Niitty

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

#include <iostream>
#include <vector>

using namespace std;

bool contains(vector<char> v, char x) {
    for (int i = 0; i < v.size(); i++) {
        if (v[i] == x) {
            return true;
        }
    }
    return false;
}

bool rect_has_all_flowers(int iSt, int jSt, int iEnd, int jEnd, int uniqCNT, vector<vector<vector<int>>> prefix) {
    int cnt = 0;
    for (int k = 0; k < 26; k++) {
        if (prefix[iEnd][jEnd][k] + prefix[iSt-1][jSt-1][k] - prefix[iSt-1][jEnd][k] - prefix[iEnd][jSt-1][k] > 0) {
            cnt++;
        }
    }

    return cnt == uniqCNT;
}

int solve(vector<vector<char>> v, int n, vector<char> uniq, vector<vector<vector<int>>> prefix) {
    int ans = 0;
    for (int stRow = 1; stRow < n+1; stRow++) {
        int colmx = n+1;
        for (int rowInc = 0; rowInc < n - stRow + 1; rowInc++) {
            for (int col = 1; col < colmx; col++) {
                if (rect_has_all_flowers(stRow, 1, stRow+rowInc, col, uniq.size(), prefix)) {
                    // Try to make rectangle smaller
                    int colDec = 1;
                    while (rect_has_all_flowers(stRow, colDec, stRow+rowInc, col, uniq.size(), prefix)) {
                        colDec++;
                    }
                    colDec--;

                    ans += (colDec) * (n-col+1) * (n - (stRow + rowInc) + 1);

                    colmx = col;

                    break;
                }
            }
        }
    }


    cout << ans << endl;

    return 0;
}

int main() {
    int n;
    cin >> n;
    vector<char> uniq; // Create a list of all unical letters.
    int cnt = 0; // Count all letters

    vector<vector<char>> v(n); // Create flower map
    vector<vector<vector<int>>> prefix(n+1, vector<vector<int>> (n+1, vector<int>(26, 0))); // Create prefix map

    for (int i = 1; i < n+1; i++) {
        vector<char> temp(n);
        for (int j = 1; j < n+1; j++) {
            char ch;
            cin >> ch;
            temp[j-1] = ch;
            if (!contains(uniq, ch)) {
                cnt++;
                uniq.push_back(ch);
            }

            for (int k = 0; k < 26; k++) {
                prefix[i][j][k] = prefix[i-1][j][k] + prefix[i][j-1][k] - prefix[i-1][j-1][k];
            }
            prefix[i][j][(int) temp[j-1] - 65] += 1;
        }
        v[i-1] = temp;
    }
    solve(v, n, uniq, prefix);

    return 0;
}

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: ACCEPTED

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: ACCEPTED

Test 10

Group: 3, 4, 5, 6

Verdict: WRONG ANSWER

Test 11

Group: 3, 4, 5, 6

Verdict: TIME LIMIT EXCEEDED

Test 12

Group: 3, 4, 5, 6

Verdict: WRONG ANSWER

Test 13

Group: 3, 4, 5, 6

Verdict: TIME LIMIT EXCEEDED

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: WRONG ANSWER

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