CSES - Putka Open 2020 – 4/5 - Results
Submission details
Task:Ruudukko
Sender:hltk
Submission time:2020-11-08 13:01:39 +0200
Language:C++ (C++17)
Status:READY
Result:17
Feedback
groupverdictscore
#1ACCEPTED5
#2ACCEPTED12
#30
#40
#50
Test results
testverdicttimegroup
#1ACCEPTED0.01 s1, 5details
#2ACCEPTED0.01 s2, 5details
#30.01 s3, 5details
#40.01 s4, 5details
#50.01 s5details
#60.01 s5details
#7ACCEPTED0.01 s2, 5details
#8ACCEPTED0.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>
using namespace std;

// 1....2
string solve1xn1(int n, int m, int i, int j, int di, int dj){
	if(minmax(1,m) != minmax(j,dj)) return "";
	return string(m-1, j==1 ? 'R' : 'L');
}

// 1...
// 2...
string solve2xn1(int n, int m, int i, int j, int di, int dj){
	if(j != dj || (j != m && j != 1)) return "";
	string r;
	r += solve1xn1(1, m, 1, j, 1, m - j + 1);
	r += i == 1 ? "D" : "U";
	r += solve1xn1(1, m, 1, m - j + 1, 1, j);
	return r;
}

// ..12.
// .....
string solve2xn2(int n, int m, int i, int j, int di, int dj){
	if(abs(dj - j) != 1 || i != di) return "";
	string r;
	r += solve2xn1(n, j < dj ? j : m - j + 1, i, j < dj ? j : 1, i == 1 ? 2 : 1, j < dj ? j : 1);
	r += j < dj ? "R" : "L";
	r += solve2xn1(n, j < dj ? m - dj + 1 : dj, i == 1 ? 2 : 1, j < dj ? 1 : dj, i, j < dj ? 1 : dj);
	return r;
}

// 1..2
// ....
string solve2xn3(int n, int m, int i, int j, int di, int dj){
	if(minmax(1,m) != minmax(j,dj) || m % 2 != 0 || i != di) return "";
	string r;
	r += i == 1 ? "D" : "U";
	r += j == 1 ? "R" : "L";
	for(int k=0; k<m-2; k+=2){
		r += i == 1 ? "U" : "D";
		r += j == 1 ? "R" : "L";
		r += i == 1 ? "D" : "U";
		r += j == 1 ? "R" : "L";
	}
	r += i == 1 ? "U" : "D";
	return r;
}

// .1..2.
// ......
string solve2xn4(int n, int m, int i, int j, int di, int dj){
	if(abs(dj - j) % 2 != 1 || i != di) return "";
	string r;
	r += solve2xn1(n, j < dj ? j : m - j + 1, i, j < dj ? j : 1, i == 1 ? 2 : 1, j < dj ? j : 1);
	r += j < dj ? "R" : "L";
	if(abs(dj - j) > 1){
		r += solve2xn3(n, abs(dj - j) - 1, i == 1 ? 2 : 1, j < dj ? 1 : abs(dj - j) - 1, i == 1 ? 2 : 1, j < dj ? abs(dj - j) - 1 : 1);
	}
	r += j < dj ? "R" : "L";
	r += solve2xn1(n, j < dj ? m - dj + 1 : dj, i == 1 ? 2 : 1, j < dj ? 1 : dj, i, j < dj ? 1 : dj);
	return r;
}

// 1....
// ....2
string solve2xn5(int n, int m, int i, int j, int di, int dj){
	if(minmax(1,m) != minmax(j,dj) || m % 2 != 1 || i == di) return "";
	if(m == 1){
		return i == 1 ? "D" : "U";
	}
	string r;
	r += i == 1 ? "D" : "U";
	r += j == 1 ? "R" : "L";
	for(int k=0; k<m-4; k+=2){
		r += i == 1 ? "U" : "D";
		r += j == 1 ? "R" : "L";
		r += i == 1 ? "D" : "U";
		r += j == 1 ? "R" : "L";
	}
	r += i == 1 ? "U" : "D";
	r += j == 1 ? "R" : "L";
	r += i == 1 ? "D" : "U";
	return r;
}

// ..1......
// ......2..
string solve2xn6(int n, int m, int i, int j, int di, int dj){
	if(abs(dj - j) % 2 != 0 || i == di || abs(dj - j) < 2) return "";
	string r;
	r += solve2xn1(n, j < dj ? j : m - j + 1, i, j < dj ? j : 1, di, j < dj ? j : 1);
	r += j < dj ? "R" : "L";
	if(abs(dj - j) > 0){
		r += solve2xn5(n, abs(dj - j) - 1, di, j < dj ? 1 : abs(dj - j) - 1, i, j < dj ? abs(dj - j) - 1 : 1);
	}
	r += j < dj ? "R" : "L";
	r += solve2xn1(n, j < dj ? m - dj + 1 : dj, i, j < dj ? 1 : dj, di, j < dj ? 1 : dj);
	return r;
}

string solve1xn(int n, int m, int i, int j, int di, int dj){
	if (string k = solve1xn1(n,m,i,j,di,dj); !k.empty()) return "YES\n" + k;
	return "NO";
}

string solve2xn(int n, int m, int i, int j, int di, int dj){
	if (string k = solve2xn1(n,m,i,j,di,dj); !k.empty()) return "YES\n" + k;
	if (string k = solve2xn2(n,m,i,j,di,dj); !k.empty()) return "YES\n" + k;
	if (string k = solve2xn3(n,m,i,j,di,dj); !k.empty()) return "YES\n" + k;
	if (string k = solve2xn4(n,m,i,j,di,dj); !k.empty()) return "YES\n" + k;
	if (string k = solve2xn5(n,m,i,j,di,dj); !k.empty()) return "YES\n" + k;
	if (string k = solve2xn6(n,m,i,j,di,dj); !k.empty()) return "YES\n" + k;
	return "NO";
}

string solve(int n, int m, int i, int j, int di, int dj){
	if(n == 1) return solve1xn(n,m,i,j,di,dj);
	if(n == 2) return solve2xn(n,m,i,j,di,dj);
	throw;
}

int main(){
	int tc;
	cin>>tc;
	while(tc--){
		int n, m, i, j, di, dj;
		cin >> n >> m >> i >> j >> di >> dj;
		cout << solve(n,m,i,j,di,dj) << '\n';
	}
}

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: ACCEPTED

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
YES
...
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
(empty)

Error:
terminate called without an active exception

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
(empty)

Error:
terminate called without an active exception

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
(empty)

Error:
terminate called without an active exception

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
(empty)

Error:
terminate called without an active exception

Test 7

Group: 2, 5

Verdict: ACCEPTED

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
YES
LLDRRRU
NO
NO
NO
...
Truncated

Test 8

Group: 2, 5

Verdict: ACCEPTED

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
YES
RRRDLLLLU
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
(empty)

Error:
terminate called without an active exception

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
(empty)

Error:
terminate called without an active exception

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
(empty)

Error:
terminate called without an active exception

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
(empty)

Error:
terminate called without an active exception

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
(empty)

Error:
terminate called without an active exception

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
(empty)

Error:
terminate called without an active exception

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
(empty)

Error:
terminate called without an active exception

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
(empty)

Error:
terminate called without an active exception