Niitty

//
//  main.cpp
//  cpp
//
//  Created by Fatih Meric Koc on 28.10.2024.
//
#include <iostream>
#include <string>
#include <vector>
#include <set>
using namespace std;

int countValidAreas(const vector<string>& meadow) {
    int n = meadow.size();
    int count = 0;
    
    // Precompute all unique species
    set<char> allSpecies;
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < n; j++) {
            allSpecies.insert(meadow[i][j]);
        }
    }
    int totalSpecies = allSpecies.size();
    
    // For each possible top row
    for (int top = 0; top < n; top++) {
        // For each possible bottom row
        for (int bottom = top; bottom < n; bottom++) {
            // For each possible left column
            vector<int> speciesCount(26, 0);
            for (int left = 0; left < n; left++) {
                // Reset species count for new left column
                fill(speciesCount.begin(), speciesCount.end(), 0);
                int uniqueSpecies = 0;
                
                // Count species in current rectangle from left to each possible right column
                for (int right = left; right < n; right++) {
                    // Add species from new column
                    for (int row = top; row <= bottom; row++) {
                        char species = meadow[row][right];
                        if (speciesCount[species - 'A'] == 0) {
                            uniqueSpecies++;
                        }
                        speciesCount[species - 'A']++;
                    }
                    
                    // If we found all species, this is a valid rectangle
                    if (uniqueSpecies == totalSpecies) {
                        count++;
                    }
                }
            }
        }
    }
    
    return count;
}

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    
    int n;
    cin >> n;
    
    vector<string> meadow(n);
    for (int i = 0; i < n; i++) {
        cin >> meadow[i];
    }
    
    cout << countValidAreas(meadow) << endl;
    
    return 0;
}

Test 1

Group: 1, 2, 3, 4, 5, 6

Verdict: ACCEPTED

Test 2

Group: 1, 2, 3, 4, 5, 6

Verdict: ACCEPTED

Test 3

Group: 1, 2, 3, 4, 5, 6

Verdict: ACCEPTED

Test 4

Group: 1, 2, 3, 4, 5, 6

Verdict: ACCEPTED

Test 5

Group: 1, 2, 3, 4, 5, 6

Verdict: ACCEPTED

Test 6

Group: 2, 3, 4, 5, 6

Verdict: ACCEPTED

Test 7

Group: 2, 3, 4, 5, 6

Verdict: ACCEPTED

Test 8

Group: 2, 3, 4, 5, 6

Verdict: ACCEPTED

Test 9

Group: 2, 3, 4, 5, 6

Verdict: ACCEPTED

Test 10

Group: 3, 4, 5, 6

Verdict: ACCEPTED

Test 11

Group: 3, 4, 5, 6

Verdict: ACCEPTED

Test 12

Group: 3, 4, 5, 6

Verdict: ACCEPTED

Test 13

Group: 3, 4, 5, 6

Verdict: ACCEPTED

Test 14

Group: 4, 5, 6

Verdict: TIME LIMIT EXCEEDED

Test 15

Group: 4, 5, 6

Verdict: TIME LIMIT EXCEEDED

Test 16

Group: 4, 5, 6

Verdict: TIME LIMIT EXCEEDED

Test 17

Group: 4, 5, 6

Verdict: TIME LIMIT EXCEEDED

Test 18

Group: 5, 6

Verdict: TIME LIMIT EXCEEDED

Test 19

Group: 5, 6

Verdict: TIME LIMIT EXCEEDED

Test 20

Group: 5, 6

Verdict: TIME LIMIT EXCEEDED

Test 21

Group: 5, 6

Verdict: TIME LIMIT EXCEEDED

Test 22

Group: 6

Verdict: TIME LIMIT EXCEEDED

Test 23

Group: 6

Verdict: TIME LIMIT EXCEEDED

Test 24

Group: 6

Verdict: TIME LIMIT EXCEEDED

Test 25

Group: 6

Verdict: TIME LIMIT EXCEEDED