CSES - Datatähti 2025 alku

CSES - Datatähti 2025 alku - Results

Submission details
Task:	Niitty
Sender:	DLPS
Submission time:	2024-10-30 19:11:04 +0200
Language:	C++ (C++20)
Status:	READY
Result:	4

Feedback
group	verdict	score
#1	ACCEPTED	4
#2	WRONG ANSWER	0
#3	WRONG ANSWER	0
#4	WRONG ANSWER	0
#5	WRONG ANSWER	0
#6	WRONG ANSWER	0

Test results
test	verdict	time	group
#1	ACCEPTED	0.00 s	1, 2, 3, 4, 5, 6	details
#2	ACCEPTED	0.01 s	1, 2, 3, 4, 5, 6	details
#3	ACCEPTED	0.00 s	1, 2, 3, 4, 5, 6	details
#4	ACCEPTED	0.00 s	1, 2, 3, 4, 5, 6	details
#5	ACCEPTED	0.00 s	1, 2, 3, 4, 5, 6	details
#6	WRONG ANSWER	0.01 s	2, 3, 4, 5, 6	details
#7	WRONG ANSWER	0.01 s	2, 3, 4, 5, 6	details
#8	WRONG ANSWER	0.01 s	2, 3, 4, 5, 6	details
#9	WRONG ANSWER	0.01 s	2, 3, 4, 5, 6	details
#10	WRONG ANSWER	0.38 s	3, 4, 5, 6	details
#11	WRONG ANSWER	0.18 s	3, 4, 5, 6	details
#12	WRONG ANSWER	0.34 s	3, 4, 5, 6	details
#13	WRONG ANSWER	0.00 s	3, 4, 5, 6	details
#14	TIME LIMIT EXCEEDED	--	4, 5, 6	details
#15	TIME LIMIT EXCEEDED	--	4, 5, 6	details
#16	TIME LIMIT EXCEEDED	--	4, 5, 6	details
#17	WRONG ANSWER	0.00 s	4, 5, 6	details
#18	TIME LIMIT EXCEEDED	--	5, 6	details
#19	TIME LIMIT EXCEEDED	--	5, 6	details
#20	TIME LIMIT EXCEEDED	--	5, 6	details
#21	WRONG ANSWER	0.01 s	5, 6	details
#22	TIME LIMIT EXCEEDED	--	6	details
#23	TIME LIMIT EXCEEDED	--	6	details
#24	TIME LIMIT EXCEEDED	--	6	details
#25	WRONG ANSWER	0.01 s	6	details

Compiler report

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

Code

#include "bits/stdc++.h"
#include "unordered_map";
 
using namespace std;
 
// Debug
int CALLS = 0;
 
 
struct flowerData
{
	flowerData()
	{
 
	}
	vector<pair<int,int>> positions = vector<pair<int,int>>();
};
 
// Constants
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} };
const int NODEMINSIZE = 16;
 
vector<flowerData> differentFlowers(26);
 
//treeNode* flowerTree = nullptr;
 
// Niityn koko
int fieldSize = 0;
 
// Mahdollisuuksien m��r�
int fieldCount = 0;
 
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;
}
 
struct treeNode
{
	pair<int,int> nodeSize = pair<int, int>(0, 0);
	pair<int, int> nodeCorner = pair<int, int>(0, 0);
 
	//treeNode* children[4] = { nullptr };
 
	treeNode(pair<int, int> size, pair<int, int> corner)
	{
		nodeSize = size;
		nodeCorner = corner;
	}
 
	//~treeNode()
	//{
	//	for (auto child : children)
	//	{
	//		delete child;
	//		child = nullptr;
	//	}
	//}
};
 
bool CheckNodeSplit()
{
	return false;
}
 
void SplitNode(treeNode node, vector<treeNode>* targetVector)
{
	// Top left corner
	targetVector->push_back(treeNode(pair<int, int>(node.nodeSize.first / 2, node.nodeSize.second / 2), pair<int, int>(node.nodeCorner.first, node.nodeCorner.second)));
 
	bool unevenX = (node.nodeSize.first % 2) != 0;
	bool unevenY = (node.nodeSize.second % 2) != 0;
 
	// Top right corner
	targetVector->push_back(treeNode(pair<int, int>(node.nodeSize.first / 2 + unevenX, node.nodeSize.second / 2), pair<int, int>(node.nodeCorner.first + node.nodeSize.first / 2, node.nodeCorner.second)));
 
	// Bottom left corner
	targetVector->push_back(treeNode(pair<int, int>(node.nodeSize.first / 2 , node.nodeSize.second / 2 + unevenY), pair<int, int>(node.nodeCorner.first, node.nodeCorner.second + node.nodeSize.second / 2)));
 
	// Bottom right corner
	targetVector->push_back(treeNode(pair<int, int>(node.nodeSize.first / 2 + unevenX, node.nodeSize.second / 2 + unevenY), pair<int, int>(node.nodeCorner.first + node.nodeSize.first / 2, node.nodeCorner.second + node.nodeSize.second / 2)));
}
 
void ComprehensiveSearch(treeNode nodeToSearch)
{
	for (int x1 = nodeToSearch.nodeCorner.first; x1 < nodeToSearch.nodeCorner.first + nodeToSearch.nodeSize.first; x1++)
	{
		for (int x2 = x1; x2 < nodeToSearch.nodeCorner.first + nodeToSearch.nodeSize.first; x2++)
		{
			for (int y1 = nodeToSearch.nodeCorner.second; y1 < nodeToSearch.nodeCorner.first + nodeToSearch.nodeSize.first; y1++)
			{
				for (int y2 = y1; y2 < nodeToSearch.nodeCorner.first + nodeToSearch.nodeSize.first; y2++)
				{
					fieldCount += ContainsAllFlowers(x1, x2, y1, y2);
				}
			}
		}
	}
}
 
void CountFields()
{
	vector<treeNode> unchecked;
 
	if (fieldSize >= NODEMINSIZE)
	{
		// Koko niitty sis�lt�� aina kaikki kukat.
		fieldCount++;
		SplitNode(treeNode(pair<int, int>(fieldSize, fieldSize), pair<int, int>(0, 0)), &unchecked);
	}
	else
	{
		ComprehensiveSearch(treeNode(pair<int, int>(fieldSize, fieldSize), pair<int, int>(0, 0)));
		return;
	}
 
	while (!unchecked.empty())
	{
		treeNode currentNode = move(unchecked.back());
		unchecked.pop_back();
 
		if (!(currentNode.nodeSize.first < NODEMINSIZE || currentNode.nodeSize.second < NODEMINSIZE))
		{
			// Onko t�ss� osassa kaikkia kukkia?
			if (ContainsAllFlowers(currentNode.nodeCorner.first, currentNode.nodeCorner.first + currentNode.nodeSize.first - 1, currentNode.nodeCorner.second, currentNode.nodeCorner.second + currentNode.nodeSize.second - 1))
			{
				SplitNode(move(currentNode), &unchecked);
			}
		}
		else
		{
			// Ei en��n jakoa.
			ComprehensiveSearch(move(currentNode));
		}
	}
}
 
int main()
{
	cin >> fieldSize;
 
	cout << "";
 
	for (int y = 0; y < fieldSize; 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));
		}
	}
 
	CountFields();
 
	cout << fieldCount;
}

Test details

Test 1

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

Verdict: ACCEPTED

input
`10 TNCTNPNTPC NPPNTNTPTP NTNTTCNTCT NPCPNPPNTT ...` view save

correct output
`2035` view save

user output
`2035` view save

Test 2

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

Verdict: ACCEPTED

input
`10 NFWQLWNWYS DZOQJVXFPJ CNHXPXMCQD QRTBVNLTQC ...` view save

correct output
`9` view save

user output
`9` view save

Test 3

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

Verdict: ACCEPTED

input
`10 XXXXXXXXXX XXXXXXXXXX XXXXXXXXXX XXXXXXXXXX ...` view save

correct output
`3025` view save

user output
`3025` view save

Test 4

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

Verdict: ACCEPTED

input
`10 FFFFFFFFFF FFFFFCFFFF FFFFFFJFFF FFFFFFFFFF ...` view save

correct output
`12` view save

user output
`12` view save

Test 5

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

Verdict: ACCEPTED

input
`1 X` view save

correct output
`1` view save

user output
`1` view save

Test 6

Group: 2, 3, 4, 5, 6

Verdict: WRONG ANSWER

input
`20 BBCBUBOUOBBCUUBBCOUO BOUCOOCUBCOOOCOBOCUO UCCUUUOBCOCBCBUBUCOO BUOBUCUCUOOBCOOUBUOO ...` view save

correct output
`38724` view save

user output
`12902` view save

Test 7

Group: 2, 3, 4, 5, 6

Verdict: WRONG ANSWER

input
`20 CBGLSHGZHYZDWBNDBJUG SMUXOJQYPXZDTMJUIWOJ XIDSTNBGHKRKOVUVMINB MTQGCFRUHQKALXRNCQGS ...` view save

correct output
`8334` view save

user output
`552` view save

Test 8

Group: 2, 3, 4, 5, 6

Verdict: WRONG ANSWER

input
`20 KKKKKKKKKKKKKKKKKKKK KKKKKKKKKKKKKKKKKKKK KKKKKKKKKKKKKKKKKKKK KKKKKKKKKKKKKKKKKKKK ...` view save

correct output
`44100` view save

user output
`17601` view save

Test 9

Group: 2, 3, 4, 5, 6

Verdict: WRONG ANSWER

input
`20 AAAAAAAAXAAAAAAAAAAA AAAWAAAAAAAAAAAAAOAA AAAAAAAAAAAAAAAAAPAA AAAAAAAAKAAAAAAAAAAZ ...` view save

correct output
`18` view save

user output
`1` view save

Test 10

Group: 3, 4, 5, 6

Verdict: WRONG ANSWER

input
`50 GRGREEEGREGXRXXEGXXREXGRRRGRRR...` view save

correct output
`1584665` view save

user output
`308648` view save

Test 11

Group: 3, 4, 5, 6

Verdict: WRONG ANSWER

input
`50 AITIISJUHCCRZNKSDCNQKYSQRINFWJ...` view save

correct output
`1077746` view save

user output
`83118` view save

Test 12

Group: 3, 4, 5, 6

Verdict: WRONG ANSWER

input
`50 OOOOOOOOOOOOOOOOOOOOOOOOOOOOOO...` view save

correct output
`1625625` view save

user output
`351521` view save

Test 13

Group: 3, 4, 5, 6

Verdict: WRONG ANSWER

input
`50 FFFFFFFFFFFFFFFFFFFFFFFFFFFFFF...` view save

correct output
`1680` view save

user output
`1` view save

Test 14

Group: 4, 5, 6

Verdict: TIME LIMIT EXCEEDED

input
`100 NNCMDCDDCCNNNDNCMMNCDCDCCDCDNM...` view save

correct output
`25325366` view save

user output
(empty)

Test 15

Group: 4, 5, 6

Verdict: TIME LIMIT EXCEEDED

input
`100 LIMQQIHASECROEVILNVULGWZJPPKOG...` view save

correct output
`22342463` view save

user output
(empty)

Test 16

Group: 4, 5, 6

Verdict: TIME LIMIT EXCEEDED

input
`100 TTTTTTTTTTTTTTTTTTTTTTTTTTTTTT...` view save

correct output
`25502500` view save

user output
(empty)

Test 17

Group: 4, 5, 6

Verdict: WRONG ANSWER

input
`100 QXQQQQQQQQQQQQQQQQQQQQQQQQQQQQ...` view save

correct output
`25650` view save

user output
`1` view save

Test 18

Group: 5, 6

Verdict: TIME LIMIT EXCEEDED

input
`200 NAANANMMKNKKAKMKMAKNKMNKMMNNAA...` view save

correct output
`403292767` view save

user output
(empty)

Test 19

Group: 5, 6

Verdict: TIME LIMIT EXCEEDED

input
`200 OMYWATTLURKQPTKEFMGGYAOONXWVSC...` view save

correct output
`388111321` view save

user output
(empty)

Test 20

Group: 5, 6

Verdict: TIME LIMIT EXCEEDED

input
`200 CCCCCCCCCCCCCCCCCCCCCCCCCCCCCC...` view save

correct output
`404010000` view save

user output
(empty)

Test 21

Group: 5, 6

Verdict: WRONG ANSWER

input
`200 LLLLLLLLLLLLLLLLLHLLLLLLLLLLLL...` view save

correct output
`14159445` view save

user output
`1` view save

Test 22

Group: 6

Verdict: TIME LIMIT EXCEEDED

input
`500 VVHWVUHVHUWWWVUUUWVUUHUUWHWUVW...` view save

correct output
`15683003812` view save

user output
(empty)

Test 23

Group: 6

Verdict: TIME LIMIT EXCEEDED

input
`500 OIMZGEQSBMBDSDXSWRFNKSGFEBBTJE...` view save

correct output
`15575906951` view save

user output
(empty)

Test 24

Group: 6

Verdict: TIME LIMIT EXCEEDED

input
`500 IIIIIIIIIIIIIIIIIIIIIIIIIIIIII...` view save

correct output
`15687562500` view save

user output
(empty)

Test 25

Group: 6

Verdict: WRONG ANSWER

input
`500 WWWWWWWWWWWWWWWWWWWWWWWWWWWWWW...` view save

correct output
`3058970930` view save

user output
`1` view save

Datatähti 2025 alku

Niitty

Compiler report

Code

Test details

Test 1

Test 2

Test 3

Test 4

Test 5

Test 6

Test 7

Test 8

Test 9

Test 10

Test 11

Test 12

Test 13

Test 14

Test 15

Test 16

Test 17

Test 18

Test 19

Test 20

Test 21

Test 22

Test 23

Test 24

Test 25

Tasks

Submissions (DLPS)