Submission #38615280

Source Code Expand

n, m = map(int, input().split(" "))

ans = 0
nodes = set()
edges = []
for _ in range(m):
    edge = sorted(list(map(lambda x: int(x) - 1, input().split(" "))))
    edges.append(edge)

edges = sorted(edges)

for i in range(m):
    s, d = edges[i]
    if s in nodes and d in nodes:
        ans += 1
    nodes.add(s)
    nodes.add(d)

print(ans)

Submission Info

Submission Time
Task C - Don’t be cycle
User minjinaffa
Language PyPy3 (7.3.0)
Score 0
Code Size 364 Byte
Status WA
Exec Time 847 ms
Memory 137464 KiB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 300
Status AC
AC × 8
WA × 15
Set Name Test Cases
Sample
All sample00.txt, sample01.txt, sample02.txt, testcase00.txt, testcase01.txt, testcase02.txt, testcase03.txt, testcase04.txt, testcase05.txt, testcase06.txt, testcase07.txt, testcase08.txt, testcase09.txt, testcase10.txt, testcase11.txt, testcase12.txt, testcase13.txt, testcase14.txt, testcase15.txt, testcase16.txt, testcase17.txt, testcase18.txt, testcase19.txt
Case Name Status Exec Time Memory
sample00.txt AC 78 ms 61732 KiB
sample01.txt AC 48 ms 61644 KiB
sample02.txt AC 49 ms 61684 KiB
testcase00.txt AC 50 ms 61740 KiB
testcase01.txt AC 749 ms 106212 KiB
testcase02.txt AC 773 ms 106560 KiB
testcase03.txt WA 808 ms 136652 KiB
testcase04.txt WA 822 ms 136508 KiB
testcase05.txt AC 804 ms 120472 KiB
testcase06.txt AC 847 ms 118324 KiB
testcase07.txt WA 826 ms 137464 KiB
testcase08.txt WA 814 ms 136952 KiB
testcase09.txt WA 819 ms 137196 KiB
testcase10.txt WA 828 ms 137248 KiB
testcase11.txt WA 811 ms 136772 KiB
testcase12.txt WA 821 ms 136616 KiB
testcase13.txt WA 828 ms 136448 KiB
testcase14.txt WA 814 ms 133448 KiB
testcase15.txt WA 804 ms 131444 KiB
testcase16.txt WA 811 ms 131892 KiB
testcase17.txt WA 811 ms 131336 KiB
testcase18.txt WA 822 ms 131436 KiB
testcase19.txt WA 807 ms 131684 KiB