Submission details
Task:Chess board tour
Sender:aalto26im_002
Submission time:2026-11-02 17:19:38 +0200
Language:Python3 (PyPy3)
Status:READY
Result:
Test results
testverdicttime
#1ACCEPTED0.05 sdetails
#2ACCEPTED0.05 sdetails
#30.05 sdetails
#4ACCEPTED0.05 sdetails
#50.05 sdetails
#6ACCEPTED0.05 sdetails
#70.05 sdetails
#8ACCEPTED0.05 sdetails
#9ACCEPTED0.05 sdetails
#10ACCEPTED0.05 sdetails
#11ACCEPTED0.05 sdetails
#12ACCEPTED0.05 sdetails
#13ACCEPTED0.05 sdetails
#14ACCEPTED0.05 sdetails
#15ACCEPTED0.05 sdetails
#160.05 sdetails
#170.05 sdetails
#180.05 sdetails
#19ACCEPTED0.05 sdetails
#20ACCEPTED0.05 sdetails
#210.05 sdetails
#22ACCEPTED0.05 sdetails
#230.05 sdetails
#24ACCEPTED0.05 sdetails
#25ACCEPTED0.05 sdetails
#260.05 sdetails
#270.05 sdetails
#280.05 sdetails
#290.05 sdetails
#300.05 sdetails
#31ACCEPTED0.05 sdetails
#32ACCEPTED0.05 sdetails
#330.05 sdetails
#340.05 sdetails
#350.05 sdetails
#360.05 sdetails
#37ACCEPTED0.05 sdetails
#380.05 sdetails
#390.05 sdetails
#400.05 sdetails
#410.06 sdetails
#420.05 sdetails
#430.06 sdetails
#44ACCEPTED0.05 sdetails
#450.05 sdetails
#460.05 sdetails
#470.10 sdetails
#480.12 sdetails
#490.06 sdetails
#500.06 sdetails
#510.22 sdetails
#52ACCEPTED0.05 sdetails
#530.21 sdetails
#540.05 sdetails
#550.18 sdetails
#560.05 sdetails

Code

# FULL TEMPLATE: delete every block you don't use. Blocks don't depend on each other.
# Nodes are 1..n (slot 0 unused). Arrays are 0-indexed.
import sys
from collections import deque, defaultdict, Counter
from heapq import heappush, heappop
from bisect import bisect_left, bisect_right
from itertools import accumulate, permutations, combinations, product
from functools import lru_cache, cmp_to_key
from math import gcd, isqrt, comb, inf
input = sys.stdin.readline
MOD = 10**9 + 7

def I():  return int(input())                    # "5"          -> 5
def MI(): return map(int, input().split())       # "8 4"        -> n, q = MI()
def LI(): return list(map(int, input().split())) # "3 2 4 5"    -> [3, 2, 4, 5]
def S():  return input().strip()                 # "BABAZA", ".*.#" (kept as text)
def LS(): return input().split()                 # "? 2 3"      -> ['?', '2', '3']


# ==== UNION-FIND ==== uf.join(a, b) -> False if already together, uf.size(x)
class UF:
    def __init__(self, n):
        self.e = [-1] * n

    def find(self, x):
        e = self.e
        while e[x] >= 0:
            if e[e[x]] >= 0:
                e[x] = e[e[x]]
            x = e[x]
        return x

    def size(self, x):
        return -self.e[self.find(x)]

    def join(self, a, b):
        a, b = self.find(a), self.find(b)
        if a == b:
            return False
        if self.e[a] > self.e[b]:
            a, b = b, a
        self.e[a] += self.e[b]
        self.e[b] = a
        return True


# ==== FENWICK ==== ft.add(i, d): a[i] += d.  ft.query(i) = a[0] + ... + a[i-1]
class FT:
    def __init__(self, n):
        self.s = [0] * n

    def add(self, i, d):
        s, n = self.s, len(self.s)
        while i < n:
            s[i] += d
            i |= i + 1

    def query(self, i):
        s, r = self.s, 0
        while i > 0:
            r += s[i - 1]
            i &= i - 1
        return r


# ==== SEGMENT TREE (min) ==== t.update(i, v): a[i] = v.  t.query(l, r) = min of a[l..r-1]
# sum/max: change INF and the 3 lines marked "op"
class Tree:
    INF = inf

    def __init__(self, a):
        n = self.n = len(a)
        t = self.t = [self.INF] * n + list(a)
        for i in range(n - 1, 0, -1):
            t[i] = min(t[2 * i], t[2 * i + 1])         # op

    def update(self, i, v):
        t = self.t
        i += self.n
        t[i] = v
        i >>= 1
        while i:
            t[i] = min(t[2 * i], t[2 * i + 1])         # op
            i >>= 1

    def query(self, l, r):
        t, res = self.t, self.INF
        l += self.n
        r += self.n
        while l < r:
            if l & 1:
                res = min(res, t[l])                    # op
                l += 1
            if r & 1:
                r -= 1
                res = min(res, t[r])                    # op
            l >>= 1
            r >>= 1
        return res


# ==== BFS (unweighted graph) ==== -> dist[v], -1 = unreachable
def bfs(adj, start):
    dist = [-1] * len(adj)
    dist[start] = 0
    q = deque([start])
    while q:
        u = q.popleft()
        for v in adj[u]:
            if dist[v] == -1:
                dist[v] = dist[u] + 1
                q.append(v)
    return dist


# ==== DIJKSTRA ==== wadj[u] = [(v, w)] -> dist[v], inf = unreachable
def dijkstra(wadj, start):
    dist = [inf] * len(wadj)
    dist[start] = 0
    pq = [(0, start)]
    while pq:
        d, u = heappop(pq)
        if d != dist[u]:
            continue
        for v, w in wadj[u]:
            if d + w < dist[v]:
                dist[v] = d + w
                heappush(pq, (dist[v], v))
    return dist


# ==== GRID BFS ==== g[r][c], '#' = wall -> dist[r][c], -1 = unreachable
DIRS = ((-1, 0), (1, 0), (0, -1), (0, 1))              # U D L R
def grid_bfs(g, sr, sc):
    R, C = len(g), len(g[0])
    dist = [[-1] * C for _ in range(R)]
    dist[sr][sc] = 0
    q = deque([(sr, sc)])
    while q:
        r, c = q.popleft()
        for dr, dc in DIRS:
            nr, nc = r + dr, c + dc
            if 0 <= nr < R and 0 <= nc < C and g[nr][nc] != '#' and dist[nr][nc] == -1:
                dist[nr][nc] = dist[r][c] + 1
                q.append((nr, nc))
    return dist


# ==== BINARY SEARCH ON THE ANSWER ==== smallest x in [lo, hi] with ok(x) True (ok: False...False True...True)
def first_true(lo, hi, ok):
    while lo < hi:
        mid = (lo + hi) // 2
        if ok(mid):
            hi = mid
        else:
            lo = mid + 1
    return lo


# mod power is built in: pow(b, e, MOD).  inverse: pow(a, MOD - 2, MOD)


def main():
    # ---- INPUT: keep the shape you need, delete the rest ----
    x, n = MI()

    if (x*n) % 2 == 1:
        print(-1)
    else:
        out = []
        if n % 2 == 0:
            out.extend('D' * (x-1))

            out.extend('R')
            snake = 2
            up = True
            while snake < n:
                if up:
                    out.extend('D' * (x - 2))
                    up = False
                else:
                    out.extend('U' * (x - 2))
                    up = True
                out.extend('R')
                snake += 1
            
            out.extend('U' * (x - 1))
            out.extend('L' * (n - 1))

        else:

            out.extend('L' * (x-1))

            out.extend('D')
            snake = 2
            up = True

            while snake < x:

                if up:
                    out.extend('L' * (x - 2))
                    up = False
                else:
                    out.extend('R' * (x - 2))
                    up = True

                out.extend('D')
                snake += 1
            out.extend('L' * (x - 1))
            out.extend('U' * (n - 1))

        print(''.join(out))








main()

Test details

Test 1

Verdict: ACCEPTED

input
2 2

correct output
DRUL

user output
DRUL

Test 2

Verdict: ACCEPTED

input
2 2

correct output
DRUL

user output
DRUL

Test 3

Verdict:

input
2 3

correct output
RRDLLU

user output
LDLUU

Test 4

Verdict: ACCEPTED

input
2 2

correct output
DRUL

user output
DRUL

Test 5

Verdict:

input
4 4

correct output
DDDRUURDDRUUULLL

user output
DDDRDDRUURUUULLL

Test 6

Verdict: ACCEPTED

input
3 3

correct output
-1

user output
-1

Test 7

Verdict:

input
4 4

correct output
DDDRUURDDRUUULLL

user output
DDDRDDRUURUUULLL

Test 8

Verdict: ACCEPTED

input
3 5

correct output
-1

user output
-1

Test 9

Verdict: ACCEPTED

input
3 2

correct output
DDRUUL

user output
DDRUUL

Test 10

Verdict: ACCEPTED

input
4 2

correct output
DDDRUUUL

user output
DDDRUUUL

Test 11

Verdict: ACCEPTED

input
5 5

correct output
-1

user output
-1

Test 12

Verdict: ACCEPTED

input
2 2

correct output
DRUL

user output
DRUL

Test 13

Verdict: ACCEPTED

input
5 5

correct output
-1

user output
-1

Test 14

Verdict: ACCEPTED

input
2 2

correct output
DRUL

user output
DRUL

Test 15

Verdict: ACCEPTED

input
5 2

correct output
DDDDRUUUUL

user output
DDDDRUUUUL

Test 16

Verdict:

input
2 3

correct output
RRDLLU

user output
LDLUU

Test 17

Verdict:

input
6 7

correct output
RRRRRRDLLLLLDRRRRRDLLLLLDRRRRR...

user output
LLLLLDLLLLDRRRRDLLLLDRRRRDLLLL...

Test 18

Verdict:

input
5 10

correct output
DDDDRUUURDDDRUUURDDDRUUURDDDRU...

user output
DDDDRDDDRUUURDDDRUUURDDDRUUURD...

Test 19

Verdict: ACCEPTED

input
5 3

correct output
-1

user output
-1

Test 20

Verdict: ACCEPTED

input
6 2

correct output
DDDDDRUUUUUL

user output
DDDDDRUUUUUL

Test 21

Verdict:

input
10 10

correct output
DDDDDDDDDRUUUUUUUURDDDDDDDDRUU...

user output
DDDDDDDDDRDDDDDDDDRUUUUUUUURDD...

Test 22

Verdict: ACCEPTED

input
3 2

correct output
DDRUUL

user output
DDRUUL

Test 23

Verdict:

input
10 10

correct output
DDDDDDDDDRUUUUUUUURDDDDDDDDRUU...

user output
DDDDDDDDDRDDDDDDDDRUUUUUUUURDD...

Test 24

Verdict: ACCEPTED

input
2 4

correct output
DRRRULLL

user output
DRRRULLL

Test 25

Verdict: ACCEPTED

input
9 2

correct output
DDDDDDDDRUUUUUUUUL

user output
DDDDDDDDRUUUUUUUUL

Test 26

Verdict:

input
2 5

correct output
RRRRDLLLLU

user output
LDLUUUU

Test 27

Verdict:

input
56 60

correct output
DDDDDDDDDDDDDDDDDDDDDDDDDDDDDD...

user output
DDDDDDDDDDDDDDDDDDDDDDDDDDDDDD...

Test 28

Verdict:

input
43 100

correct output
DDDDDDDDDDDDDDDDDDDDDDDDDDDDDD...

user output
DDDDDDDDDDDDDDDDDDDDDDDDDDDDDD...

Test 29

Verdict:

input
45 20

correct output
DDDDDDDDDDDDDDDDDDDDDDDDDDDDDD...

user output
DDDDDDDDDDDDDDDDDDDDDDDDDDDDDD...

Test 30

Verdict:

input
56 9

correct output
RRRRRRRRDLLLLLLLDRRRRRRRDLLLLL...

user output
LLLLLLLLLLLLLLLLLLLLLLLLLLLLLL...

Test 31

Verdict: ACCEPTED

input
97 91

correct output
-1

user output
-1

Test 32

Verdict: ACCEPTED

input
23 7

correct output
-1

user output
-1

Test 33

Verdict:

input
90 95

correct output
RRRRRRRRRRRRRRRRRRRRRRRRRRRRRR...

user output
LLLLLLLLLLLLLLLLLLLLLLLLLLLLLL...

Test 34

Verdict:

input
9 24

correct output
DDDDDDDDRUUUUUUURDDDDDDDRUUUUU...

user output
DDDDDDDDRDDDDDDDRUUUUUUURDDDDD...

Test 35

Verdict:

input
88 3

correct output
RRDLDRDLDRDLDRDLDRDLDRDLDRDLDR...

user output
LLLLLLLLLLLLLLLLLLLLLLLLLLLLLL...

Test 36

Verdict:

input
3 38

correct output
DDRURDRURDRURDRURDRURDRURDRURD...

user output
DDRDRURDRURDRURDRURDRURDRURDRU...

Test 37

Verdict: ACCEPTED

input
111 119

correct output
-1

user output
-1

Test 38

Verdict:

input
84 200

correct output
DDDDDDDDDDDDDDDDDDDDDDDDDDDDDD...

user output
DDDDDDDDDDDDDDDDDDDDDDDDDDDDDD...

Test 39

Verdict:

input
88 38

correct output
DDDDDDDDDDDDDDDDDDDDDDDDDDDDDD...

user output
DDDDDDDDDDDDDDDDDDDDDDDDDDDDDD...

Test 40

Verdict:

input
111 16

correct output
DDDDDDDDDDDDDDDDDDDDDDDDDDDDDD...

user output
DDDDDDDDDDDDDDDDDDDDDDDDDDDDDD...

Test 41

Verdict:

input
194 181

correct output
RRRRRRRRRRRRRRRRRRRRRRRRRRRRRR...

user output
LLLLLLLLLLLLLLLLLLLLLLLLLLLLLL...

Test 42

Verdict:

input
46 12

correct output
DDDDDDDDDDDDDDDDDDDDDDDDDDDDDD...

user output
DDDDDDDDDDDDDDDDDDDDDDDDDDDDDD...

Test 43

Verdict:

input
179 190

correct output
DDDDDDDDDDDDDDDDDDDDDDDDDDDDDD...

user output
DDDDDDDDDDDDDDDDDDDDDDDDDDDDDD...

Test 44

Verdict: ACCEPTED

input
17 47

correct output
-1

user output
-1

Test 45

Verdict:

input
175 4

correct output
DDDDDDDDDDDDDDDDDDDDDDDDDDDDDD...

user output
DDDDDDDDDDDDDDDDDDDDDDDDDDDDDD...

Test 46

Verdict:

input
4 74

correct output
DDDRUURDDRUURDDRUURDDRUURDDRUU...

user output
DDDRDDRUURDDRUURDDRUURDDRUURDD...

Test 47

Verdict:

input
550 594

correct output
DDDDDDDDDDDDDDDDDDDDDDDDDDDDDD...

user output
DDDDDDDDDDDDDDDDDDDDDDDDDDDDDD...

Test 48

Verdict:

input
418 998

correct output
DDDDDDDDDDDDDDDDDDDDDDDDDDDDDD...

user output
DDDDDDDDDDDDDDDDDDDDDDDDDDDDDD...

Test 49

Verdict:

input
437 186

correct output
DDDDDDDDDDDDDDDDDDDDDDDDDDDDDD...

user output
DDDDDDDDDDDDDDDDDDDDDDDDDDDDDD...

Test 50

Verdict:

input
552 72

correct output
DDDDDDDDDDDDDDDDDDDDDDDDDDDDDD...

user output
DDDDDDDDDDDDDDDDDDDDDDDDDDDDDD...

Test 51

Verdict:

input
968 901

correct output
RRRRRRRRRRRRRRRRRRRRRRRRRRRRRR...

user output
LLLLLLLLLLLLLLLLLLLLLLLLLLLLLL...

Test 52

Verdict: ACCEPTED

input
223 57

correct output
-1

user output
-1

Test 53

Verdict:

input
893 948

correct output
DDDDDDDDDDDDDDDDDDDDDDDDDDDDDD...

user output
DDDDDDDDDDDDDDDDDDDDDDDDDDDDDD...

Test 54

Verdict:

input
78 229

correct output
RRRRRRRRRRRRRRRRRRRRRRRRRRRRRR...

user output
LLLLLLLLLLLLLLLLLLLLLLLLLLLLLL...

Test 55

Verdict:

input
874 13

correct output
RRRRRRRRRRRRDLLLLLLLLLLLDRRRRR...

user output
LLLLLLLLLLLLLLLLLLLLLLLLLLLLLL...

Test 56

Verdict:

input
12 366

correct output
DDDDDDDDDDDRUUUUUUUUUURDDDDDDD...

user output
DDDDDDDDDDDRDDDDDDDDDDRUUUUUUU...