結果
問題 | No.583 鉄道同好会 |
ユーザー | McGregorsh |
提出日時 | 2023-07-04 22:05:23 |
言語 | PyPy3 (7.3.15) |
結果 |
WA
|
実行時間 | - |
コード長 | 1,609 bytes |
コンパイル時間 | 515 ms |
コンパイル使用メモリ | 87,184 KB |
実行使用メモリ | 91,704 KB |
最終ジャッジ日時 | 2023-09-25 21:24:41 |
合計ジャッジ時間 | 6,621 ms |
ジャッジサーバーID (参考情報) |
judge11 / judge13 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 252 ms
90,148 KB |
testcase_01 | AC | 252 ms
89,948 KB |
testcase_02 | AC | 247 ms
89,912 KB |
testcase_03 | AC | 249 ms
90,112 KB |
testcase_04 | WA | - |
testcase_05 | AC | 242 ms
89,996 KB |
testcase_06 | AC | 240 ms
90,056 KB |
testcase_07 | AC | 241 ms
89,860 KB |
testcase_08 | AC | 235 ms
89,924 KB |
testcase_09 | AC | 241 ms
90,188 KB |
testcase_10 | AC | 243 ms
89,952 KB |
testcase_11 | AC | 257 ms
91,440 KB |
testcase_12 | AC | 250 ms
91,556 KB |
testcase_13 | AC | 251 ms
91,704 KB |
testcase_14 | AC | 255 ms
91,520 KB |
testcase_15 | AC | 253 ms
91,436 KB |
testcase_16 | AC | 262 ms
91,316 KB |
testcase_17 | AC | 267 ms
91,424 KB |
testcase_18 | AC | 269 ms
91,552 KB |
ソースコード
import sys from sys import stdin from fractions import Fraction import math from math import ceil, floor, sqrt, pi, factorial, gcd from copy import deepcopy from collections import Counter, deque, defaultdict from heapq import heapify, heappop, heappush from itertools import accumulate, product, combinations, combinations_with_replacement, permutations from bisect import bisect, bisect_left, bisect_right from functools import reduce, lru_cache from decimal import Decimal, getcontext, ROUND_HALF_UP def i_input(): return int(stdin.readline()) def i_map(): return map(int, stdin.readline().split()) def i_list(): return list(i_map()) def s_input(): return stdin.readline()[:-1] def s_map(): return s_input().split() def s_list(): return list(s_map()) def lcm(a, b): return a * b // gcd(a, b) def get_distance(x1, y1, x2, y2): d = sqrt((x2 - x1) ** 2 + (y2 - y1) ** 2) return d def rotate(table): n_fild = [] for x in zip(*table[::-1]): n_fild.append(x) return n_fild sys.setrecursionlimit(10 ** 7) INF = float('inf') MOD = 10 ** 9 + 7 MOD2 = 998244353 alpa = 'abcdefghijklmnopqrstuvwxyz' ALPA = 'ABCDEFGHIJKLMNOPQRSTUVWXYZ' def main(): N, M = i_map() cou = [0] * N for i in range(M): a, b = i_map() cou[a] += 1 cou[b] += 1 p = 0 g = 0 k = 0 for i in range(N): if cou[i] > 0: k += 1 if cou[i] % 2 == 1: p += 1 else: if cou[i] > 0: g += 1 if g == k or p == 2: print('YES') else: print('NO') if __name__ == '__main__': main()