CSES - Aalto Competitive Programming 2024 - wk9 - Mon - Results
Submission details
Task:Chess board tour
Sender:ilyas.ben
Submission time:2024-11-04 17:01:17 +0200
Language:C++ (C++20)
Status:READY
Result:
Test results
testverdicttime
#10.00 sdetails
#20.00 sdetails
#30.00 sdetails
#40.00 sdetails
#50.00 sdetails
#6ACCEPTED0.00 sdetails
#70.00 sdetails
#8ACCEPTED0.01 sdetails
#90.00 sdetails
#100.00 sdetails
#11ACCEPTED0.00 sdetails
#120.00 sdetails
#13ACCEPTED0.00 sdetails
#140.01 sdetails
#150.00 sdetails
#160.00 sdetails
#170.00 sdetails
#180.00 sdetails
#19ACCEPTED0.00 sdetails
#200.00 sdetails
#210.00 sdetails
#220.00 sdetails
#230.00 sdetails
#240.00 sdetails
#250.00 sdetails
#260.00 sdetails
#270.00 sdetails
#280.00 sdetails
#290.00 sdetails
#300.00 sdetails
#31ACCEPTED0.00 sdetails
#32ACCEPTED0.00 sdetails
#330.00 sdetails
#340.00 sdetails
#350.00 sdetails
#360.00 sdetails
#37ACCEPTED0.00 sdetails
#380.00 sdetails
#390.00 sdetails
#400.00 sdetails
#410.01 sdetails
#420.00 sdetails
#430.01 sdetails
#44ACCEPTED0.00 sdetails
#450.00 sdetails
#460.00 sdetails
#470.02 sdetails
#480.02 sdetails
#490.01 sdetails
#500.01 sdetails
#510.04 sdetails
#52ACCEPTED0.00 sdetails
#530.04 sdetails
#540.00 sdetails
#550.00 sdetails
#560.00 sdetails

Code

#include <iostream>
#include <vector>
using namespace std;

int main() {
    long long n, m;
    cin >> n >> m;

    // Si n et m sont impairs, il est impossible de créer un chemin valide
    if ((n % 2 != 0) && (m % 2 != 0)) {
        cout << "-1" << endl;
        return 0;
    }

    // Stocker le chemin dans un vecteur de caractères
    vector<char> path;

    // Si n est pair, parcourir le tableau en zigzag par lignes
    if (n % 2 == 0) {
        for (long long i = 0; i < n; ++i) {
            if (i % 2 == 0) {
                for (long long j = 1; j < m; ++j) path.push_back('R'); // Aller à droite
            } else {
                for (long long j = 1; j < m; ++j) path.push_back('L'); // Aller à gauche
            }
            if (i != n - 1) path.push_back('D'); // Descendre si ce n'est pas la dernière ligne
        }
    } else { // Si m est pair, parcourir le tableau en zigzag par colonnes
        for (long long j = 0; j < m; ++j) {
            if (j % 2 == 0) {
                for (long long i = 1; i < n; ++i) path.push_back('D'); // Descendre
            } else {
                for (long long i = 1; i < n; ++i) path.push_back('U'); // Monter
            }
            if (j != m - 1) path.push_back('R'); // Aller à droite si ce n'est pas la dernière colonne
        }
    }

    // Afficher le chemin
    for (char move : path) {
        cout << move;
    }
    cout << endl;

    return 0;
}

Test details

Test 1

Verdict:

input
2 2

correct output
DRUL

user output
RDL

Test 2

Verdict:

input
2 2

correct output
DRUL

user output
RDL

Test 3

Verdict:

input
2 3

correct output
RRDLLU

user output
RRDLL

Test 4

Verdict:

input
2 2

correct output
DRUL

user output
RDL

Test 5

Verdict:

input
4 4

correct output
DDDRUURDDRUUULLL

user output
RRRDLLLDRRRDLLL

Test 6

Verdict: ACCEPTED

input
3 3

correct output
-1

user output
-1

Test 7

Verdict:

input
4 4

correct output
DDDRUURDDRUUULLL

user output
RRRDLLLDRRRDLLL

Test 8

Verdict: ACCEPTED

input
3 5

correct output
-1

user output
-1

Test 9

Verdict:

input
3 2

correct output
DDRUUL

user output
DDRUU

Test 10

Verdict:

input
4 2

correct output
DDDRUUUL

user output
RDLDRDL

Test 11

Verdict: ACCEPTED

input
5 5

correct output
-1

user output
-1

Test 12

Verdict:

input
2 2

correct output
DRUL

user output
RDL

Test 13

Verdict: ACCEPTED

input
5 5

correct output
-1

user output
-1

Test 14

Verdict:

input
2 2

correct output
DRUL

user output
RDL

Test 15

Verdict:

input
5 2

correct output
DDDDRUUUUL

user output
DDDDRUUUU

Test 16

Verdict:

input
2 3

correct output
RRDLLU

user output
RRDLL

Test 17

Verdict:

input
6 7

correct output
RRRRRRDLLLLLDRRRRRDLLLLLDRRRRR...

user output
RRRRRRDLLLLLLDRRRRRRDLLLLLLDRR...

Test 18

Verdict:

input
5 10

correct output
DDDDRUUURDDDRUUURDDDRUUURDDDRU...

user output
DDDDRUUUURDDDDRUUUURDDDDRUUUUR...

Test 19

Verdict: ACCEPTED

input
5 3

correct output
-1

user output
-1

Test 20

Verdict:

input
6 2

correct output
DDDDDRUUUUUL

user output
RDLDRDLDRDL

Test 21

Verdict:

input
10 10

correct output
DDDDDDDDDRUUUUUUUURDDDDDDDDRUU...

user output
RRRRRRRRRDLLLLLLLLLDRRRRRRRRRD...

Test 22

Verdict:

input
3 2

correct output
DDRUUL

user output
DDRUU

Test 23

Verdict:

input
10 10

correct output
DDDDDDDDDRUUUUUUUURDDDDDDDDRUU...

user output
RRRRRRRRRDLLLLLLLLLDRRRRRRRRRD...

Test 24

Verdict:

input
2 4

correct output
DRRRULLL

user output
RRRDLLL

Test 25

Verdict:

input
9 2

correct output
DDDDDDDDRUUUUUUUUL

user output
DDDDDDDDRUUUUUUUU

Test 26

Verdict:

input
2 5

correct output
RRRRDLLLLU

user output
RRRRDLLLL

Test 27

Verdict:

input
56 60

correct output
DDDDDDDDDDDDDDDDDDDDDDDDDDDDDD...

user output
RRRRRRRRRRRRRRRRRRRRRRRRRRRRRR...

Test 28

Verdict:

input
43 100

correct output
DDDDDDDDDDDDDDDDDDDDDDDDDDDDDD...

user output
DDDDDDDDDDDDDDDDDDDDDDDDDDDDDD...

Test 29

Verdict:

input
45 20

correct output
DDDDDDDDDDDDDDDDDDDDDDDDDDDDDD...

user output
DDDDDDDDDDDDDDDDDDDDDDDDDDDDDD...

Test 30

Verdict:

input
56 9

correct output
RRRRRRRRDLLLLLLLDRRRRRRRDLLLLL...

user output
RRRRRRRRDLLLLLLLLDRRRRRRRRDLLL...

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:

input
9 24

correct output
DDDDDDDDRUUUUUUURDDDDDDDRUUUUU...

user output
DDDDDDDDRUUUUUUUURDDDDDDDDRUUU...

Test 35

Verdict:

input
88 3

correct output
RRDLDRDLDRDLDRDLDRDLDRDLDRDLDR...

user output
RRDLLDRRDLLDRRDLLDRRDLLDRRDLLD...

Test 36

Verdict:

input
3 38

correct output
DDRURDRURDRURDRURDRURDRURDRURD...

user output
DDRUURDDRUURDDRUURDDRUURDDRUUR...

Test 37

Verdict: ACCEPTED

input
111 119

correct output
-1

user output
-1

Test 38

Verdict:

input
84 200

correct output
DDDDDDDDDDDDDDDDDDDDDDDDDDDDDD...

user output
RRRRRRRRRRRRRRRRRRRRRRRRRRRRRR...

Test 39

Verdict:

input
88 38

correct output
DDDDDDDDDDDDDDDDDDDDDDDDDDDDDD...

user output
RRRRRRRRRRRRRRRRRRRRRRRRRRRRRR...

Test 40

Verdict:

input
111 16

correct output
DDDDDDDDDDDDDDDDDDDDDDDDDDDDDD...

user output
DDDDDDDDDDDDDDDDDDDDDDDDDDDDDD...

Test 41

Verdict:

input
194 181

correct output
RRRRRRRRRRRRRRRRRRRRRRRRRRRRRR...

user output
RRRRRRRRRRRRRRRRRRRRRRRRRRRRRR...

Test 42

Verdict:

input
46 12

correct output
DDDDDDDDDDDDDDDDDDDDDDDDDDDDDD...

user output
RRRRRRRRRRRDLLLLLLLLLLLDRRRRRR...

Test 43

Verdict:

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:

input
175 4

correct output
DDDDDDDDDDDDDDDDDDDDDDDDDDDDDD...

user output
DDDDDDDDDDDDDDDDDDDDDDDDDDDDDD...

Test 46

Verdict:

input
4 74

correct output
DDDRUURDDRUURDDRUURDDRUURDDRUU...

user output
RRRRRRRRRRRRRRRRRRRRRRRRRRRRRR...

Test 47

Verdict:

input
550 594

correct output
DDDDDDDDDDDDDDDDDDDDDDDDDDDDDD...

user output
RRRRRRRRRRRRRRRRRRRRRRRRRRRRRR...

Test 48

Verdict:

input
418 998

correct output
DDDDDDDDDDDDDDDDDDDDDDDDDDDDDD...

user output
RRRRRRRRRRRRRRRRRRRRRRRRRRRRRR...

Test 49

Verdict:

input
437 186

correct output
DDDDDDDDDDDDDDDDDDDDDDDDDDDDDD...

user output
DDDDDDDDDDDDDDDDDDDDDDDDDDDDDD...

Test 50

Verdict:

input
552 72

correct output
DDDDDDDDDDDDDDDDDDDDDDDDDDDDDD...

user output
RRRRRRRRRRRRRRRRRRRRRRRRRRRRRR...

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:

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

Test 56

Verdict:

input
12 366

correct output
DDDDDDDDDDDRUUUUUUUUUURDDDDDDD...

user output
RRRRRRRRRRRRRRRRRRRRRRRRRRRRRR...