Submission #1173644

---

Source Code Expand

import sys
from heapq import heapify, heappush, heappop

H, W, K, T = 30, 30, 450, 10000

def solve():
    # Input
    input()
    s, g = [], []

    for i in range(K):
        a, b, c, d = map(int, input().split())
        s.append([a - 1, b - 1])
        g.append((c - 1, d - 1))

    # Process
    res = tekito_move(s, g)
    L, ans = len(res), res

    # Output
    print(L)
    print(*ans, sep='\n')

def tekito_move(s, g):
    res = []
    ban = [[0] * W for i in range(H)]

    # 盤面を作る
    for rs, cs in s:
        ban[rs][cs] = 1

    i = 0

    for lp in range(2 * T):
        if lp == T:
            break
        if i == K:
            break

        rs, cs = s[i]
        rg, cg = g[i]
        msg = ''

        if rs < rg:
            if ban[rs + 1][cs] == 0:
                ban[rs][cs] = 0
                ban[rs + 1][cs] = 1
                s[i] = [rs + 1, cs]
                msg = '-' * i + 'D' + '-' * (K - i - 1)
        elif rs > rg:
            if ban[rs - 1][cs] == 0:
                ban[rs][cs] = 0
                ban[rs - 1][cs] = 1
                s[i] = [rs - 1, cs]
                msg = '-' * i + 'U' + '-' * (K - i - 1)
        elif cs < cg:
            if ban[rs][cs + 1] == 0:
                ban[rs][cs] = 0
                ban[rs][cs + 1] = 1
                s[i] = [rs, cs + 1]
                msg = '-' * i + 'R' + '-' * (K - i - 1)
        elif cs > cg:
            if ban[rs][cs - 1] == 0:
                ban[rs][cs] = 0
                ban[rs][cs - 1] = 1
                s[i] = [rs, cs - 1]
                msg = '-' * i + 'L' + '-' * (K - i - 1)

        if msg:
            res.append(msg)
        else:
            i += 1

    return res



def debug(x, table):
    for name, val in table.items():
        if x is val:
            print('DEBUG:{} -> {}'.format(name, val), file=sys.stderr)
            return None

if __name__ == '__main__':
    solve()

Submission Info

Judge Result