Niitty

input/code.cpp: In function 'int count_fenced_areas(std::vector<std::__cxx11::basic_string<char> >&, int)':
input/code.cpp:19:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   19 |     for (int i = 0; i < unique_species.size(); ++i) {
      |                     ~~^~~~~~~~~~~~~~~~~~~~~~~

#include <iostream>
#include <vector>
#include <set>
#include <unordered_map>
 
using namespace std;
 
int count_fenced_areas(vector<string>& meadow, int n) {
    set<char> unique_species_set;
    for (const auto& row : meadow) {
        for (char flower : row) {
            unique_species_set.insert(flower);
        }
    }
    int total_species = unique_species_set.size();
    vector<char> unique_species(unique_species_set.begin(), unique_species_set.end());
 
    unordered_map<char, int> species_index;
    for (int i = 0; i < unique_species.size(); ++i) {
        species_index[unique_species[i]] = i;
    }
 
    vector<vector<vector<int>>> prefix_species_count(n, vector<vector<int>>(n, vector<int>(total_species, 0)));
    
    for (int i = 0; i < n; ++i) {
        for (int j = 0; j < n; ++j) {
            if (species_index.count(meadow[i][j])) {
                prefix_species_count[i][j][species_index[meadow[i][j]]] = 1;
            }
            if (i > 0) {
                for (int s = 0; s < total_species; ++s) {
                    prefix_species_count[i][j][s] += prefix_species_count[i - 1][j][s];
                }
            }
        }
    }
 
    int fenced_areas_count = 0;
 
    for (int r1 = 0; r1 < n; ++r1) {
        for (int r2 = r1; r2 < n; ++r2) {
            vector<int> species_in_window(total_species, 0);
            int species_found = 0;  
            int left = 0;
 
            for (int right = 0; right < n; ++right) {
                for (int s = 0; s < total_species; ++s) {
                    int count = prefix_species_count[r2][right][s] - (r1 > 0 ? prefix_species_count[r1 - 1][right][s] : 0);
                    if (count > 0 && species_in_window[s] == 0) species_found++;
                    species_in_window[s] += count;
                }
                
                while (species_found == total_species) {                    
                    fenced_areas_count += (n - right);
 
                    for (int s = 0; s < total_species; ++s) {
                        int count = prefix_species_count[r2][left][s] - (r1 > 0 ? prefix_species_count[r1 - 1][left][s] : 0);
                        if (count > 0) {
                            species_in_window[s] -= count;
                            if (species_in_window[s] == 0) species_found--;
                        }
                    }
                    left++;  
                }
            }
        }
    }
 
    return fenced_areas_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];
    }
 
    int result = count_fenced_areas(meadow, n);
    cout << result << 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: ACCEPTED

Test 15

Group: 4, 5, 6

Verdict: ACCEPTED

Test 16

Group: 4, 5, 6

Verdict: ACCEPTED

Test 17

Group: 4, 5, 6

Verdict: ACCEPTED

Test 18

Group: 5, 6

Verdict: ACCEPTED

Test 19

Group: 5, 6

Verdict: ACCEPTED

Test 20

Group: 5, 6

Verdict: ACCEPTED

Test 21

Group: 5, 6

Verdict: ACCEPTED

Test 22

Group: 6

Verdict: TIME LIMIT EXCEEDED

Test 23

Group: 6

Verdict: TIME LIMIT EXCEEDED

Test 24

Group: 6

Verdict: WRONG ANSWER

Test 25

Group: 6

Verdict: TIME LIMIT EXCEEDED