| Task: | Kortit II | 
| Sender: | PMak | 
| Submission time: | 2024-11-08 23:38:52 +0200 | 
| Language: | C++ (C++17) | 
| Status: | READY | 
| Result: | 0 | 
| group | verdict | score | 
|---|---|---|
| #1 | RUNTIME ERROR | 0 | 
| #2 | RUNTIME ERROR | 0 | 
| #3 | RUNTIME ERROR | 0 | 
| #4 | RUNTIME ERROR | 0 | 
| #5 | RUNTIME ERROR | 0 | 
| test | verdict | time | group | |
|---|---|---|---|---|
| #1 | RUNTIME ERROR | 0.10 s | 1, 2, 3, 4, 5 | details | 
| #2 | RUNTIME ERROR | 0.10 s | 2, 3, 4, 5 | details | 
| #3 | RUNTIME ERROR | 0.10 s | 3, 4, 5 | details | 
| #4 | RUNTIME ERROR | 0.10 s | 4, 5 | details | 
| #5 | RUNTIME ERROR | 0.10 s | 5 | details | 
| #6 | WRONG ANSWER | 0.10 s | 5 | details | 
Compiler report
input/code.cpp:26:19: warning: use of 'auto' in parameter declaration only available with '-std=c++20' or '-fconcepts'
   26 | void print(vector<auto> v) {
      |                   ^~~~Code
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
typedef tree<int,null_type,std::less<int>,rb_tree_tag, tree_order_statistics_node_update> indexed_set;
#define F0R(n) for (int i=0; i<n; i++)
#define FOR(i, from, to) for (i = from; i < to; i++)
#define R0F(n) for (int i = n; i>=0; --i)
#define ROF(from, to) for (int i = from; i >= to; --i)
#define ll long long
#define mod (int) (1e9 + 7)
#define vi vector<int>
#define vll vector<ll>
#define vc vector<char>
#define pii pair<int, int>
#define pci pair<char, int>
#define pll pair<ll, ll>
#define YES cout << "YES\n";
#define NO cout << "NO\n";
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
using namespace std;
void print(vector<auto> v) {
	for (auto it = v.begin(); it != v.end(); ++it)
		cout << *it << " ";
	cout << "\n";
}
vll fact_mod(2001);
void build_fact() {
    fact_mod[0] = 1;
    int i;
    FOR (i, 1, 2001)
        (fact_mod[i] = fact_mod[i-1]*i) %= mod;
}
ll nCr(ll n, ll k) {
    if (k <= 0) return 1;
    ll ans = 1;
    (ans = fact_mod[n]/(fact_mod[k]*fact_mod[n-k]) ) %= mod;
    return ans;
}
ll N = 2001;
vector<vll> dp(N, vll(N, 0));
void build() {
    dp[0][0] = 1;
    ll a, b;
    FOR (a, 1, N) {
        FOR (b, 1, N) {
            (dp[a][b] = dp[a][b-1]*a) %= mod;
            (dp[a][b] += dp[a-1][b]*b) %= mod;
            (dp[a][b] += dp[a-1][b-1]*(a+b-1)) %= mod;
            dp[a][b] %= mod;
        }
    }
}
void soln() {
    ll n, a, b;
    cin >> n >> a >> b;
    ll ans = dp[a][b];
    ans *= nCr(n, a+b);
    ans %= mod;
    ans *= fact_mod[n];
    ans %= mod;
    cout << ans << "\n";
}
int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    build_fact();
    build();
    int tc;
    cin >> tc;
    while (tc--) soln();
    return 0;
}
Test details
Test 1
Group: 1, 2, 3, 4, 5
Verdict: RUNTIME ERROR
| input | 
|---|
| 54 4 4 0 3 1 3 3 2 2 4 0 4 ...  | 
| correct output | 
|---|
| 0 0 0 0 0 ...  | 
| user output | 
|---|
| (empty) | 
Test 2
Group: 2, 3, 4, 5
Verdict: RUNTIME ERROR
| input | 
|---|
| 284 6 1 0 5 0 2 7 1 5 7 7 5 ...  | 
| correct output | 
|---|
| 0 0 35280 0 36720 ...  | 
| user output | 
|---|
| (empty) | 
Test 3
Group: 3, 4, 5
Verdict: RUNTIME ERROR
| input | 
|---|
| 841 19 3 12 19 19 13 19 7 13 20 11 15 ...  | 
| correct output | 
|---|
| 40291066 0 0 0 0 ...  | 
| user output | 
|---|
| (empty) | 
Test 4
Group: 4, 5
Verdict: RUNTIME ERROR
| input | 
|---|
| 1000 15 12 6 7 1 6 44 4 26 6 6 5 ...  | 
| correct output | 
|---|
| 0 5040 494558320 0 340694548 ...  | 
| user output | 
|---|
| (empty) | 
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 | 
|---|
| (empty) | 
Test 6
Group: 5
Verdict: WRONG ANSWER
| input | 
|---|
| 1000 2000 1107 508 2000 1372 249 2000 588 65 2000 1739 78 ...  | 
| correct output | 
|---|
| 750840601 678722180 744501884 159164549 868115056 ...  | 
| user output | 
|---|
| 0 0 0 0 0 ...  | 
