Submission #616135
Source Code Expand
#include<iostream> #include<algorithm> using namespace std; int n, k[108000], ans[108000]; int main(){ cin >> n; n--; for(int i = 0;i < n;i++)cin >> k[i]; ans[0] = k[0]; ans[n] = k[n-1]; for(int i = 1;i < n;i++){ ans[i] = min(k[i-1], k[i]); } for(int i = 0;i <= n;i++){ if(i)cout << " "; cout << ans[i]; } cout << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | B - 積み鉛筆 |
User | catupper |
Language | C++ (GCC 4.9.2) |
Score | 80 |
Code Size | 373 Byte |
Status | AC |
Exec Time | 120 ms |
Memory | 1576 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 | 24 ms | 800 KB |
sample2.txt | AC | 25 ms | 808 KB |
sample3.txt | AC | 28 ms | 928 KB |
subtask0_0.txt | AC | 102 ms | 1444 KB |
subtask0_1.txt | AC | 90 ms | 1572 KB |
subtask0_10.txt | AC | 82 ms | 1440 KB |
subtask0_11.txt | AC | 91 ms | 1452 KB |
subtask0_12.txt | AC | 102 ms | 1440 KB |
subtask0_13.txt | AC | 87 ms | 1448 KB |
subtask0_14.txt | AC | 97 ms | 1576 KB |
subtask0_2.txt | AC | 83 ms | 1316 KB |
subtask0_3.txt | AC | 99 ms | 1444 KB |
subtask0_4.txt | AC | 89 ms | 1440 KB |
subtask0_5.txt | AC | 84 ms | 1448 KB |
subtask0_6.txt | AC | 99 ms | 1440 KB |
subtask0_7.txt | AC | 79 ms | 1316 KB |
subtask0_8.txt | AC | 98 ms | 1440 KB |
subtask0_9.txt | AC | 120 ms | 1524 KB |