Submission #3622371
Source Code Expand
def DFS(N, copyedge): matrix = [[] for i in range(M)] for a, b in copyedge: matrix[a].append(b) matrix[b].append(a) check = [True]*N check[0] = False Que = [0] while len(Que) != 0: now = Que.pop() for i in matrix[now]: if check[i] == True: check[i] = False Que.append(i) if True not in check: return 0 else: return 1 ans = 0 N, M = map(int, input().split()) edge = [] for i in range(M): edge.append([int(i) - 1 for i in input().split()]) for i in range(M): copyedge = edge[:i] + edge[i+1:] ans += DFS(N, copyedge) print(ans)
Submission Info
Submission Time | |
---|---|
Task | C - Bridge |
User | yutala |
Language | Python (3.4.3) |
Score | 0 |
Code Size | 733 Byte |
Status | RE |
Exec Time | 20 ms |
Memory | 3064 KB |
Judge Result
Set Name | Sample | All | ||||||||
---|---|---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 0 / 300 | ||||||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | sample_01.txt, sample_02.txt, sample_03.txt |
All | sample_01.txt, sample_02.txt, sample_03.txt, subtask_1_1.txt, subtask_1_10.txt, subtask_1_11.txt, subtask_1_12.txt, subtask_1_13.txt, subtask_1_14.txt, subtask_1_15.txt, subtask_1_16.txt, subtask_1_17.txt, subtask_1_2.txt, subtask_1_3.txt, subtask_1_4.txt, subtask_1_5.txt, subtask_1_6.txt, subtask_1_7.txt, subtask_1_8.txt, subtask_1_9.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
sample_01.txt | AC | 18 ms | 3064 KB |
sample_02.txt | AC | 18 ms | 3064 KB |
sample_03.txt | RE | 18 ms | 3064 KB |
subtask_1_1.txt | RE | 18 ms | 3064 KB |
subtask_1_10.txt | AC | 18 ms | 3064 KB |
subtask_1_11.txt | AC | 19 ms | 3064 KB |
subtask_1_12.txt | AC | 19 ms | 3064 KB |
subtask_1_13.txt | RE | 18 ms | 3064 KB |
subtask_1_14.txt | RE | 18 ms | 3064 KB |
subtask_1_15.txt | AC | 19 ms | 3064 KB |
subtask_1_16.txt | AC | 20 ms | 3064 KB |
subtask_1_17.txt | AC | 19 ms | 3064 KB |
subtask_1_2.txt | AC | 19 ms | 3064 KB |
subtask_1_3.txt | AC | 18 ms | 3064 KB |
subtask_1_4.txt | AC | 19 ms | 3064 KB |
subtask_1_5.txt | RE | 18 ms | 3064 KB |
subtask_1_6.txt | AC | 19 ms | 3064 KB |
subtask_1_7.txt | RE | 18 ms | 3064 KB |
subtask_1_8.txt | AC | 19 ms | 3064 KB |
subtask_1_9.txt | AC | 18 ms | 3064 KB |