Kortit II

input/code.cpp:1:25: warning: extra tokens at end of #include directive
    1 | #include "bits/stdc++.h";
      |                         ^
input/code.cpp: In function 'int EvaluateBranch(int, std::vector<int>, std::vector<int>, int, int, int)':
input/code.cpp:18:35: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   18 |                 for (int i = 0; i < aHand.size(); i++)
      |                                 ~~^~~~~~~~~~~~~~
input/code.cpp:24:43: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   24 |                         for (int j = 0; j < bHand.size(); j++)
      |                                         ~~^~~~~~~~~~~~~~

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

using namespace std;

// Yhteisiä yhdelle testille.
int cardCount = 0;
int aTarget = 0;
int bTarget = 0;
int maxZeros = 0;

// Cards kuvaa montako korttia pelaajilla on jäljellä.
int EvaluateBranch(int cards, vector<int> aHand, vector<int> bHand, int aPoints, int bPoints, int zeros)
{
	// Voidaanko vielä pelata
	if (!(cards - 1 < 0))
	{
		int answer = 0;
		for (int i = 0; i < aHand.size(); i++)
		{
			vector<int> newAHand = aHand;
			swap(newAHand[i], newAHand.back());
			newAHand.pop_back();

			for (int j = 0; j < bHand.size(); j++)
			{
				// Nämä voisi luoda etukäteen jolloin menee enemmän muistia, mutta vähemmän prosessointi tehoa.
				vector<int> newBHand = bHand;
				swap(newBHand[j], newBHand.back());
				newBHand.pop_back();

				int aPoint = 0;
				int bPoint = 0;
				int zero = 0;

				if (aHand[i] != bHand[j])
				{
					if (aHand[i] > bHand[j])
					{
						aPoint++;
					}
					else
					{
						bPoint++;
					}
				}
				else
				{
					zero++;
				}

				answer += EvaluateBranch(cards - 1, newAHand, newBHand, aPoints + aPoint, bPoints + bPoint, zeros + zero);
			}
		}
		return answer;
	}
	else // Ei kortteja jäljellä
	{
		if (aPoints == aTarget && bPoints == bTarget && zeros == maxZeros)
		{
			return 1;
		}
	}
	return 0;
}

void Evaluate(int n, int a, int b)
{
	cardCount = n;
	aTarget = a;
	bTarget = b;
	maxZeros = n - a - b;

	vector<int> baseHand;

	for (int i = 0; i < n; i++)
	{
		baseHand.push_back(i + 1);
	}

	cout << EvaluateBranch(n, baseHand, baseHand, 0, 0, 0) << "\n";
}

int main()
{
	int testCount = 0;
	cin >> testCount;

	for (int i = 0; i < testCount; i++)
	{
		int n, a, b;
		cin >> n >> a >> b;

		Evaluate(n, a, b);
	}
}

Test 1

Group: 1, 2, 3, 4, 5

Verdict: ACCEPTED

Test 2

Group: 2, 3, 4, 5

Verdict: TIME LIMIT EXCEEDED

Test 3

Group: 3, 4, 5

Verdict: TIME LIMIT EXCEEDED

Test 4

Group: 4, 5

Verdict: TIME LIMIT EXCEEDED

Test 5

Group: 5

Verdict: TIME LIMIT EXCEEDED

Test 6

Group: 5

Verdict: TIME LIMIT EXCEEDED