Submission #616102
Source Code Expand
#include <bits/stdc++.h> typedef long long LL; #define SORT(c) sort((c).begin(),(c).end()) #define FOR(i,a,b) for(int i=(a);i<(b);++i) #define REP(i,n) FOR(i,0,n) using namespace std; int main(void) { int n,a,b; cin >> n; a=1023456789; REP(i,n-1){ cin >> b; cout << min(a,b) << ' '; a=b; } cout << a << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | B - 積み鉛筆 |
User | siotouto |
Language | C++11 (GCC 4.9.2) |
Score | 80 |
Code Size | 371 Byte |
Status | AC |
Exec Time | 487 ms |
Memory | 924 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 | 32 ms | 764 KB |
sample2.txt | AC | 24 ms | 792 KB |
sample3.txt | AC | 24 ms | 920 KB |
subtask0_0.txt | AC | 412 ms | 912 KB |
subtask0_1.txt | AC | 437 ms | 772 KB |
subtask0_10.txt | AC | 327 ms | 672 KB |
subtask0_11.txt | AC | 307 ms | 920 KB |
subtask0_12.txt | AC | 408 ms | 916 KB |
subtask0_13.txt | AC | 429 ms | 804 KB |
subtask0_14.txt | AC | 440 ms | 804 KB |
subtask0_2.txt | AC | 370 ms | 800 KB |
subtask0_3.txt | AC | 401 ms | 788 KB |
subtask0_4.txt | AC | 449 ms | 924 KB |
subtask0_5.txt | AC | 403 ms | 804 KB |
subtask0_6.txt | AC | 351 ms | 912 KB |
subtask0_7.txt | AC | 362 ms | 800 KB |
subtask0_8.txt | AC | 333 ms | 744 KB |
subtask0_9.txt | AC | 487 ms | 800 KB |