Submission #18500846


Source Code Expand

Copy
from copy import copy
#from time import time
from collections import deque

#start=time()


H,W,K,sr,sc=map(int,input().split())
sr=sr-1
sc=sc-1
s=[]
for h in range(H):
    s.append(input())
N=int(input())
food=[[[0,0] for _ in range(W)] for _ in range(H)]
for i in range(N):
    fr,fc,F,D=map(int,input().split())
    food[fr-1][fc-1]=[F,D]

step=[[1,0],[-1,0],[0,1],[0,-1]]
dir=["D","U","R","L"]

def BFS(score,r,c,course,cnt,eat):

    seen=[[0]*W for _ in range(H)]

    q=deque([[score,r,c,course,cnt,eat]])
    seen[r][c]=1
    while q:
        sc,h0,w0,c,count,eat1=q.popleft()
        if count==K:
            return sc,h0,w0,c,count,eat1
        if sc>0:
            return sc, h0, w0, c, count,eat1
        for i in range(4):
            h1=h0+step[i][0]
            w1=w0+step[i][1]
            if 0<=h1<H and 0<=w1<W and seen[h1][w1]==0 and s[h1][w1]==".":
                tmp_score = copy(sc)
                tmp_course = copy(c)
                tmp_eat=copy(eat1)
                if (food[h1][w1][0]-food[h1][w1][1]*count)>0:
                    tmp_eat.append([h1,w1])
                    tmp_score+=food[h1][w1][0]-food[h1][w1][1]*count
                elif (food[h1][w1][0]-food[h1][w1][1]*count)<0:
                    continue
                tmp_course+=dir[i]
                q.append([tmp_score,h1,w1,tmp_course,count+1,tmp_eat])
                seen[h1][w1]=1
    return sc,h0,w0,c,count,eat1


anss=[]
#while time()-start<9.5:
for n in range(1):
    ans=[]
    score=0
    h0=sr
    w0=sc
    hp=h0
    wp=w0
    course=""
    cnt=0

    while True:
        score1,h1,w1,course,cnt,eat=BFS(0,h0,w0,"",cnt,[])
        if len(course)==0:
            for i in range(K-len(ans)):
                ans+="-"
        if cnt==K:
            ans.append(course)
            score+=score1
            break
        score+=score1
        ans.append(course)
        for fr,fc in eat:
            food[fr][fc]=[0,0]
        h0=h1
        w0=w1

    anss.append([score,ans])

Ans=anss[anss.index(min(anss))][1]
print("".join(Ans))






Submission Info

Submission Time
Task B - Food Collector
User SleepyPuppy
Language PyPy3 (7.3.0)
Score 18221
Code Size 2135 Byte
Status AC
Exec Time 168 ms
Memory 70168 KB

Judge Result

Set Name test_01 test_02 test_03 test_04 test_05 test_06 test_07 test_08 test_09 test_10
Score / Max Score 1726 / 20000 2394 / 20000 1818 / 20000 1096 / 20000 1921 / 20000 2385 / 20000 2015 / 20000 1598 / 20000 1165 / 20000 2103 / 20000
Status
AC × 1
AC × 1
AC × 1
AC × 1
AC × 1
AC × 1
AC × 1
AC × 1
AC × 1
AC × 1
Set Name Test Cases
test_01 subtask_01_01.txt
test_02 subtask_01_02.txt
test_03 subtask_01_03.txt
test_04 subtask_01_04.txt
test_05 subtask_01_05.txt
test_06 subtask_01_06.txt
test_07 subtask_01_07.txt
test_08 subtask_01_08.txt
test_09 subtask_01_09.txt
test_10 subtask_01_10.txt
Case Name Status Exec Time Memory
subtask_01_01.txt AC 168 ms 69560 KB
subtask_01_02.txt AC 131 ms 69344 KB
subtask_01_03.txt AC 132 ms 69440 KB
subtask_01_04.txt AC 118 ms 69432 KB
subtask_01_05.txt AC 131 ms 69740 KB
subtask_01_06.txt AC 128 ms 70168 KB
subtask_01_07.txt AC 128 ms 70028 KB
subtask_01_08.txt AC 125 ms 70000 KB
subtask_01_09.txt AC 120 ms 69432 KB
subtask_01_10.txt AC 134 ms 69892 KB