Submission #7840352
Source Code Expand
#include <iostream> #include <vector> using namespace std; typedef long long int ll; int main(){ cin.tie(nullptr); ios::sync_with_stdio(false); int n; cin >> n; vector<int> a(n-1),b(n); for(int i=0;i<n-1;i++){ cin >> a[i]; } for(int i=0;i<n-2;i++){ b[i+1]=min(a[i],a[i+1]); } b[0]=a[0]; b[n-1]=a[n-2]; cout << b[0]; for(int i=1;i<n;i++){ cout << " " << b[i]; } cout << endl; }
Submission Info
Submission Time | |
---|---|
Task | B - 積み鉛筆 |
User | KKT89 |
Language | C++14 (GCC 5.4.1) |
Score | 80 |
Code Size | 418 Byte |
Status | AC |
Exec Time | 19 ms |
Memory | 1920 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 | 2 ms | 384 KB |
sample2.txt | AC | 1 ms | 256 KB |
sample3.txt | AC | 1 ms | 256 KB |
subtask0_0.txt | AC | 17 ms | 1792 KB |
subtask0_1.txt | AC | 16 ms | 1536 KB |
subtask0_10.txt | AC | 15 ms | 1536 KB |
subtask0_11.txt | AC | 16 ms | 1664 KB |
subtask0_12.txt | AC | 17 ms | 1792 KB |
subtask0_13.txt | AC | 16 ms | 1536 KB |
subtask0_14.txt | AC | 18 ms | 1664 KB |
subtask0_2.txt | AC | 14 ms | 1408 KB |
subtask0_3.txt | AC | 16 ms | 1664 KB |
subtask0_4.txt | AC | 16 ms | 1536 KB |
subtask0_5.txt | AC | 14 ms | 1408 KB |
subtask0_6.txt | AC | 16 ms | 1664 KB |
subtask0_7.txt | AC | 13 ms | 1408 KB |
subtask0_8.txt | AC | 16 ms | 1664 KB |
subtask0_9.txt | AC | 19 ms | 1920 KB |