Tontti

input/code.cpp: In function 'int gets(int, int, int, int)':
input/code.cpp:25:1: warning: control reaches end of non-void function [-Wreturn-type]
 }
 ^

#include <bits/stdc++.h>

#define _ ios_base::sync_with_stdio(0);cin.tie();
#define mp make_pair
#define pb push_back

#define ll long long
#define pii pair<int,int>
#define vpii vector<pii>
#define vi vector<int>

#define INF 9223372036854775807LL
#define N 2000

using namespace std;

int val[N+1][N+1];
int sum[N+1][N+1];

int gets(int x1, int y1, int x2, int y2) {
    if(x1==0&&y1==0) return sum[x2][y2];
    if(x1==0&&y1>0) return sum[x2][y2]-sum[x2][y1-1];
    if(x1>0&&y1==0) return sum[x2][y2]-sum[x1-1][y2];
    if(x1>0&&y1>0) return sum[x2][y2]-sum[x1-1][y2]-sum[x2][y1-1]+sum[x1-1][y1-1];
}

int main() { _

    int n,m,trees;
    cin >> n >> m >> trees;

    for(int y=0;y<n;y++) {
        for(int x=0;x<m;x++) {
            int rv;
            char c; cin >> c;
            if(c=='*') rv=1;
            else rv=0;
            if(x==0) sum[0][y] = (y>0 ? sum[0][y-1]+rv : rv);
            if(y==0) sum[x][0] = (x>0 ? sum[x-1][0]+rv : rv);
            if(x>0&&y>0) sum[x][y] = sum[x-1][y]+sum[x][y-1]-sum[x-1][y-1]+rv;
        }
    }

    int c=0;

    for(int w=1;w<=min(n,m);w++)
        for(int y=w-1;y<n;y++)
            for(int x=w-1;x<m;x++)
                if(gets(x-w+1, y-w+1, x, y)==trees) c++;

    cout << c << endl;

    return 0;
}

Test 1

Group: 1

Verdict: ACCEPTED

Test 2

Group: 1

Verdict: ACCEPTED

Test 3

Group: 1

Verdict: ACCEPTED

Test 4

Group: 1

Verdict: ACCEPTED

Test 5

Group: 1

Verdict: ACCEPTED

Test 6

Group: 2

Verdict: ACCEPTED

Test 7

Group: 2

Verdict: ACCEPTED

Test 8

Group: 2

Verdict: ACCEPTED

Test 9

Group: 2

Verdict: ACCEPTED

Test 10

Group: 2

Verdict: ACCEPTED

Test 11

Group: 3

Verdict: TIME LIMIT EXCEEDED

Test 12

Group: 3

Verdict: TIME LIMIT EXCEEDED

Test 13

Group: 3

Verdict: TIME LIMIT EXCEEDED

Test 14

Group: 3

Verdict: TIME LIMIT EXCEEDED

Test 15

Group: 3

Verdict: TIME LIMIT EXCEEDED