Submission details
Task:Chess board tour
Sender:aalto26im_032
Submission time:2026-11-02 16:58:03 +0200
Language:C++ (C++20)
Status:READY
Result:
Test results
testverdicttime
#1ACCEPTED0.00 sdetails
#2ACCEPTED0.00 sdetails
#30.00 sdetails
#4ACCEPTED0.00 sdetails
#5ACCEPTED0.00 sdetails
#6ACCEPTED0.00 sdetails
#7ACCEPTED0.00 sdetails
#8ACCEPTED0.00 sdetails
#9ACCEPTED0.00 sdetails
#10ACCEPTED0.00 sdetails
#11ACCEPTED0.00 sdetails
#12ACCEPTED0.00 sdetails
#13ACCEPTED0.00 sdetails
#14ACCEPTED0.00 sdetails
#15ACCEPTED0.00 sdetails
#160.00 sdetails
#170.00 sdetails
#18ACCEPTED0.00 sdetails
#19ACCEPTED0.00 sdetails
#20ACCEPTED0.00 sdetails
#21ACCEPTED0.00 sdetails
#22ACCEPTED0.00 sdetails
#23ACCEPTED0.00 sdetails
#24ACCEPTED0.00 sdetails
#25ACCEPTED0.00 sdetails
#260.00 sdetails
#27ACCEPTED0.00 sdetails
#28ACCEPTED0.00 sdetails
#29ACCEPTED0.00 sdetails
#300.00 sdetails
#31ACCEPTED0.00 sdetails
#32ACCEPTED0.00 sdetails
#330.00 sdetails
#34ACCEPTED0.00 sdetails
#350.00 sdetails
#36ACCEPTED0.00 sdetails
#37ACCEPTED0.00 sdetails
#38ACCEPTED0.00 sdetails
#39ACCEPTED0.00 sdetails
#40ACCEPTED0.00 sdetails
#410.00 sdetails
#42ACCEPTED0.00 sdetails
#43ACCEPTED0.00 sdetails
#44ACCEPTED0.00 sdetails
#45ACCEPTED0.00 sdetails
#46ACCEPTED0.00 sdetails
#47ACCEPTED0.00 sdetails
#48ACCEPTED0.00 sdetails
#49ACCEPTED0.00 sdetails
#50ACCEPTED0.00 sdetails
#510.01 sdetails
#52ACCEPTED0.00 sdetails
#53ACCEPTED0.01 sdetails
#540.00 sdetails
#550.00 sdetails
#56ACCEPTED0.00 sdetails

Code

#include <bits/stdc++.h>
using namespace std;

// debug
template<class T> ostream& operator<<(ostream&, const vector<T>&);
template<class T> ostream& operator<<(ostream&, const set<T>&);
template<class T> ostream& operator<<(ostream&, const multiset<T>&);
template<class K, class V> ostream& operator<<(ostream&, const map<K, V>&);
template<class T, size_t N> ostream& operator<<(ostream&, const array<T, N>&);
template<class A, class B> ostream& operator<<(ostream& os, const pair<A, B>& p) { return os << "(" << p.first << ", " << p.second << ")"; }
template<class T>
void print_collection(ostream& os, const T& v) {
    os << "{";
    bool first = true;
    for (const auto& x : v) {
        if (!first) os << ", ";
        first = false;
        os << x;
    }
    os << "}";
}
template<class T> ostream& operator<<(ostream& os, const vector<T>& v) { print_collection(os, v); return os; }
template<class T> ostream& operator<<(ostream& os, const set<T>& v) { print_collection(os, v); return os; }
template<class T> ostream& operator<<(ostream& os, const multiset<T>& v) { print_collection(os, v); return os; }
template<class K, class V> ostream& operator<<(ostream& os, const map<K, V>& v) { print_collection(os, v); return os; }
template<class T, size_t N> ostream& operator<<(ostream& os, const array<T, N>& v) { print_collection(os, v); return os; }
#define dbg(x) cerr << #x << " = " << (x) << '\n'

using ll = long long;
constexpr int INF = 1'000'000'000; // 1e9
constexpr ll LINF = 1'000'000'000'000'000'000LL; // 1e18
constexpr int MOD = 1'000'000'007; // 1e9 + 7

inline ll add(ll a, ll b) { return (a + b) % MOD; }
inline ll sub(ll a, ll b) { return ((a - b) % MOD + MOD) % MOD; }
inline ll mul(ll a, ll b) { return (a * b) % MOD; }


void solve() {
    int N, M;
    cin >> N >> M;

    bool mEven = M%2 == 0, nEven = N%2 == 0;

    if(!mEven && !nEven) {
        cout << -1;
        return;
    }

    if(mEven) {
        cout << string(N-1, 'D');
        for(int i = 0; i < M/2-1; i++) {
            cout << 'R' << string(N-2, 'U') << 'R' << string(N-2, 'D');
        }
        cout << 'R' << string(N-1, 'U') << string(M-1, 'L');
    } else {
        cout << string(N-1, 'R');
        for(int i = 0; i < M/2-1; i++) {
            cout << 'D' << string(N-2, 'L') << 'D' << string(N-2, 'R');
        }
        cout << 'D' << string(N-1, 'L') << string(M-1, 'U');
    }
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    solve();

    return 0;
}

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
RDLUU

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
DDDRUURDDRUUULLL

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
DDDRUURDDRUUULLL

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
RDLUU

Test 17

Verdict:

input
6 7

correct output
RRRRRRDLLLLLDRRRRRDLLLLLDRRRRR...

user output
RRRRRDLLLLDRRRRDLLLLDRRRRDLLLL...

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
DDDDDRUUUUUL

Test 21

Verdict: ACCEPTED

input
10 10

correct output
DDDDDDDDDRUUUUUUUURDDDDDDDDRUU...

user output
DDDDDDDDDRUUUUUUUURDDDDDDDDRUU...

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

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
RDDDLUUUU

Test 27

Verdict: ACCEPTED

input
56 60

correct output
DDDDDDDDDDDDDDDDDDDDDDDDDDDDDD...

user output
DDDDDDDDDDDDDDDDDDDDDDDDDDDDDD...

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:

input
56 9

correct output
RRRRRRRRDLLLLLLLDRRRRRRRDLLLLL...

user output
RRRRRRRRRRRRRRRRRRRRRRRRRRRRRR...

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

Test 34

Verdict: ACCEPTED

input
9 24

correct output
DDDDDDDDRUUUUUUURDDDDDDDRUUUUU...

user output
DDDDDDDDRUUUUUUURDDDDDDDRUUUUU...

Test 35

Verdict:

input
88 3

correct output
RRDLDRDLDRDLDRDLDRDLDRDLDRDLDR...

user output
RRRRRRRRRRRRRRRRRRRRRRRRRRRRRR...

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

Test 39

Verdict: ACCEPTED

input
88 38

correct output
DDDDDDDDDDDDDDDDDDDDDDDDDDDDDD...

user output
DDDDDDDDDDDDDDDDDDDDDDDDDDDDDD...

Test 40

Verdict: ACCEPTED

input
111 16

correct output
DDDDDDDDDDDDDDDDDDDDDDDDDDDDDD...

user output
DDDDDDDDDDDDDDDDDDDDDDDDDDDDDD...

Test 41

Verdict:

input
194 181

correct output
RRRRRRRRRRRRRRRRRRRRRRRRRRRRRR...

user output
RRRRRRRRRRRRRRRRRRRRRRRRRRRRRR...

Test 42

Verdict: ACCEPTED

input
46 12

correct output
DDDDDDDDDDDDDDDDDDDDDDDDDDDDDD...

user output
DDDDDDDDDDDDDDDDDDDDDDDDDDDDDD...

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

Test 47

Verdict: ACCEPTED

input
550 594

correct output
DDDDDDDDDDDDDDDDDDDDDDDDDDDDDD...

user output
DDDDDDDDDDDDDDDDDDDDDDDDDDDDDD...

Test 48

Verdict: ACCEPTED

input
418 998

correct output
DDDDDDDDDDDDDDDDDDDDDDDDDDDDDD...

user output
DDDDDDDDDDDDDDDDDDDDDDDDDDDDDD...

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

Test 51

Verdict:

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:

input
78 229

correct output
RRRRRRRRRRRRRRRRRRRRRRRRRRRRRR...

user output
RRRRRRRRRRRRRRRRRRRRRRRRRRRRRR...

Test 55

Verdict:

input
874 13

correct output
RRRRRRRRRRRRDLLLLLLLLLLLDRRRRR...

user output
RRRRRRRRRRRRRRRRRRRRRRRRRRRRRR...

Test 56

Verdict: ACCEPTED

input
12 366

correct output
DDDDDDDDDDDRUUUUUUUUUURDDDDDDD...

user output
DDDDDDDDDDDRUUUUUUUUUURDDDDDDD...