Submission #1173746

---

Source Code Expand

import copy
temp=input().split()
H=int(temp[0])
W=int(temp[1])
K=int(temp[2])
T=int(temp[3])

AB=[]
CD=[]
for i in range(K):
	temp=input().split()
	AB.append([int(temp[0])-1,int(temp[1])-1])
	CD.append([int(temp[2])-1,int(temp[3])-1])
#inputEnd
existMap=[[False for j in range(W)] for i in range(H)]
nextExistMap=[[False for j in range(W)] for i in range(H)]
for i in range(K):
	existMap[AB[i][0]][AB[i][1]]=True
	nextExistMap[AB[i][0]][AB[i][1]]=True

ans=[]

roop=0
for k in range(15):
	while True:
		time=0
		tempAns="-"*(30*k)
		for i in range(30*k,30*(k+1)):
			if AB[i][0]<CD[i][0]:
				if existMap[AB[i][0]+1][AB[i][1]]==False and nextExistMap[AB[i][0]+1][AB[i][1]]==False:
					tempAns+="D"
					nextExistMap[AB[i][0]+1][AB[i][1]]=True
					nextExistMap[AB[i][0]][AB[i][1]]=False
					AB[i][0]+=1
					time+=1
					continue
			if AB[i][0]>CD[i][0]:
				if existMap[AB[i][0]-1][AB[i][1]]==False and nextExistMap[AB[i][0]-1][AB[i][1]]==False:
					tempAns+="U"
					nextExistMap[AB[i][0]-1][AB[i][1]]=True
					nextExistMap[AB[i][0]][AB[i][1]]=False
					AB[i][0]-=1
					time+=1
					continue
			if AB[i][1]<CD[i][1]:
				if existMap[AB[i][0]][AB[i][1]+1]==False and nextExistMap[AB[i][0]][AB[i][1]+1]==False:
					tempAns+="R"
					nextExistMap[AB[i][0]][AB[i][1]+1]=True
					nextExistMap[AB[i][0]][AB[i][1]]=False
					AB[i][1]+=1
					time+=1
					continue
			if AB[i][1]>CD[i][1]:
				if existMap[AB[i][0]][AB[i][1]-1]==False and nextExistMap[AB[i][0]][AB[i][1]-1]==False:
					tempAns+="L"
					nextExistMap[AB[i][0]][AB[i][1]-1]=True
					nextExistMap[AB[i][0]][AB[i][1]]=False
					AB[i][1]-=1
					time+=1
					continue
			tempAns+="-"
		if time==0 or roop==T:
			break
		else:
			tempAns+="-"*30*(14-k)
			ans.append(tempAns)
			roop+=1
			existMap=copy.deepcopy(nextExistMap)
	if roop==T:
		break


Length=len(ans)
print(Length)
for i in range(Length):
	print(ans[i])

Submission Info

Judge Result