Submission details
Task:Chess board tour
Sender:aalto26im_026
Submission time:2026-11-02 16:58:50 +0200
Language:C++ (C++23)
Status:READY
Result:
Test results
testverdicttime
#1ACCEPTED0.00 sdetails
#2ACCEPTED0.00 sdetails
#3ACCEPTED0.00 sdetails
#4ACCEPTED0.00 sdetails
#5ACCEPTED0.00 sdetails
#6ACCEPTED0.00 sdetails
#7ACCEPTED0.00 sdetails
#8ACCEPTED0.00 sdetails
#90.00 sdetails
#10ACCEPTED0.00 sdetails
#11ACCEPTED0.00 sdetails
#12ACCEPTED0.00 sdetails
#13ACCEPTED0.00 sdetails
#14ACCEPTED0.00 sdetails
#150.00 sdetails
#16ACCEPTED0.00 sdetails
#17ACCEPTED0.00 sdetails
#180.00 sdetails
#19ACCEPTED0.00 sdetails
#20ACCEPTED0.00 sdetails
#21ACCEPTED0.00 sdetails
#220.00 sdetails
#23ACCEPTED0.00 sdetails
#24ACCEPTED0.00 sdetails
#250.00 sdetails
#26ACCEPTED0.00 sdetails
#27ACCEPTED0.00 sdetails
#280.00 sdetails
#290.00 sdetails
#30ACCEPTED0.00 sdetails
#31ACCEPTED0.00 sdetails
#32ACCEPTED0.00 sdetails
#33ACCEPTED0.00 sdetails
#340.00 sdetails
#35ACCEPTED0.00 sdetails
#360.00 sdetails
#37ACCEPTED0.00 sdetails
#38ACCEPTED0.00 sdetails
#39ACCEPTED0.00 sdetails
#400.00 sdetails
#41ACCEPTED0.00 sdetails
#42ACCEPTED0.00 sdetails
#430.00 sdetails
#44ACCEPTED0.00 sdetails
#450.00 sdetails
#46ACCEPTED0.00 sdetails
#47ACCEPTED0.00 sdetails
#48ACCEPTED0.00 sdetails
#490.00 sdetails
#50ACCEPTED0.00 sdetails
#51ACCEPTED0.01 sdetails
#52ACCEPTED0.00 sdetails
#530.00 sdetails
#54ACCEPTED0.00 sdetails
#55ACCEPTED0.00 sdetails
#56ACCEPTED0.00 sdetails

Code

#include <iostream>
#include <string>


int main(int argc, char **argv) {
    int n, m;
    std::cin >> n >> m;

    if (n == 1 || m == 1) {
        std::cout << "-1" << std::endl;
        return 0;
    }

    if (n % 2 != 0 && m % 2 == 0) {
        std::cout << "-1" << std::endl;
        return 0;
    }

    if (n % 2 == 0 && m >=2) {
        std::cout << std::string(m-1, 'R');
        for (int row=1; row<n; row++) {
            char c = (row % 2 != 0) ? 'L' : 'R';
            std::cout << 'D' << std::string(m-2, c);
        }
        std::cout << 'L' << std::string(n-1, 'U') << std::endl;
    } else if (n >= 2 && m % 2 == 0) {
        std::cout << std::string(n-1, 'D');
        for (int col=1; col<m; col++) {
            char c = (col % 2 != 0) ? 'U' : 'D';
            std::cout << 'R' << std::string(n-2, c);
        }
        std::cout << 'U' << std::string(m-1, 'L') << std::endl;
    } else {
        std::cout << "-1" << std::endl;
    }

    return 0;
}

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:

input
3 2

correct output
DDRUUL

user output
-1

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:

input
5 2

correct output
DDDDRUUUUL

user output
-1

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:

input
5 10

correct output
DDDDRUUURDDDRUUURDDDRUUURDDDRU...

user output
-1

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:

input
3 2

correct output
DDRUUL

user output
-1

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:

input
9 2

correct output
DDDDDDDDRUUUUUUUUL

user output
-1

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:

input
43 100

correct output
DDDDDDDDDDDDDDDDDDDDDDDDDDDDDD...

user output
-1

Test 29

Verdict:

input
45 20

correct output
DDDDDDDDDDDDDDDDDDDDDDDDDDDDDD...

user output
-1

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:

input
9 24

correct output
DDDDDDDDRUUUUUUURDDDDDDDRUUUUU...

user output
-1

Test 35

Verdict: ACCEPTED

input
88 3

correct output
RRDLDRDLDRDLDRDLDRDLDRDLDRDLDR...

user output
RRDLDRDLDRDLDRDLDRDLDRDLDRDLDR...

Test 36

Verdict:

input
3 38

correct output
DDRURDRURDRURDRURDRURDRURDRURD...

user output
-1

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:

input
111 16

correct output
DDDDDDDDDDDDDDDDDDDDDDDDDDDDDD...

user output
-1

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:

input
179 190

correct output
DDDDDDDDDDDDDDDDDDDDDDDDDDDDDD...

user output
-1

Test 44

Verdict: ACCEPTED

input
17 47

correct output
-1

user output
-1

Test 45

Verdict:

input
175 4

correct output
DDDDDDDDDDDDDDDDDDDDDDDDDDDDDD...

user output
-1

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:

input
437 186

correct output
DDDDDDDDDDDDDDDDDDDDDDDDDDDDDD...

user output
-1

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:

input
893 948

correct output
DDDDDDDDDDDDDDDDDDDDDDDDDDDDDD...

user output
-1

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