CSES - Aalto Competitive Programming 2024 - wk9 - Mon - Results
Submission details
Task:Chess board tour
Sender:AleksandrPolitov
Submission time:2024-11-04 16:31:14 +0200
Language:C++ (C++20)
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.01 sdetails
#54ACCEPTED0.00 sdetails
#55ACCEPTED0.00 sdetails
#56ACCEPTED0.00 sdetails

Code

#ifdef ONPC
    #define _GLIBCXX_DEBUG
#endif
#include <bits/stdc++.h>

#define char unsigned char
#define rep(i, a, b) for(int i=a; i< (b); ++i)
#define all(x) begin(x), end(x)
#define sz(x) (int)(x).size()
#define eb emplace_back
#define mp make_pair
#define mt make_tuple
#define fi first
#define se second
#define pb push_back

#define LSOne(S) ((S) & -(S))

using namespace std;
// mt19937 rnd(239);
mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());

template <typename T> int sgn(T x) { return (T(0) < x) - (x < T(0)); }
typedef long double T;
typedef complex<T> pt;
#define X real()
#define Y imag()

template<class T>
istream& operator>> (istream& is, complex<T>& p) {
    T value;
    is >> value;
    p.real(value);
    is >> value;
    p.imag(value);
    return is;
}

typedef long long ll;
typedef long double ld;

using pi = pair<ll, ll>;
using vi = vector<ll>;
template <class T>
using pq = priority_queue<T>;
template <class T>
using pqg = priority_queue<T, vector<T>, greater<T>>;

int popcnt(int x) { return __builtin_popcount(x); }
int popcnt(ll x) { return __builtin_popcountll(x); }

#define MIN(v) *min_element(all(v))
#define MAX(v) *max_element(all(v))
#define LB(c, x) distance((c).begin(), lower_bound(all(c), (x)))
#define UB(c, x) distance((c).begin(), upper_bound(all(c), (x)))

void __print(int x) {cerr << x;}
void __print(long x) {cerr << x;}
void __print(long long x) {cerr << x;}
void __print(unsigned x) {cerr << x;}
void __print(unsigned long x) {cerr << x;}
void __print(unsigned long long x) {cerr << x;}
void __print(float x) {cerr << x;}
void __print(double x) {cerr << x;}
void __print(long double x) {cerr << x;}
void __print(char x) {cerr << '\'' << x << '\'';}
void __print(const char *x) {cerr << '\"' << x << '\"';}
void __print(const string &x) {cerr << '\"' << x << '\"';}
void __print(bool x) {cerr << (x ? "true" : "false");}

template<typename T, typename V>
void __print(const pair<T, V> &x) {cerr << '{'; __print(x.first); cerr << ", "; __print(x.second); cerr << '}';}
template<typename T>
void __print(const T &x) {int f = 0; cerr << '{'; for (auto &i: x) cerr << (f++ ? ", " : ""), __print(i); cerr << "}";}
void _print() {cerr << "]\n";}
template <typename T, typename... V>
void _print(T t, V... v) {__print(t); if (sizeof...(v)) cerr << ", "; _print(v...);}
#ifdef DEBUG
#define dbg(x...) cerr << "\e[91m"<<__func__<<":"<<__LINE__<<" [" << #x << "] = ["; _print(x); cerr << "\e[39m" << endl;
#else
#define dbg(x...)
#endif

template<typename S, typename T = S> void chmin(S &s, T t) {s = s < t ? s : t;}
template<typename S, typename T = S> void chmax(S &s, T t) {s = s > t ? s : t;}

const int INF = 1e9; // 10^9 = 1B is < 2^31-1
const ll LLINF = 4e18; // 4*10^18 is < 2^63-1
const double EPS = 1e-9;
const ll MOD = 1e9+7;

int solve() {
    int n,m; std::cin >> n >> m;
  
    if(n%2==1 && m%2==1) {
        std::cout << -1 << std::endl;
        return 0;
    }


    if(n%2==0) {
        string res="R";
        for (int i = 1; i <= n; i++) {
            if(i%2==1) {
                res+=string(m-2, 'R');
            } else if(i%2==0) {
                res+=string(m-2, 'L');
            }
            if(i!=n) res+='D';
        }
        res+='L';
        res+=string(n-1, 'U');

        std::cout << res << std::endl;
    } else if(m%2==0) {
        string res="D";
        for (int i = 1; i <= n; i++) {
            if(i%2==1) {
                res+=string(m-2, 'D');
            } else if(i%2==0) {
                res+=string(m-2, 'U');
            }
            if(i!=n) res+='R';
        }
        res+='U';
        res+=string(n-1, 'L');

        std::cout << res << std::endl;
    }


    return 0;
}

int32_t main() {
    ios::sync_with_stdio(0);
    cin.tie(0);
    int TET = 1;
    //cin >> TET;
    for (int i = 1; i <= TET; i++) {
        #ifdef ONPC
            cout << "TEST CASE#" << i << endl;
        #endif
        
        if (solve()) {
            break;
        }

        #ifdef ONPC
            cout << "__________________________" << endl;
        #endif
    }
    #ifdef ONPC
        cerr << endl << "finished in " << clock() * 1.0 / CLOCKS_PER_SEC << " sec" << endl;
    #endif
}

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
DRRULL

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
DRRRRULLLL

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

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

Test 22

Verdict:

input
3 2

correct output
DDRUUL

user output
DRRULL

Test 23

Verdict: ACCEPTED

input
10 10

correct output
DDDDDDDDDRUUUUUUUURDDDDDDDDRUU...

user output
RRRRRRRRRDLLLLLLLLDRRRRRRRRDLL...
Truncated

Test 24

Verdict: ACCEPTED

input
2 4

correct output
DRRRULLL

user output
RRRDLLLU

Test 25

Verdict:

input
9 2

correct output
DDDDDDDDRUUUUUUUUL

user output
DRRRRRRRRULLLLLLLL

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

Test 28

Verdict:

input
43 100

correct output
DDDDDDDDDDDDDDDDDDDDDDDDDDDDDD...

user output
DDDDDDDDDDDDDDDDDDDDDDDDDDDDDD...
Truncated

Test 29

Verdict:

input
45 20

correct output
DDDDDDDDDDDDDDDDDDDDDDDDDDDDDD...

user output
DDDDDDDDDDDDDDDDDDDRUUUUUUUUUU...
Truncated

Test 30

Verdict: ACCEPTED

input
56 9

correct output
RRRRRRRRDLLLLLLLDRRRRRRRDLLLLL...

user output
RRRRRRRRDLLLLLLLDRRRRRRRDLLLLL...
Truncated

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

Test 34

Verdict:

input
9 24

correct output
DDDDDDDDRUUUUUUURDDDDDDDRUUUUU...

user output
DDDDDDDDDDDDDDDDDDDDDDDRUUUUUU...
Truncated

Test 35

Verdict: ACCEPTED

input
88 3

correct output
RRDLDRDLDRDLDRDLDRDLDRDLDRDLDR...

user output
RRDLDRDLDRDLDRDLDRDLDRDLDRDLDR...
Truncated

Test 36

Verdict:

input
3 38

correct output
DDRURDRURDRURDRURDRURDRURDRURD...

user output
DDDDDDDDDDDDDDDDDDDDDDDDDDDDDD...
Truncated

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

Test 39

Verdict: ACCEPTED

input
88 38

correct output
DDDDDDDDDDDDDDDDDDDDDDDDDDDDDD...

user output
RRRRRRRRRRRRRRRRRRRRRRRRRRRRRR...
Truncated

Test 40

Verdict:

input
111 16

correct output
DDDDDDDDDDDDDDDDDDDDDDDDDDDDDD...

user output
DDDDDDDDDDDDDDDRUUUUUUUUUUUUUU...
Truncated

Test 41

Verdict: ACCEPTED

input
194 181

correct output
RRRRRRRRRRRRRRRRRRRRRRRRRRRRRR...

user output
RRRRRRRRRRRRRRRRRRRRRRRRRRRRRR...
Truncated

Test 42

Verdict: ACCEPTED

input
46 12

correct output
DDDDDDDDDDDDDDDDDDDDDDDDDDDDDD...

user output
RRRRRRRRRRRDLLLLLLLLLLDRRRRRRR...
Truncated

Test 43

Verdict:

input
179 190

correct output
DDDDDDDDDDDDDDDDDDDDDDDDDDDDDD...

user output
DDDDDDDDDDDDDDDDDDDDDDDDDDDDDD...
Truncated

Test 44

Verdict: ACCEPTED

input
17 47

correct output
-1

user output
-1

Test 45

Verdict:

input
175 4

correct output
DDDDDDDDDDDDDDDDDDDDDDDDDDDDDD...

user output
DDDRUURDDRUURDDRUURDDRUURDDRUU...
Truncated

Test 46

Verdict: ACCEPTED

input
4 74

correct output
DDDRUURDDRUURDDRUURDDRUURDDRUU...

user output
RRRRRRRRRRRRRRRRRRRRRRRRRRRRRR...
Truncated

Test 47

Verdict: ACCEPTED

input
550 594

correct output
DDDDDDDDDDDDDDDDDDDDDDDDDDDDDD...

user output
RRRRRRRRRRRRRRRRRRRRRRRRRRRRRR...
Truncated

Test 48

Verdict: ACCEPTED

input
418 998

correct output
DDDDDDDDDDDDDDDDDDDDDDDDDDDDDD...

user output
RRRRRRRRRRRRRRRRRRRRRRRRRRRRRR...
Truncated

Test 49

Verdict:

input
437 186

correct output
DDDDDDDDDDDDDDDDDDDDDDDDDDDDDD...

user output
DDDDDDDDDDDDDDDDDDDDDDDDDDDDDD...
Truncated

Test 50

Verdict: ACCEPTED

input
552 72

correct output
DDDDDDDDDDDDDDDDDDDDDDDDDDDDDD...

user output
RRRRRRRRRRRRRRRRRRRRRRRRRRRRRR...
Truncated

Test 51

Verdict: ACCEPTED

input
968 901

correct output
RRRRRRRRRRRRRRRRRRRRRRRRRRRRRR...

user output
RRRRRRRRRRRRRRRRRRRRRRRRRRRRRR...
Truncated

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

Test 54

Verdict: ACCEPTED

input
78 229

correct output
RRRRRRRRRRRRRRRRRRRRRRRRRRRRRR...

user output
RRRRRRRRRRRRRRRRRRRRRRRRRRRRRR...
Truncated

Test 55

Verdict: ACCEPTED

input
874 13

correct output
RRRRRRRRRRRRDLLLLLLLLLLLDRRRRR...

user output
RRRRRRRRRRRRDLLLLLLLLLLLDRRRRR...
Truncated

Test 56

Verdict: ACCEPTED

input
12 366

correct output
DDDDDDDDDDDRUUUUUUUUUURDDDDDDD...

user output
RRRRRRRRRRRRRRRRRRRRRRRRRRRRRR...
Truncated