結果
問題 | No.1714 Tag on Grid |
ユーザー | McGregorsh |
提出日時 | 2022-07-25 21:13:50 |
言語 | PyPy3 (7.3.15) |
結果 |
WA
|
実行時間 | - |
コード長 | 2,208 bytes |
コンパイル時間 | 306 ms |
コンパイル使用メモリ | 87,016 KB |
実行使用メモリ | 92,628 KB |
最終ジャッジ日時 | 2023-09-22 07:19:01 |
合計ジャッジ時間 | 9,404 ms |
ジャッジサーバーID (参考情報) |
judge12 / judge14 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 255 ms
92,484 KB |
testcase_01 | AC | 259 ms
92,452 KB |
testcase_02 | AC | 249 ms
92,548 KB |
testcase_03 | AC | 252 ms
92,204 KB |
testcase_04 | AC | 248 ms
92,452 KB |
testcase_05 | AC | 248 ms
92,204 KB |
testcase_06 | WA | - |
testcase_07 | AC | 245 ms
92,240 KB |
testcase_08 | AC | 254 ms
92,532 KB |
testcase_09 | WA | - |
testcase_10 | AC | 247 ms
92,532 KB |
testcase_11 | AC | 249 ms
92,624 KB |
testcase_12 | AC | 252 ms
92,436 KB |
testcase_13 | AC | 249 ms
92,340 KB |
testcase_14 | WA | - |
testcase_15 | WA | - |
testcase_16 | WA | - |
testcase_17 | WA | - |
testcase_18 | AC | 246 ms
92,588 KB |
testcase_19 | WA | - |
testcase_20 | AC | 243 ms
92,180 KB |
testcase_21 | WA | - |
testcase_22 | WA | - |
testcase_23 | WA | - |
testcase_24 | AC | 246 ms
92,288 KB |
testcase_25 | AC | 246 ms
92,440 KB |
testcase_26 | AC | 247 ms
92,336 KB |
testcase_27 | AC | 259 ms
92,552 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(): h, w = i_map() ni, nj = i_map() zi, zj = i_map() move = [[0, 1], [0, -1], [1, 0], [-1, 0]] if zi == 1 and zj == 1: for i, j in move: nz = ni + i nzi = nj + j if nz == 2 and nzi == 2: print('Yes') exit() if zi == 1 and zj == w: for i, j in move: nz = ni + i nzi = nj + j if nz == 2 and nzi == w-1: print('Yes') exit() if zi == h and zj == 1: for i, j in move: nz = ni + i nzi = nj + j if nz == h - 1 and nzi == 2: print('Yes') exit() if zi == h and zj == w: for i, j in move: nz = ni + i nzi = nj + j if nz == h-1 and nzi == w-1: print('Yes') exit() print('No') if __name__ == '__main__': main()