Submission #3417704


Source Code Expand

def dfs(nowv, vertex, edge, last):
    global f
    vertex[nowv]=0

    for now in edge:
        if now[0]==nowv and vertex[now[1]]==1:
            last=now
            dfs(now[1], vertex, edge, last)
        elif now[1]==nowv and vertex[now[0]]==0 :
            if not (now==last):
                f=0

        elif  now[1]==nowv and vertex[now[0]]==1:
            last=now
            dfs(now[0], vertex, edge, last)
        elif (now[0]==nowv and vertex[now[1]]==0):
            if not (now==last):
                f=0

[n,m]=[int(i) for i in input().split()]
edge=[]
for _ in range(m):
    temp=[int(i) for i in input().split()]
    temp.append(1)
    edge.append(temp)

vertex={i+1:1 for i in range(n)}

count=0
f=1
for i in vertex:
    if vertex[i]==1:
        f=1
        dfs(i, vertex, edge, [-1,-1])
        if f:
            count+=1
print(count)

Submission Info

Submission Time
Task B - バウムテスト
User shino104
Language Python (3.4.3)
Score 0
Code Size 894 Byte
Status WA
Exec Time 116 ms
Memory 3572 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 100
Status
AC × 3
AC × 12
WA × 22
Set Name Test Cases
Sample subtask0_sample_01.txt, subtask0_sample_02.txt, subtask0_sample_03.txt
All subtask0_sample_01.txt, subtask0_sample_02.txt, subtask0_sample_03.txt, subtask1_01.txt, subtask1_02.txt, subtask1_03.txt, subtask1_04.txt, subtask1_05.txt, subtask1_06.txt, subtask1_07.txt, subtask1_08.txt, subtask1_09.txt, subtask1_10.txt, subtask1_11.txt, subtask1_12.txt, subtask1_13.txt, subtask1_14.txt, subtask1_15.txt, subtask1_16.txt, subtask1_17.txt, subtask1_18.txt, subtask1_19.txt, subtask1_20.txt, subtask1_21.txt, subtask1_22.txt, subtask1_23.txt, subtask1_24.txt, subtask1_25.txt, subtask1_26.txt, subtask1_27.txt, subtask1_28.txt, subtask1_29.txt, subtask1_30.txt, subtask1_31.txt
Case Name Status Exec Time Memory
subtask0_sample_01.txt AC 17 ms 3064 KB
subtask0_sample_02.txt AC 17 ms 3064 KB
subtask0_sample_03.txt AC 17 ms 3064 KB
subtask1_01.txt WA 18 ms 3064 KB
subtask1_02.txt WA 17 ms 3064 KB
subtask1_03.txt AC 17 ms 3064 KB
subtask1_04.txt AC 22 ms 3064 KB
subtask1_05.txt WA 18 ms 3064 KB
subtask1_06.txt WA 17 ms 3064 KB
subtask1_07.txt WA 17 ms 3064 KB
subtask1_08.txt WA 18 ms 3064 KB
subtask1_09.txt WA 18 ms 3064 KB
subtask1_10.txt WA 18 ms 3064 KB
subtask1_11.txt WA 18 ms 3064 KB
subtask1_12.txt WA 18 ms 3064 KB
subtask1_13.txt AC 22 ms 3064 KB
subtask1_14.txt WA 18 ms 3064 KB
subtask1_15.txt WA 20 ms 3064 KB
subtask1_16.txt AC 21 ms 3064 KB
subtask1_17.txt WA 19 ms 3064 KB
subtask1_18.txt WA 19 ms 3064 KB
subtask1_19.txt WA 20 ms 3064 KB
subtask1_20.txt WA 18 ms 3064 KB
subtask1_21.txt WA 21 ms 3064 KB
subtask1_22.txt WA 18 ms 3064 KB
subtask1_23.txt WA 19 ms 3064 KB
subtask1_24.txt WA 20 ms 3064 KB
subtask1_25.txt AC 17 ms 3064 KB
subtask1_26.txt WA 19 ms 3064 KB
subtask1_27.txt AC 19 ms 3064 KB
subtask1_28.txt WA 19 ms 3064 KB
subtask1_29.txt AC 116 ms 3572 KB
subtask1_30.txt AC 113 ms 3572 KB
subtask1_31.txt AC 17 ms 3064 KB