Niitty

input/code.cpp: In function 'std::set<char> getCarrots(const std::vector<std::vector<char> >&)':
input/code.cpp:44:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::vector<char> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   44 |     for (int i=0; i<list.size(); i++) {
      |                   ~^~~~~~~~~~~~
input/code.cpp:45:24: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   45 |         for (int j=0; j<list.at(i).size(); j++) {
      |                       ~^~~~~~~~~~~~~~~~~~
input/code.cpp: In function 'int getSolution(int, const std::vector<std::vector<char> >&)':
input/code.cpp:87:9: warning: unused variable 'operations' [-Wunused-variable]
   87 |         operations=0;
      |         ^~~~~~~~~~

#include <iostream>
#include <vector>
#include <set>
#include <algorithm>

std::set<char> getCarrots(const std::vector<std::vector<char>> &list);
 
std::vector<std::vector<char>> getSubgrid(
    const std::vector<std::vector<char>> &flowerGrid,
    int x1, int y1, int x2, int y2);
 
bool checkElement(const std::vector<std::vector<char>> &grid, const std::set<char> &allCars);
 
int getSolution(int sideLen, const std::vector<std::vector<char>> &flowerGrid);

int main() {
    int sideLen;
    char carrotInput;
    std::vector<char> nRow;
    std::vector<std::vector<char>> flowerGrid; 
 
    std::cin >> sideLen;
 
    for (int i=0; i<sideLen; i++) {
        for (int j=0; j<sideLen; j++) {
            std::cin >> carrotInput;
            nRow.push_back(carrotInput);
        }
        flowerGrid.push_back(nRow);
        nRow.clear();
    }
 
    int solution = getSolution(sideLen, flowerGrid);
 
    std::cout << solution;
 
 
    return 0;
}
 
 
std::set<char> getCarrots(const std::vector<std::vector<char>> &list) {
    std::set<char> returnSet;
    for (int i=0; i<list.size(); i++) {
        for (int j=0; j<list.at(i).size(); j++) {
            returnSet.insert(list.at(i).at(j));
        }
    }
    return returnSet;
}

std::vector<std::vector<char>> getSubgrid(
    const std::vector<std::vector<char>> &flowerGrid,
    int col1, int row1, int col2, int row2) 
{
    std::vector<std::vector<char>> returnGrid;
    std::vector<char> rowN;
	
	int i=0, j=0;
	
	for (int row=row1; i<abs(row1-row2)+1; row++, i++) {
		j=0;
    	for (int col=col1; j<abs(col1-col2)+1; col++, j++) {
            rowN.push_back(flowerGrid.at(row).at(col));
        }
        returnGrid.push_back(rowN);
        rowN.clear();
    }

    return returnGrid;
}

bool checkElement(const std::vector<std::vector<char>> &grid, const std::set<char> &allCars) {
    std::set<char> carSet = getCarrots(grid);
    if (carSet == allCars) return true;
    
    return false;
}
 
int getSolution(int sideLen, const std::vector<std::vector<char>> &flowerGrid) {
    std::set<char> subGridCars, 
    	allCars = getCarrots(flowerGrid);
    
    std::vector<std::vector<char>> subGrid;
    int subgridAmount = 0,
    	uniqCarsAmount = static_cast<int>(allCars.size()),
        operations=0;
    
    // the amount of for loops here is severely unholy

    for (int startRow=0; startRow < sideLen; startRow++) {
        for (int startCol=0; startCol < sideLen; startCol++) {
            for (int endRow=startRow; endRow < sideLen; endRow++) {
                for (int endCol=startCol; endCol < sideLen; endCol++) {
                    if (((abs(startRow-endRow)+1)*(abs(startCol-endCol)+1)) < uniqCarsAmount) continue;

                    subGrid = getSubgrid(flowerGrid, startCol, startRow, endCol, endRow);
                  	
                    if (checkElement(subGrid, allCars)) {
                        subgridAmount++;
                    }
                }
            }
        }
    }
    return subgridAmount;
}

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