Submission #616062
Source Code Expand
#include <iostream> #include <cstdio> #include <string> #include <set> #include <queue> #include <map> using namespace std; int N, K[100000], L[100000]; void solve() { scanf("%d", &N); for (int i = 0; i < N - 1; i++) scanf("%d", &K[i]); L[0] = K[0]; L[N - 1] = K[N - 2]; for (int i = 1; i < N - 1; i++) { L[i] = min(K[i - 1], K[i]); } for (int i = 0; i < N; i++) { if (i == 0) printf("%d", L[i]); else printf(" %d", L[i]); } printf("\n"); } int main() { solve(); return 0; }
Submission Info
Submission Time | |
---|---|
Task | B - 積み鉛筆 |
User | ysd |
Language | C++11 (GCC 4.9.2) |
Score | 80 |
Code Size | 575 Byte |
Status | AC |
Exec Time | 66 ms |
Memory | 1576 KB |
Compile Error
./Main.cpp: In function ‘void solve()’: ./Main.cpp:13:20: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] scanf("%d", &N); ^ ./Main.cpp:14:55: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] for (int i = 0; i < N - 1; i++) scanf("%d", &K[i]); ^
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 | 27 ms | 728 KB |
sample2.txt | AC | 25 ms | 920 KB |
sample3.txt | AC | 27 ms | 932 KB |
subtask0_0.txt | AC | 63 ms | 1392 KB |
subtask0_1.txt | AC | 57 ms | 1572 KB |
subtask0_10.txt | AC | 54 ms | 1444 KB |
subtask0_11.txt | AC | 60 ms | 1444 KB |
subtask0_12.txt | AC | 63 ms | 1432 KB |
subtask0_13.txt | AC | 58 ms | 1448 KB |
subtask0_14.txt | AC | 59 ms | 1576 KB |
subtask0_2.txt | AC | 56 ms | 1320 KB |
subtask0_3.txt | AC | 58 ms | 1440 KB |
subtask0_4.txt | AC | 58 ms | 1448 KB |
subtask0_5.txt | AC | 63 ms | 1436 KB |
subtask0_6.txt | AC | 58 ms | 1316 KB |
subtask0_7.txt | AC | 51 ms | 1312 KB |
subtask0_8.txt | AC | 58 ms | 1496 KB |
subtask0_9.txt | AC | 66 ms | 1444 KB |