Submission #616053
Source Code Expand
#include <iostream> #include <string> #include <vector> #include <algorithm> #include <utility> using namespace std; typedef pair<int, int> pii; int main(){ ios_base::sync_with_stdio(false); int n; cin >> n; const int m = n - 1; vector<int> a(m); for(int i = 0; i < m; ++i){ cin >> a[i]; } vector<pii> b(m); for(int i = 0; i < m; ++i){ b[i] = pii(a[i], i); } sort(b.begin(), b.end()); vector<int> c(n, -1); for(int i = 0; i < m; ++i){ const int j = b[i].second; if(c[j] == -1 && c[j + 1] == -1){ c[j] = c[j + 1] = b[i].first; }else if(c[j] == -1){ c[j] = b[i].first; }else if(c[j + 1] == -1){ c[j + 1] = b[i].first; } } for(int i = 0; i < n; ++i){ if(i != 0){ cout << " "; } if(c[i] == -1){ c[i] = 1; } cout << c[i]; } cout << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | B - 積み鉛筆 |
User | logicmachine |
Language | C++11 (GCC 4.9.2) |
Score | 80 |
Code Size | 826 Byte |
Status | AC |
Exec Time | 79 ms |
Memory | 2336 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 80 / 80 | ||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | sample1.txt, sample2.txt, sample3.txt |
All | 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 | AC | 28 ms | 800 KB |
sample2.txt | AC | 26 ms | 808 KB |
sample3.txt | AC | 26 ms | 924 KB |
subtask0_0.txt | AC | 74 ms | 2084 KB |
subtask0_1.txt | AC | 64 ms | 2264 KB |
subtask0_10.txt | AC | 59 ms | 2208 KB |
subtask0_11.txt | AC | 67 ms | 2268 KB |
subtask0_12.txt | AC | 71 ms | 2084 KB |
subtask0_13.txt | AC | 63 ms | 2212 KB |
subtask0_14.txt | AC | 66 ms | 2336 KB |
subtask0_2.txt | AC | 61 ms | 2076 KB |
subtask0_3.txt | AC | 71 ms | 2076 KB |
subtask0_4.txt | AC | 64 ms | 2328 KB |
subtask0_5.txt | AC | 59 ms | 2076 KB |
subtask0_6.txt | AC | 71 ms | 2088 KB |
subtask0_7.txt | AC | 57 ms | 2088 KB |
subtask0_8.txt | AC | 66 ms | 2216 KB |
subtask0_9.txt | AC | 79 ms | 2324 KB |