Submission #2244260
Source Code Expand
import itertools N,M=map(int,input().split()) C=[[] for j in range(N)] for i in range(M): a,b=map(int,input().split()) C[a-1].append(b-1) C[b-1].append(a-1) d=[int(x)+1 for x in range(N-1)] ans=0 for exam in itertools.permutations(d): cnt=list(exam) cnt.insert(0,0) flg=True for i in range(N-1): if not(cnt[i+1] in C[cnt[i]]): flg=False break if flg: ans+=1 print(ans)
Submission Info
Submission Time | |
---|---|
Task | C - One-stroke Path |
User | kobaya0514 |
Language | Python (3.4.3) |
Score | 300 |
Code Size | 427 Byte |
Status | AC |
Exec Time | 31 ms |
Memory | 3064 KB |
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 | sample_01.txt, sample_02.txt, subtask_1_01.txt, subtask_1_02.txt, subtask_1_03.txt, subtask_1_04.txt, subtask_1_05.txt, subtask_1_06.txt, subtask_1_07.txt, subtask_1_08.txt, subtask_1_09.txt, subtask_1_10.txt, subtask_1_11.txt, subtask_1_12.txt, subtask_1_13.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
sample_01.txt | AC | 17 ms | 3064 KB |
sample_02.txt | AC | 18 ms | 3064 KB |
subtask_1_01.txt | AC | 23 ms | 3064 KB |
subtask_1_02.txt | AC | 23 ms | 3064 KB |
subtask_1_03.txt | AC | 23 ms | 3064 KB |
subtask_1_04.txt | AC | 31 ms | 3064 KB |
subtask_1_05.txt | AC | 17 ms | 3064 KB |
subtask_1_06.txt | AC | 17 ms | 3064 KB |
subtask_1_07.txt | AC | 17 ms | 3064 KB |
subtask_1_08.txt | AC | 17 ms | 3064 KB |
subtask_1_09.txt | AC | 18 ms | 3064 KB |
subtask_1_10.txt | AC | 18 ms | 3064 KB |
subtask_1_11.txt | AC | 25 ms | 3064 KB |
subtask_1_12.txt | AC | 27 ms | 3064 KB |
subtask_1_13.txt | AC | 29 ms | 3064 KB |