Tontti

input/code.cpp: In function 'int main()':
input/code.cpp:41:9: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     S(n); S(m); S(x);
         ^
input/code.cpp:41:15: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     S(n); S(m); S(x);
               ^
input/code.cpp:41:21: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     S(n); S(m); S(x);
                     ^

#include <iostream>
#include <vector>

using namespace std;

#define REP(n) for(__typeof(n) _i=0; _i<(n); ++_i)
#define FOR(i,a,b) for(__typeof(b) i=a; i<b; ++i)
#define FORE(i,a,b) for(__typeof(b) i=a; i<=b; ++i)
#define S(x) scanf("%d", &(x))

typedef long long LL;

#define MAX(a,b) ((a)<(b) ? (b) : (a))

int s[2001][2001];
char f[2000][2000];

// How many trees in k*k square where bottom right is (i,j)
int trees(int i, int j, int k, int na) {
    int x=i-k, y=j-k;
    if(x<0 || y<0) return na;
    return s[i][j] - s[i][y] - s[x][j] + s[x][y];
}

int bin(int i, int j, int x) {
    int l=0, h=2047;

    for(int s=1024; s; s>>=1) {
        if(trees(i,j,l+s, x+1) < x)
            l += s;
        if(trees(i,j,h-s, x+1) > x)
            h -= s;
    }
    //cout << l << " and " << h << endl;
    return l==h ? 0 : h-l-1;
}

int main() {
    int n, m, x;

    S(n); S(m); S(x);
    FOR(i,0,n) cin >> f[i];

    FORE(i,0,n) {
        FORE(j,0,m) {
            if(!i || !j) {
                s[i][j] = 0;
            } else {
                s[i][j] = (f[i-1][j-1] == '*' ? 1 : 0) +
                    s[i-1][j] + s[i][j-1] - s[i-1][j-1];
            }
        }
    }

    int I = 0;
    FORE(i,1,n) {
        FORE(j,1,m) {
            //cout << i << ", " << j << " = " << bin(i,j,x) << endl;
            I += bin(i,j,x);
        }
    }

    cout << I << endl;

    return 0;
}

Test 1

Subtask: 1

Verdict: ACCEPTED

Test 2

Subtask: 1

Verdict: ACCEPTED

Test 3

Subtask: 1

Verdict: ACCEPTED

Test 4

Subtask: 1

Verdict: ACCEPTED

Test 5

Subtask: 1

Verdict: ACCEPTED

Test 6

Subtask: 2

Verdict: ACCEPTED

Test 7

Subtask: 2

Verdict: ACCEPTED

Test 8

Subtask: 2

Verdict: ACCEPTED

Test 9

Subtask: 2

Verdict: ACCEPTED

Test 10

Subtask: 2

Verdict: ACCEPTED

Test 11

Subtask: 3

Verdict: ACCEPTED

Test 12

Subtask: 3

Verdict: ACCEPTED

Test 13

Subtask: 3

Verdict: ACCEPTED

Test 14

Subtask: 3

Verdict: ACCEPTED

Test 15

Subtask: 3

Verdict: ACCEPTED