— Dark mode

Datatähti 2025 alku

Kortit I

  • Start: 2024-10-28 00:00:00
  • End: 2024-11-11 00:00:00
CSES - Datatähti 2025 alku - Results
Submission details
Task:Kortit I
Sender:DLPS
Submission time:2024-10-28 16:59:27 +0200
Language:C++ (C++20)
Status:READY
Result:0
Feedback
groupverdictscore
#10
#20
#30
Test results
testverdicttimegroup
#10.00 s1, 2, 3details
#20.00 s2, 3details
#30.00 s3details
#40.00 s3details
#50.00 s3details
#60.00 s3details
#70.00 s3details
#80.00 s3details
#90.00 s3details
#100.00 s3details
#110.00 s3details
#120.00 s3details
#130.00 s3details
#140.00 s3details
#150.00 s3details
#160.00 s3details
#170.00 s3details
#180.01 s3details
#190.00 s3details
#200.00 s3details

Compiler report

input/code.cpp: In function 'gameResult Search(gameState, int, int, gameResult)':
input/code.cpp:70:1: warning: control reaches end of non-void function [-Wreturn-type]
   70 | }
      | ^

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

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:

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
(empty)

Test 2

Group: 2, 3

Verdict:

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:

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:

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
NO
view save

Test 5

Group: 3

Verdict:

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:

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
NO
NO
view save

Test 7

Group: 3

Verdict:

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:

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
NO
NO
NO
NO
NO
view save

Test 9

Group: 3

Verdict:

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:

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
NO
view save

Test 11

Group: 3

Verdict:

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:

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
NO
view save

Test 13

Group: 3

Verdict:

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
NO
NO
view save

Test 14

Group: 3

Verdict:

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
NO
view save

Test 15

Group: 3

Verdict:

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
NO
NO
NO
NO
view save

Test 16

Group: 3

Verdict:

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
NO
NO
view save

Test 17

Group: 3

Verdict:

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
NO
view save

Test 18

Group: 3

Verdict:

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
NO
NO
NO
NO
view save

Test 19

Group: 3

Verdict:

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
NO
NO
NO
NO
NO
...
view save

Test 20

Group: 3

Verdict:

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
NO
NO
NO
NO
NO
...
view save

Tasks

A Pizzat-B Robotti-C Kortit I-D Kortit II-E Niitty-F Tikut-

Submissions (DLPS)

2024-10-28 19:06:14 1002024-10-28 18:35:41 122024-10-28 18:04:19 122024-10-28 17:50:00 122024-10-28 17:00:01 02024-10-28 16:59:27 02024-10-28 15:27:08 02024-10-28 15:26:46 02024-10-28 15:24:39 02024-10-28 15:21:33 0