Niitty

input/code.cpp: In function 'bool stringContainsChar(std::string, char)':
input/code.cpp:8:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
    8 |     for(int i = 0; i < s.size(); i++){
      |                    ~~^~~~~~~~~~
input/code.cpp: In function 'int main()':
input/code.cpp:25:26: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   25 |         for(int i = 0; i < s.size(); i++){
      |                        ~~^~~~~~~~~~

#include<iostream>
#include<list>
#include<algorithm>

using namespace std;
bool stringContainsChar(string s, char ch)
{
    for(int i = 0; i < s.size(); i++){
        if(s[i]==ch)
            return true;
    }
    return false;
}
int main(){
    int SideLength = 0;
    cin >> SideLength;
    string niitty[SideLength] = {};
    for(int i = 0; i < SideLength; i++){
        string newFieldRow = "";
        cin >> newFieldRow;
        niitty [i] = newFieldRow;
    }
    string uniqueFlowers; //unique characters.
    for(string s : niitty){
        for(int i = 0; i < s.size(); i++){
        if(!stringContainsChar(uniqueFlowers, s[i]))
            uniqueFlowers += s[i];
        }
    }
    int possibleFoundBoxes = 0;
    int uniqueFlowersCount = uniqueFlowers.size(); //wah wah wah "but 1 bit allocation!!! just use uniqueflowerscount wah wah!!" SHUT THE FUCK UP!
    int flowersInField = SideLength * SideLength;
    for(int i = 0; i < flowersInField; i++){
        int indexOfArrayContainingFlower = i / SideLength;
        int indexOfFlowerInThisArray = i - (SideLength * indexOfArrayContainingFlower);
        string foundFlowers = "";
        //string checkd = ""; //use checkd if you wanna see what all are possible
        bool found = false;
        //j = width.
        for(int j = 0; j < SideLength - indexOfFlowerInThisArray; j++){
            //checkd = "";
            foundFlowers = "";
            found = false;
            for(int k = indexOfArrayContainingFlower; k < SideLength; k++){
                //std::cout<<"\n";
                for (int m = indexOfFlowerInThisArray; m <= indexOfFlowerInThisArray + j; m++){
                    //checkd += niitty[k][m];
                    if(!stringContainsChar(foundFlowers, niitty[k][m]))
                        foundFlowers += niitty[k][m];
                    if(foundFlowers.size()!=0 && foundFlowers.size()%uniqueFlowersCount==0){
                        foundFlowers = "";
                        found = true;
                        break;
                    }
                }
                if(found){
                    possibleFoundBoxes++;
                    //std::cout<<checkd<<endl;
                }
            }
        }
    }
    std::cout << possibleFoundBoxes << endl;
}

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

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

Test 15

Group: 4, 5, 6

Verdict: TIME LIMIT EXCEEDED

Test 16

Group: 4, 5, 6

Verdict: ACCEPTED

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