CSES - Datatähti 2025 alku

CSES - Datatähti 2025 alku - Results

Submission details
Task:	Kortit I
Sender:	DLPS
Submission time:	2024-10-28 17:00:01 +0200
Language:	C++ (C++20)
Status:	READY
Result:	0

Feedback
group	verdict	score
#1	WRONG ANSWER	0
#2	WRONG ANSWER	0
#3	WRONG ANSWER	0

Test results
test	verdict	time	group
#1	WRONG ANSWER	0.01 s	1, 2, 3	details
#2	TIME LIMIT EXCEEDED	--	2, 3	details
#3	TIME LIMIT EXCEEDED	--	3	details
#4	TIME LIMIT EXCEEDED	--	3	details
#5	TIME LIMIT EXCEEDED	--	3	details
#6	TIME LIMIT EXCEEDED	--	3	details
#7	TIME LIMIT EXCEEDED	--	3	details
#8	TIME LIMIT EXCEEDED	--	3	details
#9	TIME LIMIT EXCEEDED	--	3	details
#10	TIME LIMIT EXCEEDED	--	3	details
#11	TIME LIMIT EXCEEDED	--	3	details
#12	TIME LIMIT EXCEEDED	--	3	details
#13	TIME LIMIT EXCEEDED	--	3	details
#14	TIME LIMIT EXCEEDED	--	3	details
#15	TIME LIMIT EXCEEDED	--	3	details
#16	TIME LIMIT EXCEEDED	--	3	details
#17	TIME LIMIT EXCEEDED	--	3	details
#18	TIME LIMIT EXCEEDED	--	3	details
#19	TIME LIMIT EXCEEDED	--	3	details
#20	TIME LIMIT EXCEEDED	--	3	details

Code

//#include "bits/stdc++.h";
#include <bits/stdc++.h>
 
using namespace std;
 
struct gameState
{
	set<int> aHand = set<int>();
	int aScore = 0;
 
	set<int> bHand = set<int>();
	int bScore = 0;
};
 
struct gameResult
{
	bool success = false;
 
	vector<int> aMoves = vector<int>();
	vector<int> bMoves = vector<int>();
};
 
// Etsitään ratkaisu rekursiivisesti.
gameResult Search(gameState state, int a, int b, gameResult currentResult)
{
	// Ei enään pelattavia kortteja
	if (state.aHand.size() == 0)
	{
		gameResult newResult = currentResult;
		newResult.success = (state.aScore == a && state.bScore == b);
		
		return newResult;
	}
 
	// On vielä kortteja
	for (int moveA : state.aHand)
	{
		for (int moveB : state.bHand)
		{
			// Luodaan uusi pelin tilanne
			gameState newState = state;
			gameResult newResult = currentResult;
 
			newResult.aMoves.push_back(moveA);
			newResult.bMoves.push_back(moveB);
			newState.aHand.erase(moveA);
			newState.bHand.erase(moveB);
 
			// Päivitetään pisteet.
			if (moveA != moveB)
			{
				if (moveA > moveB)
				{
					newState.aScore++;
				}
				else
				{
					newState.bScore++;
				}
			}
 
			gameResult recursiveResult = Search(newState, a, b, newResult);
 
			if(recursiveResult.success)
			{
				return recursiveResult;
			}
		}
	}
	return currentResult;
}
 
void EvaluateTest(int n, int a, int b)
{
	// Tarkistetaan onko pisteitä enemmän kuin kortteja
	if (a + b > n)
	{
		cout << "NO";
		return;
	}
 
	// Luodaan molempien pakat
	set<int> playerADeck = set<int>();
	set<int> playerBDeck = set<int>();
	for (int i = 0; i < n; i++)
	{
		playerADeck.insert(i + 1);
		playerBDeck.insert(i + 1);
	}
 
	gameState originalState;
	originalState.aHand = playerADeck;
	originalState.bHand = playerBDeck;
 
	gameResult originalResult;
 
	gameResult gameResult = Search(originalState, a, b, originalResult);
 
	if (!gameResult.success)
	{
		cout << "NO";
		return;
	}
	for (int i = 0; i < n; i++)
	{
		cout << gameResult.aMoves[i];
		if (i != n - 1)
		{
			cout << " ";
		}
	}
	cout << "\n";
	for (int i = 0; i < n; i++)
	{
		cout << gameResult.bMoves[i];
		if (i != n - 1)
		{
			cout << " ";
		}
	}
 
	/*
	// Kortit jotka ollaan pelattu.
	vector<int> playerAPlayed = vector<int>();
	vector<int> playerBPlayed = vector<int>();
 
	int played = 0;
 
	// Montako samaa korttia pelattiin?
	int zeros = n - (a + b);
 
	for (int i = 0; i < zeros; i++)
	{
		// Esim n=5, jolloin n-played-1 = 4 jos ei yht��n pelattu, joka on viimeinen elementti
		playerAPlayed.push_back(playerADeck[n - played - 1]);
		playerADeck.pop_back();
		playerBPlayed.push_back(playerBDeck[n - played - 1]);
		playerBDeck.pop_back();
 
		played++;
	}
 
	// A:n voitot
	for (int i = 0; i < a; i++)
	{
		// A pelaa isoimman
		int aMax = playerADeck[n - played - 1];
		int bCard = playerBDeck[0];
 
		//cout << "aMax: " << aMax << " bCard: " << bCard << "\n";
 
		// Onko a:n kortti isompi kuin b:n?
		if (!(aMax > bCard))
		{
			//cout << "A not greater\n";
			cout << "NO";
			return;
		}
 
		playerAPlayed.push_back(aMax);
		playerADeck.pop_back();
		playerBPlayed.push_back(bCard);
		playerBDeck.erase(playerBDeck.begin());
 
		played++;
	}*/
	/*
	cout << "Decks\n";
	for (int tt : playerADeck)
	{
		cout << tt << " ";
	}
	cout << "\n";
	for (int tt : playerBDeck)
	{
		cout << tt << " ";
	}
	cout << "\n";*/
 
	/*
	//B:n voitot
	for (int i = 0; i < b; i++)
	{
		int aMax = playerADeck[n - played - 1];
		int bMax = playerBDeck[n - played - 1];
 
		//cout << "aMax: " << aMax << " bMax: " << bMax << "\n";
 
		if (!(bMax > aMax))
		{
			//cout << "B not greater\n";
			cout << "NO";
			return;
		}
 
		playerAPlayed.push_back(aMax);
		playerADeck.pop_back();
		playerBPlayed.push_back(bMax);
		playerBDeck.pop_back();
 
		played++;
	}
 
	cout << "YES\n";
 
	for (int i = 0; i < n; i++)
	{
		cout << playerAPlayed[i];
		if (i != n - 1)
		{
			cout << " ";
		}
	}
	cout << "\n";
	for (int i = 0; i < n; i++)
	{
		cout << playerBPlayed[i];
		if (i != n - 1)
		{
			cout << " ";
		}
	}*/
}
 
int main()
{
	int testCount = 0;
	cin >> testCount;
 
	for (int i = 0; i < testCount; i++)
	{
		int n, a, b;
		cin >> n >> a >> b;
 
		EvaluateTest(n, a, b);
 
		if (i < testCount - 1)
		{
			cout << "\n";
		}
	}
}

Test details

Test 1

Group: 1, 2, 3

Verdict: WRONG ANSWER

input
`54 4 4 0 3 1 3 3 2 2 4 0 4 ...` view save

correct output
`NO NO NO NO NO ...` view save

user output
`NO NO NO NO NO ...` view save

Test 2

Group: 2, 3

Verdict: TIME LIMIT EXCEEDED

input
`284 6 1 0 5 0 2 7 1 5 7 7 5 ...` view save

correct output
`NO NO YES 1 2 3 4 5 6 7 2 3 4 5 6 1 7 ...` view save

user output
(empty)

Test 3

Group: 3

Verdict: TIME LIMIT EXCEEDED

input
`955 14 2 10 12 2 5 10 4 9 14 1 13 ...` view save

correct output
`YES 1 2 3 4 5 6 7 8 9 10 11 12 13 ...` view save

user output
(empty)

Test 4

Group: 3

Verdict: TIME LIMIT EXCEEDED

input
`869 17 12 9 16 8 4 15 9 9 17 11 15 ...` view save

correct output
`NO YES 1 2 3 4 5 6 7 8 9 10 11 12 13 ...` view save

user output
(empty)

Test 5

Group: 3

Verdict: TIME LIMIT EXCEEDED

input
`761 18 3 15 19 1 15 18 8 1 19 19 17 ...` view save

correct output
`YES 1 2 3 4 5 6 7 8 9 10 11 12 13 ...` view save

user output
(empty)

Test 6

Group: 3

Verdict: TIME LIMIT EXCEEDED

input
`925 21 14 21 20 18 18 20 7 6 21 14 9 ...` view save

correct output
`NO NO YES 1 2 3 4 5 6 7 8 9 10 11 12 13 ...` view save

user output
(empty)

Test 7

Group: 3

Verdict: TIME LIMIT EXCEEDED

input
`529 22 3 3 22 17 5 22 6 15 22 22 20 ...` view save

correct output
`YES 1 2 3 4 5 6 7 8 9 10 11 12 13 ...` view save

user output
(empty)

Test 8

Group: 3

Verdict: TIME LIMIT EXCEEDED

input
`576 23 18 9 23 16 8 23 16 13 23 16 22 ...` view save

correct output
`NO NO NO NO NO ...` view save

user output
(empty)

Test 9

Group: 3

Verdict: TIME LIMIT EXCEEDED

input
`625 24 2 22 24 15 21 24 6 3 24 21 1 ...` view save

correct output
`YES 1 2 3 4 5 6 7 8 9 10 11 12 13 ...` view save

user output
(empty)

Test 10

Group: 3

Verdict: TIME LIMIT EXCEEDED

input
`676 25 16 25 25 15 2 25 15 7 25 15 16 ...` view save

correct output
`NO YES 1 2 3 4 5 6 7 8 9 10 11 12 13 ...` view save

user output
(empty)

Test 11

Group: 3

Verdict: TIME LIMIT EXCEEDED

input
`729 26 2 18 26 14 18 26 5 18 26 19 13 ...` view save

correct output
`YES 1 2 3 4 5 6 7 8 9 10 11 12 13 ...` view save

user output
(empty)

Test 12

Group: 3

Verdict: TIME LIMIT EXCEEDED

input
`784 27 26 7 27 14 0 27 14 5 27 14 14 ...` view save

correct output
`NO NO YES 1 2 3 4 5 6 7 8 9 10 11 12 13 ...` view save

user output
(empty)

Test 13

Group: 3

Verdict: TIME LIMIT EXCEEDED

input
`841 28 26 16 28 13 19 28 5 8 28 26 4 ...` view save

correct output
`NO NO YES 1 2 3 4 5 6 7 8 9 10 11 12 13 ...` view save

user output
(empty)

Test 14

Group: 3

Verdict: TIME LIMIT EXCEEDED

input
`900 29 24 15 29 13 2 29 13 7 29 13 16 ...` view save

correct output
`NO YES 1 2 3 4 5 6 7 8 9 10 11 12 13 ...` view save

user output
(empty)

Test 15

Group: 3

Verdict: TIME LIMIT EXCEEDED

input
`961 30 24 26 30 12 24 30 4 29 30 24 14 ...` view save

correct output
`NO NO NO NO YES ...` view save

user output
(empty)

Test 16

Group: 3

Verdict: TIME LIMIT EXCEEDED

input
`1000 15 12 6 33 18 30 44 4 26 6 6 5 ...` view save

correct output
`NO NO YES 1 2 3 4 5 6 7 8 9 10 11 12 13 ...` view save

user output
(empty)

Test 17

Group: 3

Verdict: TIME LIMIT EXCEEDED

input
`1000 45 32 30 4 0 3 46 23 10 71 19 46 ...` view save

correct output
`NO NO YES 1 2 3 4 5 6 7 8 9 10 11 12 13 ...` view save

user output
(empty)

Test 18

Group: 3

Verdict: TIME LIMIT EXCEEDED

input
`1000 51 29 37 75 11 72 5 2 4 31 8 26 ...` view save

correct output
`NO NO NO NO YES ...` view save

user output
(empty)

Test 19

Group: 3

Verdict: TIME LIMIT EXCEEDED

input
`1000 50 20 37 99 45 58 86 79 73 85 70 54 ...` view save

correct output
`NO NO NO NO NO ...` view save

user output
(empty)

Test 20

Group: 3

Verdict: TIME LIMIT EXCEEDED

input
`1000 26 23 5 73 53 59 64 47 41 80 75 55 ...` view save

correct output
`NO NO NO NO NO ...` view save

user output
(empty)

Datatähti 2025 alku

Kortit I

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

Tasks

Submissions (DLPS)