CSES - Putka Open 2020 – 1/5

CSES - Putka Open 2020 – 1/5 - Results

Submission details
Task:	Ruudukko
Sender:	Guuber
Submission time:	2020-09-05 01:56:09 +0300
Language:	C++ (C++11)
Status:	READY
Result:	100

Feedback
group	verdict	score
#1	ACCEPTED	16
#2	ACCEPTED	30
#3	ACCEPTED	54

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

Code

#include<bits/stdc++.h>
using namespace std;
 
int ruudukkol[1000][1000];
int ruudukkomin[1000][1000];
int ruudukkomax[1000][1000];
 
int main(){
	int n;
	cin >> n;
	for(int i = 0; i < n; i++){
		for(int j = 0; j < n; j++){
			char a;
			cin >> a;
			if(a == '.'){
				ruudukkol[i][j] = 0;
			}else ruudukkol[i][j] = 1;
		}
	}
	
	for(int i = 0; i < n; i++){
		for(int j = 0; j < n; j++){
			if(i == 0){
				if(j == 0){
					if(ruudukkol[i][j] == 0){
						ruudukkomin[i][j] = 0;
						ruudukkomax[i][j] = 0;
					}else{
						ruudukkomin[i][j] = 1;
						ruudukkomax[i][j] = 1;
					}
				}else{
					if(ruudukkol[i][j] == 0){
						ruudukkomin[i][j] = ruudukkomin[i][j-1];
						ruudukkomax[i][j] = ruudukkomax[i][j-1];
					}else{
						ruudukkomin[i][j] = 1 + ruudukkomin[i][j-1];
						ruudukkomax[i][j] = 1 + ruudukkomax[i][j-1];
					}
				}
			}else{
				if(j == 0){
					if(ruudukkol[i][j] == 0){
						ruudukkomin[i][j] = ruudukkomin[i-1][j];
						ruudukkomax[i][j] = ruudukkomax[i-1][j];
					}else{
						ruudukkomin[i][j] = 1 + ruudukkomin[i-1][j];
						ruudukkomax[i][j] = 1 + ruudukkomax[i-1][j];
					}
				}else{
					if(ruudukkol[i][j] == 0){
						ruudukkomin[i][j] = min(ruudukkomin[i-1][j], ruudukkomin[i][j-1]);
						ruudukkomax[i][j] = max(ruudukkomax[i-1][j], ruudukkomax[i][j-1]);
					}else{
						ruudukkomin[i][j] = 1 + min(ruudukkomin[i-1][j], ruudukkomin[i][j-1]);
						ruudukkomax[i][j] = 1 + max(ruudukkomax[i-1][j], ruudukkomax[i][j-1]);
					}
				}
			}
		}
	}
	for(int i = 0; i < n; i++){
		for(int j = 0; j < n; j++){
			//cout << ruudukko[i][j].size() << " ";
		}
		//cout << "\n";
	}
//	for(auto u : ruudukko[n-1][n-1]) cout << u << " ";
//	cout<< "\n";
	cout << ruudukkomax[n-1][n-1] - ruudukkomin[n-1][n-1] + 1 << "\n";
}

Test details

Test 1

Group: 1, 2, 3

Verdict: ACCEPTED

input
`10 .......... .......... .......... .......... ...` view save

correct output
`1` view save

user output
`1` view save

Test 2

Group: 1, 2, 3

Verdict: ACCEPTED

input
`10 o.o....... .......... .o...o.oo. ..o...o.oo ...` view save

correct output
`9` view save

user output
`9` view save

Test 3

Group: 1, 2, 3

Verdict: ACCEPTED

input
`10 o......o.. oo.oo..... oooo....oo o.......oo ...` view save

correct output
`14` view save

user output
`14` view save

Test 4

Group: 1, 2, 3

Verdict: ACCEPTED

input
`10 ..ooooo.oo .ooo.o..oo .....ooo.o ooo.ooo.oo ...` view save

correct output
`12` view save

user output
`12` view save

Test 5

Group: 1, 2, 3

Verdict: ACCEPTED

input
`10 oooooooooo ooo....ooo .oo.oo.ooo oooooooooo ...` view save

correct output
`10` view save

user output
`10` view save

Test 6

Group: 1, 2, 3

Verdict: ACCEPTED

input
`10 oooooooooo oooooooooo oooooooooo oooooooooo ...` view save

correct output
`1` view save

user output
`1` view save

Test 7

Group: 2, 3

Verdict: ACCEPTED

input
`100 .................................` view save

correct output
`1` view save

user output
`1` view save

Test 8

Group: 2, 3

Verdict: ACCEPTED

input
`100 .........o.....o.........o..o....` view save

correct output
`114` view save

user output
`114` view save

Test 9

Group: 2, 3

Verdict: ACCEPTED

input
`100 oo..oo.oo..o...o..o.o..o.........` view save

correct output
`151` view save

user output
`151` view save

Test 10

Group: 2, 3

Verdict: ACCEPTED

input
`100 o..o.ooo..oo.o.o.o..o.o..o..oo...` view save

correct output
`143` view save

user output
`143` view save

Test 11

Group: 2, 3

Verdict: ACCEPTED

input
`100 oo..oooooooooooo.oooo.o.o.oooo...` view save

correct output
`115` view save

user output
`115` view save

Test 12

Group: 2, 3

Verdict: ACCEPTED

input
`100 oooooooooooooooooooooooooooooo...` view save

correct output
`1` view save

user output
`1` view save

Test 13

Group: 3

Verdict: ACCEPTED

input
`1000 .................................` view save

correct output
`1` view save

user output
`1` view save

Test 14

Group: 3

Verdict: ACCEPTED

input
`1000 o..........o...o...o...o.........` view save

correct output
`1121` view save

user output
`1121` view save

Test 15

Group: 3

Verdict: ACCEPTED

input
`1000 .o.............o....o.o......o...` view save

correct output
`1583` view save

user output
`1583` view save

Test 16

Group: 3

Verdict: ACCEPTED

input
`1000 oooooo.oooooo.....oooo..o...o....` view save

correct output
`1574` view save

user output
`1574` view save

Test 17

Group: 3

Verdict: ACCEPTED

input
`1000 ooooo.oo.oooooooooo...o...oo.....` view save

correct output
`1147` view save

user output
`1147` view save

Test 18

Group: 3

Verdict: ACCEPTED

input
`1000 oooooooooooooooooooooooooooooo...` view save

correct output
`1` view save

user output
`1` view save

Putka Open 2020 – 1/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

Test 17

Test 18

Tasks

Submissions (Guuber)