| Task: | Ruudukko |
| Sender: | AtskaFin |
| Submission time: | 2020-09-04 23:53:51 +0300 |
| Language: | C++ (C++11) |
| Status: | READY |
| Result: | 46 |
| group | verdict | score |
|---|---|---|
| #1 | ACCEPTED | 16 |
| #2 | ACCEPTED | 30 |
| #3 | TIME LIMIT EXCEEDED | 0 |
| 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.05 s | 2, 3 | details |
| #9 | ACCEPTED | 0.07 s | 2, 3 | details |
| #10 | ACCEPTED | 0.07 s | 2, 3 | details |
| #11 | ACCEPTED | 0.05 s | 2, 3 | details |
| #12 | ACCEPTED | 0.01 s | 2, 3 | details |
| #13 | ACCEPTED | 0.16 s | 3 | details |
| #14 | TIME LIMIT EXCEEDED | -- | 3 | details |
| #15 | TIME LIMIT EXCEEDED | -- | 3 | details |
| #16 | TIME LIMIT EXCEEDED | -- | 3 | details |
| #17 | TIME LIMIT EXCEEDED | -- | 3 | details |
| #18 | ACCEPTED | 0.16 s | 3 | details |
Code
#include <iostream>
#include <vector>
#include <set>
using namespace std;
int n;
string board[1000];
vector<int> mergeAndMakeUnique(vector<int> &a, vector<int> &b) {
set<int> s;
for (int x : a) s.insert(x);
for (int x : b) s.insert(x);
vector<int> v ( s.begin(), s.end() );
return v;
}
void increaseByOne(vector<int> &a) {
for (int i = a.size() - 1; i > -1; i--) a[i]++;
}
int main() {
cin >> n;
vector<vector<vector<int>>> grid(n, vector<vector<int>>(n));
for (int i = 0; i < n; i++) {
cin >> board[i];
}
int coins = 0;
for (int i = 0; i < n; i++) {
if (board[0][i] == 'o') coins++;
grid[0][i].push_back(coins);
}
for (int i = 1; i < n; i++) {
if (board[i][0] == 'o') {
grid[i][0].push_back(grid[i-1][0][0]+1);
} else {
grid[i][0].push_back(grid[i-1][0][0]);
}
}
for (int i = 1; i < n; i++) {
for (int j = 1; j < n; j++) {
grid[i][j] = mergeAndMakeUnique(grid[i][j-1], grid[i-1][j]);
if (board[i][j] == 'o') {
increaseByOne(grid[i][j]);
}
}
}
cout << grid[n-1][n-1].size();
}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: TIME LIMIT EXCEEDED
| input |
|---|
| 1000 o..........o...o...o...o......... |
| correct output |
|---|
| 1121 |
| user output |
|---|
| (empty) |
Test 15
Group: 3
Verdict: TIME LIMIT EXCEEDED
| input |
|---|
| 1000 .o.............o....o.o......o... |
| correct output |
|---|
| 1583 |
| user output |
|---|
| (empty) |
Test 16
Group: 3
Verdict: TIME LIMIT EXCEEDED
| input |
|---|
| 1000 oooooo.oooooo.....oooo..o...o.... |
| correct output |
|---|
| 1574 |
| user output |
|---|
| (empty) |
Test 17
Group: 3
Verdict: TIME LIMIT EXCEEDED
| input |
|---|
| 1000 ooooo.oo.oooooooooo...o...oo..... |
| correct output |
|---|
| 1147 |
| user output |
|---|
| (empty) |
Test 18
Group: 3
Verdict: ACCEPTED
| input |
|---|
| 1000 oooooooooooooooooooooooooooooo... |
| correct output |
|---|
| 1 |
| user output |
|---|
| 1 |
