CSES - Datatähti 2025 alku - Results
Submission details
Task:Niitty
Sender:Elmortti
Submission time:2024-11-09 00:57:34 +0200
Language:C++ (C++20)
Status:READY
Result:0
Feedback
groupverdictscore
#10
#20
#30
#40
#50
#60
Test results
testverdicttimegroup
#10.00 s1, 2, 3, 4, 5, 6details
#2ACCEPTED0.00 s1, 2, 3, 4, 5, 6details
#3ACCEPTED0.00 s1, 2, 3, 4, 5, 6details
#4ACCEPTED0.00 s1, 2, 3, 4, 5, 6details
#5ACCEPTED0.00 s1, 2, 3, 4, 5, 6details
#60.00 s2, 3, 4, 5, 6details
#70.01 s2, 3, 4, 5, 6details
#8ACCEPTED0.00 s2, 3, 4, 5, 6details
#9ACCEPTED0.01 s2, 3, 4, 5, 6details
#100.01 s3, 4, 5, 6details
#110.05 s3, 4, 5, 6details
#12ACCEPTED0.00 s3, 4, 5, 6details
#13ACCEPTED0.23 s3, 4, 5, 6details
#140.01 s4, 5, 6details
#150.20 s4, 5, 6details
#16ACCEPTED0.01 s4, 5, 6details
#17--4, 5, 6details
#180.03 s5, 6details
#190.79 s5, 6details
#20ACCEPTED0.01 s5, 6details
#21--5, 6details
#220.14 s6details
#23--6details
#240.02 s6details
#25--6details

Code

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

using namespace std;

int main() {
	set<char> meadowFlowers;
	int 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++) {

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

				// Sliding window right
				for (int j = x; j <= n; j++) {

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

					// Calculate the sum of each flower type in the current window
					for (int f = 0; f < flowerNum; f++) {
						int flowerCount = 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);
						sum.at(f) = flowerCount;
						if (sum.at(f) > 0) {
							++found;
						}
					}

					// If all flower types are found in the current window, increment
					// areas for current and all larger windows from this position
					if (found == flowerNum) {
						areas += (n - i + 1) * (n - j + 1);
						i = n;
						j = n;
					}
				}
			}
		}
	}

	cout << areas;
}

Test details

Test 1

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

Verdict:

input
10
TNCTNPNTPC
NPPNTNTPTP
NTNTTCNTCT
NPCPNPPNTT
...

correct output
2035

user output
1314

Test 2

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

Verdict: ACCEPTED

input
10
NFWQLWNWYS
DZOQJVXFPJ
CNHXPXMCQD
QRTBVNLTQC
...

correct output
9

user output
9

Test 3

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

Verdict: ACCEPTED

input
10
XXXXXXXXXX
XXXXXXXXXX
XXXXXXXXXX
XXXXXXXXXX
...

correct output
3025

user output
3025

Test 4

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

Verdict: ACCEPTED

input
10
FFFFFFFFFF
FFFFFCFFFF
FFFFFFJFFF
FFFFFFFFFF
...

correct output
12

user output
12

Test 5

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

Verdict: ACCEPTED

input
1
X

correct output
1

user output
1

Test 6

Group: 2, 3, 4, 5, 6

Verdict:

input
20
BBCBUBOUOBBCUUBBCOUO
BOUCOOCUBCOOOCOBOCUO
UCCUUUOBCOCBCBUBUCOO
BUOBUCUCUOOBCOOUBUOO
...

correct output
38724

user output
25197

Test 7

Group: 2, 3, 4, 5, 6

Verdict:

input
20
CBGLSHGZHYZDWBNDBJUG
SMUXOJQYPXZDTMJUIWOJ
XIDSTNBGHKRKOVUVMINB
MTQGCFRUHQKALXRNCQGS
...

correct output
8334

user output
5864

Test 8

Group: 2, 3, 4, 5, 6

Verdict: ACCEPTED

input
20
KKKKKKKKKKKKKKKKKKKK
KKKKKKKKKKKKKKKKKKKK
KKKKKKKKKKKKKKKKKKKK
KKKKKKKKKKKKKKKKKKKK
...

correct output
44100

user output
44100

Test 9

Group: 2, 3, 4, 5, 6

Verdict: ACCEPTED

input
20
AAAAAAAAXAAAAAAAAAAA
AAAWAAAAAAAAAAAAAOAA
AAAAAAAAAAAAAAAAAPAA
AAAAAAAAKAAAAAAAAAAZ
...

correct output
18

user output
18

Test 10

Group: 3, 4, 5, 6

Verdict:

input
50
GRGREEEGREGXRXXEGXXREXGRRRGRRR...

correct output
1584665

user output
1232088

Test 11

Group: 3, 4, 5, 6

Verdict:

input
50
AITIISJUHCCRZNKSDCNQKYSQRINFWJ...

correct output
1077746

user output
352981

Test 12

Group: 3, 4, 5, 6

Verdict: ACCEPTED

input
50
OOOOOOOOOOOOOOOOOOOOOOOOOOOOOO...

correct output
1625625

user output
1625625

Test 13

Group: 3, 4, 5, 6

Verdict: ACCEPTED

input
50
FFFFFFFFFFFFFFFFFFFFFFFFFFFFFF...

correct output
1680

user output
1680

Test 14

Group: 4, 5, 6

Verdict:

input
100
NNCMDCDDCCNNNDNCMMNCDCDCCDCDNM...

correct output
25325366

user output
22047134

Test 15

Group: 4, 5, 6

Verdict:

input
100
LIMQQIHASECROEVILNVULGWZJPPKOG...

correct output
22342463

user output
7273749

Test 16

Group: 4, 5, 6

Verdict: ACCEPTED

input
100
TTTTTTTTTTTTTTTTTTTTTTTTTTTTTT...

correct output
25502500

user output
25502500

Test 17

Group: 4, 5, 6

Verdict:

input
100
QXQQQQQQQQQQQQQQQQQQQQQQQQQQQQ...

correct output
25650

user output
(empty)

Test 18

Group: 5, 6

Verdict:

input
200
NAANANMMKNKKAKMKMAKNKMNKMMNNAA...

correct output
403292767

user output
375417775

Test 19

Group: 5, 6

Verdict:

input
200
OMYWATTLURKQPTKEFMGGYAOONXWVSC...

correct output
388111321

user output
157931006

Test 20

Group: 5, 6

Verdict: ACCEPTED

input
200
CCCCCCCCCCCCCCCCCCCCCCCCCCCCCC...

correct output
404010000

user output
404010000

Test 21

Group: 5, 6

Verdict:

input
200
LLLLLLLLLLLLLLLLLHLLLLLLLLLLLL...

correct output
14159445

user output
(empty)

Test 22

Group: 6

Verdict:

input
500
VVHWVUHVHUWWWVUUUWVUUHUUWHWUVW...

correct output
15683003812

user output
-1944874275

Test 23

Group: 6

Verdict:

input
500
OIMZGEQSBMBDSDXSWRFNKSGFEBBTJE...

correct output
15575906951

user output
(empty)

Test 24

Group: 6

Verdict:

input
500
IIIIIIIIIIIIIIIIIIIIIIIIIIIIII...

correct output
15687562500

user output
-1492306684

Test 25

Group: 6

Verdict:

input
500
WWWWWWWWWWWWWWWWWWWWWWWWWWWWWW...

correct output
3058970930

user output
(empty)