Submission #1960979
Source Code Expand
#include<bits/stdc++.h> using namespace std; #define r(i,n) for(int i=0;i<n;i++) int a[100009],b[100009]; int main(){ int n,c=0; cin>>n;n--; r(i,n)cin>>a[i]; for(int i=1;i<n-1;i++)if(a[i-1]>a[i]&&a[i]<a[i+1])b[i+1]=a[i],b[i]=a[i]; for(int i=0;i<n+1;i++){ if(!b[i]){ b[i]=a[c++]; // cout<<i<<' '<<c-1<<endl; } else{ c++; i++; } // cout<<i<<' '<<c-1<<endl; } r(i,n+1){ if(!b[i])b[i]=1; if(i)cout<<' '; cout<<b[i]; } cout<<endl; }
Submission Info
Submission Time | |
---|---|
Task | B - 積み鉛筆 |
User | c7c7 |
Language | C++14 (GCC 5.4.1) |
Score | 0 |
Code Size | 529 Byte |
Status | WA |
Exec Time | 64 ms |
Memory | 1920 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 0 / 80 | ||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | sample1.txt, sample2.txt, sample3.txt |
All | sample1.txt, sample2.txt, sample3.txt, subtask0_0.txt, subtask0_1.txt, subtask0_10.txt, subtask0_11.txt, subtask0_12.txt, subtask0_13.txt, subtask0_14.txt, subtask0_2.txt, subtask0_3.txt, subtask0_4.txt, subtask0_5.txt, subtask0_6.txt, subtask0_7.txt, subtask0_8.txt, subtask0_9.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
sample1.txt | WA | 1 ms | 256 KB |
sample2.txt | WA | 1 ms | 256 KB |
sample3.txt | WA | 1 ms | 256 KB |
subtask0_0.txt | WA | 59 ms | 1792 KB |
subtask0_1.txt | WA | 45 ms | 1536 KB |
subtask0_10.txt | WA | 41 ms | 1408 KB |
subtask0_11.txt | WA | 48 ms | 1664 KB |
subtask0_12.txt | WA | 55 ms | 1792 KB |
subtask0_13.txt | WA | 43 ms | 1536 KB |
subtask0_14.txt | WA | 50 ms | 1664 KB |
subtask0_2.txt | WA | 42 ms | 1408 KB |
subtask0_3.txt | WA | 54 ms | 1664 KB |
subtask0_4.txt | WA | 44 ms | 1536 KB |
subtask0_5.txt | WA | 42 ms | 1408 KB |
subtask0_6.txt | WA | 53 ms | 1664 KB |
subtask0_7.txt | WA | 39 ms | 1408 KB |
subtask0_8.txt | WA | 48 ms | 1664 KB |
subtask0_9.txt | WA | 64 ms | 1920 KB |