Submission #2998543
Source Code Expand
import collections N = int(input()) a,b = map(int,input().split()) K = int(input()) P = list(map(int,input().split())) PP = collections.Counter(P) for i,j in PP.items(): if j>1 or i==a or i==b: print('NO') exit() print('YES')
Submission Info
Submission Time | |
---|---|
Task | B - 嘘つきの高橋くん |
User | toberustacean |
Language | Python (3.4.3) |
Score | 100 |
Code Size | 257 Byte |
Status | AC |
Exec Time | 21 ms |
Memory | 3316 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 100 / 100 | ||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | subtask0_sample_01.txt, subtask0_sample_02.txt, subtask0_sample_03.txt, subtask0_sample_04.txt, subtask0_sample_05.txt |
All | subtask0_sample_01.txt, subtask0_sample_02.txt, subtask0_sample_03.txt, subtask0_sample_04.txt, subtask0_sample_05.txt, subtask1_01.txt, subtask1_02.txt, subtask1_03.txt, subtask1_04.txt, subtask1_05.txt, subtask1_06.txt, subtask1_07.txt, subtask1_08.txt, subtask1_09.txt, subtask1_10.txt, subtask1_11.txt, subtask1_12.txt, subtask1_13.txt, subtask1_14.txt, subtask1_15.txt, subtask1_16.txt, subtask1_17.txt, subtask1_18.txt, subtask1_19.txt, subtask1_20.txt, subtask1_21.txt, subtask1_22.txt, subtask1_23.txt, subtask1_24.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
subtask0_sample_01.txt | AC | 21 ms | 3316 KB |
subtask0_sample_02.txt | AC | 21 ms | 3316 KB |
subtask0_sample_03.txt | AC | 21 ms | 3316 KB |
subtask0_sample_04.txt | AC | 21 ms | 3316 KB |
subtask0_sample_05.txt | AC | 20 ms | 3316 KB |
subtask1_01.txt | AC | 21 ms | 3316 KB |
subtask1_02.txt | AC | 21 ms | 3316 KB |
subtask1_03.txt | AC | 21 ms | 3316 KB |
subtask1_04.txt | AC | 21 ms | 3316 KB |
subtask1_05.txt | AC | 21 ms | 3316 KB |
subtask1_06.txt | AC | 21 ms | 3316 KB |
subtask1_07.txt | AC | 21 ms | 3316 KB |
subtask1_08.txt | AC | 21 ms | 3316 KB |
subtask1_09.txt | AC | 21 ms | 3316 KB |
subtask1_10.txt | AC | 21 ms | 3316 KB |
subtask1_11.txt | AC | 21 ms | 3316 KB |
subtask1_12.txt | AC | 21 ms | 3316 KB |
subtask1_13.txt | AC | 21 ms | 3316 KB |
subtask1_14.txt | AC | 21 ms | 3316 KB |
subtask1_15.txt | AC | 21 ms | 3316 KB |
subtask1_16.txt | AC | 21 ms | 3316 KB |
subtask1_17.txt | AC | 21 ms | 3316 KB |
subtask1_18.txt | AC | 21 ms | 3316 KB |
subtask1_19.txt | AC | 21 ms | 3316 KB |
subtask1_20.txt | AC | 21 ms | 3316 KB |
subtask1_21.txt | AC | 21 ms | 3316 KB |
subtask1_22.txt | AC | 21 ms | 3316 KB |
subtask1_23.txt | AC | 21 ms | 3316 KB |
subtask1_24.txt | AC | 21 ms | 3316 KB |