結果
問題 | No.583 鉄道同好会 |
ユーザー | McGregorsh |
提出日時 | 2023-07-04 22:11:53 |
言語 | PyPy3 (7.3.15) |
結果 |
WA
|
実行時間 | - |
コード長 | 1,646 bytes |
コンパイル時間 | 1,921 ms |
コンパイル使用メモリ | 86,616 KB |
実行使用メモリ | 91,552 KB |
最終ジャッジ日時 | 2023-09-25 21:32:17 |
合計ジャッジ時間 | 7,828 ms |
ジャッジサーバーID (参考情報) |
judge14 / judge12 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 229 ms
89,816 KB |
testcase_01 | AC | 228 ms
90,000 KB |
testcase_02 | AC | 237 ms
89,816 KB |
testcase_03 | AC | 234 ms
90,004 KB |
testcase_04 | WA | - |
testcase_05 | AC | 232 ms
89,596 KB |
testcase_06 | AC | 228 ms
90,044 KB |
testcase_07 | AC | 227 ms
89,864 KB |
testcase_08 | AC | 227 ms
89,992 KB |
testcase_09 | AC | 234 ms
89,864 KB |
testcase_10 | AC | 236 ms
89,820 KB |
testcase_11 | AC | 251 ms
91,292 KB |
testcase_12 | AC | 247 ms
91,388 KB |
testcase_13 | AC | 244 ms
91,488 KB |
testcase_14 | AC | 242 ms
91,552 KB |
testcase_15 | AC | 243 ms
91,244 KB |
testcase_16 | AC | 258 ms
91,344 KB |
testcase_17 | AC | 261 ms
91,228 KB |
testcase_18 | AC | 260 ms
91,496 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: print('YES') exit() if p == 2: print('YES') exit() print('NO') if __name__ == '__main__': main()