Niitty

#include <cmath>
#include <iostream>
#include <set>
#include <string>
#include <unordered_map>
#include <vector>

using namespace std;

int main() {
	set<char> meadowFlowers;
	unsigned long long areas = 0;

	int n;
	string s;
	cin >> n;

	vector<vector<char>> meadow(n, vector<char>(n, 'A'));

	for (int i = 0; i < n; i++) {
		cin >> s;
		for (int j = 0; j < n; j++) {
			meadow.at(i).at(j) = s.at(j);
			meadowFlowers.insert(s.at(j));
		}
	}

	unordered_map<char, int> flowerMap;
	vector<char> flowerVector(meadowFlowers.begin(), meadowFlowers.end());
	const int flowerNum = flowerVector.size();

	// Map flowers to index
	for (int i = 0; i < flowerNum; i++) {
		flowerMap[flowerVector.at(i)] = i;
	}
	vector<vector<vector<int>>> meadowPrefixSums(
		 flowerNum, vector<vector<int>>(n + 1, vector<int>(n + 1, 0)));

	// Calculate prefix sums for each flower type
	for (int f = 0; f < flowerNum; ++f) {
		char flowerType = flowerVector.at(f);
		for (int i = 1; i <= n; i++) {
			for (int j = 1; j <= n; j++) {
				meadowPrefixSums.at(f).at(i).at(j) =
					 meadowPrefixSums.at(f).at(i - 1).at(j) +
					 meadowPrefixSums.at(f).at(i).at(j - 1) -
					 meadowPrefixSums.at(f).at(i - 1).at(j - 1) +
					 (meadow.at(i - 1).at(j - 1) == flowerType ? 1 : 0);
			}
		}
	}

	// Iterate through every possible starting corner
	for (int y = 1; y <= n; y++) {
		for (int x = 1; x <= n; x++) {

			vector<int> sum(flowerNum, 0);
			int found = 0;

			// Sliding window down
			for (int j = x; j <= n; j++) {
				found = 0;
					if (found == flowerNum) {
						areas += (n - j + 1);
						found = 0;
						break;
					}

				// Sliding window right
				for (int i = y; i <= n; i++) {

					// Calculate the sum of each flower type in the current window
					for (int f = 0; f < flowerNum; f++) {
						sum.at(f) = meadowPrefixSums.at(f).at(i).at(j) -
										meadowPrefixSums.at(f).at(y - 1).at(j) -
										meadowPrefixSums.at(f).at(i).at(x - 1) +
										meadowPrefixSums.at(f).at(y - 1).at(x - 1);
						if (sum.at(f) > 0) {
							++found;
						}
					}

					// Increment areas if found match
					if (found == flowerNum) {
						areas += (n - i + 1);
						found = 0;
						break;
					}
					found = 0;
				}
			}
		}
	}

	cout << areas;
}

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

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

Test 15

Group: 4, 5, 6

Verdict: ACCEPTED

Test 16

Group: 4, 5, 6

Verdict: ACCEPTED

Test 17

Group: 4, 5, 6

Verdict: TIME LIMIT EXCEEDED

Test 18

Group: 5, 6

Verdict: ACCEPTED

Test 19

Group: 5, 6

Verdict: TIME LIMIT EXCEEDED

Test 20

Group: 5, 6

Verdict: ACCEPTED

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

Test 25

Group: 6

Verdict: TIME LIMIT EXCEEDED