Submission #618008
Source Code Expand
# -*- coding: utf-8 -*- N = int(raw_input()) K = map(int, raw_input().split()) tList = [0] * N minValue = min(K) minIndex = K.index(minValue) tList[minIndex] = minValue tList[minIndex + 1] = minValue for x in range(N - 1): if tList[x] == 0: tList[x] = K[x] if tList[x + 1] == 0: tList[x + 1] = K[x] for i in tList: print i,
Submission Info
| Submission Time | |
|---|---|
| Task | B - 積み鉛筆 |
| User | dson22 |
| Language | Python (2.7.3) |
| Score | 0 |
| Code Size | 347 Byte |
| Status | WA |
| Exec Time | 277 ms |
| Memory | 11996 KiB |
Judge Result
| Set Name | Sample | All | ||||||
|---|---|---|---|---|---|---|---|---|
| Score / Max Score | 0 / 0 | 0 / 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 | 85 ms | 3468 KiB |
| sample2.txt | AC | 60 ms | 3468 KiB |
| sample3.txt | AC | 59 ms | 3528 KiB |
| subtask0_0.txt | WA | 262 ms | 11028 KiB |
| subtask0_1.txt | AC | 277 ms | 11936 KiB |
| subtask0_10.txt | AC | 244 ms | 11088 KiB |
| subtask0_11.txt | WA | 263 ms | 11616 KiB |
| subtask0_12.txt | WA | 257 ms | 10780 KiB |
| subtask0_13.txt | AC | 266 ms | 11584 KiB |
| subtask0_14.txt | WA | 274 ms | 11996 KiB |
| subtask0_2.txt | WA | 234 ms | 10300 KiB |
| subtask0_3.txt | WA | 271 ms | 10420 KiB |
| subtask0_4.txt | AC | 270 ms | 11680 KiB |
| subtask0_5.txt | WA | 238 ms | 10536 KiB |
| subtask0_6.txt | WA | 240 ms | 10500 KiB |
| subtask0_7.txt | AC | 239 ms | 10248 KiB |
| subtask0_8.txt | WA | 263 ms | 11544 KiB |
| subtask0_9.txt | WA | 275 ms | 11764 KiB |