Submission

Score: 100

User: Bestzu

Problemset: ความหลากหลาย

Language: cpp

Time: 0.002 second

Submitted On: 2025-10-17 09:38:41

#include <bits/stdc++.h>
#define endl '\n'
using namespace std;

int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);

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

    vector<vector<int>> a(n+1, vector<int>(m+1));
    int f[51][51][10] = {0};

    for(int i=1; i<=n; i++){
        for(int j=1; j<=m; j++){
            cin >> a[i][j];
            for(int k=0; k<10; k++){
                f[i][j][k] = f[i-1][j][k] + f[i][j-1][k] - f[i-1][j-1][k];
            }
            f[i][j][a[i][j]]++;
        }
    }

    int ans = 0;
    for(int i=5; i<=n; i++){
        for(int j=5; j<=m; j++){
            int cnt = 0;
            for(int k=0; k<10; k++){
                if(f[i][j][k] - f[i-5][j][k] - f[i][j-5][k] + f[i-5][j-5][k] > 0) cnt++;
            }
            if(cnt >= 5) ans++;
        }
    }

    cout << ans;
    return 0;
}