Submission #42339544
Source Code Expand
n=int(input())
A = list(map(int,input().split()))
d={}
ans=[]
for i in range(1,n+1):
d[i] = 0
for j in A:
d[j]+=1
if d[j]==2:
ans.append(j)
print(*ans)
Submission Info
| Submission Time | |
|---|---|
| Task | C - Centers |
| User | kuraba |
| Language | Python (3.8.2) |
| Score | 250 |
| Code Size | 187 Byte |
| Status | AC |
| Exec Time | 234 ms |
| Memory | 43712 KiB |
Judge Result
| Set Name | Sample | All | ||||
|---|---|---|---|---|---|---|
| Score / Max Score | 0 / 0 | 250 / 250 | ||||
| Status |
|
|
| Set Name | Test Cases |
|---|---|
| Sample | 00_sample_00.txt, 00_sample_01.txt, 00_sample_02.txt |
| All | 00_sample_00.txt, 00_sample_01.txt, 00_sample_02.txt, 01_random_00.txt, 01_random_01.txt, 01_random_02.txt, 01_random_03.txt, 01_random_04.txt, 01_random_05.txt, 01_random_06.txt, 01_random_07.txt, 01_random_08.txt, 01_random_09.txt, 01_random_10.txt, 01_random_11.txt, 01_random_12.txt, 01_random_13.txt, 01_random_14.txt, 01_random_15.txt |
| Case Name | Status | Exec Time | Memory |
|---|---|---|---|
| 00_sample_00.txt | AC | 17 ms | 8764 KiB |
| 00_sample_01.txt | AC | 18 ms | 8860 KiB |
| 00_sample_02.txt | AC | 19 ms | 8768 KiB |
| 01_random_00.txt | AC | 95 ms | 22312 KiB |
| 01_random_01.txt | AC | 38 ms | 12292 KiB |
| 01_random_02.txt | AC | 42 ms | 11908 KiB |
| 01_random_03.txt | AC | 98 ms | 22388 KiB |
| 01_random_04.txt | AC | 66 ms | 16324 KiB |
| 01_random_05.txt | AC | 98 ms | 22848 KiB |
| 01_random_06.txt | AC | 88 ms | 20700 KiB |
| 01_random_07.txt | AC | 234 ms | 43532 KiB |
| 01_random_08.txt | AC | 229 ms | 43712 KiB |
| 01_random_09.txt | AC | 230 ms | 43428 KiB |
| 01_random_10.txt | AC | 115 ms | 25312 KiB |
| 01_random_11.txt | AC | 214 ms | 41960 KiB |
| 01_random_12.txt | AC | 228 ms | 43580 KiB |
| 01_random_13.txt | AC | 172 ms | 37400 KiB |
| 01_random_14.txt | AC | 170 ms | 37300 KiB |
| 01_random_15.txt | AC | 220 ms | 43432 KiB |