CSES - Datatähti 2016 alku - Results
Submission details
Task:Tontti
Sender:Dentosal
Submission time:2015-10-11 21:33:33 +0300
Language:C++
Status:READY
Result:0
Feedback
groupverdictscore
#10
#20
#30
Test results
testverdicttimegroup
#10.06 s1details
#2ACCEPTED0.06 s1details
#3ACCEPTED0.06 s1details
#4ACCEPTED0.06 s1details
#5ACCEPTED0.06 s1details
#60.06 s2details
#7ACCEPTED0.23 s2details
#8ACCEPTED0.23 s2details
#9ACCEPTED0.22 s2details
#10ACCEPTED0.22 s2details
#110.21 s3details
#120.13 s3details
#130.13 s3details
#140.15 s3details
#150.14 s3details

Code

#include <iostream>
#include <string>
typedef long long ll;
using namespace std;

unsigned int sumtable[500][500] = {0};

int S(int x, int y) {
    if (x<1 || y<1) {
        return 0;
    }
    return sumtable[x-1][y-1];
}

int main() {
    ll height;
    ll width;
    ll trees;

    cin >> height;
    cin >> width;
    cin >> trees;

    string temps;

    if (trees==0) {
        std::cout << 0 << std::endl;
        return 0;
    }
    if (trees==1) {
        ll sum = 0;
        for (ll y = 0; y < height; y++) {
            cin >> temps;
            for (ll x = 0; x < width; x++) {
                if (temps[x]=='*') {
                    sum++;
                }
            }
        }
        std::cout << sum << std::endl;
        return 0;
    }

    ll linesum;
    for (ll y = 0; y < height; y++) {
        linesum = 0;
        cin >> temps;
        for (ll x = 0; x < width; x++) {
            if (temps[x]=='*') {
                linesum++;
            }
            sumtable[x][y] = linesum;
            if (y!=0) {
                sumtable[x][y] += sumtable[x][y-1];
            }
        }
    }
    ll res = 0;
    for (int x = 0; x < width; x++) {
        for (int y = 0; y < height; y++) {
            for (int s = 2; s < min(width-x, height-y)+1; s++) {
                if (S(x+s,y+s)-S(x,y+s)-S(x+s,y)+S(x,y) == trees) {
                    res++;
                }
            }
        }
    }


    std::cout << res << std::endl;
    return 0;
}

Test details

Test 1

Group: 1

Verdict:

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

correct output
94

user output
10

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:

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

correct output
9552040

user output
8

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:

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

correct output
489611392

user output
9

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)