結果
問題 | No.85 TVザッピング(1) |
ユーザー | McGregorsh |
提出日時 | 2023-05-13 15:07:11 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 247 ms / 5,000 ms |
コード長 | 1,629 bytes |
コンパイル時間 | 425 ms |
コンパイル使用メモリ | 87,112 KB |
実行使用メモリ | 92,508 KB |
最終ジャッジ日時 | 2023-08-19 14:26:01 |
合計ジャッジ時間 | 9,190 ms |
ジャッジサーバーID (参考情報) |
judge14 / judge10 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 247 ms
92,344 KB |
testcase_01 | AC | 242 ms
92,504 KB |
testcase_02 | AC | 242 ms
92,324 KB |
testcase_03 | AC | 242 ms
92,456 KB |
testcase_04 | AC | 241 ms
92,352 KB |
testcase_05 | AC | 246 ms
92,156 KB |
testcase_06 | AC | 242 ms
92,376 KB |
testcase_07 | AC | 245 ms
92,340 KB |
testcase_08 | AC | 245 ms
92,408 KB |
testcase_09 | AC | 240 ms
92,408 KB |
testcase_10 | AC | 239 ms
92,192 KB |
testcase_11 | AC | 247 ms
92,160 KB |
testcase_12 | AC | 246 ms
92,400 KB |
testcase_13 | AC | 242 ms
92,508 KB |
testcase_14 | AC | 240 ms
92,480 KB |
testcase_15 | AC | 243 ms
92,340 KB |
testcase_16 | AC | 242 ms
92,228 KB |
testcase_17 | AC | 244 ms
92,356 KB |
testcase_18 | AC | 240 ms
92,276 KB |
testcase_19 | AC | 240 ms
92,328 KB |
testcase_20 | AC | 243 ms
92,428 KB |
testcase_21 | AC | 242 ms
92,340 KB |
testcase_22 | AC | 240 ms
92,264 KB |
testcase_23 | AC | 243 ms
92,308 KB |
testcase_24 | AC | 243 ms
92,200 KB |
testcase_25 | AC | 241 ms
92,496 KB |
testcase_26 | AC | 243 ms
92,196 KB |
testcase_27 | AC | 242 ms
92,156 KB |
testcase_28 | AC | 244 ms
92,196 KB |
testcase_29 | AC | 246 ms
92,496 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, ROUND_HALF_UP 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, C, = i_map() if N == 1 and M == 2: print('YES') exit() if N == 2 and M == 1: print('YES') exit() if N == 1 or M == 1: print('NO') exit() if N % 2 == 0 or M % 2 == 0: print('YES') else: print('NO') if __name__ == '__main__': main()