結果
問題 | No.1714 Tag on Grid |
ユーザー | McGregorsh |
提出日時 | 2023-05-22 14:42:25 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 242 ms / 2,000 ms |
コード長 | 1,505 bytes |
コンパイル時間 | 632 ms |
コンパイル使用メモリ | 86,980 KB |
実行使用メモリ | 92,616 KB |
最終ジャッジ日時 | 2023-08-23 23:22:19 |
合計ジャッジ時間 | 8,972 ms |
ジャッジサーバーID (参考情報) |
judge15 / judge11 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 241 ms
92,316 KB |
testcase_01 | AC | 238 ms
92,268 KB |
testcase_02 | AC | 242 ms
92,352 KB |
testcase_03 | AC | 238 ms
92,332 KB |
testcase_04 | AC | 239 ms
92,344 KB |
testcase_05 | AC | 238 ms
92,404 KB |
testcase_06 | AC | 238 ms
92,616 KB |
testcase_07 | AC | 234 ms
92,272 KB |
testcase_08 | AC | 235 ms
92,408 KB |
testcase_09 | AC | 238 ms
92,420 KB |
testcase_10 | AC | 233 ms
92,328 KB |
testcase_11 | AC | 236 ms
92,548 KB |
testcase_12 | AC | 236 ms
92,212 KB |
testcase_13 | AC | 233 ms
92,496 KB |
testcase_14 | AC | 233 ms
92,492 KB |
testcase_15 | AC | 235 ms
92,364 KB |
testcase_16 | AC | 236 ms
92,428 KB |
testcase_17 | AC | 240 ms
92,444 KB |
testcase_18 | AC | 238 ms
92,504 KB |
testcase_19 | AC | 234 ms
92,316 KB |
testcase_20 | AC | 234 ms
92,408 KB |
testcase_21 | AC | 234 ms
92,496 KB |
testcase_22 | AC | 238 ms
92,408 KB |
testcase_23 | AC | 237 ms
92,324 KB |
testcase_24 | AC | 235 ms
92,268 KB |
testcase_25 | AC | 238 ms
92,416 KB |
testcase_26 | AC | 238 ms
92,540 KB |
testcase_27 | AC | 236 ms
92,416 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(): H, W = i_map() a, b = i_map() c, d = i_map() e = abs(b - a) + abs(d - c) if e % 2 == 0: print('No') else: print('Yes') if __name__ == '__main__': main()