CSES - Datatähti 2025 alku

CSES - Datatähti 2025 alku - Results

Submission details
Task:	Niitty
Sender:	DLPS
Submission time:	2024-10-31 07:20:37 +0200
Language:	C++ (C++20)
Status:	READY
Result:	20

Feedback
group	verdict	score
#1	ACCEPTED	4
#2	ACCEPTED	6
#3	ACCEPTED	10
#4	TIME LIMIT EXCEEDED	0
#5	TIME LIMIT EXCEEDED	0
#6	TIME LIMIT EXCEEDED	0

Test results
test	verdict	time	group
#1	ACCEPTED	0.00 s	1, 2, 3, 4, 5, 6	details
#2	ACCEPTED	0.00 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	ACCEPTED	0.01 s	2, 3, 4, 5, 6	details
#7	ACCEPTED	0.01 s	2, 3, 4, 5, 6	details
#8	ACCEPTED	0.01 s	2, 3, 4, 5, 6	details
#9	ACCEPTED	0.00 s	2, 3, 4, 5, 6	details
#10	ACCEPTED	0.09 s	3, 4, 5, 6	details
#11	ACCEPTED	0.58 s	3, 4, 5, 6	details
#12	ACCEPTED	0.05 s	3, 4, 5, 6	details
#13	ACCEPTED	0.01 s	3, 4, 5, 6	details
#14	TIME LIMIT EXCEEDED	--	4, 5, 6	details
#15	TIME LIMIT EXCEEDED	--	4, 5, 6	details
#16	ACCEPTED	0.76 s	4, 5, 6	details
#17	ACCEPTED	0.27 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	TIME LIMIT EXCEEDED	--	5, 6	details
#22	TIME LIMIT EXCEEDED	--	6	details
#23	TIME LIMIT EXCEEDED	--	6	details
#24	TIME LIMIT EXCEEDED	--	6	details
#25	TIME LIMIT EXCEEDED	--	6	details

Compiler report

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

Code

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

using namespace std;

#define byte unsigned char

// Bit masks
const byte bits[8] = { 1, 2, 4, 8, 16, 32, 64, 128 };
const byte rbits[8] = { 254, 253, 251, 247, 239, 223, 191, 127 };

// Debug
int CALLS = 0;


int fieldSize = 0;

struct flowerData
{
	vector<pair<int,int>> positions = vector<pair<int,int>>();

	vector<vector<byte>> rows = vector<vector<byte>>();

	int flowerCount = 0;

	bool init = false;

	void Init()
	{
		if (init)
		{
			return;
		}
		init = true;

		vector<byte> filler(fieldSize / 8 + 1, 0);
		rows.reserve(fieldSize);

		for (int i = 0; i < fieldSize; i++)
		{
			rows.push_back(filler);
		}
	}

	void Insert(int x, int y)
	{
		flowerCount++;

		vector<byte>& row = rows[y];

		// Maybe x - 1
		byte& workingByte = row[ceil(x / 8)];
		// Maybe x - 1
		workingByte = workingByte | bits[x % 8];
	}

	bool InBox(int left, int right, int top, int bottom)
	{
		for (int y = top; y <= bottom; y++)
		{
			int minByte = left / 8;
			int minByteStart = left % 8;
			int maxByte = right / 8;
			int maxByteEnd = right % 8;

			if (minByte == maxByte)
			{
				/**/
				byte workingByte = rows[y][minByte];

				// Masking from the left
				for (int i = 0; i < minByteStart; i++)
				{
					workingByte &= rbits[i];
				}
				// Masking from the right
				for (int i = maxByteEnd + 1; i < 8; i++)
				{
					workingByte &= rbits[i];
				}

				if (workingByte > 0)
				{
					return true;
				}

				/*
				// Create mask
				byte mask = 255;
				for (int i = 0; i < minByteStart; i++)
				{
					mask = mask & rbits[i];
				}
				// Masking from the right
				for (int i = maxByteEnd + 1; i < 8; i++)
				{
					mask = mask & rbits[i];
				}
				//mask = ~mask;

				byte& ref = rows.at(y).at(minByte);
				if ((ref & mask) > 0)
				{
					return true;
				}*/
			}
			else
			{
				/**/
				byte workingByte = rows[y][minByte];

				// Masking from the left
				for (int i = 0; i < minByteStart; i++)
				{
					workingByte &= rbits[i];
				}

				if (workingByte > 0)
				{
					return true;
				}

				for (int i = minByte + 1; i < maxByte; i++)
				{
					if (rows[y][i] > 0)
					{
						return true;
					}
				}

				workingByte = rows[y][maxByte];

				// Masking from the right
				for (int i = maxByteEnd + 1; i < 8; i++)
				{
					workingByte &= rbits[i];
				}

				if (workingByte > 0)
				{
					return true;
				}

				/*
				byte mask = 255;
				for (int i = 0; i < minByteStart; i++)
				{
					mask = mask & rbits[i];
				}
				//mask = ~mask;
				byte& ref = rows.at(y).at(minByte);
				if ((ref & mask) > 0)
				{
					return true;
				}

				mask = 255;
				for (int i = maxByteEnd + 1; i < 8; i++)
				{
					mask = mask & rbits[i];
				}
				//mask = ~mask;

				ref = rows.at(y).at(maxByte);
				if ((ref & mask) > 0)
				{
					return true;
				}

				for (int i = minByte + 1; i < maxByte; i++)
				{
					ref = rows.at(y).at(i);
					if (ref > 0)
					{
						return true;
					}
				}*/
			}
		}

		return false;
	}
};

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);

bool ContainsAllFlowers(int left, int right, int top, int bottom)
{
	CALLS++;
	for (flowerData& flowerType : differentFlowers)
	{
		
		if (flowerType.flowerCount <= 0)
		{
			continue;
		}

		if (!flowerType.InBox(left, right, top, bottom))
		{
			return false;
		}

		/*
		// 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 false;
		}*/
	}

	return true;
}

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[flowerIndecies.at(row[x])];

			currentFlower.Init();

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

	int count = 0;

	
	for (int x1 = 0; x1 < fieldSize; x1++)
	{
		bool hadSuccessX2 = false;
		for (int x2 = fieldSize - 1; x2 >= x1; x2--)
		{
			bool hadSuccessY1 = false;
			for (int y1 = 0; y1 < fieldSize; y1++)
			{
				bool hadSuccessY2 = false;
				for (int y2 = fieldSize - 1; y2 >= y1; y2--)
				{
					if (ContainsAllFlowers(x1, x2, y1, y2))
					{
						hadSuccessY2 = true;
						count++;
					}
					else
					{
						break;
					}
				}
				if (!hadSuccessY2)
				{
					break;
				}
				else
				{
					hadSuccessY1 = true;
				}
			}
			if (!hadSuccessY1)
			{
				break;
			}
			else
			{
				hadSuccessX2 = true;
			}
		}
		if (!hadSuccessX2)
		{
			break;
		}
	}

	cout << count;
}

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

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

correct output
`38724` view save

user output
`38724` view save

Test 7

Group: 2, 3, 4, 5, 6

Verdict: ACCEPTED

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

correct output
`8334` view save

user output
`8334` view save

Test 8

Group: 2, 3, 4, 5, 6

Verdict: ACCEPTED

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

correct output
`44100` view save

user output
`44100` view save

Test 9

Group: 2, 3, 4, 5, 6

Verdict: ACCEPTED

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

correct output
`18` view save

user output
`18` view save

Test 10

Group: 3, 4, 5, 6

Verdict: ACCEPTED

input
`50 GRGREEEGREGXRXXEGXXREXGRRRGRRR...` view save

correct output
`1584665` view save

user output
`1584665` view save

Test 11

Group: 3, 4, 5, 6

Verdict: ACCEPTED

input
`50 AITIISJUHCCRZNKSDCNQKYSQRINFWJ...` view save

correct output
`1077746` view save

user output
`1077746` view save

Test 12

Group: 3, 4, 5, 6

Verdict: ACCEPTED

input
`50 OOOOOOOOOOOOOOOOOOOOOOOOOOOOOO...` view save

correct output
`1625625` view save

user output
`1625625` view save

Test 13

Group: 3, 4, 5, 6

Verdict: ACCEPTED

input
`50 FFFFFFFFFFFFFFFFFFFFFFFFFFFFFF...` view save

correct output
`1680` view save

user output
`1680` 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: ACCEPTED

input
`100 TTTTTTTTTTTTTTTTTTTTTTTTTTTTTT...` view save

correct output
`25502500` view save

user output
`25502500` view save

Test 17

Group: 4, 5, 6

Verdict: ACCEPTED

input
`100 QXQQQQQQQQQQQQQQQQQQQQQQQQQQQQ...` view save

correct output
`25650` view save

user output
`25650` 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: TIME LIMIT EXCEEDED

input
`200 LLLLLLLLLLLLLLLLLHLLLLLLLLLLLL...` view save

correct output
`14159445` view save

user output
(empty)

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

input
`500 WWWWWWWWWWWWWWWWWWWWWWWWWWWWWW...` view save

correct output
`3058970930` view save

user output
(empty)

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)