(cache)Submission #62768036 - AtCoder Beginner Contest 393

Contest Duration: 2025-02-15(Sat) 21:00 - 2025-02-15(Sat) 22:40 (local time) (100 minutes) Back to Home

Submission #62768036

Source Code Expand

Copy

1
2
3
4
5
6
7
8
9
10
11
12
13
N,M = map(int,input().split())
graph = {}
for i in range(N):
    graph[i] = set()
count = 0
for i in range(M):
    u,v = map(int,input().split())
    if v - 1 in graph[u - 1] or u == v:
        count += 1
        continue
    graph[u - 1].add(v - 1)
    graph[v - 1].add(u - 1)
print(count)
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

N,M = map(int,input().split())
graph = {}
for i in range(N):
    graph[i] = set()
count = 0
for i in range(M):
    u,v = map(int,input().split())
    if v - 1 in graph[u - 1] or u == v:
        count += 1
        continue
    graph[u - 1].add(v - 1)
    graph[v - 1].add(u - 1)
print(count)

Submission Info

Submission Time	2025-02-15 21:09:04
Task	C - Make it Simple
User	kangping
Language	Python (CPython 3.11.4)
Score	300
Code Size	302 Byte
Status	AC
Exec Time	1459 ms
Memory	158872 KiB

Judge Result

Set Name

Sample

All

Score / Max Score

0 / 0

300 / 300

Status

× 3

× 19

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, 01_n_small_00.txt, 01_n_small_01.txt, 01_n_small_02.txt, 01_n_small_03.txt, 02_random_00.txt, 02_random_01.txt, 02_random_02.txt, 02_random_03.txt, 02_random_04.txt, 02_random_05.txt, 02_random_06.txt, 02_random_07.txt, 03_corner_00.txt, 03_corner_01.txt, 03_corner_02.txt, 03_corner_03.txt

Case Name	Status	Exec Time	Memory
00_sample_00.txt	AC	10 ms	8492 KiB
00_sample_01.txt	AC	10 ms	8452 KiB
00_sample_02.txt	AC	10 ms	8444 KiB
01_n_small_00.txt	AC	549 ms	8544 KiB
01_n_small_01.txt	AC	448 ms	8428 KiB
01_n_small_02.txt	AC	618 ms	8948 KiB
01_n_small_03.txt	AC	621 ms	8428 KiB
02_random_00.txt	AC	826 ms	99104 KiB
02_random_01.txt	AC	863 ms	105532 KiB
02_random_02.txt	AC	1422 ms	155876 KiB
02_random_03.txt	AC	1410 ms	158776 KiB
02_random_04.txt	AC	1177 ms	139684 KiB
02_random_05.txt	AC	864 ms	106912 KiB
02_random_06.txt	AC	1262 ms	147420 KiB
02_random_07.txt	AC	1459 ms	158872 KiB
03_corner_00.txt	AC	1096 ms	96576 KiB
03_corner_01.txt	AC	1161 ms	96816 KiB
03_corner_02.txt	AC	948 ms	70076 KiB
03_corner_03.txt	AC	976 ms	69912 KiB