Submission #616152
Source Code Expand
#include <iostream> #include <fstream> #include <cstdio> #include <cmath> #include <vector> #include <string> #include <map> #include <queue> #include <algorithm> #define REP(i,n) for(int i=0; i<n; i++) #define FOR(i,a,b) for(int i=a; i<=b; i++) using namespace std; int k[100000]; int main(void) { int n; cin >> n; REP(i, n-1) { cin >> k[i]; } cout << k[0] << " "; REP(i, n - 2) { if (k[i] < k[i + 1]) cout << k[i] << " "; else cout << k[i + 1] << " "; } cout << k[n - 2] << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | B - 積み鉛筆 |
User | TangentDay |
Language | C++ (GCC 4.9.2) |
Score | 80 |
Code Size | 560 Byte |
Status | AC |
Exec Time | 113 ms |
Memory | 1184 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 | 26 ms | 728 KB |
sample2.txt | AC | 26 ms | 800 KB |
sample3.txt | AC | 25 ms | 744 KB |
subtask0_0.txt | AC | 105 ms | 1048 KB |
subtask0_1.txt | AC | 90 ms | 1060 KB |
subtask0_10.txt | AC | 85 ms | 1056 KB |
subtask0_11.txt | AC | 94 ms | 1060 KB |
subtask0_12.txt | AC | 103 ms | 1052 KB |
subtask0_13.txt | AC | 89 ms | 1060 KB |
subtask0_14.txt | AC | 99 ms | 1184 KB |
subtask0_2.txt | AC | 84 ms | 1056 KB |
subtask0_3.txt | AC | 100 ms | 1064 KB |
subtask0_4.txt | AC | 94 ms | 1176 KB |
subtask0_5.txt | AC | 92 ms | 1004 KB |
subtask0_6.txt | AC | 105 ms | 1060 KB |
subtask0_7.txt | AC | 79 ms | 1064 KB |
subtask0_8.txt | AC | 94 ms | 1064 KB |
subtask0_9.txt | AC | 113 ms | 1060 KB |