| Task: | Tontti |
| Sender: | MusserO |
| Submission time: | 2015-10-11 01:05:30 +0300 |
| Language: | C++ |
| Status: | READY |
| Result: | 0 |
| group | verdict | score |
|---|---|---|
| #1 | RUNTIME ERROR | 0 |
| #2 | TIME LIMIT EXCEEDED | 0 |
| #3 | TIME LIMIT EXCEEDED | 0 |
| test | verdict | time | group | |
|---|---|---|---|---|
| #1 | RUNTIME ERROR | 0.12 s | 1 | details |
| #2 | ACCEPTED | 0.06 s | 1 | details |
| #3 | ACCEPTED | 0.05 s | 1 | details |
| #4 | WRONG ANSWER | 0.06 s | 1 | details |
| #5 | ACCEPTED | 0.07 s | 1 | details |
| #6 | TIME LIMIT EXCEEDED | -- | 2 | details |
| #7 | TIME LIMIT EXCEEDED | -- | 2 | details |
| #8 | TIME LIMIT EXCEEDED | -- | 2 | details |
| #9 | TIME LIMIT EXCEEDED | -- | 2 | details |
| #10 | TIME LIMIT EXCEEDED | -- | 2 | details |
| #11 | TIME LIMIT EXCEEDED | -- | 3 | details |
| #12 | TIME LIMIT EXCEEDED | -- | 3 | details |
| #13 | TIME LIMIT EXCEEDED | -- | 3 | details |
| #14 | TIME LIMIT EXCEEDED | -- | 3 | details |
| #15 | TIME LIMIT EXCEEDED | -- | 3 | details |
Code
#include <iostream>
#include <algorithm>
#include <vector>
using namespace std;
vector<pair<pair<int,int>,int> > p;
int h(int **r, int n, int m, int t, int k, int x, int y){
if (find(p.begin(), p.end(), make_pair(make_pair(x, y),k)) != p.end() ||
x+1 < k || y+1 < k || x >= m || y >= n) return 0;
p.push_back(make_pair(make_pair(x, y),k));
int v = 0;
int w;
if (x == k-1 && y == k-1) {w = r[y][x];
} else if (x == k-1) {w = r[y][x] - r[y-k][x];
} else if (y == k-1) {w = r[y][x] - r[y][x-k];
} else {w = r[y][x] - r[y][x-k] - r[y-k][x] + r[y-k][x-k];}
if (w < t){
v += h(r, n, m, t, k+1, x+1, y+1);
} else if (w > t) {
v += h(r, n, m, t, k-1, x, y-1);
v += h(r, n, m, t, k-1, x-1, y);
} else {
++v;
v += h(r, n, m, t, k+1, x+1, y+1);
v += h(r, n, m, t, k-1, x, y-1);
v += h(r, n, m, t, k-1, x-1, y);
}
return v;
}
int main(int argc, char** argv) {
int n, m, t;
cin >> n >> m >> t;
string s;
int **r = new int*[n];
for (int i = 0; i < n; ++i){
r[i] = new int[m];
cin >> s;
for (int j = 0; j < m; ++j){
if (i == 0 && j == 0) r[i][j] = s[j] == '*';
else if (i == 0) r[i][j] = r[i][j-1] + (s[j] == '*');
else if (j == 0) r[i][j] = r[i-1][j] + (s[j] == '*');
else r[i][j] = (s[j] == '*') + r[i][j-1] + r[i-1][j] - r[i-1][j-1];
}
}
cout << h(r, n, m, t, 1, 0, 0) << "\n";
return 0;
}
Test details
Test 1
Group: 1
Verdict: RUNTIME ERROR
| input |
|---|
| 10 10 1 ......*... .......*.. *..*....*. *....*.... ... |
| correct output |
|---|
| 94 |
| user output |
|---|
| (empty) |
Test 2
Group: 1
Verdict: ACCEPTED
| input |
|---|
| 10 10 5 ********** ********** ********** ********** ... |
| correct output |
|---|
| 0 |
| user output |
|---|
| 0 |
Test 3
Group: 1
Verdict: ACCEPTED
| input |
|---|
| 10 10 10 **...*...* *..*.**.*. ...**.*..* *...**.*.. ... |
| correct output |
|---|
| 4 |
| user output |
|---|
| 4 |
Test 4
Group: 1
Verdict: WRONG ANSWER
| input |
|---|
| 10 10 5 ****...... *.*.**..** ....*.*..* ...*.***.. ... |
| correct output |
|---|
| 16 |
| user output |
|---|
| 15 |
Test 5
Group: 1
Verdict: ACCEPTED
| input |
|---|
| 10 10 2 **.***..*. ...*.*.... .***.*...* ***.***..* ... |
| correct output |
|---|
| 30 |
| user output |
|---|
| 30 |
Test 6
Group: 2
Verdict: TIME LIMIT EXCEEDED
| input |
|---|
| 500 500 1 ................................. |
| correct output |
|---|
| 9552040 |
| user output |
|---|
| (empty) |
Test 7
Group: 2
Verdict: TIME LIMIT EXCEEDED
| input |
|---|
| 500 500 5 ................................. |
| correct output |
|---|
| 1536063 |
| user output |
|---|
| (empty) |
Test 8
Group: 2
Verdict: TIME LIMIT EXCEEDED
| input |
|---|
| 500 500 25000 **...*...**..*.*..*.**.*..*.*.... |
| correct output |
|---|
| 288 |
| user output |
|---|
| (empty) |
Test 9
Group: 2
Verdict: TIME LIMIT EXCEEDED
| input |
|---|
| 500 500 12500 **.**.*..*...*.**...*.***........ |
| correct output |
|---|
| 786 |
| user output |
|---|
| (empty) |
Test 10
Group: 2
Verdict: TIME LIMIT EXCEEDED
| input |
|---|
| 500 500 5000 .*.*.**..*.*.**.**..*..**...*.... |
| correct output |
|---|
| 1763 |
| user output |
|---|
| (empty) |
Test 11
Group: 3
Verdict: TIME LIMIT EXCEEDED
| input |
|---|
| 2000 2000 1 ................................. |
| correct output |
|---|
| 489611392 |
| user output |
|---|
| (empty) |
Test 12
Group: 3
Verdict: TIME LIMIT EXCEEDED
| input |
|---|
| 2000 2000 5 ................................. |
| correct output |
|---|
| 120725884 |
| user output |
|---|
| (empty) |
Test 13
Group: 3
Verdict: TIME LIMIT EXCEEDED
| input |
|---|
| 2000 2000 400000 ..*..**.**.**.*.***...**.*..**... |
| correct output |
|---|
| 1849 |
| user output |
|---|
| (empty) |
Test 14
Group: 3
Verdict: TIME LIMIT EXCEEDED
| input |
|---|
| 2000 2000 200000 ***.*....*.*..*....**..*..*.*.... |
| correct output |
|---|
| 2665 |
| user output |
|---|
| (empty) |
Test 15
Group: 3
Verdict: TIME LIMIT EXCEEDED
| input |
|---|
| 2000 2000 80000 **.**...*.***.**....**.*....*.... |
| correct output |
|---|
| 5587 |
| user output |
|---|
| (empty) |
