結果

問題 No.1949 足し算するだけのパズルゲーム(2)
ユーザー KeroruKeroru
提出日時 2022-05-20 23:39:03
言語 PyPy3
(7.3.15)
結果
WA  
実行時間 -
コード長 4,169 bytes
コンパイル時間 315 ms
コンパイル使用メモリ 82,688 KB
実行使用メモリ 106,596 KB
最終ジャッジ日時 2024-09-20 10:05:21
合計ジャッジ時間 7,752 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge1
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 151 ms
92,416 KB
testcase_01 WA -
testcase_02 AC 149 ms
92,416 KB
testcase_03 AC 151 ms
92,672 KB
testcase_04 WA -
testcase_05 AC 151 ms
92,416 KB
testcase_06 WA -
testcase_07 AC 169 ms
92,928 KB
testcase_08 WA -
testcase_09 AC 183 ms
93,184 KB
testcase_10 AC 182 ms
93,056 KB
testcase_11 AC 180 ms
93,312 KB
testcase_12 AC 366 ms
94,776 KB
testcase_13 WA -
testcase_14 WA -
testcase_15 WA -
testcase_16 WA -
testcase_17 AC 555 ms
106,200 KB
testcase_18 WA -
testcase_19 WA -
testcase_20 AC 158 ms
92,544 KB
testcase_21 WA -
testcase_22 AC 441 ms
100,360 KB
testcase_23 WA -
testcase_24 WA -
testcase_25 AC 306 ms
94,256 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

import sys
read=sys.stdin.buffer.read;readline=sys.stdin.buffer.readline;input=lambda:sys.stdin.readline().rstrip()
import bisect,string,math,time,functools,random,fractions
from bisect import*
from heapq import heappush,heappop,heapify
from collections import deque,defaultdict,Counter
from itertools import permutations,combinations,groupby
rep=range;R=range
def I():return int(input())
def LI():return [int(i) for i in input().split()]
def SLI():return sorted([int(i) for i in input().split()])
def LI_():return [int(i)-1 for i in input().split()]
def S_():return input()
def IS():return input().split()
def LS():return [i for i in input().split()]
def NI(n):return [int(input()) for i in range(n)]
def NI_(n):return [int(input())-1 for i in range(n)]
def NLI(n):return [[int(i) for i in input().split()] for i in range(n)]
def NLI_(n):return [[int(i)-1 for i in input().split()] for i in range(n)]
def StoLI():return [ord(i)-97 for i in input()]
def ItoS(n):return chr(n+97)
def LtoS(ls):return ''.join([chr(i+97) for i in ls])
def RLI(n=8,a=1,b=10):return [random.randint(a,b)for i in range(n)]
def RI(a=1,b=10):return random.randint(a,b)
def INP():
    N=3
    n=random.randint(1,N)
    n=3
    p=4
    mn,mx=1,100000000
    q=[[random.randint(mn,mx) for i in range(p)]for i in range(n)]
    return n,p,q
def Rtest(T):
    case,err=0,0
    for i in range(T):
        inp=INP()
        a1=naive(*inp)
        a2=solve(*inp)
        if a1!=a2:
            print(inp)
            print('naive',a1)
            print('solve',a2)
            err+=1
        case+=1
    print('Tested',case,'case with',err,'errors')
def GI(V,E,ls=None,Directed=False,index=1):
    org_inp=[];g=[[] for i in range(V)]
    FromStdin=True if ls==None else False
    for i in range(E):
        if FromStdin:
            inp=LI()
            org_inp.append(inp)
        else:
            inp=ls[i]
        if len(inp)==2:a,b=inp;c=1
        else:a,b,c=inp
        if index==1:a-=1;b-=1
        aa=a,c,;bb=b,c,;g[a].append(bb)
        if not Directed:g[b].append(aa)
    return g,org_inp
def RE(E):
    rt=[[]for i in range(len(E))]
    for i in range(len(E)):
        for nb,d in E[i]:
            rt[nb]+=(i,d),
    return rt
def GGI(h,w,search=None,replacement_of_found='.',mp_def={'#':1,'.':0},boundary=1):
    #h,w,g,sg=GGI(h,w,search=['S','G'],replacement_of_found='.',mp_def={'#':1,'.':0},boundary=1) # sample usage
    mp=[boundary]*(w+2);found={}
    for i in R(h):
        s=input()
        for char in search:
            if char in s:
                found[char]=((i+1)*(w+2)+s.index(char)+1)
                mp_def[char]=mp_def[replacement_of_found]
        mp+=[boundary]+[mp_def[j] for j in s]+[boundary]
    mp+=[boundary]*(w+2)
    return h+2,w+2,mp,found
def TI(n):return GI(n,n-1)
def accum(ls):
    rt=[0]
    for i in ls:rt+=[rt[-1]+i]
    return rt
def bit_combination(n,base=2):
    rt=[]
    for tb in R(base**n):s=[tb//(base**bt)%base for bt in R(n)];rt+=[s]
    return rt
def gcd(x,y):
    if y==0:return x
    if x%y==0:return y
    while x%y!=0:x,y=y,x%y
    return y
def RLE(it):
    rt=[]
    for i in it:
        if rt and rt[-1][0]==i:rt[-1][1]+=1
        else:rt+=[i,1],
    return rt
def YN(x):print(['NO','YES'][x])
def Yn(x):print(['No','Yes'][x])
def show(*inp,end='\n'):
    if show_flg:print(*inp,end=end)
def gcj(t,*a):
    print('Case #{}:'.format(t+1),*a)

mo=10**9+7
#mo=998244353
inf=float('inf')
FourNb=[(-1,0),(1,0),(0,1),(0,-1)];EightNb=[(-1,0),(1,0),(0,1),(0,-1),(1,1),(-1,-1),(1,-1),(-1,1)];compas=dict(zip('WENS',FourNb));cursol=dict(zip('LRUD',FourNb))
alp=[chr(ord('a')+i)for i in range(26)]
#sys.setrecursionlimit(10**7)


show_flg=False
show_flg=True


ans=0


h,w,x,y=LI()
#x-=1;y-=1
a=[[0]*(w+2)]
for i in range(h):
    a+=[0]+LI()+[0],
a+=[[0]*(w+2)]

t=a[y][x]
a[y][x]=0

q=[(0,(y,x))]
while q:
    e,(r,c)=heappop(q)
    #show(t,e)
    if t<=e:
        print('No')
        exit()
    t+=e
    for dr,dc in FourNb:
        nr,nc=r+dr,c+dc
        
        if a[nr][nc]>0:
            if t>a[nr][nc]:
                heappush(q,(a[nr][nc],(nr,nc)))
                #show((a[nr][nc],(nr,nc)),q)
                a[nr][nc]=0

print('Yes')
0