CSES - Aalto Competitive Programming 2024 - wk9 - Mon

CSES - Aalto Competitive Programming 2024 - wk9 - Mon - Results

Submission details
Task:	Chess board tour
Sender:	ZDHKLV
Submission time:	2024-11-04 17:14:40 +0200
Language:	C++ (C++20)
Status:	READY
Result:	TIME LIMIT EXCEEDED

Test results
test	verdict	time
#1	ACCEPTED	0.00 s	details
#2	ACCEPTED	0.00 s	details
#3	ACCEPTED	0.00 s	details
#4	ACCEPTED	0.00 s	details
#5	ACCEPTED	0.00 s	details
#6	ACCEPTED	0.01 s	details
#7	ACCEPTED	0.00 s	details
#8	ACCEPTED	0.00 s	details
#9	ACCEPTED	0.00 s	details
#10	ACCEPTED	0.00 s	details
#11	ACCEPTED	0.00 s	details
#12	ACCEPTED	0.00 s	details
#13	ACCEPTED	0.00 s	details
#14	ACCEPTED	0.00 s	details
#15	ACCEPTED	0.00 s	details
#16	ACCEPTED	0.00 s	details
#17	ACCEPTED	0.00 s	details
#18	ACCEPTED	0.00 s	details
#19	ACCEPTED	0.00 s	details
#20	ACCEPTED	0.00 s	details
#21	ACCEPTED	0.01 s	details
#22	ACCEPTED	0.00 s	details
#23	ACCEPTED	0.01 s	details
#24	ACCEPTED	0.00 s	details
#25	ACCEPTED	0.00 s	details
#26	ACCEPTED	0.00 s	details
#27	TIME LIMIT EXCEEDED	--	details
#28	TIME LIMIT EXCEEDED	--	details
#29	TIME LIMIT EXCEEDED	--	details
#30	TIME LIMIT EXCEEDED	--	details
#31	TIME LIMIT EXCEEDED	--	details
#32	ACCEPTED	0.18 s	details
#33	TIME LIMIT EXCEEDED	--	details
#34	TIME LIMIT EXCEEDED	--	details
#35	ACCEPTED	0.01 s	details
#36	ACCEPTED	0.00 s	details
#37	TIME LIMIT EXCEEDED	--	details
#38	TIME LIMIT EXCEEDED	--	details
#39	TIME LIMIT EXCEEDED	--	details
#40	TIME LIMIT EXCEEDED	--	details
#41	TIME LIMIT EXCEEDED	--	details
#42	TIME LIMIT EXCEEDED	--	details
#43	TIME LIMIT EXCEEDED	--	details
#44	TIME LIMIT EXCEEDED	--	details
#45	ACCEPTED	0.01 s	details
#46	ACCEPTED	0.12 s	details
#47	TIME LIMIT EXCEEDED	--	details
#48	TIME LIMIT EXCEEDED	--	details
#49	TIME LIMIT EXCEEDED	--	details
#50	TIME LIMIT EXCEEDED	--	details
#51	TIME LIMIT EXCEEDED	--	details
#52	TIME LIMIT EXCEEDED	--	details
#53	TIME LIMIT EXCEEDED	--	details
#54	TIME LIMIT EXCEEDED	--	details
#55	TIME LIMIT EXCEEDED	--	details
#56	TIME LIMIT EXCEEDED	--	details

Code

#include <bits/stdc++.h>

using namespace std;

bool dfs(int x, int y, int seen, vector<vector<bool>> &visited, int n, int m, vector<char> &output) {

    if (visited[x][y]) {
        if (x == 0 && y == 0) {
            if (seen < n * m) return false;
            return true;
        }
        return false;
    }

    bool block_up = (y == 0 || visited[x][y-1]);
    bool block_left = (x == 0 || visited[x-1][y]);
    bool block_right = (x == n-1 || visited[x+1][y]);
    bool block_down = (y == m-1 || visited[x][y+1]);

    bool can_go_left = (x > 0 && !visited[x-1][y]);
    bool can_go_right = (x+1 < n && !visited[x+1][y]);
    bool can_go_up = (y > 0 && !visited[x][y-1]);
    bool can_go_down = (y+1 < m && !visited[x][y+1]);

    if (block_up && (can_go_left && can_go_right)) return false;
    if (block_down && (can_go_left && can_go_right)) return false;
    if (block_left && (can_go_up && can_go_down)) return false;
    if (block_right && (can_go_up && can_go_down)) return false;

    visited[x][y] = true;

    if (x > 0 && (!visited[x-1][y] || (x-1 == 0 && y == 0))) {
        output.push_back('U');
        bool b = dfs(x-1, y, seen+1, visited, n, m, output);
        if (b) return true;
        output.pop_back();
    }

    if (x+1 < n && !visited[x+1][y]) {
        output.push_back('D');
        bool b = dfs(x+1, y, seen+1, visited, n, m, output);
        if (b) return true;
        output.pop_back();
    }

    if (y > 0 && (!visited[x][y-1] || (x == 0 && y-1 == 0))) {
        output.push_back('L');
        bool b = dfs(x, y-1, seen+1, visited, n, m, output);
        if (b) return true;
        output.pop_back();
    }

    if (y+1 < m && !visited[x][y+1]) {
        output.push_back('R');
        bool b = dfs(x, y+1, seen+1, visited, n, m, output);
        if (b) return true;
        output.pop_back();
    }

    visited[x][y] = false;

    return false;

}

/*
void dfs(int x, int y, int n, int m) {

    vector<vector<bool>> visited(n, vector<bool>(m, false));

    typedef struct {
        int x, y, seen;
    } state_t;

    stack<state_t> s;
    s.push({ x, y, 0 });

    vector<char> events;

    while (!s.empty()) {

        state_t pos = s.top();
        s.pop();

        if (visited[pos.x][pos.y]) {
            if (pos.x == 0 && pos.y == 0) {
                //
                if (pos.seen < n * m)
                    continue;
                else {
                    bool found = false;
                    for (int i = 0; i < n; i++) {
                        for (int j = 0; j < m; j++) {
                            if (!visited[i][j]) {
                                found = true;
                                break;
                            }
                        }
                        if (found) break;
                    }
                    if (found) continue;

                    cout << "ok" << endl;
                }
            }
            continue;
        }
        
        visited[pos.x][pos.y] = true;

        if (pos.x > 0 && !visited[pos.x-1][pos.y]) {
            events.push_back('L');
            s.push({ pos.x-1, pos.y, pos.seen+1 });

        }

        if (pos.x+1 < n && !visited[pos.x+1][pos.y]) {
            events.push_back('D');
            s.push({ pos.x+1, pos.y, pos.seen+1 });
        }

        if (pos.y > 0 && !visited[pos.x][pos.y-1]) {
            events.push_back('U');
            s.push({ pos.x, pos.y-1, pos.seen+1 });
        }

        if (pos.y+1 < m && !visited[pos.x][pos.y+1]) {
            events.push_back('D');
            s.push({ pos.x, pos.y+1, pos.seen+1 });
        }
        
    }

}
*/

int main() {

    int n, m;
    cin >> n >> m;

    vector<vector<bool>> visited(n, vector<bool>(m, false));
    vector<char> output;
    bool b = dfs(0, 0, 0, visited, n, m, output);

    if (!b) {
        cout << -1 << endl;
    } else {
        for (char c : output)
            cout << c;
        cout << endl;
    }

}

Test details

Test 1

Verdict: ACCEPTED

input
`2 2` view save

correct output
`DRUL` view save

user output
`DRUL` view save

Test 2

Verdict: ACCEPTED

input
`2 2` view save

correct output
`DRUL` view save

user output
`DRUL` view save

Test 3

Verdict: ACCEPTED

input
`2 3` view save

correct output
`RRDLLU` view save

user output
`DRRULL` view save

Test 4

Verdict: ACCEPTED

input
`2 2` view save

correct output
`DRUL` view save

user output
`DRUL` view save

Test 5

Verdict: ACCEPTED

input
`4 4` view save

correct output
`DDDRUURDDRUUULLL` view save

user output
`DDDRRRUUULDDLUUL` view save

Test 6

Verdict: ACCEPTED

input
`3 3` view save

correct output
`-1` view save

user output
`-1` view save

Test 7

Verdict: ACCEPTED

input
`4 4` view save

correct output
`DDDRUURDDRUUULLL` view save

user output
`DDDRRRUUULDDLUUL` view save

Test 8

Verdict: ACCEPTED

input
`3 5` view save

correct output
`-1` view save

user output
`-1` view save

Test 9

Verdict: ACCEPTED

input
`3 2` view save

correct output
`DDRUUL` view save

user output
`DDRUUL` view save

Test 10

Verdict: ACCEPTED

input
`4 2` view save

correct output
`DDDRUUUL` view save

user output
`DDDRUUUL` view save

Test 11

Verdict: ACCEPTED

input
`5 5` view save

correct output
`-1` view save

user output
`-1` view save

Test 12

Verdict: ACCEPTED

input
`2 2` view save

correct output
`DRUL` view save

user output
`DRUL` view save

Test 13

Verdict: ACCEPTED

input
`5 5` view save

correct output
`-1` view save

user output
`-1` view save

Test 14

Verdict: ACCEPTED

input
`2 2` view save

correct output
`DRUL` view save

user output
`DRUL` view save

Test 15

Verdict: ACCEPTED

input
`5 2` view save

correct output
`DDDDRUUUUL` view save

user output
`DDDDRUUUUL` view save

Test 16

Verdict: ACCEPTED

input
`2 3` view save

correct output
`RRDLLU` view save

user output
`DRRULL` view save

Test 17

Verdict: ACCEPTED

input
`6 7` view save

correct output
`RRRRRRDLLLLLDRRRRRDLLLLLDRRRRR...` view save

user output
`DDDDDRRRRRRUUUUULDDDDLUUUULDDD...` view save

Test 18

Verdict: ACCEPTED

input
`5 10` view save

correct output
`DDDDRUUURDDDRUUURDDDRUUURDDDRU...` view save

user output
`DDDDRRRRRRRRRUUUULDDDLUUULDDDL...` view save

Test 19

Verdict: ACCEPTED

input
`5 3` view save

correct output
`-1` view save

user output
`-1` view save

Test 20

Verdict: ACCEPTED

input
`6 2` view save

correct output
`DDDDDRUUUUUL` view save

user output
`DDDDDRUUUUUL` view save

Test 21

Verdict: ACCEPTED

input
`10 10` view save

correct output
`DDDDDDDDDRUUUUUUUURDDDDDDDDRUU...` view save

user output
`DDDDDDDDDRRRRRRRRRUUUUUUUUULDD...` Truncated

Test 22

Verdict: ACCEPTED

input
`3 2` view save

correct output
`DDRUUL` view save

user output
`DDRUUL` view save

Test 23

Verdict: ACCEPTED

input
`10 10` view save

correct output
`DDDDDDDDDRUUUUUUUURDDDDDDDDRUU...` view save

user output
`DDDDDDDDDRRRRRRRRRUUUUUUUUULDD...` Truncated

Test 24

Verdict: ACCEPTED

input
`2 4` view save

correct output
`DRRRULLL` view save

user output
`DRRRULLL` view save

Test 25

Verdict: ACCEPTED

input
`9 2` view save

correct output
`DDDDDDDDRUUUUUUUUL` view save

user output
`DDDDDDDDRUUUUUUUUL` view save

Test 26

Verdict: ACCEPTED

input
`2 5` view save

correct output
`RRRRDLLLLU` view save

user output
`DRRRRULLLL` view save

Test 27

Verdict: TIME LIMIT EXCEEDED

input
`56 60` view save

correct output
`DDDDDDDDDDDDDDDDDDDDDDDDDDDDDD...` view save

user output
(empty)

Test 28

Verdict: TIME LIMIT EXCEEDED

input
`43 100` view save

correct output
`DDDDDDDDDDDDDDDDDDDDDDDDDDDDDD...` view save

user output
(empty)

Test 29

Verdict: TIME LIMIT EXCEEDED

input
`45 20` view save

correct output
`DDDDDDDDDDDDDDDDDDDDDDDDDDDDDD...` view save

user output
(empty)

Test 30

Verdict: TIME LIMIT EXCEEDED

input
`56 9` view save

correct output
`RRRRRRRRDLLLLLLLDRRRRRRRDLLLLL...` view save

user output
(empty)

Test 31

Verdict: TIME LIMIT EXCEEDED

input
`97 91` view save

correct output
`-1` view save

user output
(empty)

Test 32

Verdict: ACCEPTED

input
`23 7` view save

correct output
`-1` view save

user output
`-1` view save

Test 33

Verdict: TIME LIMIT EXCEEDED

input
`90 95` view save

correct output
`RRRRRRRRRRRRRRRRRRRRRRRRRRRRRR...` view save

user output
(empty)

Test 34

Verdict: TIME LIMIT EXCEEDED

input
`9 24` view save

correct output
`DDDDDDDDRUUUUUUURDDDDDDDRUUUUU...` view save

user output
(empty)

Test 35

Verdict: ACCEPTED

input
`88 3` view save

correct output
`RRDLDRDLDRDLDRDLDRDLDRDLDRDLDR...` view save

user output
`DDDDDDDDDDDDDDDDDDDDDDDDDDDDDD...` Truncated

Test 36

Verdict: ACCEPTED

input
`3 38` view save

correct output
`DDRURDRURDRURDRURDRURDRURDRURD...` view save

user output
`DDRRRRRRRRRRRRRRRRRRRRRRRRRRRR...` Truncated

Test 37

Verdict: TIME LIMIT EXCEEDED

input
`111 119` view save

correct output
`-1` view save

user output
(empty)

Test 38

Verdict: TIME LIMIT EXCEEDED

input
`84 200` view save

correct output
`DDDDDDDDDDDDDDDDDDDDDDDDDDDDDD...` view save

user output
(empty)

Test 39

Verdict: TIME LIMIT EXCEEDED

input
`88 38` view save

correct output
`DDDDDDDDDDDDDDDDDDDDDDDDDDDDDD...` view save

user output
(empty)

Test 40

Verdict: TIME LIMIT EXCEEDED

input
`111 16` view save

correct output
`DDDDDDDDDDDDDDDDDDDDDDDDDDDDDD...` view save

user output
(empty)

Test 41

Verdict: TIME LIMIT EXCEEDED

input
`194 181` view save

correct output
`RRRRRRRRRRRRRRRRRRRRRRRRRRRRRR...` view save

user output
(empty)

Test 42

Verdict: TIME LIMIT EXCEEDED

input
`46 12` view save

correct output
`DDDDDDDDDDDDDDDDDDDDDDDDDDDDDD...` view save

user output
(empty)

Test 43

Verdict: TIME LIMIT EXCEEDED

input
`179 190` view save

correct output
`DDDDDDDDDDDDDDDDDDDDDDDDDDDDDD...` view save

user output
(empty)

Test 44

Verdict: TIME LIMIT EXCEEDED

input
`17 47` view save

correct output
`-1` view save

user output
(empty)

Test 45

Verdict: ACCEPTED

input
`175 4` view save

correct output
`DDDDDDDDDDDDDDDDDDDDDDDDDDDDDD...` view save

user output
`DDDDDDDDDDDDDDDDDDDDDDDDDDDDDD...` Truncated

Test 46

Verdict: ACCEPTED

input
`4 74` view save

correct output
`DDDRUURDDRUURDDRUURDDRUURDDRUU...` view save

user output
`DDDRRRRRRRRRRRRRRRRRRRRRRRRRRR...` Truncated

Test 47

Verdict: TIME LIMIT EXCEEDED

input
`550 594` view save

correct output
`DDDDDDDDDDDDDDDDDDDDDDDDDDDDDD...` view save

user output
(empty)

Test 48

Verdict: TIME LIMIT EXCEEDED

input
`418 998` view save

correct output
`DDDDDDDDDDDDDDDDDDDDDDDDDDDDDD...` view save

user output
(empty)

Test 49

Verdict: TIME LIMIT EXCEEDED

input
`437 186` view save

correct output
`DDDDDDDDDDDDDDDDDDDDDDDDDDDDDD...` view save

user output
(empty)

Test 50

Verdict: TIME LIMIT EXCEEDED

input
`552 72` view save

correct output
`DDDDDDDDDDDDDDDDDDDDDDDDDDDDDD...` view save

user output
(empty)

Test 51

Verdict: TIME LIMIT EXCEEDED

input
`968 901` view save

correct output
`RRRRRRRRRRRRRRRRRRRRRRRRRRRRRR...` view save

user output
(empty)

Test 52

Verdict: TIME LIMIT EXCEEDED

input
`223 57` view save

correct output
`-1` view save

user output
(empty)

Test 53

Verdict: TIME LIMIT EXCEEDED

input
`893 948` view save

correct output
`DDDDDDDDDDDDDDDDDDDDDDDDDDDDDD...` view save

user output
(empty)

Test 54

Verdict: TIME LIMIT EXCEEDED

input
`78 229` view save

correct output
`RRRRRRRRRRRRRRRRRRRRRRRRRRRRRR...` view save

user output
(empty)

Test 55

Verdict: TIME LIMIT EXCEEDED

input
`874 13` view save

correct output
`RRRRRRRRRRRRDLLLLLLLLLLLDRRRRR...` view save

user output
(empty)

Test 56

Verdict: TIME LIMIT EXCEEDED

input
`12 366` view save

correct output
`DDDDDDDDDDDRUUUUUUUUUURDDDDDDD...` view save

user output
(empty)

Aalto Competitive Programming 2024 - wk9 - Mon

Chess board tour

Code

Test details

Test 1

Test 2

Test 3

Test 4

Test 5

Test 6

Test 7

Test 8

Test 9

Test 10

Test 11

Test 12

Test 13

Test 14

Test 15

Test 16

Test 17

Test 18

Test 19

Test 20

Test 21

Test 22

Test 23

Test 24

Test 25

Test 26

Test 27

Test 28

Test 29

Test 30

Test 31

Test 32

Test 33

Test 34

Test 35

Test 36

Test 37

Test 38

Test 39

Test 40

Test 41

Test 42

Test 43

Test 44

Test 45

Test 46

Test 47

Test 48

Test 49

Test 50

Test 51

Test 52

Test 53

Test 54

Test 55

Test 56

Tasks

Submissions (ZDHKLV)