| Task: | Kortit II | 
| Sender: | Vludo | 
| Submission time: | 2024-11-10 23:51:08 +0200 | 
| Language: | C++ (C++20) | 
| Status: | READY | 
| Result: | 34 | 
| group | verdict | score | 
|---|---|---|
| #1 | ACCEPTED | 3 | 
| #2 | ACCEPTED | 5 | 
| #3 | ACCEPTED | 26 | 
| #4 | WRONG ANSWER | 0 | 
| #5 | WRONG ANSWER | 0 | 
| test | verdict | time | group | |
|---|---|---|---|---|
| #1 | ACCEPTED | 0.01 s | 1, 2, 3, 4, 5 | details | 
| #2 | ACCEPTED | 0.01 s | 2, 3, 4, 5 | details | 
| #3 | ACCEPTED | 0.01 s | 3, 4, 5 | details | 
| #4 | WRONG ANSWER | 0.01 s | 4, 5 | details | 
| #5 | RUNTIME ERROR | 0.01 s | 5 | details | 
| #6 | RUNTIME ERROR | 0.01 s | 5 | details | 
Code
#include<bits/stdc++.h>
using namespace std;
#define forn(i,n) for(int i=0;i<n;++i)
#define forN(i,k,n) for(int i=k;i<n;++i)
#define pb push_back
#define F first
#define S second
#define all(x) (x.begin()),(x.end())
#define rall(x) (x.rbegin()),(x.rend())
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
#define inf ((int)(1.01e9))
#define mod ((int)(1e9+7))
#define N ((int)(100))
ll n, m, a, b;
ll arr[N+2][N+2][N+2], fact[N+2];
ll rev(ll a, ll m) {
    if (a==1) return 1;
    return (1-rev(m%a, a)*m) / a + m;
}
ll nCr(ll n, ll r) {
    if (!r) return 1;
    return (fact[n]%mod * rev(fact[r], mod)%mod * rev(fact[n-r], mod)%mod)%mod;
}
void solve() {
    cin >> m >> a >> b;
    if (m < a + b || ((!b)&&a) || ((!a)&&b)) {
        cout << "0" << endl;
        return;
    }
    if (a > b) swap(a,b);
    n = a + b;
    
    ll comb = nCr(m,m-n);
    comb = comb * comb % mod * fact[m-n] % mod * fact[n] % mod; 
    int counter = arr[n+1][a][b];
    if (!counter) counter=1;
    int result = (counter*comb) % mod;
    cout << result << endl;
}
int main() {
    cin.tie(0) -> sync_with_stdio(0);
    cout.tie(0);
    fact[0] = fact[1] = 1;
    forN(i,2,N) fact[i] = (i)*fact[i-1] % mod; 
    memset(arr, 0, sizeof(arr));
    arr[1][0][0] = 1;
    for(int i = 1; i < N; i++) {
        for(int A = 0; A < i; A++) {
            for(int B = 0; B < i && B+A < i; B++) {
                ll f = i-1 - A - B;
                // a, b, f+1
                arr[i+1][A][B] = (arr[i+1][A][B] + arr[i][A][B]) % mod;
                if (!f) continue;
                // a+1, b, f
                arr[i+1][A+1][B] = (arr[i+1][A+1][B] + f * arr[i][A][B]) % mod;
                // a, b+1, f
                arr[i+1][A][B+1] = (arr[i+1][A][B+1] + f * arr[i][A][B]) % mod;
                // a+1, b+1, f-1
                arr[i+1][A+1][B+1] = (arr[i+1][A+1][B+1] + f*f * arr[i][A][B]) % mod;
            }
        }
    }
    int t;
    cin >> t;
    while(t--) solve();
}Test details
Test 1
Group: 1, 2, 3, 4, 5
Verdict: ACCEPTED
| input | 
|---|
| 54 4 4 0 3 1 3 3 2 2 4 0 4 ...  | 
| correct output | 
|---|
| 0 0 0 0 0 ...  | 
| user output | 
|---|
| 0 0 0 0 0 ...  | 
Test 2
Group: 2, 3, 4, 5
Verdict: ACCEPTED
| input | 
|---|
| 284 6 1 0 5 0 2 7 1 5 7 7 5 ...  | 
| correct output | 
|---|
| 0 0 35280 0 36720 ...  | 
| user output | 
|---|
| 0 0 35280 0 36720 ...  | 
Test 3
Group: 3, 4, 5
Verdict: ACCEPTED
| input | 
|---|
| 841 19 3 12 19 19 13 19 7 13 20 11 15 ...  | 
| correct output | 
|---|
| 40291066 0 0 0 0 ...  | 
| user output | 
|---|
| 40291066 0 0 0 0 ...  | 
Test 4
Group: 4, 5
Verdict: WRONG ANSWER
| input | 
|---|
| 1000 15 12 6 7 1 6 44 4 26 6 6 5 ...  | 
| correct output | 
|---|
| 0 5040 494558320 0 340694548 ...  | 
| user output | 
|---|
| 0 5040 494558320 0 340694548 ...  | 
Test 5
Group: 5
Verdict: RUNTIME ERROR
| input | 
|---|
| 1000 892 638 599 966 429 655 1353 576 1140 1403 381 910 ...  | 
| correct output | 
|---|
| 0 0 0 249098285 0 ...  | 
| user output | 
|---|
| 0 0 0  | 
Test 6
Group: 5
Verdict: RUNTIME ERROR
| input | 
|---|
| 1000 2000 1107 508 2000 1372 249 2000 588 65 2000 1739 78 ...  | 
| correct output | 
|---|
| 750840601 678722180 744501884 159164549 868115056 ...  | 
| user output | 
|---|
| (empty) | 
