CSES - Putka Open 2020 – 4/5

CSES - Putka Open 2020 – 4/5 - Results

Submission details
Task:	Ruudukko
Sender:	Mahtimursu
Submission time:	2020-11-07 19:55:55 +0200
Language:	C++ (C++11)
Status:	READY
Result:	5

Feedback
group	verdict	score
#1	ACCEPTED	5
#2	WRONG ANSWER	0
#3	WRONG ANSWER	0
#4	WRONG ANSWER	0
#5	WRONG ANSWER	0

Test results
test	verdict	time	group
#1	ACCEPTED	0.01 s	1, 5	details
#2	WRONG ANSWER	0.01 s	2, 5	details
#3	WRONG ANSWER	0.01 s	3, 5	details
#4	WRONG ANSWER	0.01 s	4, 5	details
#5	WRONG ANSWER	0.01 s	5	details
#6	WRONG ANSWER	0.01 s	5	details
#7	WRONG ANSWER	0.01 s	2, 5	details
#8	WRONG ANSWER	0.01 s	2, 5	details
#9	WRONG ANSWER	0.01 s	3, 5	details
#10	WRONG ANSWER	0.01 s	3, 5	details
#11	WRONG ANSWER	0.01 s	3, 5	details
#12	WRONG ANSWER	0.01 s	3, 5	details
#13	WRONG ANSWER	0.01 s	4, 5	details
#14	WRONG ANSWER	0.01 s	5	details
#15	WRONG ANSWER	0.01 s	3, 5	details
#16	WRONG ANSWER	0.01 s	5	details

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;
    } 
 
    // https://ipsc.ksp.sk/2013/real/solutions/booklet.pdf Tehtävä G
 
    int sq = n*m;
    int c = m;
 
    int sc = (y1 + x1) % 2;
    int fc = (y2 + x2) % 2;
    if (sq % 2 == 0 && sc == fc) {
        cout << "NO";
        return;
    }
 
    if (sq & 1 && sc == 1 && fc == 1) {
        cout << "NO";
        return;
    }
 
    if (sq & 1 && sc != fc) {
        cout << "NO";
        return;
    }
 
    if (n == 2 && y1 != y2 && abs(x1 - x2) <= 1) {
        if (max(x1 + x2, 2*c-x1-x2+2) < sq) {
            cout << "NO";
            return;
        }
    } 
 
    if (n == 3 && c % 2 == 0 && sc != fc) {
        if ((y1 == 2 && x1 < x2) || (x1 < x2 - 1)) {
            cout << "NO";
            return;
        }
    }
}
 
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;
}
 
/*bool vis[50][50];
string path;
string ans;
int n, m, y2, x2;
 
int dirs[4][2] = {
    {1, 0},
    {-1, 0},
    {0, 1},
    {0, -1}
};
 
string pd = "DURL";
 
bool inside(int y, int x) {
    return y >= 0 && y < n && x >= 0 && x < m;
}
 
void rec(int y, int x, int steps) {
    if (vis[y][x] || ans != "X") return;
    if (steps + 1 == n*m) {
        if (y == y2 && x == x2) {
            ans = path;
        }
        return;
    }
 
    vis[y][x] = 1;
 
    for (int i = 0; i < 4; ++i) {
        int ty = y + dirs[i][0];
        int tx = x + dirs[i][1];
 
        path[steps] = pd[i];
 
        if (!inside(ty, tx)) continue;
 
        rec(ty, tx, steps + 1);
    }
    
    vis[y][x] = 0;
} */
 
/*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;*/

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 ...` view save

correct output
`YES LLLLLLLLLLLLLLLLLLLLLLLLLLLLLL...` view save

user output
`YES LLLLLLLLLLLLLLLLLLLLLLLLLLLLLL...` Truncated

Test 2

Group: 2, 5

Verdict: WRONG ANSWER

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 ...` view save

correct output
`NO NO NO NO YES ...` view save

user output
`NO NO NO NO ...` Truncated

Test 3

Group: 3, 5

Verdict: WRONG ANSWER

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 ...` view save

correct output
`NO NO NO YES RRRRRRRUULDLULDLULDLLUR ...` view save

user output
`NO NO ...` Truncated

Test 4

Group: 4, 5

Verdict: WRONG ANSWER

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 ...` view save

correct output
`YES DDRRRRRRULLLLLURRRRRULLLLLLLDD...` view save

user output
`NO NO ...` Truncated

Test 5

Group: 5

Verdict: WRONG ANSWER

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 ...` view save

correct output
`NO YES LURULURULURULURULURRDDDDDDDDDR...` view save

user output
`NO NO ...` Truncated

Test 6

Group: 5

Verdict: WRONG ANSWER

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 ...` view save

correct output
`YES LLLLLLLLLLLLDRRRRRRRRRRRRDLLLL...` view save

user output
`NO NO NO ...` Truncated

Test 7

Group: 2, 5

Verdict: WRONG ANSWER

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 ...` view save

correct output
`YES LLDRRRU NO NO NO ...` view save

user output
`NO NO NO NO ...` Truncated

Test 8

Group: 2, 5

Verdict: WRONG ANSWER

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 ...` view save

correct output
`YES LDRRURRDL YES RRRDLLLLU NO ...` view save

user output
`NO NO NO ...` Truncated

Test 9

Group: 3, 5

Verdict: WRONG ANSWER

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 ...` view save

correct output
`YES DDRRRUULLDR NO YES URRRDDLULDL ...` view save

user output
`NO NO ...` Truncated

Test 10

Group: 3, 5

Verdict: WRONG ANSWER

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 ...` view save

correct output
`NO NO YES UURRRRDDLULDLU NO ...` view save

user output
`NO NO NO ...` Truncated

Test 11

Group: 3, 5

Verdict: WRONG ANSWER

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 ...` view save

correct output
`NO NO NO YES LLLDRRRRURDRUULLLLLLLDD ...` view save

user output
`NO NO NO ...` Truncated

Test 12

Group: 3, 5

Verdict: WRONG ANSWER

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 ...` view save

correct output
`NO NO NO NO NO ...` view save

user output
`NO NO NO NO NO ...` Truncated

Test 13

Group: 4, 5

Verdict: WRONG ANSWER

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 ...` view save

correct output
`YES DDLUUURRDDDRUUU YES UUURRRDLDRDLLUU NO ...` view save

user output
`NO NO ...` Truncated

Test 14

Group: 5

Verdict: WRONG ANSWER

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 ...` view save

correct output
`YES DLDDDDDRUUUURDDDDRUURDDRRULURU...` view save

user output
`...` Truncated

Test 15

Group: 3, 5

Verdict: WRONG ANSWER

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 ...` view save

correct output
`YES RRRRRRRUULDLULDLULDLULDLDLULDL...` view save

user output
`...` Truncated

Test 16

Group: 5

Verdict: WRONG ANSWER

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 ...` view save

correct output
`YES DDDDDDDDDDDDDDDDDDDDDRUUUUUUUU...` view save

user output
`...` Truncated

Putka Open 2020 – 4/5

Ruudukko

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

Tasks

Submissions (Mahtimursu)