Submission #4670981

Source Code Expand

import numpy as np

# import sys
# sys.setrecursionlimit(200000)

N = int(input())
b = list(map(int, input().split(" ")))

res = []

while len(b) > 0:
    seq = np.arange(1, len(b) + 1)
    same = np.where(np.array(b) == seq)[0]
    if len(same) == 0:
        print(-1)
        exit()
    else:
        maximum = same[-1]
    res.append(str(b.pop(maximum)))

print("\n".join(res[::-1]))

Submission Info

Submission Time
Task A - Limited Insertion
User chahan69
Language Python (3.4.3)
Score 400
Code Size 406 Byte
Status AC
Exec Time 1080 ms
Memory 18984 KiB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 400 / 400
Status
AC × 3
AC × 21
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 1080 ms 18984 KiB
sample_02.txt AC 148 ms 12392 KiB
sample_03.txt AC 148 ms 12392 KiB
test_01.txt AC 149 ms 12392 KiB
test_02.txt AC 148 ms 12392 KiB
test_03.txt AC 149 ms 12392 KiB
test_04.txt AC 149 ms 12392 KiB
test_05.txt AC 149 ms 12392 KiB
test_06.txt AC 149 ms 12392 KiB
test_07.txt AC 149 ms 12392 KiB
test_08.txt AC 148 ms 12392 KiB
test_09.txt AC 148 ms 12392 KiB
test_10.txt AC 148 ms 12392 KiB
test_11.txt AC 147 ms 12392 KiB
test_12.txt AC 147 ms 12392 KiB
test_13.txt AC 146 ms 12392 KiB
test_14.txt AC 148 ms 12388 KiB
test_15.txt AC 148 ms 12392 KiB
test_16.txt AC 147 ms 12392 KiB
test_17.txt AC 147 ms 12392 KiB
test_18.txt AC 147 ms 12392 KiB