Submission #35883035
Source Code Expand
#ABC274C_20221022
N=int(input())
A=list(map(int,input().split()))
ans=[0]*(2*N+2)
gen=0
for i in range(N):
#print(i,ans[A[i]])
gen=ans[A[i]-1]+1
ans[2*(i+1)-1]=gen
ans[2*(i+1)]=gen
for i in range(2*N+1):
print(ans[i])
Submission Info
| Submission Time | |
|---|---|
| Task | C - Ameba |
| User | Konini |
| Language | PyPy3 (7.3.0) |
| Score | 300 |
| Code Size | 250 Byte |
| Status | AC |
| Exec Time | 224 ms |
| Memory | 100048 KiB |
Judge Result
| Set Name | Sample | All | ||||
|---|---|---|---|---|---|---|
| Score / Max Score | 0 / 0 | 300 / 300 | ||||
| Status |
|
|
| Set Name | Test Cases |
|---|---|
| Sample | sample_01.txt, sample_02.txt |
| All | random_01.txt, random_02.txt, random_03.txt, random_04.txt, random_05.txt, random_06.txt, random_07.txt, random_08.txt, random_09.txt, random_10.txt, random_11.txt, random_12.txt, random_13.txt, random_14.txt, random_15.txt, random_16.txt, sample_01.txt, sample_02.txt |
| Case Name | Status | Exec Time | Memory |
|---|---|---|---|
| random_01.txt | AC | 224 ms | 99960 KiB |
| random_02.txt | AC | 205 ms | 98196 KiB |
| random_03.txt | AC | 206 ms | 99924 KiB |
| random_04.txt | AC | 97 ms | 76940 KiB |
| random_05.txt | AC | 206 ms | 100036 KiB |
| random_06.txt | AC | 192 ms | 97740 KiB |
| random_07.txt | AC | 209 ms | 99912 KiB |
| random_08.txt | AC | 177 ms | 94124 KiB |
| random_09.txt | AC | 210 ms | 99884 KiB |
| random_10.txt | AC | 208 ms | 99672 KiB |
| random_11.txt | AC | 211 ms | 99884 KiB |
| random_12.txt | AC | 118 ms | 80900 KiB |
| random_13.txt | AC | 207 ms | 99712 KiB |
| random_14.txt | AC | 214 ms | 100048 KiB |
| random_15.txt | AC | 209 ms | 99652 KiB |
| random_16.txt | AC | 51 ms | 61400 KiB |
| sample_01.txt | AC | 51 ms | 61640 KiB |
| sample_02.txt | AC | 51 ms | 61792 KiB |