Niitty

input/code.cpp:1:25: warning: extra tokens at end of #include directive
    1 | #include "bits/stdc++.h";
      |                         ^
input/code.cpp:2:25: warning: extra tokens at end of #include directive
    2 | #include "unordered_map";
      |                         ^
input/code.cpp: In function 'int main()':
input/code.cpp:76:35: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   76 |                 for (int x = 0; x < row.size(); x++)
      |                                 ~~^~~~~~~~~~~~

#include "bits/stdc++.h";
#include "unordered_map";

using namespace std;

int CALLS = 0;

struct flowerData
{
	flowerData()
	{

	}
	vector<pair<int,int>> positions = vector<pair<int,int>>();
};

const unordered_map<char, int> flowerIndecies = { {'A',0},{'B',1},{'C',2},{'D',3},{'E',4},{'F',5},{'G',6},{'H',7},{'I',8},{'J',9},{'K',10},{'L',11},{'M',12},{'N',13},{'O',14},{'P',15},{'Q',16},{'R',17},{'S',18},{'T',19},{'U',20},{'V',21},{'W',22},{'X',23},{'Y',24},{'Z',25} };
vector<flowerData> differentFlowers(26);

int ContainsAllFlowers(int left, int right, int top, int bottom)
{
	CALLS++;
	for (flowerData& flowerType : differentFlowers)
	{
		// Skip flower types that don't exist.
		if (flowerType.positions.size() <= 0)
		{
			continue;
		}

		bool contains = false;

		for (auto& flower : flowerType.positions)
		{
			if (flower.first < left)
			{
				continue;
			}
			if (flower.first > right)
			{
				continue;
			}
			if (flower.second < top)
			{
				continue;
			}
			if (flower.second > bottom)
			{
				continue;
			}
			contains = true;
			break;
		}
		if (!contains)
		{
			return 0;
		}
	}

	return 1;
}

int main()
{
	int size = 0;
	cin >> size;

	cout << "";

	for (int y = 0; y < size; y++)
	{
		string row;
		cin >> row;
		//map.push_back(move(row));

		for (int x = 0; x < row.size(); x++)
		{
			flowerData& currentFlower = differentFlowers.at(flowerIndecies.at(row[x]));

			currentFlower.positions.push_back(pair<int, int>(x, y));
		}
	}

	int count = 0;

	for (int x1 = 0; x1 < size; x1++)
	{
		for (int x2 = x1; x2 < size; x2++)
		{
			for (int y1 = 0; y1 < size; y1++)
			{
				for (int y2 = y1; y2 < size; y2++)
				{
					count += ContainsAllFlowers(x1, x2, y1, y2);
				}
			}
		}
	}

	cout << count;
}

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

Test 17

Group: 4, 5, 6

Verdict: ACCEPTED

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