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:58:35: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   58 |                 for (int x = 0; x < row.size(); x++)
      |                                 ~~^~~~~~~~~~~~

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

using namespace std;

struct flowerData
{
	flowerData()
	{

	}

	int left = 0;
	int right = 0;
	int top = 0;
	int bottom = 0;
	bool set = false;
};

unordered_map<char, flowerData> flowers;

int ContainsAllFlowers(int left, int right, int top, int bottom)
{
	for (auto& flower : flowers)
	{
		if (flower.second.right < left)
		{
			return 0;
		}
		if (flower.second.left > right)
		{
			return 0;
		}
		if (flower.second.bottom < top)
		{
			return 0;
		}
		if (flower.second.top > bottom)
		{
			return 0;
		}
	}

	return 1;
}

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

	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 = flowers[row[x]];
			if (!currentFlower.set)
			{
				currentFlower.left = x;
				currentFlower.right = x;
				currentFlower.top = y;
				currentFlower.bottom = y;
				currentFlower.set = true;
			}
			else
			{
				if (x > currentFlower.right)
				{
					currentFlower.right = x;
				}
				if (y > currentFlower.bottom)
				{
					currentFlower.bottom = 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: WRONG ANSWER

Test 2

Group: 1, 2, 3, 4, 5, 6

Verdict: WRONG ANSWER

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

Test 7

Group: 2, 3, 4, 5, 6

Verdict: WRONG ANSWER

Test 8

Group: 2, 3, 4, 5, 6

Verdict: ACCEPTED

Test 9

Group: 2, 3, 4, 5, 6

Verdict: WRONG ANSWER

Test 10

Group: 3, 4, 5, 6

Verdict: WRONG ANSWER

Test 11

Group: 3, 4, 5, 6

Verdict: WRONG ANSWER

Test 12

Group: 3, 4, 5, 6

Verdict: ACCEPTED

Test 13

Group: 3, 4, 5, 6

Verdict: WRONG ANSWER

Test 14

Group: 4, 5, 6

Verdict: WRONG ANSWER

Test 15

Group: 4, 5, 6

Verdict: WRONG ANSWER

Test 16

Group: 4, 5, 6

Verdict: ACCEPTED

Test 17

Group: 4, 5, 6

Verdict: WRONG ANSWER

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