Submission

PPP-------

Score: 30

User: Whally

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

Language: cpp

Time: 0.002 second

Submitted On: 2025-04-12 23:36:23

#include <bits/stdc++.h>
using namespace std;
int t[110][110];
bitset<15> ch;

int main()
{
    cin.tie(0)->sync_with_stdio(0);
    int r,c;
    cin >> r >> c;
    for (int i = 1; i <= r; i++){
        for (int j = 1; j <= c; j++){
            cin >> t[i][j];
        }
    }
    int ans = 0;
    if (r < 5 || c < 5){
        cout << "0";
        return 0;
    }
    for (int i = 1; i <= r; i++){
        for (int j = 1; j <= c; j++){
            int cnt = 0;
            ch.reset();
            for (int k = 0; k < 5; k++){
                for (int l = 0; l < 5; l++){
                    int now = t[i+k][j+l];
                    if (!ch[now]) cnt++, ch[now] = 1;
                    if (cnt >= 5) break;
                }
                if (cnt >= 5) break;
            }
            if (cnt >= 5) ans++;
        }
    }
    cout << ans;

    return 0;
}