Kortit II

input/code.cpp: In function 'void combinations2()':
input/code.cpp:109:22: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
  109 |     if (temp2.size() == globalN){
      |         ~~~~~~~~~~~~~^~~~~~~~~~
input/code.cpp:122:26: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  122 |         for (int i = 0; i<temp.size(); i++){
      |                         ~^~~~~~~~~~~~
input/code.cpp: In function 'void combinations()':
input/code.cpp:152:21: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
  152 |     if (temp.size() == globalN){
      |         ~~~~~~~~~~~~^~~~~~~~~~
input/code.cpp: In function 'int main()':
input/code.cpp:217:12: warning: unused variable 'tasapelit' [-Wunused-va...

#include <iostream>
#include <cmath>
#include <vector>
#include <algorithm>
#include <string>
#include <sstream>

typedef long long ll;
using namespace std;



ll kertoma(int x){
    for(int i = x-1; i>0; i--){
        x *= i;
    }

    return x;
}

vector<int> temp;
vector<int> temp2;

int p[1000001];
int p2[1000001];

int globalA;
int globalB;
int globalN;
int vastaus = 0;

// void combinations2(int level, int n){
//     for (int i = 1; i <= n; i++){
//         if (temp2.size() <= level){
//             temp2.push_back(i);
//         }
//         else{
//             temp2[level] = i;
//         }
//         if (level >= n){
//             // THIS COUTS ALL POSSIBLE COMBINATIONS
//             // for (int i2 = 0; i2<temp.size(); i2++){
//             //     cout << temp[i2] << " ";
//             // }
//             // cout << ", ";
//             // for (int i2 = 0; i2<temp2.size(); i2++){
//             //     cout << temp2[i2] << " ";
//             // }
//             // cout << "\n \n";

//             int a = 0;
//             int b = 0;

//             int temp1amount = 0;
//             int temp2amount = 0;

//             for (int i2 = 0; i2<temp.size(); i2++){

//                 if (temp[i2] > temp2[i2]){
//                     a++;
//                 }
//                 else if (temp[i2] < temp2[i2]){
//                     b++;
//                 }

//                 temp1amount += temp[i2];
//                 temp2amount += temp2[i2];
//             }

//             if (a == globalA && b == globalB){

//                 if (temp1amount == kertoma(n) && temp2amount == kertoma(n)){
//                     vastaus ++;
//                 }
//             }
//         }
//         else{
//             combinations2(level+1, n);
//         }
//     }
//     if (level >= n) return;
// }

// void combinations(int level, int n){

//     for (int i = 1; i <= n; i++){
//         if (temp.size() <= level){
//             temp.push_back(i);
//         }
//         else{
//             temp[level] = i;
//         }
//         if (level >= n){
//             // for (int i2 = 0; i<temp.size(); i++){
//             //     cout << temp[i] << " ";
//             // }
//             // cout << "\n";
//             combinations2(0,n);
//         }
//         else{
//             combinations(level+1, n);
//         }
//     }
//     if (level >= n) return;
// }


void combinations2(){
    if (temp2.size() == globalN){
        // for (int i = 0; i<temp.size(); i++){
        //     cout << temp[i] << " ";
        // }
        // cout << "\n";
        // for (int i = 0; i<temp2.size(); i++){
        //     cout << temp2[i] << " ";
        // }
        // cout << "\n \n";

        int a = 0;
        int b = 0;

        for (int i = 0; i<temp.size(); i++){

            if (temp[i] > temp2[i]){
                a++;
            }
            else if (temp[i] < temp2[i]){
                b++;
            }

        }

        if (a == globalA && b == globalB){
            vastaus++;
        }


    }
    else {
        for(int i = 1; i<=globalN; i++){
            if (p2[i]) continue;
            p2[i] = 1;
            temp2.push_back(i);
            combinations2();
            p2[i] = 0;
            temp2.pop_back();
        }
    }
}

void combinations(){
    if (temp.size() == globalN){
        // for (int i = 0; i<temp.size(); i++){
        //     cout << temp[i] << " ";
        // }
        // cout << "\n";

        combinations2();

    }
    else {
        for(int i = 1; i<=globalN; i++){
            if (p[i]) continue;
            p[i] = 1;
            temp.push_back(i);
            combinations();
            p[i] = 0;
            temp.pop_back();
        }
    }
}



int main() {

    int t;

    cin >> t;

    vector<int> nA;
    vector<int> aA;
    vector<int> bA;



    for (int i = 0; i<t; i++){

        int n, a, b;
        cin >> n >> a >> b;

        nA.push_back(n);
        aA.push_back(a);
        bA.push_back(b);
        


    }

    for (int i =0; i<t; i++){


        int n = nA[i], a = aA[i], b = bA[i];

        if (a != 0 && b != 0){
            if (a+b > n){
                cout << "0" << "\n";
                continue;
            }
        }
        else if (a+b != 0){
            cout << "0" << "\n";
            continue;
        }


        ll tasapelit = n-a-b;

        // ll tasapeliparit;  // Tämä lasketaan binomikertoimella, eli kuinka monta kertaa joukosta N voi ottaa <tasapelit> verran numeroita

        // // BINOMIKERROINLASKU:

        // if (tasapelit == 0){
        //     tasapeliparit = 1;
        // }
        // else if (tasapelit == 1){
        //     tasapeliparit = n;
        // }
        // else{
        //     tasapeliparit = kertoma(n)/(kertoma(tasapelit)*kertoma(n-tasapelit));
        // }


        // ll loput = kertoma(n-tasapelit-1);
        // ll vastaus = ((loput*tasapeliparit))*kertoma(n);


        // cout << tasapeliparit << " " << tasapelit << " " << n << " " << vastaus;

        // temp.push_back(0);
        // temp2.push_back(0);

        globalA = a;
        globalB = b;
        globalN = n;

        vastaus = 0;

        combinations();

        cout << vastaus << "\n";

        // temp.clear();
        // temp2.clear();

    }


    



}
 

 

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