Kortit II

#include <algorithm>
#include <bits/stdc++.h>

using namespace std;

long mod = 1000000000 + 7;

int fc(int factor) { //factorial
  int answer = 1;
  for (long i = 1; i <= factor; i++) {
    answer *= i;
  }
  return answer;
}

long fcm(int factor) { //factorial
  long answer = 1;
  for (long i = 1; i <= factor; i++) {
    answer = (answer % mod * i % mod) % mod;
  }
  return answer;
}

string sumtest(int n) {
  string answer = "1";
  for (int i = 2; i <= n; i++) {
    answer += "+" + to_string(i);
  }
  return answer;
}
string factortest(int n) {
  string answer = "1";
  for (int i = 2; i <= n; i++) {
    answer += "*" + to_string(i);
  }
  return answer;
}

vector<long> createNumberLine(int n) {
  vector<long> answer = {};
  for (long i = 1; i <= n; i++) {
    answer.push_back(i);
  }
  return answer;
}

int main() {
  /*int a = 0;
  int n = 0;
  cout << "n, a: ";
  cin >> n >> a;
  int ap = 0; //a permutations
  for (int i = 1; i <= n; i++) {
    int d = n-i; // Vaikutusalue
    if (d >= a) { //kertolasku amt: a-1 ja summa amt: d-a+1
      int sum = (d-a+1 != 0) ? d-a+1 : 1;
      ap += (fc(n-i)/fc(sum))*((sum*(sum+1)/2));
      cout << "x: " << i << " ap: " << factortest(n-i) << "/" << factortest(sum) << " sum: " << sumtest(sum) << endl;
      cout << "ap: " << (fc(n-i)/fc(sum))*((sum*(sum+1)/2)) << endl;
    } else {
      continue; //break; ??
    }
  }
  cout << ap;*/

  // b permutations laske katso jos on samanlainen algoritmi
  // jos on skill issue käytä n² kaavaa? jos pystyy?



  long t;
  vector<vector<long>> g;
  cin >> t;
  for (long i = 0; i < t; i++) {
    long n, a, b;
    cin >> n >> a >> b;
    g.push_back({n, a, b});
  }
  for (long i = 0; i < (long)g.size(); i++) {
    long n = g[i][0];
    long a = g[i][1];
    long b = g[i][2];
    long d = n-(a+b); //Tasapelit
    //Tasapelikerroin on tasapelit * n
    //Permutaatiokerroin on n!
    //Nykyinen tavoite: Hanki kaikki permutaatiot järjestykselle 1, 2, 3.. n
    //

    long n2 = n-d; //Uusi n
    long p = 0;

    if (a+b <= n && (abs(a-b) != a+b || a+b == 0)) {
      /*for (int x = 0; x < n; x++) {
        Oikea O(n) ratkaisu tulee tähän
      }*/
      //Bruteforce test:
      //vector<int> l1 = createNumberLine(n);
      vector<long> l2 = createNumberLine(n);
      for (long j = 1; j <= fc(n2); j++) {
        long a1 = 0;
        long b1 = 0;
        for (long k = 0; k < (long)l2.size(); k++) {
          if (l2[k] > k+1) {
            b1++;
          } else if (l2[k] < k+1) {
            a1++;
          }
        }
        if (a1 == a && b1 == b) {
          p++;
        }
        next_permutation(l2.begin(),l2.end());
      }
      long kerroin = (((d%mod)*(n%mod))%mod != 0) ? ((d%mod)*(n%mod))%mod : 1;
      cout << (( ( (p%mod) * (fcm(n)%mod) ) % mod ) * kerroin % mod ) % mod << "\n";
    } else {
      cout << 0 << "test\n";
    }
  } 
}

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: WRONG ANSWER

Test 6

Group: 5

Verdict: WRONG ANSWER