Submission #616212
Source Code Expand
#include <algorithm> #include <iostream> #include <string> #include <vector> using namespace std; int main() { int n; int k[100000]; cin >> n; for (int i = 0; i < n - 1; ++i) { cin >> k[i]; } cout << k[0] << ' '; for (int i = 0; i < n - 2; ++i) { cout << min(k[i], k[i + 1]) << ' '; } cout << k[n - 2] << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | B - 積み鉛筆 |
User | saltcandy123 |
Language | C++11 (GCC 4.9.2) |
Score | 80 |
Code Size | 374 Byte |
Status | AC |
Exec Time | 116 ms |
Memory | 1188 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 | 728 KB |
sample2.txt | AC | 28 ms | 808 KB |
sample3.txt | AC | 26 ms | 796 KB |
subtask0_0.txt | AC | 109 ms | 1056 KB |
subtask0_1.txt | AC | 98 ms | 1188 KB |
subtask0_10.txt | AC | 85 ms | 1064 KB |
subtask0_11.txt | AC | 105 ms | 1056 KB |
subtask0_12.txt | AC | 103 ms | 1060 KB |
subtask0_13.txt | AC | 93 ms | 1056 KB |
subtask0_14.txt | AC | 99 ms | 1112 KB |
subtask0_2.txt | AC | 90 ms | 1060 KB |
subtask0_3.txt | AC | 106 ms | 1056 KB |
subtask0_4.txt | AC | 97 ms | 1116 KB |
subtask0_5.txt | AC | 88 ms | 1056 KB |
subtask0_6.txt | AC | 106 ms | 1064 KB |
subtask0_7.txt | AC | 80 ms | 1052 KB |
subtask0_8.txt | AC | 97 ms | 1176 KB |
subtask0_9.txt | AC | 116 ms | 1064 KB |