提出 #38423135

ソースコード 拡げる

N, M = map(int,input().split())
g = [[] for i in range(N)]

for i in range(M):
    u, v = map(int, input().split())
    u -= 1
    v -= 1
    g[u].append(v)
    g[v].append(u)

count1 = 0
count2 = 0
s = -1
id = -1
for i in range(N):
    if len(g[i]) == 1:
        count1 += 1
        id = i
        s = g[i][0]
    elif len(g[i]) == 2:
        count2 += 1

flag = False
if count1 == 2 and count2 == N - 2:
    flag = True
seen = []

if flag:
    for i in range(N):
        if len(g[s]) == 2:
            if id in seen:
                break
            seen.append(id)
            
            g[s].remove(id)
            id = s
            s = g[s][0]
        else:
            seen.append(id)
            seen.append(s)
            break

seen.sort()

if flag:
    if len(seen) == N:
        print("Yes")
else:
    print("No")

提出情報

提出日時
問題 C - Path Graph?
ユーザ Jone931
言語 PyPy3 (7.3.0)
得点 0
コード長 876 Byte
結果 WA
実行時間 2208 ms
メモリ 95688 KiB

ジャッジ結果

セット名 Sample All
得点 / 配点 0 / 0 0 / 300
結果
AC × 3
AC × 22
WA × 6
TLE × 8
セット名 テストケース
Sample 00_example_00.txt, 00_example_01.txt, 00_example_02.txt
All 00_example_00.txt, 00_example_01.txt, 00_example_02.txt, 01_dense_00.txt, 02_path_00.txt, 02_path_01.txt, 02_path_02.txt, 02_path_03.txt, 02_path_04.txt, 02_path_05.txt, 02_path_06.txt, 02_path_07.txt, 02_path_08.txt, 02_path_09.txt, 03_paths_00.txt, 03_paths_01.txt, 03_paths_02.txt, 04_cycles_00.txt, 04_cycles_01.txt, 04_cycles_02.txt, 04_cycles_03.txt, 04_cycles_04.txt, 04_cycles_05.txt, 05_corner_00.txt, 05_corner_01.txt, 05_corner_02.txt, 05_corner_03.txt, 05_corner_04.txt, 05_corner_05.txt, 06_random_00.txt, 06_random_01.txt, 06_random_02.txt, 06_random_03.txt, 06_random_04.txt, 07_small_00.txt, 07_small_01.txt
ケース名 結果 実行時間 メモリ
00_example_00.txt AC 71 ms 61940 KiB
00_example_01.txt AC 53 ms 61912 KiB
00_example_02.txt AC 51 ms 61888 KiB
01_dense_00.txt AC 184 ms 75960 KiB
02_path_00.txt TLE 2208 ms 95688 KiB
02_path_01.txt TLE 2208 ms 95612 KiB
02_path_02.txt TLE 2208 ms 84112 KiB
02_path_03.txt TLE 2208 ms 91100 KiB
02_path_04.txt TLE 2208 ms 84232 KiB
02_path_05.txt TLE 2208 ms 92260 KiB
02_path_06.txt AC 1754 ms 82132 KiB
02_path_07.txt TLE 2208 ms 93044 KiB
02_path_08.txt TLE 2208 ms 83640 KiB
02_path_09.txt AC 114 ms 70352 KiB
03_paths_00.txt AC 407 ms 91144 KiB
03_paths_01.txt AC 417 ms 90956 KiB
03_paths_02.txt AC 248 ms 81032 KiB
04_cycles_00.txt AC 380 ms 91056 KiB
04_cycles_01.txt AC 381 ms 91092 KiB
04_cycles_02.txt AC 389 ms 90904 KiB
04_cycles_03.txt AC 414 ms 90844 KiB
04_cycles_04.txt AC 405 ms 90308 KiB
04_cycles_05.txt AC 218 ms 79056 KiB
05_corner_00.txt WA 720 ms 92652 KiB
05_corner_01.txt WA 623 ms 92084 KiB
05_corner_02.txt WA 480 ms 91528 KiB
05_corner_03.txt WA 402 ms 91232 KiB
05_corner_04.txt WA 385 ms 91360 KiB
05_corner_05.txt WA 480 ms 91172 KiB
06_random_00.txt AC 527 ms 89912 KiB
06_random_01.txt AC 536 ms 89932 KiB
06_random_02.txt AC 520 ms 88000 KiB
06_random_03.txt AC 522 ms 86308 KiB
06_random_04.txt AC 509 ms 85972 KiB
07_small_00.txt AC 53 ms 61992 KiB
07_small_01.txt AC 57 ms 61736 KiB