Tontti

#include <iostream>
#include <algorithm>
 
typedef long long int ll;
 
using namespace std;
 
int n, m, x;
int field[2000][2000];
 
int p(int i, int j) {
    int res = 0;
    int q = min(n-i,m-j);
    for (int s = 1; s <= q; ++s) {
        int t = 0;
        for (int a = i; a < i+s; ++a) {
            for (int b = j; b < j+s; ++b) {
                if (field[a][b]) {
                    ++t;
                }
            }
        }
        if (t == x) {
            res += 1;
        }
    }
    return res;
}
 
int main() {
 
    cin >> n >> m >> x;
 
    for (int i = 0; i < n; ++i) {
        for (int j = 0; j < m; ++j) {
            char c;
            cin >> c;
            field[i][j] = c == '*';
        }
    }
 
    int res = 0;
 
    for (int i = 0; i < n; ++i) {
        for (int j = 0; j < m; ++j) {
            res += p(i, j);
        }
    }
 
    cout << res << 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: TIME LIMIT EXCEEDED

Test 7

Group: 2

Verdict: TIME LIMIT EXCEEDED

Test 8

Group: 2

Verdict: TIME LIMIT EXCEEDED

Test 9

Group: 2

Verdict: TIME LIMIT EXCEEDED

Test 10

Group: 2

Verdict: TIME LIMIT EXCEEDED

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