結果
問題 | No.240 ナイト散歩 |
ユーザー | McGregorsh |
提出日時 | 2022-06-19 18:21:08 |
言語 | PyPy3 (7.3.15) |
結果 |
WA
|
実行時間 | - |
コード長 | 1,668 bytes |
コンパイル時間 | 158 ms |
コンパイル使用メモリ | 82,496 KB |
実行使用メモリ | 83,764 KB |
最終ジャッジ日時 | 2024-04-20 02:39:49 |
合計ジャッジ時間 | 5,083 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge3 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 109 ms
83,428 KB |
testcase_01 | AC | 110 ms
83,656 KB |
testcase_02 | AC | 105 ms
83,564 KB |
testcase_03 | AC | 114 ms
83,464 KB |
testcase_04 | AC | 110 ms
83,600 KB |
testcase_05 | AC | 108 ms
83,452 KB |
testcase_06 | AC | 108 ms
83,668 KB |
testcase_07 | AC | 108 ms
83,384 KB |
testcase_08 | AC | 114 ms
83,700 KB |
testcase_09 | AC | 107 ms
83,596 KB |
testcase_10 | AC | 107 ms
83,524 KB |
testcase_11 | AC | 107 ms
83,592 KB |
testcase_12 | AC | 109 ms
83,200 KB |
testcase_13 | AC | 106 ms
83,520 KB |
testcase_14 | AC | 109 ms
83,516 KB |
testcase_15 | AC | 108 ms
83,628 KB |
testcase_16 | AC | 108 ms
83,256 KB |
testcase_17 | AC | 112 ms
83,728 KB |
testcase_18 | WA | - |
testcase_19 | WA | - |
testcase_20 | AC | 106 ms
83,596 KB |
testcase_21 | AC | 105 ms
83,280 KB |
testcase_22 | WA | - |
testcase_23 | WA | - |
testcase_24 | WA | - |
testcase_25 | AC | 103 ms
83,220 KB |
testcase_26 | AC | 106 ms
83,180 KB |
testcase_27 | AC | 102 ms
83,372 KB |
testcase_28 | AC | 108 ms
83,156 KB |
testcase_29 | AC | 107 ms
83,732 KB |
testcase_30 | AC | 107 ms
83,584 KB |
testcase_31 | AC | 105 ms
83,240 KB |
testcase_32 | AC | 109 ms
83,192 KB |
testcase_33 | AC | 105 ms
83,764 KB |
ソースコード
import sys, re 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 sys.setrecursionlimit(10 ** 7) INF = float('inf') MOD = 10 ** 9 + 7 MOD2 = 998244353 def main(): x, y = i_map() move = [[-2, -1], [-2, 1], [-1, -2], [-1, 2], [1, -2], [1, 2], [2, -1], [2, 1]] nums = set() for i in range(8): a, b = move[i] for j in range(8): c, d = move[j] for k in range(8): e, f = move[k] ans1 = a + c + e ans2 = b + d + f nums.add((ans1, ans2)) nums.add((0, 0)) #print(nums) if (x, y) in nums: print('YES') else: print('NO') if __name__ == '__main__': main()