Niitty

input/code.cpp: In function 'int main()':
input/code.cpp:127:38: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::vector<flower> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  127 |                     for (int i = 0; i<flist.size(); i++){
      |                                     ~^~~~~~~~~~~~~
input/code.cpp:108:19: warning: variable 'foundAllPoint' set but not used [-Wunused-but-set-variable]
  108 |     pair<int,int> foundAllPoint = {0, 0};
      |                   ^~~~~~~~~~~~~

#include <iostream>
#include <cmath>
#include <vector>
#include <algorithm>
#include <string>
#include <sstream>
#include <chrono>
#include <iomanip>
#include <algorithm>
 
typedef long long ll;
using namespace std;
 
struct flower{
 
    int x, y;
 
    int id;
};
 
vector<vector<flower>> flist;
 
int idList[200] = {0};
 
int letterGrid[501][501];
 
vector<bool> findLettersFromRect(int minX, int maxX, int minY, int maxY){
 
    vector<bool> foundLetters(flist.size(), false);
 
    for (int x = minX; x<=maxX; x++){
        for (int y = minY; y<=maxY; y++){
            foundLetters[letterGrid[x][y]] = true;
        }
    }
 
    return foundLetters;
 
 
}
 
int main(){
 
    ios_base::sync_with_stdio(0);
    cin.tie(0);
 
    fill_n(idList, 200, -1);
 
    int n;
 
    cin >> n;
    cin.ignore(1,'\n');
 
    int id = 0;
    vector<string> sI;
 
    for (int y = n-1; y>=0; y--){
 
        
        sI.push_back(string());
        getline(cin, sI[sI.size()-1]);
 
    }
 
    int c = n-1;
 
    for (int y = n - 1; y >= 0; y--)
    {
        
        string s = sI[c];
 
        c--;
 
        for (int x = 0; x < n; x++)
        {
            flower f;
            f.x = x;
            f.y = y;
 
            if (idList[(int)s[x]] == -1)
            {
                idList[(int)s[x]] = id;
                flist.push_back(vector<flower>());
                id++;
            }
 
            f.id = idList[(int)s[x]];
 
            flist[f.id].push_back(f);
 
            letterGrid[x][y] = f.id;
        }
    }
 
    // vector<vector<char>> visualization;
 
    
 
    // for (int y = 0; y<n; y++){
    //     visualization.push_back(vector<char>());
    //     for(int x = 0; x<n; x++){
    //         visualization[y].push_back(sI[y][x]);
    //     }
    // }
 
    int v = 0;
 
    pair<int,int> foundAllPoint = {0, 0};
 
    for(int minX = 0; minX<n; minX++){
        for(int minY = 0; minY<n; minY++){
 
            for(int maxX = minX; maxX<n; maxX++){
 
                
 
                // vector<bool> letterFound(flist.size(), false);
 
                for (int maxY = minY; maxY<n; maxY++){
                    // cout << minX << ", " << maxX << ", " << minY << ", " << maxY << "\n";
                    int notFound = flist.size();
                    
                    vector<bool> currentRectLetters;
 
                    currentRectLetters = findLettersFromRect(minX, maxX, minY, maxY);
 
                    for (int i = 0; i<flist.size(); i++){
                        if (currentRectLetters[i]){
                            // letterFound[i] = true;
                            notFound--;
                        }
                    }
 
                    if (notFound == 0){
                        v++;
                    }
 
                }
 
            }
 
        }
    }
 
 
    cout << v;
 
}

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: TIME LIMIT EXCEEDED

Test 11

Group: 3, 4, 5, 6

Verdict: TIME LIMIT EXCEEDED

Test 12

Group: 3, 4, 5, 6

Verdict: TIME LIMIT EXCEEDED

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