Submission #1355375

#TimeUsernameProblemLanguageResultExecution timeMemory
1355375MatjazBob (COCI14_bob)C++20
24 / 120
1095 ms4164 KiB
//
// Created by matjaz on 4/19/26.
//

#include <iostream>
#include<vector>
using namespace std;

int main() {
    int N,M;
    cin >> N >> M;

    vector<vector<int> > a(N, vector<int>(M));

    for (int i=0; i<N; i++) {
        for (int j=0; j<M; j++) {
            cin >> a[i][j];
        }
    }

    int count = 0;

    for (int i=0; i<N; i++) {
        for (int j=0; j<M; j++) {
            for (int k=0; k<=i; k++) {
                for (int l=0; l<=j; l++) {
                    bool works = true;
                    for (int m=k; m<=i; m++) {
                        for (int n=l; n<=j; n++) {
                            if (a[m][n] != a[i][j]) {
                                works = false;
                            }
                        }
                    }
                    if (works) {count++;}
                }
            }
        }
    }

    cout << count << endl;

    return 0;
}
#Result Execution timeMemoryGrader output
Fetching results...
#Result Execution timeMemoryGrader output
Fetching results...
#Result Execution timeMemoryGrader output
Fetching results...
#Result Execution timeMemoryGrader output
Fetching results...
#Result Execution timeMemoryGrader output
Fetching results...
#Result Execution timeMemoryGrader output
Fetching results...
#Result Execution timeMemoryGrader output
Fetching results...
#Result Execution timeMemoryGrader output
Fetching results...
#Result Execution timeMemoryGrader output
Fetching results...
#Result Execution timeMemoryGrader output
Fetching results...