Submission #615952
Source Code Expand
#include <iostream> #include <algorithm> #include <vector> #include <string> #include <set> #include <map> using namespace std; typedef long long ll; int main(){ ll n; cin >> n; vector<ll> v(n); for(int i=0;i<n-1;i++) cin >> v[i]; cout << v[0] << " "; for(int i=0;i<n-2;i++){ cout << min(v[i],v[i+1]) << " "; } cout << v[n-2] << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | B - 積み鉛筆 |
User | base64 |
Language | C++11 (GCC 4.9.2) |
Score | 80 |
Code Size | 379 Byte |
Status | AC |
Exec Time | 114 ms |
Memory | 1688 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 | 932 KB |
sample2.txt | AC | 28 ms | 736 KB |
sample3.txt | AC | 27 ms | 920 KB |
subtask0_0.txt | AC | 105 ms | 1560 KB |
subtask0_1.txt | AC | 93 ms | 1688 KB |
subtask0_10.txt | AC | 89 ms | 1560 KB |
subtask0_11.txt | AC | 95 ms | 1440 KB |
subtask0_12.txt | AC | 102 ms | 1436 KB |
subtask0_13.txt | AC | 89 ms | 1428 KB |
subtask0_14.txt | AC | 98 ms | 1564 KB |
subtask0_2.txt | AC | 85 ms | 1436 KB |
subtask0_3.txt | AC | 100 ms | 1444 KB |
subtask0_4.txt | AC | 90 ms | 1564 KB |
subtask0_5.txt | AC | 88 ms | 1432 KB |
subtask0_6.txt | AC | 100 ms | 1436 KB |
subtask0_7.txt | AC | 82 ms | 1376 KB |
subtask0_8.txt | AC | 95 ms | 1556 KB |
subtask0_9.txt | AC | 114 ms | 1564 KB |