Submission details
Task:Chess board tour
Sender:aalto26im_002
Submission time:2026-11-02 17:46:48 +0200
Language:Python3 (PyPy3)
Status:READY
Result:
Test results
testverdicttime
#1ACCEPTED0.05 sdetails
#2ACCEPTED0.05 sdetails
#30.05 sdetails
#4ACCEPTED0.05 sdetails
#5ACCEPTED0.05 sdetails
#6ACCEPTED0.05 sdetails
#7ACCEPTED0.05 sdetails
#8ACCEPTED0.05 sdetails
#9ACCEPTED0.05 sdetails
#100.05 sdetails
#11ACCEPTED0.05 sdetails
#12ACCEPTED0.05 sdetails
#13ACCEPTED0.05 sdetails
#14ACCEPTED0.05 sdetails
#15ACCEPTED0.05 sdetails
#160.05 sdetails
#170.05 sdetails
#18ACCEPTED0.05 sdetails
#19ACCEPTED0.05 sdetails
#200.05 sdetails
#21ACCEPTED0.05 sdetails
#22ACCEPTED0.05 sdetails
#23ACCEPTED0.05 sdetails
#240.05 sdetails
#25ACCEPTED0.05 sdetails
#260.05 sdetails
#270.05 sdetails
#28ACCEPTED0.05 sdetails
#29ACCEPTED0.05 sdetails
#300.05 sdetails
#31ACCEPTED0.05 sdetails
#32ACCEPTED0.05 sdetails
#330.05 sdetails
#34ACCEPTED0.05 sdetails
#350.05 sdetails
#36ACCEPTED0.05 sdetails
#37ACCEPTED0.05 sdetails
#380.05 sdetails
#390.05 sdetails
#40ACCEPTED0.05 sdetails
#410.06 sdetails
#420.05 sdetails
#43ACCEPTED0.06 sdetails
#44ACCEPTED0.05 sdetails
#45ACCEPTED0.05 sdetails
#460.05 sdetails
#470.10 sdetails
#480.12 sdetails
#49ACCEPTED0.06 sdetails
#500.05 sdetails
#510.20 sdetails
#52ACCEPTED0.05 sdetails
#53ACCEPTED0.21 sdetails
#540.05 sdetails
#550.05 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']


def main():

    x, n = MI()

    if (x*n) % 2 == 1:
        print(-1)

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

            out.extend('R' * (x - 1))
            out.extend('U')
            snake = 2
            up = True

            while snake < n:

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

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

        else:

            out.extend('R' * (n-1))

            out.extend('D' * (x - 1))
            out.extend('L')
            snake = 2
            up = True

            while snake < n:

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

            out.extend('U' * (x - 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
DDRUUL

Test 4

Verdict: ACCEPTED

input
2 2

correct output
DRUL

user output
DRUL

Test 5

Verdict: ACCEPTED

input
4 4

correct output
DDDRUURDDRUUULLL

user output
DDDRRRULLURRULLL

Test 6

Verdict: ACCEPTED

input
3 3

correct output
-1

user output
-1

Test 7

Verdict: ACCEPTED

input
4 4

correct output
DDDRUURDDRUUULLL

user output
DDDRRRULLURRULLL

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
RDDLUU

Test 10

Verdict:

input
4 2

correct output
DDDRUUUL

user output
DRRRULLL

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
RDDDDLUUUU

Test 16

Verdict:

input
2 3

correct output
RRDLLU

user output
DDRUUL

Test 17

Verdict:

input
6 7

correct output
RRRRRRDLLLLLDRRRRRDLLLLLDRRRRR...

user output
DDDDDDRRRRRULLLLURRRRULLLLURRR...

Test 18

Verdict: ACCEPTED

input
5 10

correct output
DDDDRUUURDDDRUUURDDDRUUURDDDRU...

user output
RRRRRRRRRDDDDLUUULDDDLUUULDDDL...

Test 19

Verdict: ACCEPTED

input
5 3

correct output
-1

user output
-1

Test 20

Verdict:

input
6 2

correct output
DDDDDRUUUUUL

user output
DRRRRRULLLLL

Test 21

Verdict: ACCEPTED

input
10 10

correct output
DDDDDDDDDRUUUUUUUURDDDDDDDDRUU...

user output
DDDDDDDDDRRRRRRRRRULLLLLLLLURR...

Test 22

Verdict: ACCEPTED

input
3 2

correct output
DDRUUL

user output
RDDLUU

Test 23

Verdict: ACCEPTED

input
10 10

correct output
DDDDDDDDDRUUUUUUUURDDDDDDDDRUU...

user output
DDDDDDDDDRRRRRRRRRULLLLLLLLURR...

Test 24

Verdict:

input
2 4

correct output
DRRRULLL

user output
DDDRUUUL

Test 25

Verdict: ACCEPTED

input
9 2

correct output
DDDDDDDDRUUUUUUUUL

user output
RDDDDDDDDLUUUUUUUU

Test 26

Verdict:

input
2 5

correct output
RRRRDLLLLU

user output
DDDDRUUUUL

Test 27

Verdict:

input
56 60

correct output
DDDDDDDDDDDDDDDDDDDDDDDDDDDDDD...

user output
DDDDDDDDDDDDDDDDDDDDDDDDDDDDDD...

Test 28

Verdict: ACCEPTED

input
43 100

correct output
DDDDDDDDDDDDDDDDDDDDDDDDDDDDDD...

user output
RRRRRRRRRRRRRRRRRRRRRRRRRRRRRR...

Test 29

Verdict: ACCEPTED

input
45 20

correct output
DDDDDDDDDDDDDDDDDDDDDDDDDDDDDD...

user output
RRRRRRRRRRRRRRRRRRRDDDDDDDDDDD...

Test 30

Verdict:

input
56 9

correct output
RRRRRRRRDLLLLLLLDRRRRRRRDLLLLL...

user output
DDDDDDDDRRRRRRRRRRRRRRRRRRRRRR...

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
DDDDDDDDDDDDDDDDDDDDDDDDDDDDDD...

Test 34

Verdict: ACCEPTED

input
9 24

correct output
DDDDDDDDRUUUUUUURDDDDDDDRUUUUU...

user output
RRRRRRRRRRRRRRRRRRRRRRRDDDDDDD...

Test 35

Verdict:

input
88 3

correct output
RRDLDRDLDRDLDRDLDRDLDRDLDRDLDR...

user output
DDRRRRRRRRRRRRRRRRRRRRRRRRRRRR...

Test 36

Verdict: ACCEPTED

input
3 38

correct output
DDRURDRURDRURDRURDRURDRURDRURD...

user output
RRRRRRRRRRRRRRRRRRRRRRRRRRRRRR...

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: ACCEPTED

input
111 16

correct output
DDDDDDDDDDDDDDDDDDDDDDDDDDDDDD...

user output
RRRRRRRRRRRRRRRDDDDDDDDDDDDDDD...

Test 41

Verdict:

input
194 181

correct output
RRRRRRRRRRRRRRRRRRRRRRRRRRRRRR...

user output
DDDDDDDDDDDDDDDDDDDDDDDDDDDDDD...

Test 42

Verdict:

input
46 12

correct output
DDDDDDDDDDDDDDDDDDDDDDDDDDDDDD...

user output
DDDDDDDDDDDRRRRRRRRRRRRRRRRRRR...

Test 43

Verdict: ACCEPTED

input
179 190

correct output
DDDDDDDDDDDDDDDDDDDDDDDDDDDDDD...

user output
RRRRRRRRRRRRRRRRRRRRRRRRRRRRRR...

Test 44

Verdict: ACCEPTED

input
17 47

correct output
-1

user output
-1

Test 45

Verdict: ACCEPTED

input
175 4

correct output
DDDDDDDDDDDDDDDDDDDDDDDDDDDDDD...

user output
RRRDDDDDDDDDDDDDDDDDDDDDDDDDDD...

Test 46

Verdict:

input
4 74

correct output
DDDRUURDDRUURDDRUURDDRUURDDRUU...

user output
DDDDDDDDDDDDDDDDDDDDDDDDDDDDDD...

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: ACCEPTED

input
437 186

correct output
DDDDDDDDDDDDDDDDDDDDDDDDDDDDDD...

user output
RRRRRRRRRRRRRRRRRRRRRRRRRRRRRR...

Test 50

Verdict:

input
552 72

correct output
DDDDDDDDDDDDDDDDDDDDDDDDDDDDDD...

user output
DDDDDDDDDDDDDDDDDDDDDDDDDDDDDD...

Test 51

Verdict:

input
968 901

correct output
RRRRRRRRRRRRRRRRRRRRRRRRRRRRRR...

user output
DDDDDDDDDDDDDDDDDDDDDDDDDDDDDD...

Test 52

Verdict: ACCEPTED

input
223 57

correct output
-1

user output
-1

Test 53

Verdict: ACCEPTED

input
893 948

correct output
DDDDDDDDDDDDDDDDDDDDDDDDDDDDDD...

user output
RRRRRRRRRRRRRRRRRRRRRRRRRRRRRR...

Test 54

Verdict:

input
78 229

correct output
RRRRRRRRRRRRRRRRRRRRRRRRRRRRRR...

user output
DDDDDDDDDDDDDDDDDDDDDDDDDDDDDD...

Test 55

Verdict:

input
874 13

correct output
RRRRRRRRRRRRDLLLLLLLLLLLDRRRRR...

user output
DDDDDDDDDDDDRRRRRRRRRRRRRRRRRR...

Test 56

Verdict:

input
12 366

correct output
DDDDDDDDDDDRUUUUUUUUUURDDDDDDD...

user output
DDDDDDDDDDDDDDDDDDDDDDDDDDDDDD...