Submission #1307262
Source Code Expand
N, M = map(int, raw_input().split()) xs, ys = [], [] for i in range(M): x, y = map(int, raw_input().split()) xs.append(x-1) ys.append(y-1) memo = {} def dfs(used): if used == (2**N-1): return 1 if used in memo: return memo[used] res = 0 for i in range(N): if used & (2**i) == 0: ok = True for x, y in zip(xs, ys): if x == i: if (used & (2**y)) == 0: ok = False break if ok: res += dfs(used | (2**i)) memo[used] = res return res print dfs(0)
Submission Info
Submission Time | |
---|---|
Task | D - 徒競走 |
User | namakemono |
Language | Python (2.7.6) |
Score | 100 |
Code Size | 665 Byte |
Status | AC |
Exec Time | 469 ms |
Memory | 7868 KB |
Judge Result
Set Name | Sample | Subtask1 | All | ||||||
---|---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 30 / 30 | 70 / 70 | ||||||
Status |
|
|
|
Set Name | Test Cases |
---|---|
Sample | 0_00.txt, 0_01.txt, 0_02.txt |
Subtask1 | 0_00.txt, 0_01.txt, 1_00.txt, 1_01.txt, 1_02.txt, 1_03.txt, 1_04.txt, 1_05.txt, 1_06.txt, 1_07.txt, 1_08.txt, 1_09.txt, 1_10.txt, 1_11.txt, 1_12.txt |
All | 0_00.txt, 0_01.txt, 0_02.txt, 1_00.txt, 1_01.txt, 1_02.txt, 1_03.txt, 1_04.txt, 1_05.txt, 1_06.txt, 1_07.txt, 1_08.txt, 1_09.txt, 1_10.txt, 1_11.txt, 1_12.txt, 2_00.txt, 2_01.txt, 2_02.txt, 2_03.txt, 2_04.txt, 2_05.txt, 2_06.txt, 2_07.txt, 2_08.txt, 2_09.txt, 2_10.txt, 2_11.txt, 2_12.txt, 2_13.txt, 2_14.txt, 2_15.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
0_00.txt | AC | 10 ms | 2696 KB |
0_01.txt | AC | 10 ms | 2696 KB |
0_02.txt | AC | 469 ms | 7868 KB |
1_00.txt | AC | 10 ms | 2696 KB |
1_01.txt | AC | 11 ms | 2696 KB |
1_02.txt | AC | 11 ms | 2696 KB |
1_03.txt | AC | 11 ms | 2696 KB |
1_04.txt | AC | 11 ms | 2696 KB |
1_05.txt | AC | 11 ms | 2696 KB |
1_06.txt | AC | 10 ms | 2696 KB |
1_07.txt | AC | 11 ms | 2696 KB |
1_08.txt | AC | 11 ms | 2696 KB |
1_09.txt | AC | 11 ms | 2696 KB |
1_10.txt | AC | 11 ms | 2696 KB |
1_11.txt | AC | 11 ms | 2696 KB |
1_12.txt | AC | 11 ms | 2696 KB |
2_00.txt | AC | 458 ms | 7868 KB |
2_01.txt | AC | 12 ms | 2696 KB |
2_02.txt | AC | 12 ms | 2696 KB |
2_03.txt | AC | 13 ms | 2696 KB |
2_04.txt | AC | 13 ms | 2696 KB |
2_05.txt | AC | 11 ms | 2696 KB |
2_06.txt | AC | 12 ms | 2696 KB |
2_07.txt | AC | 11 ms | 2696 KB |
2_08.txt | AC | 18 ms | 2696 KB |
2_09.txt | AC | 11 ms | 2696 KB |
2_10.txt | AC | 12 ms | 2696 KB |
2_11.txt | AC | 11 ms | 2696 KB |
2_12.txt | AC | 58 ms | 2948 KB |
2_13.txt | AC | 30 ms | 2696 KB |
2_14.txt | AC | 44 ms | 2948 KB |
2_15.txt | AC | 121 ms | 3844 KB |