— Dark mode

Putka Open 2020 – 4/5

Ruudukko

  • Start: 2020-11-06 18:00:00
  • End: 2020-11-08 23:00:00
CSES - Putka Open 2020 – 4/5 - Results
Submission details
Task:Ruudukko
Sender:Gomhog
Submission time:2020-11-07 02:07:14 +0200
Language:C++11
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>
typedef long long ll;
typedef long double ld;
#define F first
#define S second

using namespace std;

const string yes="YES\n";
const string no="NO\n";

void solve(int n, int m, int y1, int x1, int y2, int x2) {
	char up='U';
	char dow='D';
	char le='L';
	char ri='R';
	if (n>m) {
		swap(n,m);
		swap(y1,x1);
		swap(y2,x2);
		swap(up,le);
		swap(dow,ri);
	}
	if (y1>y2 || (y1==y2 && 2*y1>n+1)) {
		y1=n+1-y1;
		y2=n+1-y2;
		swap(up,dow);
	}
	if (x1>x2 || (x1==x2 && 2*x2>m+1)) {
		x1=m+1-x1;
		x2=m+1-x2;
		swap(le,ri);
	}
	if (n==1) {
		if (x1>1 || x2<m) {
			cout<<no;
		} else {
			cout<<yes;
			for (int i=1;i<m;i++) cout<<ri;
			cout<<"\n";
		}
		return;
	}
	if (n==2) {
		if ((y1+x1+y2+x2)%2==0 || (x1==x2 && x1!=1)) {
			cout<<no;
		} else {
			cout<<yes;
			if (x1==x2) {
				for (int i=1;i<m;i++) cout<<ri;
				cout<<dow;
				for (int i=1;i<m;i++) cout<<le;
				cout<<"\n";
				return;
			}
			for (int j=1;j<x1;j++) cout<<le;
			cout<<dow;
			for (int j=1;j<x1;j++) cout<<ri;
			for (int j=1;j<x2-x1;j++) {
				cout<<ri;
				if (j%2==1) cout<<up;
				else cout<<dow;
			}
			cout<<ri;
			for (int j=x2;j<m;j++) cout<<ri;
			if ((x2-x1)%2==1) cout<<up;
			else cout<<dow;
			for (int j=x2;j<m;j++) cout<<le;
			cout<<"\n";
		}
		return;
	}
	cout<<no;
}

int main() {
	ios_base::sync_with_stdio(false);
	cin.tie(0);
	int tst;
	cin>>tst;
	for (int t=0;t<tst;t++) {
		int n,m,y1,x1,y2,x2;
		cin>>n>>m>>y1>>x1>>y2>>x2;
		solve(n,m,y1,x1,y2,x2);
	}
/*	solve(2,10,1,1,1,2);
	for (int j=1;j<=3;j++) solve(2,3,1,2,2,j);*/
}

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

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

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

user output
NO
NO
NO
NO
YES
...
view save

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

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

user output
NO
NO
NO
NO
NO
...
view save

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

correct output
YES
DDRRRRRRULLLLLURRRRRULLLLLLLDD...
view save

user output
NO
NO
NO
NO
NO
...
view save

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

correct output
NO
YES
LURULURULURULURULURRDDDDDDDDDR...
view save

user output
NO
NO
NO
NO
NO
...
view save

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

correct output
YES
LLLLLLLLLLLLDRRRRRRRRRRRRDLLLL...
view save

user output
NO
NO
NO
YES
UUUUUUUUUUUULDDDDDDDDDDDDDRDLD...
view save

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

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

user output
YES
LLDRRRU
NO
NO
NO
...
view save

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

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

user output
YES
LDRRURRDL
YES
RRRDLLLLU
NO
...
view save

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

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

user output
NO
NO
NO
NO
NO
...
view save

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

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

user output
NO
NO
NO
NO
NO
...
view save

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

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

user output
NO
NO
NO
NO
NO
...
view save

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

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

user output
NO
NO
NO
NO
NO
...
view save

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

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

user output
NO
NO
NO
NO
NO
...
view save

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

correct output
YES
DLDDDDDRUUUURDDDDRUURDDRRULURU...
view save

user output
NO
NO
NO
NO
NO
...
view save

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

correct output
YES
RRRRRRRUULDLULDLULDLULDLDLULDL...
view save

user output
NO
NO
NO
NO
NO
...
view save

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

correct output
YES
DDDDDDDDDDDDDDDDDDDDDRUUUUUUUU...
view save

user output
NO
NO
NO
NO
NO
...
view save

Tasks

A Neliöt-B Peli-C Tekijät-D Ruudukko-

Submissions (Gomhog)

2020-11-09 10:49:42 1002020-11-07 20:20:54 1002020-11-07 20:06:04 1002020-11-07 19:10:57 442020-11-07 19:01:34 172020-11-07 18:44:13 52020-11-07 18:33:30 02020-11-07 18:25:18 02020-11-07 02:07:14 172020-11-06 20:59:54 52020-11-06 20:54:16 5