Submission #615998
Source Code Expand
#include<stdio.h> #define MIN(x,y) (((x)<(y))?(x):(y)) int main(void){ int pencil[100000],ans[100000]={0}; int N,i,j,k; scanf("%d",&N); for(i=0;i<N-1;i++) scanf("%d",&pencil[i]); ans[0]=pencil[0]; for(i=1;i<N-1;i++) ans[i]=MIN(pencil[i],pencil[i-1]); ans[N-1]=pencil[N-2]; for(i=0;i<N;i++) printf("%d%c",ans[i],i==N-1?'\n':' '); return 0; }
Submission Info
Submission Time | |
---|---|
Task | B - 積み鉛筆 |
User | tatuyan |
Language | C (GCC 4.9.2) |
Score | 80 |
Code Size | 388 Byte |
Status | AC |
Exec Time | 68 ms |
Memory | 1448 KB |
Compile Error
./Main.c: In function ‘main’: ./Main.c:8:3: warning: ignoring return value of ‘scanf’, declared with attribute warn_unused_result [-Wunused-result] scanf("%d",&N); ^ ./Main.c:9:22: warning: ignoring return value of ‘scanf’, declared with attribute warn_unused_result [-Wunused-result] for(i=0;i<N-1;i++) scanf("%d",&pencil[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 | 21 ms | 1184 KB |
sample2.txt | AC | 22 ms | 1180 KB |
sample3.txt | AC | 22 ms | 1184 KB |
subtask0_0.txt | AC | 59 ms | 1444 KB |
subtask0_1.txt | AC | 58 ms | 1448 KB |
subtask0_10.txt | AC | 55 ms | 1440 KB |
subtask0_11.txt | AC | 58 ms | 1448 KB |
subtask0_12.txt | AC | 60 ms | 1444 KB |
subtask0_13.txt | AC | 55 ms | 1444 KB |
subtask0_14.txt | AC | 61 ms | 1440 KB |
subtask0_2.txt | AC | 53 ms | 1320 KB |
subtask0_3.txt | AC | 59 ms | 1324 KB |
subtask0_4.txt | AC | 57 ms | 1444 KB |
subtask0_5.txt | AC | 54 ms | 1312 KB |
subtask0_6.txt | AC | 58 ms | 1308 KB |
subtask0_7.txt | AC | 52 ms | 1308 KB |
subtask0_8.txt | AC | 58 ms | 1440 KB |
subtask0_9.txt | AC | 68 ms | 1440 KB |