Submission #3473883
Source Code Expand
#include <iostream> using namespace std; const int INF = 1 << 30; int main() { int N; cin >> N; int L[N + 1]; L[0] = INF; for (int i = 1; i < N; ++i) { cin >> L[i]; } L[N] = INF; for (int i = 0; i < N; ++i) { cout << min(L[i], L[i + 1]) << " "; } cout << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | B - 積み鉛筆 |
User | Tiramister |
Language | C++14 (GCC 5.4.1) |
Score | 80 |
Code Size | 363 Byte |
Status | AC |
Exec Time | 62 ms |
Memory | 1536 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 | 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 | AC | 1 ms | 256 KB |
sample2.txt | AC | 1 ms | 256 KB |
sample3.txt | AC | 1 ms | 256 KB |
subtask0_0.txt | AC | 55 ms | 1408 KB |
subtask0_1.txt | AC | 44 ms | 1152 KB |
subtask0_10.txt | AC | 40 ms | 1152 KB |
subtask0_11.txt | AC | 47 ms | 1280 KB |
subtask0_12.txt | AC | 54 ms | 1408 KB |
subtask0_13.txt | AC | 43 ms | 1152 KB |
subtask0_14.txt | AC | 49 ms | 1280 KB |
subtask0_2.txt | AC | 40 ms | 1152 KB |
subtask0_3.txt | AC | 52 ms | 1408 KB |
subtask0_4.txt | AC | 43 ms | 1152 KB |
subtask0_5.txt | AC | 41 ms | 1152 KB |
subtask0_6.txt | AC | 52 ms | 1408 KB |
subtask0_7.txt | AC | 36 ms | 1024 KB |
subtask0_8.txt | AC | 47 ms | 1280 KB |
subtask0_9.txt | AC | 62 ms | 1536 KB |