結果

問題 No.240 ナイト散歩
ユーザー Coki628
提出日時 2020-05-28 01:01:16
言語 Python3
(3.13.1 + numpy 2.2.1 + scipy 1.14.1)
結果
AC  
実行時間 35 ms / 2,000 ms
コード長 1,903 bytes
コンパイル時間 117 ms
コンパイル使用メモリ 13,056 KB
実行使用メモリ 11,136 KB
最終ジャッジ日時 2024-10-13 03:58:17
合計ジャッジ時間 2,290 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge5
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 4
other AC * 30
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

import sys
def input(): return sys.stdin.readline().strip()
def list2d(a, b, c): return [[c] * b for i in range(a)]
def list3d(a, b, c, d): return [[[d] * c for j in range(b)] for i in range(a)]
def list4d(a, b, c, d, e): return [[[[e] * d for j in range(c)] for j in range(b)] for i in range(a)]
def ceil(x, y=1): return int(-(-x // y))
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(N=None): return list(MAP()) if N is None else [INT() for i in range(N)]
def Yes(): print('Yes')
def No(): print('No')
def YES(): print('YES')
def NO(): print('NO')
sys.setrecursionlimit(10 ** 9)
INF = 10 ** 19
MOD = 10 ** 9 + 7
EPS = 10 ** -10
def bfs(src):
    from collections import deque
    que = deque([src])
    dist = {}
    dist[src] = 0
    while que:
        x, y = que.popleft()
        if dist[(x, y)] >= 3:
            continue
        if (x-2, y-1) not in dist:
            dist[(x-2, y-1)] = dist[(x, y)] + 1
            que.append((x-2, y-1))
        if (x-2, y+1) not in dist:
            dist[(x-2, y+1)] = dist[(x, y)] + 1
            que.append((x-2, y+1))
        if (x-1, y-2) not in dist:
            dist[(x-1, y-2)] = dist[(x, y)] + 1
            que.append((x-1, y-2))
        if (x-1, y+2) not in dist:
            dist[(x-1, y+2)] = dist[(x, y)] + 1
            que.append((x-1, y+2))
        if (x+1, y-2) not in dist:
            dist[(x+1, y-2)] = dist[(x, y)] + 1
            que.append((x+1, y-2))
        if (x+1, y+2) not in dist:
            dist[(x+1, y+2)] = dist[(x, y)] + 1
            que.append((x+1, y+2))
        if (x+2, y-1) not in dist:
            dist[(x+2, y-1)] = dist[(x, y)] + 1
            que.append((x+2, y-1))
        if (x+2, y+1) not in dist:
            dist[(x+2, y+1)] = dist[(x, y)] + 1
            que.append((x+2, y+1))
    return dist
x, y = MAP()
res = bfs((0, 0))
if (x, y) in res:
    YES()
else:
    NO()
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0