Submission #1101265
Source Code Expand
#include<bits/stdc++.h> #define rep(i,n)for(int i=0;i<(n);i++) using namespace std; int k[100000], a[100000]; int main() { int n; scanf("%d", &n); rep(i, n - 1)scanf("%d", &k[i]); rep(i, n)a[i] = 1; a[0] = k[0]; a[n - 1] = k[n - 2]; for (int i = 1; i < n - 1; i++)a[i] = min(k[i - 1], k[i]); rep(i, n) { if (i)printf(" "); printf("%d", a[i]); } printf("\n"); }
Submission Info
Submission Time | |
---|---|
Task | B - 積み鉛筆 |
User | autumn_eel |
Language | C++ (GCC 4.9.2) |
Score | 80 |
Code Size | 389 Byte |
Status | AC |
Exec Time | 45 ms |
Memory | 1648 KB |
Compile Error
./Main.cpp: In function ‘int main()’: ./Main.cpp:7:24: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] int n; scanf("%d", &n); ^ ./Main.cpp:8:33: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] rep(i, n - 1)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 | 17 ms | 924 KB |
sample2.txt | AC | 17 ms | 924 KB |
sample3.txt | AC | 17 ms | 924 KB |
subtask0_0.txt | AC | 41 ms | 1520 KB |
subtask0_1.txt | AC | 39 ms | 1644 KB |
subtask0_10.txt | AC | 38 ms | 1456 KB |
subtask0_11.txt | AC | 39 ms | 1516 KB |
subtask0_12.txt | AC | 42 ms | 1460 KB |
subtask0_13.txt | AC | 39 ms | 1560 KB |
subtask0_14.txt | AC | 40 ms | 1648 KB |
subtask0_2.txt | AC | 38 ms | 1452 KB |
subtask0_3.txt | AC | 40 ms | 1448 KB |
subtask0_4.txt | AC | 41 ms | 1584 KB |
subtask0_5.txt | AC | 39 ms | 1452 KB |
subtask0_6.txt | AC | 39 ms | 1460 KB |
subtask0_7.txt | AC | 37 ms | 1452 KB |
subtask0_8.txt | AC | 39 ms | 1516 KB |
subtask0_9.txt | AC | 45 ms | 1516 KB |