Niitty

input/code.cpp: In function 'int main()':
input/code.cpp:45:45: warning: comparison of integer expressions of different signedness: 'std::set<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   45 |             if (cumulativeFlowers[x].size() == types)
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~
input/code.cpp:52:40: warning: comparison of integer expressions of different signedness: 'std::set<char>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   52 |                 while (counting.size() < types && yt > -1)
      |                        ~~~~~~~~~~~~~~~~^~~~~~~
input/code.cpp:65:37: warning: comparison of integer expressions of different signedness: 'std::set<char>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   65 |                 if (counting.size() == types)
      |                     ~~~~~~~~~~~~~~~~^~~~~~~~
input/code.cpp:86:44: warning: comparison of integer expressions of different signedness: 'std...

#include <iostream>
#include <set>
#include <vector>
#include <map>

using namespace std;
// Should work ? .... ???

int main()
{

    int count = 0;
    int n;
    vector<string> meadow;
    cin >> n;
    for (int i = 0; i < n; i++)
    {
        string roww;
        cin >> roww;
        meadow.push_back(roww);
    }
    map<int, set<int>> cumulativeFlowers;
    set<char> temp;
    for (int i = 0; i < n; i++)
    {
        for (int j = 0; j < n; j++)
        {
            temp.insert(meadow[i].at(j));
        }
    }
    int types = temp.size();

    for (int y = 0; y < n; y++)
    {
        set<int> rowFlowers;
        string currRow = meadow[y];
        for (int x = 0; x < n; x++)
        {
            char curr = currRow.at(x);
            rowFlowers.insert(curr);
            for (const auto &flower : rowFlowers)
            {
                cumulativeFlowers[x].insert(flower);
            }
            if (cumulativeFlowers[x].size() == types)
            {
                count += (x + 1) * (y + 1);
                set<char> counting;
                map<int, vector<char>> rows;
                map<char, int> counts;
                int yt = y;
                while (counting.size() < types && yt > -1)
                {
                    char currCh = meadow[yt].at(x);
                    rows[yt] = {currCh};
                    if (counts.find(currCh) == counts.end())
                    {
                        counts[currCh] = 0;
                    }
                    counts[currCh]++;
                    counting.insert(currCh);
                    yt--;
                }
                yt++;
                if (counting.size() == types)
                {
                    counting.erase(meadow[yt].at(x));
                    counts[meadow[yt].at(x)] = 0;
                    yt++;
                }
                if (yt > y)
                {
                    continue;
                }
                count -= (y - yt + 1);

                for (int i = x - 1; i > -1; i--)
                {
                    for (int j = y; j >= yt; j--)
                    {
                        char currCh = meadow[j].at(i);
                        counts[currCh]++;
                        counting.insert(currCh);
                        rows[j].push_back(currCh);
                    }
                    while (counting.size() == types && yt < y)
                    {
                        yt++;
                        for (const auto &f : rows[yt - 1])
                        {
                            if ((--counts[f]) == 0)
                            {
                                counting.erase(f);
                            }
                        }
                    }

                    if (yt == y && counting.size() == types)
                    {
                        break;
                    }
                    count -= (y - yt + 1);
                }
            }
        }
    }
    cout << count << "\n";
    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: TIME LIMIT EXCEEDED

Test 20

Group: 5, 6

Verdict: ACCEPTED

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

Test 25

Group: 6

Verdict: TIME LIMIT EXCEEDED