Submission #1869625


Source Code Expand

import itertools
import collections
N,M=map(int,raw_input().split())
#print N,M
a=[map(int,raw_input().split()) for i in range(M)]
#print a
b=list(itertools.permutations(range(1,N+1)))
#print b

ans=0
for i in b:
	if i[0]!=1:
		continue
	c=[]
	for j in i:
		#print i,j
		if len(c)<2:
			c.append(j)

		if len(c)==2:
			if c in a or c[::-1] in a:
				cnt=1
			else:
				cnt=0
				break
			c.pop(0)
	ans+=cnt
print ans

Submission Info

Submission Time
Task C - One-stroke Path
User KUMAWO
Language Python (2.7.6)
Score 300
Code Size 443 Byte
Status AC
Exec Time 62 ms
Memory 8148 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 11 ms 2812 KB
sample_02.txt AC 14 ms 3448 KB
subtask_1_01.txt AC 29 ms 8148 KB
subtask_1_02.txt AC 29 ms 8148 KB
subtask_1_03.txt AC 29 ms 8148 KB
subtask_1_04.txt AC 62 ms 8148 KB
subtask_1_05.txt AC 11 ms 2812 KB
subtask_1_06.txt AC 11 ms 2812 KB
subtask_1_07.txt AC 11 ms 2812 KB
subtask_1_08.txt AC 12 ms 2812 KB
subtask_1_09.txt AC 15 ms 3448 KB
subtask_1_10.txt AC 16 ms 3320 KB
subtask_1_11.txt AC 36 ms 8148 KB
subtask_1_12.txt AC 48 ms 8148 KB
subtask_1_13.txt AC 60 ms 8148 KB