CSES - Datatähti Open 2019 - Results
Submission details
Task:Robot
Sender:zscoder
Submission time:2019-01-18 12:57:04 +0200
Language:C++
Status:READY
Result:12
Feedback
groupverdictscore
#1ACCEPTED12
#20
#30
Test results
testverdicttimegroup
#1ACCEPTED0.03 s1details
#2ACCEPTED0.02 s1details
#3ACCEPTED0.01 s1details
#4ACCEPTED0.02 s1details
#5ACCEPTED0.01 s1details
#6ACCEPTED0.02 s1details
#7ACCEPTED0.01 s1details
#8ACCEPTED0.02 s1details
#9ACCEPTED0.01 s2details
#10ACCEPTED0.01 s2details
#11ACCEPTED0.02 s2details
#120.02 s2details
#13ACCEPTED0.01 s2details
#14--2details
#150.09 s2details
#16--2details
#17--2details
#18ACCEPTED0.01 s3details
#19ACCEPTED0.02 s3details
#20ACCEPTED0.02 s3details
#210.02 s3details
#22ACCEPTED0.02 s3details
#23--3details
#240.09 s3details
#25--3details
#26--3details
#27ACCEPTED0.01 s3details
#280.01 s3details
#290.01 s3details
#30--3details
#310.03 s3details
#32--3details
#33--3details
#34--3details
#35--3details
#360.02 s3details
#37--3details
#38--3details
#39--3details

Code

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace std;
using namespace __gnu_pbds;
 
#define fi first
#define se second
#define mp make_pair
#define pb push_back
 
typedef long long ll;
typedef pair<ll,ll> ii;
typedef vector<int> vi;
typedef unsigned long long ull;
typedef long double ld; 
typedef tree<ii, null_type, less<ii>, rb_tree_tag, tree_order_statistics_node_update> pbds;

int a[111][111];
int dx[4] = {-1,0,1,0};
int dy[4] = {0,1,0,-1};
int n,m; 
int b[111][111];
bool valid(int x, int y)
{
	return (x>=0&&x<n&&y>=0&&y<m);
}

bool vis[111][111];

int main()
{
	ios_base::sync_with_stdio(0); cin.tie(0);
	cin>>n>>m;
	if(n==2)
	{
		for(int i=0;i<m;i++)
		{
			if(i+1<m) cout<<"R";
			else cout<<"G";
		}
		cout<<'\n';
		for(int i=0;i<m;i++)
		{
			if(i==0) cout<<"R";
			else cout<<"B";
		}
		cout<<'\n';
		return 0;
	}
	if(n%4==0&&m%4==0)
	{
		cout<<"IMPOSSIBLE\n"; return 0;
	}
	ll p3=1;
	for(int i=0;i<n*m-1;i++) p3*=3;
	for(ll i=0;i<p3;i++)
	{
		ll bit=i;
		for(int j=0;j<n;j++)
		{
			for(int k=0;k<m;k++)
			{
				b[j][k]=a[j][k]=bit%3;
				bit/=3;
			}
		}
		memset(vis,0,sizeof(vis));
		ii cur=mp(0,0); int dir=1;
		vis[cur.fi][cur.se]=1; int cnt=1; bool pos=1;
		for(int steps=0;steps<1000;steps++)
		{
			ii nw = mp(cur.fi+dx[dir],cur.se+dy[dir]);
			if(valid(nw.fi,nw.se))
			{
				if(!vis[nw.fi][nw.se])
				{
					vis[nw.fi][nw.se]=1; cnt++;
				}
				if(a[nw.fi][nw.se]!=a[cur.fi][cur.se])
				{
					dir++; dir%=4;
				}
				a[cur.fi][cur.se]++; a[cur.fi][cur.se]%=3;
				cur=nw;
			}
			else
			{
				pos=0; break;
			}
			if(steps>=299){pos=0; break;}
			if(cnt==n*m&&cur.fi==0&&cur.se==0) break;
		}
		if(pos)
		{
			for(int i=0;i<n;i++)
			{
				for(int j=0;j<m;j++)
				{
					cout<<b[i][j];
				}
				cout<<'\n';
			}
			return 0;
		}
		if(i%10000==0) cerr<<i<<" COMPLETE\n";
	}
}

Test details

Test 1

Group: 1

Verdict: ACCEPTED

input
2 2

correct output
RG
GR

user output
RG
RB

Test 2

Group: 1

Verdict: ACCEPTED

input
2 4

correct output
RRRG
GRRR

user output
RRRG
RBBB

Test 3

Group: 1

Verdict: ACCEPTED

input
2 6

correct output
RRRRRG
GRRRRR

user output
RRRRRG
RBBBBB

Test 4

Group: 1

Verdict: ACCEPTED

input
2 10

correct output
RRRRRRRRRG
GRRRRRRRRR

user output
RRRRRRRRRG
RBBBBBBBBB

Test 5

Group: 1

Verdict: ACCEPTED

input
2 50

correct output
RRRRRRRRRRRRRRRRRRRRRRRRRRRRRR...

user output
RRRRRRRRRRRRRRRRRRRRRRRRRRRRRR...
Truncated

Test 6

Group: 1

Verdict: ACCEPTED

input
2 80

correct output
RRRRRRRRRRRRRRRRRRRRRRRRRRRRRR...

user output
RRRRRRRRRRRRRRRRRRRRRRRRRRRRRR...
Truncated

Test 7

Group: 1

Verdict: ACCEPTED

input
2 98

correct output
RRRRRRRRRRRRRRRRRRRRRRRRRRRRRR...

user output
RRRRRRRRRRRRRRRRRRRRRRRRRRRRRR...
Truncated

Test 8

Group: 1

Verdict: ACCEPTED

input
2 100

correct output
RRRRRRRRRRRRRRRRRRRRRRRRRRRRRR...

user output
RRRRRRRRRRRRRRRRRRRRRRRRRRRRRR...
Truncated

Test 9

Group: 2

Verdict: ACCEPTED

input
2 2

correct output
RG
GR

user output
RG
RB

Test 10

Group: 2

Verdict: ACCEPTED

input
2 4

correct output
RRRG
GRRR

user output
RRRG
RBBB

Test 11

Group: 2

Verdict: ACCEPTED

input
2 6

correct output
RRRRRG
GRRRRR

user output
RRRRRG
RBBBBB

Test 12

Group: 2

Verdict:

input
4 2

correct output
RG
GG
GG
GR

user output
01
11
11
10

Error:
0 COMPLETE

Test 13

Group: 2

Verdict: ACCEPTED

input
4 4

correct output
IMPOSSIBLE

user output
IMPOSSIBLE

Test 14

Group: 2

Verdict:

input
4 6

correct output
RRRRRG
GBGRGG
GGRBRG
GRRBRR

user output
(empty)

Test 15

Group: 2

Verdict:

input
6 2

correct output
RG
GG
GG
GG
GG
...

user output
01
11
11
11
11
...

Error:
0 COMPLETE
10000 COMPLETE
20000 COMPLETE
30000 COMPLETE
40000 COMPLETE
50000 COMPLETE
6000...

Test 16

Group: 2

Verdict:

input
6 4

correct output
RRRG
RGBG
RRGG
BBGG
GRBG
...

user output
(empty)

Test 17

Group: 2

Verdict:

input
6 6

correct output
RRRRRG
GBGRBG
GGGBBG
GGGBBG
GGRBRG
...

user output
(empty)

Test 18

Group: 3

Verdict: ACCEPTED

input
2 2

correct output
RG
GR

user output
RG
RB

Test 19

Group: 3

Verdict: ACCEPTED

input
2 4

correct output
RRRG
GRRR

user output
RRRG
RBBB

Test 20

Group: 3

Verdict: ACCEPTED

input
2 6

correct output
RRRRRG
GRRRRR

user output
RRRRRG
RBBBBB

Test 21

Group: 3

Verdict:

input
4 2

correct output
RG
GG
GG
GR

user output
01
11
11
10

Error:
0 COMPLETE

Test 22

Group: 3

Verdict: ACCEPTED

input
4 4

correct output
IMPOSSIBLE

user output
IMPOSSIBLE

Test 23

Group: 3

Verdict:

input
4 6

correct output
RRRRRG
GBGRGG
GGRBRG
GRRBRR

user output
(empty)

Test 24

Group: 3

Verdict:

input
6 2

correct output
RG
GG
GG
GG
GG
...

user output
01
11
11
11
11
...

Error:
0 COMPLETE
10000 COMPLETE
20000 COMPLETE
30000 COMPLETE
40000 COMPLETE
50000 COMPLETE
6000...

Test 25

Group: 3

Verdict:

input
6 4

correct output
RRRG
RGBG
RRGG
BBGG
GRBG
...

user output
(empty)

Test 26

Group: 3

Verdict:

input
6 6

correct output
RRRRRG
GBGRBG
GGGBBG
GGGBBG
GGRBRG
...

user output
(empty)

Test 27

Group: 3

Verdict: ACCEPTED

input
2 100

correct output
RRRRRRRRRRRRRRRRRRRRRRRRRRRRRR...

user output
RRRRRRRRRRRRRRRRRRRRRRRRRRRRRR...
Truncated

Test 28

Group: 3

Verdict:

input
4 20

correct output
RRRRRRRRRRRRRRRRRRRG
GBBBBBBBBBBBBBBBGRGG
GGRRRRRRRRRRRRRRRBRG
GRRRRRRRRRRRRRRRRBRR

user output
IMPOSSIBLE

Test 29

Group: 3

Verdict:

input
4 100

correct output
RRRRRRRRRRRRRRRRRRRRRRRRRRRRRR...

user output
IMPOSSIBLE

Test 30

Group: 3

Verdict:

input
10 10

correct output
RRRRRRRRRG
GBGRBBGRBG
GGGBBGGBBG
GGGBBGGBBG
GGGBBGGBBG
...

user output
(empty)

Test 31

Group: 3

Verdict:

input
12 12

correct output
RRRRRRRRRRRG
RGBBGRBBGRBG
RRBGGBBGGBBG
RRBGGBBGGBBG
RRBGGBBGGBBG
...

user output
IMPOSSIBLE

Test 32

Group: 3

Verdict:

input
10 12

correct output
RRRRRRRRRRRG
RGBBGRBBGRBG
RRBGGBBGGBBG
RRBGGBBGGBBG
RRBGGBBGGBBG
...

user output
(empty)

Test 33

Group: 3

Verdict:

input
12 10

correct output
RRRRRRRRRG
GBGRBBGRBG
GGGBBGGBBG
GGGBBGGBBG
GGGBBGGBBG
...

user output
(empty)

Test 34

Group: 3

Verdict:

input
10 90

correct output
RRRRRRRRRRRRRRRRRRRRRRRRRRRRRR...

user output
(empty)

Test 35

Group: 3

Verdict:

input
90 10

correct output
RRRRRRRRRG
GBGRBBGRBG
GGGBBGGBBG
GGGBBGGBBG
GGGBBGGBBG
...

user output
(empty)

Test 36

Group: 3

Verdict:

input
100 100

correct output
RRRRRRRRRRRRRRRRRRRRRRRRRRRRRR...

user output
IMPOSSIBLE

Test 37

Group: 3

Verdict:

input
98 100

correct output
RRRRRRRRRRRRRRRRRRRRRRRRRRRRRR...

user output
(empty)

Test 38

Group: 3

Verdict:

input
100 98

correct output
RRRRRRRRRRRRRRRRRRRRRRRRRRRRRR...

user output
(empty)

Test 39

Group: 3

Verdict:

input
98 98

correct output
RRRRRRRRRRRRRRRRRRRRRRRRRRRRRR...

user output
(empty)