Submission #1175647
Source Code Expand
#include<cstdio> #include <iostream> #include<algorithm> #include<string> #include<queue> #include<vector> #include<functional> #include<cmath> #include<map> #include<stack> #include<list> #include<set> #include<numeric> #define MOD 1000000007 using namespace std; typedef long long ll; int main() { int N; cin >> N; ll K[100010]; for (int i = 0; i < N - 1; i++) { cin >> K[i]; } cout << K[0]; for (int i = 0; i < N-2; i++) { printf("% lld",min(K[i], K[i + 1])); } cout <<" "<< K[N - 2] << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | B - 積み鉛筆 |
User | jj |
Language | C++14 (GCC 5.4.1) |
Score | 80 |
Code Size | 566 Byte |
Status | AC |
Exec Time | 48 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 | 1 ms | 256 KB |
sample2.txt | AC | 1 ms | 256 KB |
sample3.txt | AC | 1 ms | 256 KB |
subtask0_0.txt | AC | 44 ms | 1792 KB |
subtask0_1.txt | AC | 36 ms | 1536 KB |
subtask0_10.txt | AC | 33 ms | 1408 KB |
subtask0_11.txt | AC | 38 ms | 1664 KB |
subtask0_12.txt | AC | 42 ms | 1792 KB |
subtask0_13.txt | AC | 35 ms | 1536 KB |
subtask0_14.txt | AC | 40 ms | 1664 KB |
subtask0_2.txt | AC | 32 ms | 1408 KB |
subtask0_3.txt | AC | 41 ms | 1664 KB |
subtask0_4.txt | AC | 35 ms | 1536 KB |
subtask0_5.txt | AC | 33 ms | 1408 KB |
subtask0_6.txt | AC | 41 ms | 1664 KB |
subtask0_7.txt | AC | 30 ms | 1280 KB |
subtask0_8.txt | AC | 38 ms | 1664 KB |
subtask0_9.txt | AC | 48 ms | 1920 KB |