CSES - Datatähti 2023 loppu

Submission details
Task:	Ruudukko
Sender:	a256
Submission time:	2023-01-21 16:55:49 +0200
Language:	C++ (C++11)
Status:	READY
Result:	36

Feedback
group	verdict	score
#1	ACCEPTED	11
#2	ACCEPTED	25
#3	WRONG ANSWER	0

Test results
test	verdict	time	group
#1	ACCEPTED	0.00 s	1, 2, 3	details
#2	ACCEPTED	0.00 s	1, 2, 3	details
#3	ACCEPTED	0.00 s	1, 2, 3	details
#4	ACCEPTED	0.00 s	1, 2, 3	details
#5	ACCEPTED	0.00 s	1, 2, 3	details
#6	ACCEPTED	0.00 s	1, 2, 3	details
#7	ACCEPTED	0.00 s	1, 2, 3	details
#8	ACCEPTED	0.00 s	1, 2, 3	details
#9	ACCEPTED	0.00 s	1, 2, 3	details
#10	ACCEPTED	0.00 s	1, 2, 3	details
#11	ACCEPTED	0.00 s	1, 2, 3	details
#12	ACCEPTED	0.00 s	1, 2, 3	details
#13	ACCEPTED	0.00 s	1, 2, 3	details
#14	ACCEPTED	0.00 s	1, 2, 3	details
#15	ACCEPTED	0.00 s	1, 2, 3	details
#16	ACCEPTED	0.00 s	1, 2, 3	details
#17	ACCEPTED	0.00 s	2, 3	details
#18	ACCEPTED	0.01 s	2, 3	details
#19	ACCEPTED	0.01 s	2, 3	details
#20	ACCEPTED	0.01 s	2, 3	details
#21	ACCEPTED	0.01 s	2, 3	details
#22	ACCEPTED	0.01 s	2, 3	details
#23	ACCEPTED	0.00 s	2, 3	details
#24	ACCEPTED	0.01 s	2, 3	details
#25	ACCEPTED	0.05 s	3	details
#26	ACCEPTED	0.05 s	3	details
#27	ACCEPTED	0.05 s	3	details
#28	ACCEPTED	0.05 s	3	details
#29	ACCEPTED	0.05 s	3	details
#30	ACCEPTED	0.05 s	3	details
#31	ACCEPTED	0.05 s	3	details
#32	WRONG ANSWER	0.05 s	3	details
#33	ACCEPTED	0.05 s	3	details
#34	ACCEPTED	0.05 s	3	details
#35	ACCEPTED	0.05 s	3	details
#36	ACCEPTED	0.05 s	3	details

Compiler report

input/code.cpp: In function 'void snake()':
input/code.cpp:84:21: warning: unused variable 's' [-Wunused-variable]
   84 |                 int s = 0;
      |                     ^

Code

#include <bits/stdc++.h>
using namespace std;
#define F first
#define S second
typedef long long ll;

array<string,4> manr[4][4];

void man(int n, int m){
	manr[0][0]  [0] = ".";

	manr[1][0]  [0] = ".";
	manr[1][0]  [1] = ".";

	manr[2][0]  [0] = ".";
	manr[2][0]  [1] = ".";
	manr[2][0]  [2] = ".";

	manr[3][0]  [0] = ".";
	manr[3][0]  [1] = ".";
	manr[3][0]  [2] = ".";
	manr[3][0]  [3] = ".";

	manr[1][1]  [0] = ".#";
	manr[1][1]  [1] = "..";

	manr[2][1]  [0] = "..";
	manr[2][1]  [1] = "#.";
	manr[2][1]  [2] = "..";

	manr[3][1]  [0] = "..";
	manr[3][1]  [1] = "#.";
	manr[3][1]  [2] = "..";
	manr[3][1]  [3] = "#.";

	manr[2][2]  [0] = "..#";
	manr[2][2]  [1] = ".#.";
	manr[2][2]  [2] = "...";

	manr[2][2]  [0] = "..#";
	manr[2][2]  [1] = ".#.";
	manr[2][2]  [2] = "...";

	manr[3][2]  [0] = "..#";
	manr[3][2]  [1] = ".#.";
	manr[3][2]  [2] = "...";
	manr[3][2]  [3] = ".#.";

	manr[3][3]  [0] = "..#.";
	manr[3][3]  [1] = ".#..";
	manr[3][3]  [2] = "..#.";
	manr[3][3]  [3] = "#...";

	--n; --m;

	if(n >= m){
		for(int i=0; i<=n; ++i){
			cout << manr[n][m][i] << '\n';
		}
	} else {
		for(int i=0; i<=n; ++i){
			for(int j=0; j<=m; ++j){
				cout << manr[m][n] [j][i];
			}
			cout << '\n';
		}
	}
}

int n,m;
char v[1100][1100];

void snake(){
	int x = 2;
	int l = n-1;
	if(m == 3) l += 1;
	for(int y = 0; y<l; ++y){
		v[y][x] = '#';
		if(x == 2)
			x = 1;
		else x = 2;
	}
	if(m == 3){
		int s = 0;
		for(int y = 0; y < n; y += 4){
			v[y][2] = '.';
		}
		if(v[n-1][1] == '#' && v[n-2][2] == '#'){
			v[n-1][1] = '.';
		}
		if(v[n-1][1] == '.' && v[n-2][1] == '.')
			v[n-1][0] = '#';
	} else {
		if(!(n & 1))
			v[n-1][0] = '#';
		else v[n-1][3] = '#';
	}
}

void siksak(int y, int x, int s){
	for(; y < n-1; ++y){
		v[y][x+s] = '#';
		s = !s;
	}
}

void solve(){
	int s = 1;
	for(int i = 1; i < m; i += 3){
		siksak(0, i, s);
		s = !s;
	}
	int x;
	if(n & 1)
		x = 3;
	else 
		x = 0;
	for(; x < m; x += 6)
		v[n-1][x] = '#';

	if(m % 3 == 0){
		int alku;
		if(m & 1) alku = 2;
		else alku = 1;
		for(int y = alku; y < n; y += 4){
			v[y][m-1] = '.';
		}
	}
}

int main(){
	cin >> n >> m;
	if(n < 5 && m < 5){
		man(n,m);
		return 0;
	}
	memset(v,'.',sizeof v);
	if(m < 5)
			snake();
	else if(n < 5){
			int t = n; n = m; m = t;
			snake();
			for(int i = 0; i < m; ++i){
				for(int j = 0; j<n; ++j){
					cout << v[j][i];
				}
				cout << '\n';
			}
			return 0;
	} else {
			solve();
			for(int y = 0; y < n-1; ++y){
				for(int x = 0; x<m-1; ++x){
					int a = v[y][x];
					int b = v[y][x+1];
					int c = v[y+1][x];
					int d = v[y+1][x+1];
					if(a == b && b == c && c == d){
						v[y+1][x+1] = '#';
					}
				}
			}
	}
	for(int i = 0; i < n; ++i){
		for(int j = 0; j<m; ++j){
			cout << v[i][j];
		}
		cout << '\n';
	}
}

Test details

Test 1

Group: 1, 2, 3

Verdict: ACCEPTED

input
`1 1` view save

correct output
`.` view save

user output
`.` view save

Test 2

Group: 1, 2, 3

Verdict: ACCEPTED

input
`1 2` view save

correct output
`..` view save

user output
`..` view save

Test 3

Group: 1, 2, 3

Verdict: ACCEPTED

input
`1 3` view save

correct output
`...` view save

user output
`...` view save

Test 4

Group: 1, 2, 3

Verdict: ACCEPTED

input
`1 4` view save

correct output
`....` view save

user output
`....` view save

Test 5

Group: 1, 2, 3

Verdict: ACCEPTED

input
`2 1` view save

correct output
`. .` view save

user output
`. .` view save

Test 6

Group: 1, 2, 3

Verdict: ACCEPTED

input
`2 2` view save

correct output
`.# ..` view save

user output
`.# ..` view save

Test 7

Group: 1, 2, 3

Verdict: ACCEPTED

input
`2 3` view save

correct output
`.#. ...` view save

user output
`.#. ...` view save

Test 8

Group: 1, 2, 3

Verdict: ACCEPTED

input
`2 4` view save

correct output
`.#.# ....` view save

user output
`.#.# ....` view save

Test 9

Group: 1, 2, 3

Verdict: ACCEPTED

input
`3 1` view save

correct output
`. . .` view save

user output
`. . .` view save

Test 10

Group: 1, 2, 3

Verdict: ACCEPTED

input
`3 2` view save

correct output
`.# .. .#` view save

user output
`.. #. ..` view save

Test 11

Group: 1, 2, 3

Verdict: ACCEPTED

input
`3 3` view save

correct output
`.#. ... .#.` view save

user output
`..# .#. ...` view save

Test 12

Group: 1, 2, 3

Verdict: ACCEPTED

input
`3 4` view save

correct output
`.#.# .... .#.#` view save

user output
`.... .#.# #...` view save

Test 13

Group: 1, 2, 3

Verdict: ACCEPTED

input
`4 1` view save

correct output
`. . . .` view save

user output
`. . . .` view save

Test 14

Group: 1, 2, 3

Verdict: ACCEPTED

input
`4 2` view save

correct output
`.. .# .. #.` view save

user output
`.. #. .. #.` view save

Test 15

Group: 1, 2, 3

Verdict: ACCEPTED

input
`4 3` view save

correct output
`... .#. ..# #..` view save

user output
`..# .#. ... .#.` view save

Test 16

Group: 1, 2, 3

Verdict: ACCEPTED

input
`4 4` view save

correct output
`.... .#.# ..#. #...` view save

user output
`..#. .#.. ..#. #...` view save

Test 17

Group: 2, 3

Verdict: ACCEPTED

input
`999 1` view save

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

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

Test 18

Group: 2, 3

Verdict: ACCEPTED

input
`999 2` view save

correct output
`.# .. .# .. #. ...` view save

user output
`.. .# .. .# .. ...` Truncated

Test 19

Group: 2, 3

Verdict: ACCEPTED

input
`999 3` view save

correct output
`.#. ... .#. ..# #.. ...` view save

user output
`... .#. ..# .#. ... ...` Truncated

Test 20

Group: 2, 3

Verdict: ACCEPTED

input
`999 4` view save

correct output
`.#.# .... .#.# ..#. #... ...` view save

user output
`..#. .#.. ..#. .#.. ..#. ...` Truncated

Test 21

Group: 2, 3

Verdict: ACCEPTED

input
`1000 1` view save

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

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

Test 22

Group: 2, 3

Verdict: ACCEPTED

input
`1000 2` view save

correct output
`.. .# .. #. .. ...` view save

user output
`.. .# .. .# .. ...` Truncated

Test 23

Group: 2, 3

Verdict: ACCEPTED

input
`1000 3` view save

correct output
`... .#. ..# #.. ..# ...` view save

user output
`... .#. ..# .#. ... ...` Truncated

Test 24

Group: 2, 3

Verdict: ACCEPTED

input
`1000 4` view save

correct output
`.... .#.# ..#. #... ..#. ...` view save

user output
`..#. .#.. ..#. .#.. ..#. ...` Truncated

Test 25

Group: 3

Verdict: ACCEPTED

input
`999 995` view save

correct output
`.#.#.#.#.#.#.#.#.#.#.#.#.#.#.#...` view save

user output
`..#.#...#.#...#.#...#.#...#.#....` Truncated

Test 26

Group: 3

Verdict: ACCEPTED

input
`999 996` view save

correct output
`.#.#.#.#.#.#.#.#.#.#.#.#.#.#.#...` view save

user output
`..#.#...#.#...#.#...#.#...#.#....` Truncated

Test 27

Group: 3

Verdict: ACCEPTED

input
`999 997` view save

correct output
`.#.#.#.#.#.#.#.#.#.#.#.#.#.#.#...` view save

user output
`..#.#...#.#...#.#...#.#...#.#....` Truncated

Test 28

Group: 3

Verdict: ACCEPTED

input
`999 998` view save

correct output
`.#.#.#.#.#.#.#.#.#.#.#.#.#.#.#...` view save

user output
`..#.#...#.#...#.#...#.#...#.#....` Truncated

Test 29

Group: 3

Verdict: ACCEPTED

input
`999 999` view save

correct output
`.#.#.#.#.#.#.#.#.#.#.#.#.#.#.#...` view save

user output
`..#.#...#.#...#.#...#.#...#.#....` Truncated

Test 30

Group: 3

Verdict: ACCEPTED

input
`999 1000` view save

correct output
`.#.#.#.#.#.#.#.#.#.#.#.#.#.#.#...` view save

user output
`..#.#...#.#...#.#...#.#...#.#....` Truncated

Test 31

Group: 3

Verdict: ACCEPTED

input
`1000 995` view save

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

user output
`..#.#...#.#...#.#...#.#...#.#....` Truncated

Test 32

Group: 3

Verdict: WRONG ANSWER

input
`1000 996` view save

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

user output
`..#.#...#.#...#.#...#.#...#.#....` Truncated

Test 33

Group: 3

Verdict: ACCEPTED

input
`1000 997` view save

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

user output
`..#.#...#.#...#.#...#.#...#.#....` Truncated

Test 34

Group: 3

Verdict: ACCEPTED

input
`1000 998` view save

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

user output
`..#.#...#.#...#.#...#.#...#.#....` Truncated

Test 35

Group: 3

Verdict: ACCEPTED

input
`1000 999` view save

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

user output
`..#.#...#.#...#.#...#.#...#.#....` Truncated

Test 36

Group: 3

Verdict: ACCEPTED

input
`1000 1000` view save

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

user output
`..#.#...#.#...#.#...#.#...#.#....` Truncated

Datatähti 2023 loppu

Ruudukko

Compiler report

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

Test 17

Test 18

Test 19

Test 20

Test 21

Test 22

Test 23

Test 24

Test 25

Test 26

Test 27

Test 28

Test 29

Test 30

Test 31

Test 32

Test 33

Test 34

Test 35

Test 36

Tasks

Submissions (a256)