Submission details
Task:Chess board tour
Sender:aalto26im_011
Submission time:2026-11-02 16:32:52 +0200
Language:Python3 (PyPy3)
Status:READY
Result:ACCEPTED
Test results
testverdicttime
#1ACCEPTED0.05 sdetails
#2ACCEPTED0.05 sdetails
#3ACCEPTED0.05 sdetails
#4ACCEPTED0.05 sdetails
#5ACCEPTED0.05 sdetails
#6ACCEPTED0.05 sdetails
#7ACCEPTED0.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
#16ACCEPTED0.05 sdetails
#17ACCEPTED0.05 sdetails
#18ACCEPTED0.05 sdetails
#19ACCEPTED0.05 sdetails
#20ACCEPTED0.05 sdetails
#21ACCEPTED0.05 sdetails
#22ACCEPTED0.05 sdetails
#23ACCEPTED0.05 sdetails
#24ACCEPTED0.05 sdetails
#25ACCEPTED0.05 sdetails
#26ACCEPTED0.05 sdetails
#27ACCEPTED0.05 sdetails
#28ACCEPTED0.05 sdetails
#29ACCEPTED0.05 sdetails
#30ACCEPTED0.05 sdetails
#31ACCEPTED0.05 sdetails
#32ACCEPTED0.05 sdetails
#33ACCEPTED0.05 sdetails
#34ACCEPTED0.05 sdetails
#35ACCEPTED0.05 sdetails
#36ACCEPTED0.05 sdetails
#37ACCEPTED0.05 sdetails
#38ACCEPTED0.05 sdetails
#39ACCEPTED0.05 sdetails
#40ACCEPTED0.05 sdetails
#41ACCEPTED0.05 sdetails
#42ACCEPTED0.05 sdetails
#43ACCEPTED0.05 sdetails
#44ACCEPTED0.05 sdetails
#45ACCEPTED0.05 sdetails
#46ACCEPTED0.05 sdetails
#47ACCEPTED0.05 sdetails
#48ACCEPTED0.05 sdetails
#49ACCEPTED0.05 sdetails
#50ACCEPTED0.06 sdetails
#51ACCEPTED0.06 sdetails
#52ACCEPTED0.05 sdetails
#53ACCEPTED0.06 sdetails
#54ACCEPTED0.05 sdetails
#55ACCEPTED0.05 sdetails
#56ACCEPTED0.05 sdetails

Code

import sys
from collections import deque, defaultdict, Counter
from heapq import heappush, heappop, heapify
from bisect import bisect_left, bisect_right
from itertools import permutations, combinations, product, accumulate, groupby
from functools import lru_cache, cmp_to_key, reduce
from math import gcd, isqrt, comb, inf, pi, sqrt, atan2, hypot


def main():
    data = sys.stdin.buffer.read().split(); idx = 0
    # n = int(data[idx]); idx += 1
    n, m = map(int, data[idx:idx + 2]); idx += 2
    # a = list(map(int, data[idx:idx + n])); idx += n
    # s = data[idx].decode(); idx += 1                  # strings

    # for _ in range(m):
    #     a, b = map(int, data[idx:idx + 2]); idx += 2

    # g = [data[idx + i].decode() for i in range(n)]; idx += n  # grid of n rows, no spaces, strings

    # input = sys.stdin.readline
    # n, m = map(int, input().split())
    # s = input().strip()  # strip removes the trailing newline
    # for line in sys.stdin:  # read until EOF

    out = []

    # l = {"D":}
    l = ["R", "D", "L", "U"]
    if n % 2 == 0:
        pass
    elif m%2 == 0:
        l = ["D", "R", "U", "L"]
        a = n
        n = m
        m = a
    else:
        print(-1)
        return

    


    out.append(l[0])

    for i in range(n //2):
        if i != 0:
            out.append(l[1])
        out.append(l[0] * (m-2))
        # print(out, n, m)
        out.append(l[1])
        out.append(l[2] * (m-2))

    out.append(l[2])

    out.append(l[3] * (n-1))



    sys.stdout.write("".join(map(str, out)) + "\n")  # one value per line
    # print(*out)                                      # space separated on one line
    # print(f"{ans:.6f}")                              # float with 6 decimals
    # print("\n".join("".join(row) for row in g))      # grid of chars


main()

Test details

Test 1

Verdict: ACCEPTED

input
2 2

correct output
DRUL

user output
RDLU

Test 2

Verdict: ACCEPTED

input
2 2

correct output
DRUL

user output
RDLU

Test 3

Verdict: ACCEPTED

input
2 3

correct output
RRDLLU

user output
RRDLLU

Test 4

Verdict: ACCEPTED

input
2 2

correct output
DRUL

user output
RDLU

Test 5

Verdict: ACCEPTED

input
4 4

correct output
DDDRUURDDRUUULLL

user output
RRRDLLDRRDLLLUUU

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
RRRDLLDRRDLLLUUU

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
RDDDLUUU

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
RDLU

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
RDLU

Test 15

Verdict: ACCEPTED

input
5 2

correct output
DDDDRUUUUL

user output
DDDDRUUUUL

Test 16

Verdict: ACCEPTED

input
2 3

correct output
RRDLLU

user output
RRDLLU

Test 17

Verdict: ACCEPTED

input
6 7

correct output
RRRRRRDLLLLLDRRRRRDLLLLLDRRRRR...

user output
RRRRRRDLLLLLDRRRRRDLLLLLDRRRRR...

Test 18

Verdict: ACCEPTED

input
5 10

correct output
DDDDRUUURDDDRUUURDDDRUUURDDDRU...

user output
DDDDRUUURDDDRUUURDDDRUUURDDDRU...

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
RDDDDDLUUUUU

Test 21

Verdict: ACCEPTED

input
10 10

correct output
DDDDDDDDDRUUUUUUUURDDDDDDDDRUU...

user output
RRRRRRRRRDLLLLLLLLDRRRRRRRRDLL...

Test 22

Verdict: ACCEPTED

input
3 2

correct output
DDRUUL

user output
DDRUUL

Test 23

Verdict: ACCEPTED

input
10 10

correct output
DDDDDDDDDRUUUUUUUURDDDDDDDDRUU...

user output
RRRRRRRRRDLLLLLLLLDRRRRRRRRDLL...

Test 24

Verdict: ACCEPTED

input
2 4

correct output
DRRRULLL

user output
RRRDLLLU

Test 25

Verdict: ACCEPTED

input
9 2

correct output
DDDDDDDDRUUUUUUUUL

user output
DDDDDDDDRUUUUUUUUL

Test 26

Verdict: ACCEPTED

input
2 5

correct output
RRRRDLLLLU

user output
RRRRDLLLLU

Test 27

Verdict: ACCEPTED

input
56 60

correct output
DDDDDDDDDDDDDDDDDDDDDDDDDDDDDD...

user output
RRRRRRRRRRRRRRRRRRRRRRRRRRRRRR...

Test 28

Verdict: ACCEPTED

input
43 100

correct output
DDDDDDDDDDDDDDDDDDDDDDDDDDDDDD...

user output
DDDDDDDDDDDDDDDDDDDDDDDDDDDDDD...

Test 29

Verdict: ACCEPTED

input
45 20

correct output
DDDDDDDDDDDDDDDDDDDDDDDDDDDDDD...

user output
DDDDDDDDDDDDDDDDDDDDDDDDDDDDDD...

Test 30

Verdict: ACCEPTED

input
56 9

correct output
RRRRRRRRDLLLLLLLDRRRRRRRDLLLLL...

user output
RRRRRRRRDLLLLLLLDRRRRRRRDLLLLL...

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

input
90 95

correct output
RRRRRRRRRRRRRRRRRRRRRRRRRRRRRR...

user output
RRRRRRRRRRRRRRRRRRRRRRRRRRRRRR...

Test 34

Verdict: ACCEPTED

input
9 24

correct output
DDDDDDDDRUUUUUUURDDDDDDDRUUUUU...

user output
DDDDDDDDRUUUUUUURDDDDDDDRUUUUU...

Test 35

Verdict: ACCEPTED

input
88 3

correct output
RRDLDRDLDRDLDRDLDRDLDRDLDRDLDR...

user output
RRDLDRDLDRDLDRDLDRDLDRDLDRDLDR...

Test 36

Verdict: ACCEPTED

input
3 38

correct output
DDRURDRURDRURDRURDRURDRURDRURD...

user output
DDRURDRURDRURDRURDRURDRURDRURD...

Test 37

Verdict: ACCEPTED

input
111 119

correct output
-1

user output
-1

Test 38

Verdict: ACCEPTED

input
84 200

correct output
DDDDDDDDDDDDDDDDDDDDDDDDDDDDDD...

user output
RRRRRRRRRRRRRRRRRRRRRRRRRRRRRR...

Test 39

Verdict: ACCEPTED

input
88 38

correct output
DDDDDDDDDDDDDDDDDDDDDDDDDDDDDD...

user output
RRRRRRRRRRRRRRRRRRRRRRRRRRRRRR...

Test 40

Verdict: ACCEPTED

input
111 16

correct output
DDDDDDDDDDDDDDDDDDDDDDDDDDDDDD...

user output
DDDDDDDDDDDDDDDDDDDDDDDDDDDDDD...

Test 41

Verdict: ACCEPTED

input
194 181

correct output
RRRRRRRRRRRRRRRRRRRRRRRRRRRRRR...

user output
RRRRRRRRRRRRRRRRRRRRRRRRRRRRRR...

Test 42

Verdict: ACCEPTED

input
46 12

correct output
DDDDDDDDDDDDDDDDDDDDDDDDDDDDDD...

user output
RRRRRRRRRRRDLLLLLLLLLLDRRRRRRR...

Test 43

Verdict: ACCEPTED

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

input
175 4

correct output
DDDDDDDDDDDDDDDDDDDDDDDDDDDDDD...

user output
DDDDDDDDDDDDDDDDDDDDDDDDDDDDDD...

Test 46

Verdict: ACCEPTED

input
4 74

correct output
DDDRUURDDRUURDDRUURDDRUURDDRUU...

user output
RRRRRRRRRRRRRRRRRRRRRRRRRRRRRR...

Test 47

Verdict: ACCEPTED

input
550 594

correct output
DDDDDDDDDDDDDDDDDDDDDDDDDDDDDD...

user output
RRRRRRRRRRRRRRRRRRRRRRRRRRRRRR...

Test 48

Verdict: ACCEPTED

input
418 998

correct output
DDDDDDDDDDDDDDDDDDDDDDDDDDDDDD...

user output
RRRRRRRRRRRRRRRRRRRRRRRRRRRRRR...

Test 49

Verdict: ACCEPTED

input
437 186

correct output
DDDDDDDDDDDDDDDDDDDDDDDDDDDDDD...

user output
DDDDDDDDDDDDDDDDDDDDDDDDDDDDDD...

Test 50

Verdict: ACCEPTED

input
552 72

correct output
DDDDDDDDDDDDDDDDDDDDDDDDDDDDDD...

user output
RRRRRRRRRRRRRRRRRRRRRRRRRRRRRR...

Test 51

Verdict: ACCEPTED

input
968 901

correct output
RRRRRRRRRRRRRRRRRRRRRRRRRRRRRR...

user output
RRRRRRRRRRRRRRRRRRRRRRRRRRRRRR...

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

Test 54

Verdict: ACCEPTED

input
78 229

correct output
RRRRRRRRRRRRRRRRRRRRRRRRRRRRRR...

user output
RRRRRRRRRRRRRRRRRRRRRRRRRRRRRR...

Test 55

Verdict: ACCEPTED

input
874 13

correct output
RRRRRRRRRRRRDLLLLLLLLLLLDRRRRR...

user output
RRRRRRRRRRRRDLLLLLLLLLLLDRRRRR...

Test 56

Verdict: ACCEPTED

input
12 366

correct output
DDDDDDDDDDDRUUUUUUUUUURDDDDDDD...

user output
RRRRRRRRRRRRRRRRRRRRRRRRRRRRRR...