Submission #2243150


Source Code Expand

import itertools
n,m = (int(i) for i in input().split())
a = [[int(i) for i in input().split()] for i in range(m)]
b,c,answer = [],[],0
for i in range(2,n+1):
	c.append(i)
for i in range(n):
	x = []
	for j in a:
		if j[0]==i+1:
			x.append(j[1])
		elif j[1]==i+1:
			x.append(j[0])
	b.append(x)
for i in list(itertools.permutations(c,n-1)):
	if i[0] in b[0] and all(i[j+1] in b[i[j]-1] for j in range(n-2)):
		answer += 1
print(answer)

Submission Info

Submission Time
Task C - One-stroke Path
User Clamperl
Language Python (3.4.3)
Score 300
Code Size 452 Byte
Status AC
Exec Time 30 ms
Memory 3572 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 300 / 300
Status
AC × 2
AC × 15
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 21 ms 3572 KB
subtask_1_02.txt AC 21 ms 3572 KB
subtask_1_03.txt AC 20 ms 3572 KB
subtask_1_04.txt AC 30 ms 3572 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 18 ms 3064 KB
subtask_1_09.txt AC 18 ms 3064 KB
subtask_1_10.txt AC 19 ms 3064 KB
subtask_1_11.txt AC 23 ms 3572 KB
subtask_1_12.txt AC 27 ms 3572 KB
subtask_1_13.txt AC 29 ms 3572 KB