Submission #616163
Source Code Expand
import sys import math def nicos(N): nico_canidate = [] seed = "25" nowstr = seed while(int(nowstr) <= N): nico_canidate.append(int(nowstr)) nowstr += seed return nico_canidate N = int(sys.stdin.readline().rstrip()) Ks = map(int, sys.stdin.readline().rstrip().split()) outs = [] outs.append(Ks[0]) for i in range(1, len(Ks)): outs.append(min(Ks[i-1], Ks[i])) outs.append(Ks[-1]) print " ".join(map(str, outs)) exit(0)
Submission Info
Submission Time | |
---|---|
Task | B - 積み鉛筆 |
User | hiking |
Language | Python (2.7.3) |
Score | 80 |
Code Size | 485 Byte |
Status | AC |
Exec Time | 1369 ms |
Memory | 16720 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 | 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 | 1369 ms | 3260 KB |
sample2.txt | AC | 58 ms | 3384 KB |
sample3.txt | AC | 57 ms | 3380 KB |
subtask0_0.txt | AC | 231 ms | 14976 KB |
subtask0_1.txt | AC | 241 ms | 16196 KB |
subtask0_10.txt | AC | 224 ms | 14968 KB |
subtask0_11.txt | AC | 243 ms | 15688 KB |
subtask0_12.txt | AC | 222 ms | 14908 KB |
subtask0_13.txt | AC | 234 ms | 15636 KB |
subtask0_14.txt | AC | 243 ms | 15992 KB |
subtask0_2.txt | AC | 205 ms | 13508 KB |
subtask0_3.txt | AC | 217 ms | 14336 KB |
subtask0_4.txt | AC | 236 ms | 15732 KB |
subtask0_5.txt | AC | 208 ms | 14176 KB |
subtask0_6.txt | AC | 231 ms | 14332 KB |
subtask0_7.txt | AC | 208 ms | 13484 KB |
subtask0_8.txt | AC | 236 ms | 15572 KB |
subtask0_9.txt | AC | 248 ms | 16720 KB |