Task: | Tontti |
Sender: | 6502 |
Submission time: | 2015-09-30 19:04:10 +0300 |
Language: | C++ |
Status: | READY |
Result: | 0 |
group | verdict | score |
---|---|---|
#1 | WRONG ANSWER | 0 |
#2 | TIME LIMIT EXCEEDED | 0 |
#3 | TIME LIMIT EXCEEDED | 0 |
test | verdict | time | group | |
---|---|---|---|---|
#1 | WRONG ANSWER | 0.05 s | 1 | details |
#2 | WRONG ANSWER | 0.05 s | 1 | details |
#3 | WRONG ANSWER | 0.05 s | 1 | details |
#4 | WRONG ANSWER | 0.06 s | 1 | details |
#5 | WRONG ANSWER | 0.05 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 <iterator> #include <math.h> #include <stdio.h> using namespace std; int main() { cin.sync_with_stdio(false); int i, j, n, m, k, x, q, w, o, p; int sz, s; cin >> n >> m >> k; char input[n][m]; int kq = n*m; int a[kq]; int f[kq]; for (i = 0; i < n; i++) cin >> input[i]; sz = (int)ceil(sqrt((double)k)); x = 0; for (i = 0; i < n; i++) for (j = 0; j < m; j++) { a[i*m+j] = !(input[i][j]=='.'); f[i*m+j] = 0; if(k<2) x += a[i*m+j]^k^1; } int c = max(sz,2); int g = 0, h = 0, d, z, first = 1, scale = 1; for (s = c; s <= min(n,m)-1; s++) { printf("%d ",s); z = s - 1; first = 1; if (s == c) { for (i = z; i < n; i++) { if (i > 0) { q = i * m; w = q - s * m; for (o = 0; o < s; o++, q++, w++) h += (a[q] - a[w]); g = h; } scale = 0; for (j = z; j < m; j++) { d = i*m+j; if (scale) { p = (i-z)*m+j; for (o = 0; o < s; o++, p+=m) { g += (a[p] - a[p-s]); } } else if (first) { first = 0; g = f[d]; o = s * m; for (q = 0; q < o; q+=m) { for (w = 0; w < s; w++) { g += a[q+w]; } } h = g; scale = 1; } else scale = 1; f[d] = g; //printf("s:%d\ti:%d\tj:%d\tn:%d\tm:%d\tf:%d\n",s,i,j,n,m,f[d]); x += (g == k); } } } else { int v = (n - 1) * m; g = 0; h = 0; for (i = n - 1; i >= z; i--) { j = m - 1; int d = v+j; int w = f[d-m-1] + a[d]; g = 0; h = 0; p = m; for (o = 1; o < s; o++, p+=m) { g += a[d-p]; h += a[d-o]; } w += g + h; x += (w == k); f[d] = w; d--; j--; for (; j >= z; j--) { w = f[d-m-1] + a[d]; g = 0; p = d - m; q = d - z * m; for (o = p; o >= q; o -= m) { g += a[o]; } h += a[d-z] - a[d]; w += g + h; x += (w == k); f[d] = w; d--; } v -= m; } } /*for (i = 0; i < n; i++) { for (j = 0; j < m; j++) { printf("%d",f[i*m+j]); } printf("\n"); } printf("\n");*/ } cout << x << "\n"; return 0; }
Test details
Test 1
Group: 1
Verdict: WRONG ANSWER
input |
---|
10 10 1 ......*... .......*.. *..*....*. *....*.... ... |
correct output |
---|
94 |
user output |
---|
94 2 3 4 5 6 7 8 9 |
Test 2
Group: 1
Verdict: WRONG ANSWER
input |
---|
10 10 5 ********** ********** ********** ********** ... |
correct output |
---|
0 |
user output |
---|
0 3 4 5 6 7 8 9 |
Test 3
Group: 1
Verdict: WRONG ANSWER
input |
---|
10 10 10 **...*...* *..*.**.*. ...**.*..* *...**.*.. ... |
correct output |
---|
4 |
user output |
---|
4 4 5 6 7 8 9 |
Test 4
Group: 1
Verdict: WRONG ANSWER
input |
---|
10 10 5 ****...... *.*.**..** ....*.*..* ...*.***.. ... |
correct output |
---|
16 |
user output |
---|
16 3 4 5 6 7 8 9 |
Test 5
Group: 1
Verdict: WRONG ANSWER
input |
---|
10 10 2 **.***..*. ...*.*.... .***.*...* ***.***..* ... |
correct output |
---|
30 |
user output |
---|
30 2 3 4 5 6 7 8 9 |
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) |