Task: | Tontti |
Sender: | nagrodus |
Submission time: | 2015-10-11 17:08:29 +0300 |
Language: | C++ |
Status: | READY |
Result: | 14 |
group | verdict | score |
---|---|---|
#1 | ACCEPTED | 14 |
#2 | WRONG ANSWER | 0 |
#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.05 s | 1 | details |
#4 | ACCEPTED | 0.05 s | 1 | details |
#5 | ACCEPTED | 0.06 s | 1 | details |
#6 | ACCEPTED | 0.13 s | 2 | details |
#7 | ACCEPTED | 0.14 s | 2 | details |
#8 | WRONG ANSWER | 0.07 s | 2 | details |
#9 | WRONG ANSWER | 0.09 s | 2 | details |
#10 | WRONG ANSWER | 0.10 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 |
Compiler report
input/code.cpp: In function 'int main(int, char**)': input/code.cpp:8:42: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result] scanf("%d %d %d", &yMax, &xMax, &target); ^ input/code.cpp:12:19: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result] scanf("%s", line); ^ input/code.cpp:20:20: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result] scanf("%s", line); ^
Code
#include <stdio.h> #include <math.h> #include <iostream> int main(int argc, char* argv[]) { int yMax, xMax, target; scanf("%d %d %d", &yMax, &xMax, &target); char *arr = new char[yMax*xMax]; char *line = new char[xMax + 1]; int t = 0; scanf("%s", line); for (int j = 0; j < xMax; j++){ if (line[j] == '*') t++; arr[j] = t; } for (int i = 1; i < yMax; i++){ t = 0; scanf("%s", line); for (int j = 0; j < xMax; j++){ if (line[j] == '*') t++; arr[(i*xMax) + j] = t + arr[((i-1)*xMax) + j]; } } delete[] line; long long areas = 0; int a = ceil(sqrt((double)target))-1; while (a < xMax && a < yMax){ for (int y = 0; y < yMax - a; y++){ for (int x = 0; x < xMax - a; x++){ int yT = y + a,xT = x+a ; int trees = arr[(yT*xMax) + xT]; if (!(x==0)) trees -= arr[(yT*xMax) +( x -1)]; if (!(y==0)){ trees -= arr[((y-1)*xMax) + xT]; if (!(x==0)) trees += arr[((y-1)*xMax) + (x -1)]; } if (trees == target) areas++; } } a++; } printf("%lld", areas); delete[] arr; 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: WRONG ANSWER
input |
---|
500 500 25000 **...*...**..*.*..*.**.*..*.*.... |
correct output |
---|
288 |
user output |
---|
0 |
Test 9
Group: 2
Verdict: WRONG ANSWER
input |
---|
500 500 12500 **.**.*..*...*.**...*.***........ |
correct output |
---|
786 |
user output |
---|
0 |
Test 10
Group: 2
Verdict: WRONG ANSWER
input |
---|
500 500 5000 .*.*.**..*.*.**.**..*..**...*.... |
correct output |
---|
1763 |
user output |
---|
0 |
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) |