Niitty

input/code.cpp: In function 'int main()':
input/code.cpp:28:9: warning: unused variable 'required_species' [-Wunused-variable]
   28 |     int required_species = types.size();  // Number of unique flower types in the meadow
      |         ^~~~~~~~~~~~~~~~

#include <bits/stdc++.h>
using namespace std;

int main() {
    int n;
    cin >> n;
    
    // 3D prefix sum array for counting each species (26 letters)
    vector<vector<vector<int>>> prefix_lawn(n + 1, vector<vector<int>>(n + 1, vector<int>(26, 0)));
    unordered_set<char> types;
    
    // Input the grid and build the prefix sums
    char current;
    for (int r = 1; r <= n; r++) {
        for (int c = 1; c <= n; c++) {
            cin >> current;
            int species_index = current - 'A';
            types.insert(current);
            for (int x = 0; x < 26; x++) {
                prefix_lawn[r][c][x] = prefix_lawn[r-1][c][x] + prefix_lawn[r][c-1][x]
                                        - prefix_lawn[r-1][c-1][x];
            }
            prefix_lawn[r][c][species_index]++;
        }
    }

    long long solutions = 0;
    int required_species = types.size();  // Number of unique flower types in the meadow

    // Fix the upper and lower row boundaries of the submatrix
    for (int rl = 1; rl <= n; rl++) {
        for (int rg = rl; rg <= n; rg++) {
            // Use sliding window on columns
            int cl = 1;  // Left column boundary
            unordered_map<char, int> species_count;

            for (int cg = 1; cg <= n; cg++) { // Right column boundary
                // Update species_count with the current column range [rl, rg] x [cl, cg]
                bool all_species_present = true;
                
                for (auto ch : types) {
                    int index = ch - 'A';
                    int count = prefix_lawn[rg][cg][index] - prefix_lawn[rl-1][cg][index]
                                - prefix_lawn[rg][cl-1][index] + prefix_lawn[rl-1][cl-1][index];
                    if (count == 0) {
                        all_species_present = false;
                        break;
                    }
                }

                // If valid, add all submatrices starting from (rl, cl) to (rg, cg)
                if (all_species_present) {
                    solutions += (n - cg + 1);  // All submatrices ending in this row range
                    break; // Move cl to avoid redundant checks
                }
            }
        }
    }

    cout << solutions << endl;
}

Test 1

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

Verdict: WRONG ANSWER

Test 2

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

Verdict: ACCEPTED

Test 3

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

Verdict: WRONG ANSWER

Test 4

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

Verdict: WRONG ANSWER

Test 5

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

Verdict: ACCEPTED

Test 6

Group: 2, 3, 4, 5, 6

Verdict: WRONG ANSWER

Test 7

Group: 2, 3, 4, 5, 6

Verdict: WRONG ANSWER

Test 8

Group: 2, 3, 4, 5, 6

Verdict: WRONG ANSWER

Test 9

Group: 2, 3, 4, 5, 6

Verdict: WRONG ANSWER

Test 10

Group: 3, 4, 5, 6

Verdict: WRONG ANSWER

Test 11

Group: 3, 4, 5, 6

Verdict: WRONG ANSWER

Test 12

Group: 3, 4, 5, 6

Verdict: WRONG ANSWER

Test 13

Group: 3, 4, 5, 6

Verdict: WRONG ANSWER

Test 14

Group: 4, 5, 6

Verdict: WRONG ANSWER

Test 15

Group: 4, 5, 6

Verdict: WRONG ANSWER

Test 16

Group: 4, 5, 6

Verdict: WRONG ANSWER

Test 17

Group: 4, 5, 6

Verdict: WRONG ANSWER

Test 18

Group: 5, 6

Verdict: WRONG ANSWER

Test 19

Group: 5, 6

Verdict: WRONG ANSWER

Test 20

Group: 5, 6

Verdict: WRONG ANSWER

Test 21

Group: 5, 6

Verdict: WRONG ANSWER

Test 22

Group: 6

Verdict: WRONG ANSWER

Test 23

Group: 6

Verdict: WRONG ANSWER

Test 24

Group: 6

Verdict: WRONG ANSWER

Test 25

Group: 6

Verdict: WRONG ANSWER