Kortit II

input/code.cpp: In function 'unsigned int recursive_get_solutions(std::vector<unsigned int>, std::vector<unsigned int>, unsigned int, unsigned int)':
input/code.cpp:48:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<unsigned int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   48 |         for (int i = 0; i < choices_copy.size(); i++) {
      |                         ~~^~~~~~~~~~~~~~~~~~~~~

// BRUTE FORCE APPROACH
// ONLY FOR GETTING A COUPLE OF POINTS
 
#include <iostream>
#include <stdlib.h>
#include <vector>
 
const inline unsigned int mod_by = 1000000007;
 
unsigned int factorial(unsigned int n) {
    if (n == 0 || n == 1) {
        return 1;
    }
    return n * factorial(n-1);
}
 
unsigned int recursive_get_solutions(std::vector<unsigned int> moves, std::vector<unsigned int> choices_left, unsigned int a, unsigned int b) {
    if (choices_left.size() == 0) {
        unsigned int p2_move = 1;
 
        unsigned int p1_wins = 0;
        unsigned int p2_wins = 0;
        unsigned int draws = 0;
        for (unsigned int p1_move : moves) {
            if (p1_move > p2_move) {
                p1_wins++;
            } else if (p2_move > p1_move) {
                p2_wins++;
            } else {
                draws++;
            }
 
            p2_move++;
        }
 
        if (a == p1_wins && b == p2_wins) {
            return 1;
        } else {
            return 0;
        }
    }
    unsigned int total = 0;
    for (unsigned int choice : choices_left) {
        std::vector<unsigned int> moves_copy = std::vector<unsigned int>(moves);
        moves.push_back(choice);
        
        std::vector<unsigned int> choices_copy = std::vector<unsigned int>(choices_left);
        for (int i = 0; i < choices_copy.size(); i++) {
            if (choices_copy[i] == choice) {
                choices_copy[i] = choices_copy[choices_copy.size()];
                break;
            }
        }
        choices_copy.pop_back();
        total += recursive_get_solutions(moves_copy, choices_copy, a, b);
    }
    return total;
}
 
int main() {
    unsigned int row_count;
    std::cin >> row_count;
    
    unsigned int *answers = (unsigned int *) malloc(row_count * sizeof(unsigned int));
 
    for (unsigned int i = 0; i < row_count; i++) {
        unsigned int n, a, b;
        std::cin >> n >> a >> b;
 
        unsigned long solutions;
        if (a + b <= n) {
            // brute-force!!
            solutions = factorial(n);
            // assume the p2 move n is n+1 (123456...)
 
            std::vector<unsigned int> choices;
            choices.reserve(n);
            for (unsigned int i = 0; i < n; i++) {
                choices.push_back(i);
            }
            solutions *= recursive_get_solutions(std::vector<unsigned int>(), choices, a, b);
        } else {
            solutions = 0;
        }
        answers[i] = solutions;
    }
 
    for (unsigned int i = 0; i < row_count; i++) {
        std::cout << answers[i] << std::endl;
    }
 
    return 0;
}

Test 1

Group: 1, 2, 3, 4, 5

Verdict: WRONG ANSWER

Test 2

Group: 2, 3, 4, 5

Verdict: WRONG ANSWER

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