CSES - Putka Open 2020 – 1/5 - Results
Submission details
Task:Ruudukko
Sender:AtskaFin
Submission time:2020-09-10 18:16:54 +0300
Language:C++ (C++11)
Status:READY
Result:100
Feedback
groupverdictscore
#1ACCEPTED16
#2ACCEPTED30
#3ACCEPTED54
Test results
testverdicttimegroup
#1ACCEPTED0.01 s1, 2, 3details
#2ACCEPTED0.01 s1, 2, 3details
#3ACCEPTED0.01 s1, 2, 3details
#4ACCEPTED0.01 s1, 2, 3details
#5ACCEPTED0.01 s1, 2, 3details
#6ACCEPTED0.01 s1, 2, 3details
#7ACCEPTED0.01 s2, 3details
#8ACCEPTED0.01 s2, 3details
#9ACCEPTED0.01 s2, 3details
#10ACCEPTED0.01 s2, 3details
#11ACCEPTED0.01 s2, 3details
#12ACCEPTED0.01 s2, 3details
#13ACCEPTED0.04 s3details
#14ACCEPTED0.04 s3details
#15ACCEPTED0.05 s3details
#16ACCEPTED0.05 s3details
#17ACCEPTED0.04 s3details
#18ACCEPTED0.04 s3details

Code

#include <iostream>
#include <string>
#include <algorithm>

using namespace std;

int mins[1000][1000];
int maxs[1000][1000];
string input[1000];
int n;

void search(int y, int x) {
  if (mins[y][x] > -1 || x == n || y == n) return;

  search(y, x + 1);
  search(y + 1, x);

  if (y == n - 1 && x == n - 1) {
    mins[y][x] = 0;
    maxs[y][x] = 0;
  } else if (y == n - 1) {
    mins[y][x] = mins[y][x + 1];
    maxs[y][x] = maxs[y][x + 1];
  } else if (x == n - 1) {
    mins[y][x] = mins[y + 1][x];
    maxs[y][x] = maxs[y + 1][x];
  } else {
    mins[y][x] = min(mins[y + 1][x], mins[y][x + 1]);
    maxs[y][x] = max(maxs[y + 1][x], maxs[y][x + 1]);
  }

  if (input[y][x] == 'o') {
    mins[y][x]++;
    maxs[y][x]++;
  }
}

int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  
  cin >> n;

  for (int i = 0; i < n; i++) {
    for (int j = 0; j < n; j++) {
      mins[i][j] = -1;
    }
  }

  for (int i = 0; i < n; i++) {
    cin >> input[i];
  }

  search(0, 0);

  cout << maxs[0][0] - mins[0][0] + 1 << "\n";
}

Test details

Test 1

Group: 1, 2, 3

Verdict: ACCEPTED

input
10
..........
..........
..........
..........
...

correct output
1

user output
1

Test 2

Group: 1, 2, 3

Verdict: ACCEPTED

input
10
o.o.......
..........
.o...o.oo.
..o...o.oo
...

correct output
9

user output
9

Test 3

Group: 1, 2, 3

Verdict: ACCEPTED

input
10
o......o..
oo.oo.....
oooo....oo
o.......oo
...

correct output
14

user output
14

Test 4

Group: 1, 2, 3

Verdict: ACCEPTED

input
10
..ooooo.oo
.ooo.o..oo
.....ooo.o
ooo.ooo.oo
...

correct output
12

user output
12

Test 5

Group: 1, 2, 3

Verdict: ACCEPTED

input
10
oooooooooo
ooo....ooo
.oo.oo.ooo
oooooooooo
...

correct output
10

user output
10

Test 6

Group: 1, 2, 3

Verdict: ACCEPTED

input
10
oooooooooo
oooooooooo
oooooooooo
oooooooooo
...

correct output
1

user output
1

Test 7

Group: 2, 3

Verdict: ACCEPTED

input
100
.................................

correct output
1

user output
1

Test 8

Group: 2, 3

Verdict: ACCEPTED

input
100
.........o.....o.........o..o....

correct output
114

user output
114

Test 9

Group: 2, 3

Verdict: ACCEPTED

input
100
oo..oo.oo..o...o..o.o..o.........

correct output
151

user output
151

Test 10

Group: 2, 3

Verdict: ACCEPTED

input
100
o..o.ooo..oo.o.o.o..o.o..o..oo...

correct output
143

user output
143

Test 11

Group: 2, 3

Verdict: ACCEPTED

input
100
oo..oooooooooooo.oooo.o.o.oooo...

correct output
115

user output
115

Test 12

Group: 2, 3

Verdict: ACCEPTED

input
100
oooooooooooooooooooooooooooooo...

correct output
1

user output
1

Test 13

Group: 3

Verdict: ACCEPTED

input
1000
.................................

correct output
1

user output
1

Test 14

Group: 3

Verdict: ACCEPTED

input
1000
o..........o...o...o...o.........

correct output
1121

user output
1121

Test 15

Group: 3

Verdict: ACCEPTED

input
1000
.o.............o....o.o......o...

correct output
1583

user output
1583

Test 16

Group: 3

Verdict: ACCEPTED

input
1000
oooooo.oooooo.....oooo..o...o....

correct output
1574

user output
1574

Test 17

Group: 3

Verdict: ACCEPTED

input
1000
ooooo.oo.oooooooooo...o...oo.....

correct output
1147

user output
1147

Test 18

Group: 3

Verdict: ACCEPTED

input
1000
oooooooooooooooooooooooooooooo...

correct output
1

user output
1