Submission #2667436


Source Code Expand

Copy
from itertools import permutations
N,M = map(int,input().split())
table=[[]for i in range(N)]
for i in range(M):
a,b=map(int,input().split())
table[a-1].append(b-1)
table[b-1].append(a-1)
def f(L,k):
for a in L:
if a==k:
return True
return False
S=[i for i in range(1,N)]
ans =0
for s in permutations(S,N-1):
flag =True
if not f(table[0],s[0]):
continue
for i in range(N-2):
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
from itertools import permutations
N,M = map(int,input().split())
table=[[]for i in range(N)]
for i in range(M):
    a,b=map(int,input().split())
    table[a-1].append(b-1)
    table[b-1].append(a-1)

def f(L,k):
    for a in L:
        if a==k:
            return True
    return False

S=[i for i in range(1,N)]
ans =0
for s in permutations(S,N-1):
    flag =True
    if not f(table[0],s[0]):
        continue
    for i in range(N-2):
        if not f(table[s[i]],s[i+1]):
            flag =False
    if flag:
        ans+=1
print(ans)

Submission Info

Submission Time
Task C - One-stroke Path
User okumura
Language Python (3.4.3)
Score 300
Code Size 562 Byte
Status AC
Exec Time 35 ms
Memory 3064 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 23 ms 3064 KB
subtask_1_02.txt AC 23 ms 3064 KB
subtask_1_03.txt AC 21 ms 3064 KB
subtask_1_04.txt AC 34 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 18 ms 3064 KB
subtask_1_09.txt AC 19 ms 3064 KB
subtask_1_10.txt AC 19 ms 3064 KB
subtask_1_11.txt AC 28 ms 3064 KB
subtask_1_12.txt AC 32 ms 3064 KB
subtask_1_13.txt AC 35 ms 3064 KB


2025-04-08 (Tue)
09:47:05 +00:00