Submission #32175782
Source Code Expand
N, M = map(int, input().split())
g = [[] for _ in range(N)]
for i in range(M):
a, b = map(int, input().split())
a -= 1
b -= 1
g[a].append(b)
g[b].append(a)
ans = 0
for i in range(N):
cnt = 0
for j in g[i]:
if j < i:
cnt += 1
if cnt == 1:
ans += 1
print(ans)
Submission Info
| Submission Time | |
|---|---|
| Task | 078 - Easy Graph Problem(★2) |
| User | inaty |
| Language | Python (3.8.2) |
| Score | 2 |
| Code Size | 343 Byte |
| Status | AC |
| Exec Time | 317 ms |
| Memory | 26256 KiB |
Judge Result
| Set Name | Sample | All | ||||
|---|---|---|---|---|---|---|
| Score / Max Score | 0 / 0 | 2 / 2 | ||||
| Status |
|
|
| Set Name | Test Cases |
|---|---|
| Sample | 00_sample_00.txt, 00_sample_01.txt, 00_sample_02.txt |
| All | 00_sample_00.txt, 00_sample_01.txt, 00_sample_02.txt, 10_random_small_00.txt, 10_random_small_01.txt, 10_random_small_02.txt, 10_random_small_03.txt, 10_random_small_04.txt, 10_random_small_05.txt, 10_random_small_06.txt, 10_random_small_07.txt, 11_random_large_00.txt, 11_random_large_01.txt, 11_random_large_02.txt, 11_random_large_03.txt, 11_random_large_04.txt, 11_random_large_05.txt, 11_random_large_06.txt, 11_random_large_07.txt, 20_random_max_00.txt, 20_random_max_01.txt, 20_random_max_02.txt, 20_random_max_03.txt, 20_random_max_04.txt, 80_random_tree_00.txt, 80_random_tree_01.txt, 90_random_uni_00.txt, 90_random_uni_01.txt |
| Case Name | Status | Exec Time | Memory |
|---|---|---|---|
| 00_sample_00.txt | AC | 17 ms | 8852 KiB |
| 00_sample_01.txt | AC | 20 ms | 8952 KiB |
| 00_sample_02.txt | AC | 27 ms | 8936 KiB |
| 10_random_small_00.txt | AC | 24 ms | 9040 KiB |
| 10_random_small_01.txt | AC | 18 ms | 8948 KiB |
| 10_random_small_02.txt | AC | 18 ms | 9044 KiB |
| 10_random_small_03.txt | AC | 18 ms | 8996 KiB |
| 10_random_small_04.txt | AC | 18 ms | 8972 KiB |
| 10_random_small_05.txt | AC | 19 ms | 8988 KiB |
| 10_random_small_06.txt | AC | 17 ms | 8936 KiB |
| 10_random_small_07.txt | AC | 17 ms | 8952 KiB |
| 11_random_large_00.txt | AC | 54 ms | 9740 KiB |
| 11_random_large_01.txt | AC | 199 ms | 13304 KiB |
| 11_random_large_02.txt | AC | 124 ms | 11120 KiB |
| 11_random_large_03.txt | AC | 77 ms | 9836 KiB |
| 11_random_large_04.txt | AC | 57 ms | 9756 KiB |
| 11_random_large_05.txt | AC | 38 ms | 9168 KiB |
| 11_random_large_06.txt | AC | 93 ms | 10612 KiB |
| 11_random_large_07.txt | AC | 163 ms | 12872 KiB |
| 20_random_max_00.txt | AC | 315 ms | 25456 KiB |
| 20_random_max_01.txt | AC | 315 ms | 25736 KiB |
| 20_random_max_02.txt | AC | 317 ms | 25632 KiB |
| 20_random_max_03.txt | AC | 315 ms | 25740 KiB |
| 20_random_max_04.txt | AC | 310 ms | 25784 KiB |
| 80_random_tree_00.txt | AC | 313 ms | 25508 KiB |
| 80_random_tree_01.txt | AC | 315 ms | 25416 KiB |
| 90_random_uni_00.txt | AC | 293 ms | 26148 KiB |
| 90_random_uni_01.txt | AC | 287 ms | 26256 KiB |