結果
問題 | No.1610 She Loves Me, She Loves Me Not, ... |
ユーザー | McGregorsh |
提出日時 | 2022-07-22 10:31:30 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 300 ms / 2,000 ms |
コード長 | 2,064 bytes |
コンパイル時間 | 1,441 ms |
コンパイル使用メモリ | 86,980 KB |
実行使用メモリ | 94,900 KB |
最終ジャッジ日時 | 2023-09-16 17:32:22 |
合計ジャッジ時間 | 11,107 ms |
ジャッジサーバーID (参考情報) |
judge12 / judge11 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 233 ms
92,520 KB |
testcase_01 | AC | 235 ms
92,632 KB |
testcase_02 | AC | 238 ms
92,524 KB |
testcase_03 | AC | 237 ms
92,516 KB |
testcase_04 | AC | 240 ms
92,276 KB |
testcase_05 | AC | 296 ms
94,788 KB |
testcase_06 | AC | 297 ms
94,656 KB |
testcase_07 | AC | 297 ms
94,556 KB |
testcase_08 | AC | 295 ms
94,552 KB |
testcase_09 | AC | 300 ms
94,664 KB |
testcase_10 | AC | 298 ms
94,652 KB |
testcase_11 | AC | 294 ms
94,720 KB |
testcase_12 | AC | 289 ms
94,612 KB |
testcase_13 | AC | 297 ms
94,900 KB |
testcase_14 | AC | 249 ms
92,420 KB |
testcase_15 | AC | 247 ms
92,272 KB |
testcase_16 | AC | 244 ms
92,348 KB |
testcase_17 | AC | 246 ms
92,480 KB |
testcase_18 | AC | 241 ms
92,272 KB |
testcase_19 | AC | 245 ms
92,220 KB |
testcase_20 | AC | 243 ms
92,224 KB |
testcase_21 | AC | 241 ms
92,296 KB |
testcase_22 | AC | 244 ms
92,456 KB |
testcase_23 | AC | 237 ms
92,272 KB |
testcase_24 | AC | 236 ms
92,560 KB |
testcase_25 | AC | 235 ms
92,268 KB |
testcase_26 | AC | 234 ms
92,412 KB |
testcase_27 | AC | 238 ms
92,196 KB |
testcase_28 | AC | 239 ms
92,484 KB |
testcase_29 | AC | 238 ms
92,308 KB |
testcase_30 | AC | 242 ms
92,272 KB |
testcase_31 | AC | 244 ms
92,216 KB |
testcase_32 | AC | 241 ms
92,216 KB |
testcase_33 | AC | 240 ms
92,228 KB |
testcase_34 | AC | 237 ms
92,420 KB |
testcase_35 | AC | 239 ms
92,220 KB |
ソースコード
import sys, re from fractions import Fraction 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 from decimal import Decimal, getcontext def i_input(): return int(input()) def i_map(): return map(int, input().split()) def i_list(): return list(i_map()) def i_row(N): return [i_input() for _ in range(N)] def i_row_list(N): return [i_list() for _ in range(N)] def s_input(): return input() def s_map(): return input().split() def s_list(): return list(s_map()) def s_row(N): return [s_input for _ in range(N)] def s_row_str(N): return [s_list() for _ in range(N)] def s_row_list(N): return [list(s_input()) for _ in range(N)] 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 ###関数コピーしたか?### def main(): n, m = i_map() nums = [[] for i in range(n)] counts = defaultdict(int) for i in range(m): a, b = i_map() a -= 1 b -= 1 nums[a].append(b) nums[b].append(a) counts[a] += 1 counts[b] += 1 que = deque() for key, value in counts.items(): if value == 1: que.append(key) #print(nums) #print(que) ans = 0 while que: point = que.popleft() if counts[point] == 1: ans += 1 for i in nums[point]: counts[i] -= 1 if counts[i] == 1: que.append(i) #print(counts) #print(que) #print(ans) if ans % 2 == 0: print('No') else: print('Yes') if __name__ == '__main__': main()