CSES - Datatähti 2016 alku - Results
Submission details
Task:Tontti
Sender:nagrodus
Submission time:2015-10-11 01:19:40 +0300
Language:C++
Status:READY
Result:0
Feedback
groupverdictscore
#10
#20
#30
Test results
testverdicttimegroup
#10.05 s1details
#2ACCEPTED0.05 s1details
#30.05 s1details
#40.05 s1details
#50.05 s1details
#60.12 s2details
#70.13 s2details
#80.07 s2details
#90.07 s2details
#100.09 s2details
#11--3details
#12--3details
#13--3details
#14--3details
#15--3details

Compiler report

input/code.cpp: In function 'int main(int, char**)':
input/code.cpp:7: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: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>
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];
for (int i = 0; i < yMax; i++){
int t = 0;
scanf("%s", line);
for (int j = 0; j < xMax; j++){
if (line[j] == '*')
t++;
arr[(i*xMax) + j] = t;
}
}
delete[] line;
for (int i = 0; i < xMax; i++){
int t = 0;
for (int j = 0; j < yMax; j++){
t += arr[(j*xMax) + i];
arr[(j*xMax) + i] = t;
}
}
int areas = 0;
int a = ceil(sqrt((double)target));
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-1,xT = x+a -1;
int trees = arr[(yT*xMax) + xT];
if ((xT - a) >= 0)
trees -= arr[(yT*xMax) + xT - a];
if ((yT - a) >= 0){
trees -= arr[((yT*xMax) - a) + xT];
if ((xT-a)>=0)
trees += arr[((yT*xMax)-a) + (xT - a)];
}
if (trees == target)
areas++;
}
}
a++;
}
printf("%d", areas);
delete[] arr;
return 0;
}

Test details

Test 1

Group: 1

Verdict:

input
10 10 1
......*...
.......*..
*..*....*.
*....*....
...

correct output
94

user output
52

Test 2

Group: 1

Verdict: ACCEPTED

input
10 10 5
**********
**********
**********
**********
...

correct output
0

user output
0

Test 3

Group: 1

Verdict:

input
10 10 10
**...*...*
*..*.**.*.
...**.*..*
*...**.*..
...

correct output
4

user output
0

Test 4

Group: 1

Verdict:

input
10 10 5
****......
*.*.**..**
....*.*..*
...*.***..
...

correct output
16

user output
2

Test 5

Group: 1

Verdict:

input
10 10 2
**.***..*.
...*.*....
.***.*...*
***.***..*
...

correct output
30

user output
6

Test 6

Group: 2

Verdict:

input
500 500 1
.................................

correct output
9552040

user output
4937679

Test 7

Group: 2

Verdict:

input
500 500 5
.................................

correct output
1536063

user output
610780

Test 8

Group: 2

Verdict:

input
500 500 25000
**...*...**..*.*..*.**.*..*.*....

correct output
288

user output
0

Test 9

Group: 2

Verdict:

input
500 500 12500
**.**.*..*...*.**...*.***........

correct output
786

user output
0

Test 10

Group: 2

Verdict:

input
500 500 5000
.*.*.**..*.*.**.**..*..**...*....

correct output
1763

user output
0

Test 11

Group: 3

Verdict:

input
2000 2000 1
.................................

correct output
489611392

user output
(empty)

Test 12

Group: 3

Verdict:

input
2000 2000 5
.................................

correct output
120725884

user output
(empty)

Test 13

Group: 3

Verdict:

input
2000 2000 400000
..*..**.**.**.*.***...**.*..**...

correct output
1849

user output
(empty)

Test 14

Group: 3

Verdict:

input
2000 2000 200000
***.*....*.*..*....**..*..*.*....

correct output
2665

user output
(empty)

Test 15

Group: 3

Verdict:

input
2000 2000 80000
**.**...*.***.**....**.*....*....

correct output
5587

user output
(empty)