結果
問題 | No.85 TVザッピング(1) |
ユーザー | McGregorsh |
提出日時 | 2023-05-13 15:02:22 |
言語 | PyPy3 (7.3.15) |
結果 |
WA
|
実行時間 | - |
コード長 | 1,510 bytes |
コンパイル時間 | 639 ms |
コンパイル使用メモリ | 86,952 KB |
実行使用メモリ | 92,616 KB |
最終ジャッジ日時 | 2023-08-19 14:23:52 |
合計ジャッジ時間 | 9,177 ms |
ジャッジサーバーID (参考情報) |
judge14 / judge11 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 195 ms
92,420 KB |
testcase_01 | AC | 198 ms
92,560 KB |
testcase_02 | AC | 201 ms
92,368 KB |
testcase_03 | AC | 201 ms
92,356 KB |
testcase_04 | AC | 199 ms
92,324 KB |
testcase_05 | AC | 204 ms
92,324 KB |
testcase_06 | AC | 214 ms
92,276 KB |
testcase_07 | AC | 203 ms
92,476 KB |
testcase_08 | AC | 201 ms
92,516 KB |
testcase_09 | WA | - |
testcase_10 | AC | 200 ms
92,368 KB |
testcase_11 | AC | 197 ms
92,360 KB |
testcase_12 | AC | 204 ms
92,324 KB |
testcase_13 | AC | 199 ms
92,320 KB |
testcase_14 | WA | - |
testcase_15 | AC | 201 ms
92,424 KB |
testcase_16 | AC | 199 ms
92,440 KB |
testcase_17 | AC | 197 ms
92,320 KB |
testcase_18 | AC | 196 ms
92,324 KB |
testcase_19 | AC | 205 ms
92,440 KB |
testcase_20 | AC | 197 ms
92,444 KB |
testcase_21 | AC | 203 ms
92,212 KB |
testcase_22 | AC | 201 ms
92,448 KB |
testcase_23 | AC | 202 ms
92,452 KB |
testcase_24 | AC | 203 ms
92,388 KB |
testcase_25 | AC | 210 ms
92,340 KB |
testcase_26 | AC | 213 ms
92,464 KB |
testcase_27 | AC | 206 ms
92,188 KB |
testcase_28 | AC | 210 ms
92,324 KB |
testcase_29 | AC | 206 ms
92,356 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 or M == 1: print('NO') exit() if N % 2 == 0 or M % 2 == 0: print('YES') else: print('NO') if __name__ == '__main__': main()