CSES - Putka Open 2020 – 4/5 - Results
Submission details
Task:Ruudukko
Sender:Mahtimursu
Submission time:2020-11-06 19:31:36 +0200
Language:C++ (C++11)
Status:READY
Result:5
Feedback
groupverdictscore
#1ACCEPTED5
#20
#30
#40
#50
Test results
testverdicttimegroup
#1ACCEPTED0.01 s1, 5details
#20.01 s2, 5details
#30.01 s3, 5details
#40.01 s4, 5details
#50.01 s5details
#60.01 s5details
#70.01 s2, 5details
#80.01 s2, 5details
#90.01 s3, 5details
#100.01 s3, 5details
#110.01 s3, 5details
#120.01 s3, 5details
#130.01 s4, 5details
#140.01 s5details
#150.01 s3, 5details
#160.01 s5details

Code

#include <bits/stdc++.h>

typedef long long ll;

#define M 1000000007

using namespace std;

void test_case() {
	int n, m, y1, x1, y2, x2;
	cin >> n >> m >> y1 >> x1 >> y2 >> x2;

    if (n == 1) {
        if (x1 == 1 && x2 == m) {
            cout << "YES\n";
            for (int i = 1; i < m; ++i) {
                cout << "R";
            }
        } else if (x1 == m && x2 == 1) {
            cout << "YES\n";
            for (int i = 1; i < m; ++i) {
                cout << "L";
            }
        } else {
            cout << "NO";
        }
        return;
    } 

    // Kuljetaan aina piiloon?

    int px = x1;
    int py = y1;

    bool vis[51][51];

    for (int i = 0; i <= 50; ++i) {
        for (int j = 0; j <= 50; ++j) {
            vis[i][j] = 0;
        }
    }

    int dirs[4][2] = {
        {1, 0},
        {0, 1},
        {-1, 0},
        {0, -1}
    };

    int vt = 1;

    string path;

    string cd = "RDLU";

    while (vt + 1 < n*m) {
        // valitaan suunta

        int bd = 1e9;
        int bdx = 0, bdy = 0;
        char c;
        //cout << "at: " << py << ", " << px << endl;
        vis[py][px] = 1;
        int i = -1;
        for (auto d : dirs) {
            int tx = px + d[0];
            int ty = py + d[1];
            i++;
            if (tx < 1 || tx > m || ty < 1 || ty > n) continue;
            if (vis[ty][tx]) continue;
            if (tx == x2 && ty == y2) continue;
            int td = min(ty - 1, n - ty) + min(tx - 1, m - tx);
            if (td < bd) {
                c = cd[i];
                bd = td;
                bdx = d[0];
                bdy = d[1];
            }
            
        }

        //cout << "dif: " << bdy << ", " << bdx << endl;

        if (bd == 1e9) {
            cout << "NO";
            return;
        } else {
            px += bdx;
            py += bdy;
            path += c;
        }
        vt++;
    }

    if (px + 1 == x2) path += "R";
    else if (px - 1 == x2) path += "L";
    else if (py + 1 == y2) path += "D";
    else path += "U";

    cout << "YES\n";
    cout << path;
}

int main() {
	ios_base::sync_with_stdio(false);
	cin.tie(0);
	int t;
	cin >> t;
	for (int i = 0; i < t; ++i) {
		test_case();
		cout << "\n";
	}

	return 0;
}

Test details

Test 1

Group: 1, 5

Verdict: ACCEPTED

input
100
1 45 1 45 1 1
1 18 1 1 1 10
1 47 1 17 1 30
1 33 1 28 1 20
...

correct output
YES
LLLLLLLLLLLLLLLLLLLLLLLLLLLLLL...

user output
YES
LLLLLLLLLLLLLLLLLLLLLLLLLLLLLL...
Truncated

Test 2

Group: 2, 5

Verdict:

input
100
2 43 1 33 1 21
2 2 1 1 2 2
2 32 1 1 2 8
2 14 1 12 1 14
...

correct output
NO
NO
NO
NO
YES
...

user output
NO
NO
NO
NO
NO
...
Truncated

Test 3

Group: 3, 5

Verdict:

input
100
3 4 2 1 2 4
3 38 2 24 1 22
3 29 2 23 2 3
3 8 3 1 1 2
...

correct output
NO
NO
NO
YES
RRRRRRRUULDLULDLULDLLUR
...

user output
NO
NO
NO
NO
NO
...
Truncated

Test 4

Group: 4, 5

Verdict:

input
100
4 25 2 19 1 5
4 13 3 10 4 12
4 7 3 1 4 2
4 23 1 19 2 5
...

correct output
YES
DDRRRRRRULLLLLURRRRRULLLLLLLDD...

user output
NO
NO
NO
NO
NO
...
Truncated

Test 5

Group: 5

Verdict:

input
100
16 8 13 1 14 8
41 21 19 11 32 12
46 17 13 7 6 11
8 41 4 32 4 12
...

correct output
NO
YES
LURULURULURULURULURRDDDDDDDDDR...

user output
NO
NO
NO
NO
NO
...
Truncated

Test 6

Group: 5

Verdict:

input
100
31 38 18 35 31 37
35 48 7 13 21 21
46 21 25 2 4 19
35 2 13 2 35 1
...

correct output
YES
LLLLLLLLLLLLDRRRRRRRRRRRRDLLLL...

user output
NO
NO
NO
NO
NO
...
Truncated

Test 7

Group: 2, 5

Verdict:

input
100
2 4 1 3 1 4
2 4 2 2 1 1
2 4 2 3 1 2
2 4 2 3 1 4
...

correct output
YES
LLDRRRU
NO
NO
NO
...

user output
NO
NO
NO
NO
NO
...
Truncated

Test 8

Group: 2, 5

Verdict:

input
100
2 5 1 2 2 4
2 5 1 2 1 1
2 5 2 1 1 2
2 5 1 1 1 5
...

correct output
YES
LDRRURRDL
YES
RRRDLLLLU
NO
...

user output
YES
LDRRURRDL
NO
NO
NO
...
Truncated

Test 9

Group: 3, 5

Verdict:

input
100
3 4 1 1 2 3
3 4 2 4 3 2
3 4 2 1 3 1
3 4 1 4 3 4
...

correct output
YES
DDRRRUULLDR
NO
YES
URRRDDLULDL
...

user output
YES
RRRDDLLLURR
NO
YES
URRRDDLLURD
...
Truncated

Test 10

Group: 3, 5

Verdict:

input
100
3 5 3 4 3 2
3 5 3 5 2 3
3 5 3 1 2 2
3 5 3 1 3 2
...

correct output
NO
NO
YES
UURRRRDDLULDLU
NO
...

user output
NO
NO
YES
RRRRUULDLULLDR
NO
...
Truncated

Test 11

Group: 3, 5

Verdict:

input
100
3 8 2 8 1 2
3 8 2 4 1 7
3 8 3 4 2 7
3 8 2 5 3 1
...

correct output
NO
NO
NO
YES
LLLDRRRRURDRUULLLLLLLDD
...

user output
NO
NO
NO
NO
NO
...
Truncated

Test 12

Group: 3, 5

Verdict:

input
100
3 9 1 3 2 9
3 9 1 6 1 5
3 9 3 6 2 8
3 9 3 2 3 4
...

correct output
NO
NO
NO
NO
NO
...

user output
NO
NO
YES
RRRUULLDLULLLLLDDRRRRULLLU
NO
...
Truncated

Test 13

Group: 4, 5

Verdict:

input
100
4 4 2 2 1 4
4 4 4 1 2 2
4 4 2 1 4 3
4 4 3 1 3 3
...

correct output
YES
DDLUUURRDDDRUUU
YES
UUURRRDLDRDLLUU
NO
...

user output
YES
LURRDRDDLLLURRR
YES
RRRUUULLLDDRRUL
NO
...
Truncated

Test 14

Group: 5

Verdict:

input
100
12 27 6 22 1 8
6 25 3 2 4 4
6 16 4 6 5 2
36 33 8 6 1 6
...

correct output
YES
DLDDDDDRUUUURDDDDRUURDDRRULURU...

user output
NO
NO
NO
NO
NO
...
Truncated

Test 15

Group: 3, 5

Verdict:

input
100
3 12 3 5 1 4
3 20 3 19 2 19
3 34 3 9 2 9
3 38 2 15 3 15
...

correct output
YES
RRRRRRRUULDLULDLULDLULDLDLULDL...

user output
NO
YES
RUULLDDLLLLLLLLLLLLLLLLLUURRRR...
Truncated

Test 16

Group: 5

Verdict:

input
100
50 50 29 1 16 21
50 50 37 5 23 48
50 50 32 22 45 24
50 50 6 28 12 37
...

correct output
YES
DDDDDDDDDDDDDDDDDDDDDRUUUUUUUU...

user output
NO
NO
NO
NO
NO
...
Truncated