Submission #4785432
Source Code Expand
# AGC032 Problem-AGC032
n = int(input())
a = list (map(int, input().split()))
#print (a)
a.insert(0,-1)
result = []
for i in range (n, 0, -1) :
for j in range (i, -1, -1) :
# print (a)
if a[j] == j :
result.append(j)
# print (result)
a = a[:j] + a[j+1:]
break
if j == 0 :
result = [-1]
break
result.reverse()
for ans in result :
print (ans)
Submission Info
| Submission Time | |
|---|---|
| Task | A - Limited Insertion |
| User | Cummin |
| Language | Python (3.4.3) |
| Score | 400 |
| Code Size | 467 Byte |
| Status | AC |
| Exec Time | 19 ms |
| Memory | 3060 KiB |
Judge Result
| Set Name | Sample | All | ||||
|---|---|---|---|---|---|---|
| Score / Max Score | 0 / 0 | 400 / 400 | ||||
| Status |
|
|
| Set Name | Test Cases |
|---|---|
| Sample | sample_01.txt, sample_02.txt, sample_03.txt |
| All | sample_01.txt, sample_02.txt, sample_03.txt, test_01.txt, test_02.txt, test_03.txt, test_04.txt, test_05.txt, test_06.txt, test_07.txt, test_08.txt, test_09.txt, test_10.txt, test_11.txt, test_12.txt, test_13.txt, test_14.txt, test_15.txt, test_16.txt, test_17.txt, test_18.txt |
| Case Name | Status | Exec Time | Memory |
|---|---|---|---|
| sample_01.txt | AC | 18 ms | 3060 KiB |
| sample_02.txt | AC | 18 ms | 2940 KiB |
| sample_03.txt | AC | 18 ms | 3060 KiB |
| test_01.txt | AC | 18 ms | 3060 KiB |
| test_02.txt | AC | 18 ms | 3060 KiB |
| test_03.txt | AC | 19 ms | 3060 KiB |
| test_04.txt | AC | 19 ms | 3060 KiB |
| test_05.txt | AC | 18 ms | 3060 KiB |
| test_06.txt | AC | 19 ms | 3060 KiB |
| test_07.txt | AC | 18 ms | 3060 KiB |
| test_08.txt | AC | 18 ms | 3060 KiB |
| test_09.txt | AC | 18 ms | 3060 KiB |
| test_10.txt | AC | 18 ms | 3060 KiB |
| test_11.txt | AC | 18 ms | 3060 KiB |
| test_12.txt | AC | 18 ms | 2940 KiB |
| test_13.txt | AC | 18 ms | 3060 KiB |
| test_14.txt | AC | 18 ms | 3060 KiB |
| test_15.txt | AC | 18 ms | 3060 KiB |
| test_16.txt | AC | 18 ms | 3060 KiB |
| test_17.txt | AC | 19 ms | 3060 KiB |
| test_18.txt | AC | 18 ms | 3060 KiB |