Task: | Tontti |
Sender: | juhoh |
Submission time: | 2015-10-09 22:41:34 +0300 |
Language: | C++ |
Status: | READY |
Result: | 47 |
group | verdict | score |
---|---|---|
#1 | ACCEPTED | 14 |
#2 | ACCEPTED | 33 |
#3 | TIME LIMIT EXCEEDED | 0 |
test | verdict | time | group | |
---|---|---|---|---|
#1 | ACCEPTED | 0.06 s | 1 | details |
#2 | ACCEPTED | 0.05 s | 1 | details |
#3 | ACCEPTED | 0.06 s | 1 | details |
#4 | ACCEPTED | 0.05 s | 1 | details |
#5 | ACCEPTED | 0.05 s | 1 | details |
#6 | ACCEPTED | 0.22 s | 2 | details |
#7 | ACCEPTED | 0.23 s | 2 | details |
#8 | ACCEPTED | 0.22 s | 2 | details |
#9 | ACCEPTED | 0.24 s | 2 | details |
#10 | ACCEPTED | 0.22 s | 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 <algorithm> #include <cmath> #include <iostream> #include <vector> typedef long long int ll; using namespace std; const int N = 2000; int n, m, x; int field[N][N]; ll kertyma[N][N]; ll p(int x1_, int y1_, int x2, int y2) { int x1 = x1_-1; int y1 = y1_-1; int a = 0, b = 0, c = 0; if (x1 >= 0) { a = kertyma[x1][y2]; } if (y1 >= 0) { b = kertyma[x2][y1]; } if (x1 >= 0 && y1 >= 0) { c = kertyma[x1][y1]; } else { c = 0; } return kertyma[x2][y2] + c - b - a; } int main() { cin >> m >> n >> x; if (n > m) { for (int j = 0; j < m; ++j) { for (int i = 0; i < n; ++i) { char c; cin >> c; field[i][j] = c == '*'; } } } else { for (int j = 0; j < m; ++j) { for (int i = 0; i < n; ++i) { char c; cin >> c; field[j][i] = c == '*'; } } swap(n, m); } kertyma[0][0] = field[0][0]; for (int i = 1; i < n; ++i) { kertyma[i][0] = kertyma[i-1][0]+field[i][0]; } for (int j = 1; j < m; ++j) { kertyma[0][j] = kertyma[0][j-1]+field[0][j]; } for (int i = 1; i < n; ++i) { for (int j = 1; j < m; ++j) { kertyma[i][j] = field[i][j] + kertyma[i-1][j] + kertyma[i][j-1] - kertyma[i-1][j-1]; } } ll result = 0; for (int s = 1; s <= m; ++s) { for (int i = 0; i <= n-s; ++i) { for (int j = 0; j <= m-s; ++j) { if (p(i, j, i+s-1, j+s-1) == x) { ++result; } } } } cout << result << endl; return 0; }
Test details
Test 1
Group: 1
Verdict: ACCEPTED
input |
---|
10 10 1 ......*... .......*.. *..*....*. *....*.... ... |
correct output |
---|
94 |
user output |
---|
94 |
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: ACCEPTED
input |
---|
10 10 5 ****...... *.*.**..** ....*.*..* ...*.***.. ... |
correct output |
---|
16 |
user output |
---|
16 |
Test 5
Group: 1
Verdict: ACCEPTED
input |
---|
10 10 2 **.***..*. ...*.*.... .***.*...* ***.***..* ... |
correct output |
---|
30 |
user output |
---|
30 |
Test 6
Group: 2
Verdict: ACCEPTED
input |
---|
500 500 1 ................................. |
correct output |
---|
9552040 |
user output |
---|
9552040 |
Test 7
Group: 2
Verdict: ACCEPTED
input |
---|
500 500 5 ................................. |
correct output |
---|
1536063 |
user output |
---|
1536063 |
Test 8
Group: 2
Verdict: ACCEPTED
input |
---|
500 500 25000 **...*...**..*.*..*.**.*..*.*.... |
correct output |
---|
288 |
user output |
---|
288 |
Test 9
Group: 2
Verdict: ACCEPTED
input |
---|
500 500 12500 **.**.*..*...*.**...*.***........ |
correct output |
---|
786 |
user output |
---|
786 |
Test 10
Group: 2
Verdict: ACCEPTED
input |
---|
500 500 5000 .*.*.**..*.*.**.**..*..**...*.... |
correct output |
---|
1763 |
user output |
---|
1763 |
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) |