Task: | Kortit II |
Sender: | PMak |
Submission time: | 2024-11-09 10:38:27 +0200 |
Language: | C++ (C++17) |
Status: | READY |
Result: | 100 |
group | verdict | score |
---|---|---|
#1 | ACCEPTED | 3 |
#2 | ACCEPTED | 5 |
#3 | ACCEPTED | 26 |
#4 | ACCEPTED | 28 |
#5 | ACCEPTED | 38 |
test | verdict | time | group | |
---|---|---|---|---|
#1 | ACCEPTED | 0.13 s | 1, 2, 3, 4, 5 | details |
#2 | ACCEPTED | 0.13 s | 2, 3, 4, 5 | details |
#3 | ACCEPTED | 0.13 s | 3, 4, 5 | details |
#4 | ACCEPTED | 0.13 s | 4, 5 | details |
#5 | ACCEPTED | 0.13 s | 5 | details |
#6 | ACCEPTED | 0.13 s | 5 | details |
Compiler report
input/code.cpp:13:19: warning: use of 'auto' in parameter declaration only available with '-std=c++20' or '-fconcepts' 13 | void print(vector<auto> v) { | ^~~~
Code
#include <bits/stdc++.h>#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 (ll) (1e9 + 7)#define vll vector<ll>using namespace std;void print(vector<auto> v) {for (auto it = v.begin(); it != v.end(); ++it)cout << *it << " ";cout << "\n";}ll N = 2001;vll fact_mod(2*N+2, 0);void build_fact() {fact_mod[0] = 1ll;ll i;FOR (i, 1ll, 2*N+2)// fact_mod[i] = fact_mod[i-1]*i;(fact_mod[i] = fact_mod[i-1]*i) %= mod;// print(fact_mod);}vector<vll> nCr_mod(N+1, vll(N+1,0));void build_nCr() {ll n, k;nCr_mod[0][0] = 1ll;FOR (n, 1, N+1) {FOR (k, 0, n+1) {if (k == 0)nCr_mod[n][k] = 1ll;else {nCr_mod[n][k] = nCr_mod[n-1][k-1]%mod;nCr_mod[n][k] += nCr_mod[n-1][k] % mod;nCr_mod[n][k] %= mod;}}}/*for (auto v : nCr_mod)print(v);*/}/*ll nCr(ll n, ll k) {if (k <= 0) return 1ll;ll ans = 1ll, i;FOR (i, n-k+1, n+1)ans *= i;FOR (i, 1, k+1)ans /= i;ans %= mod;return ans;}*/vector<vll> dp(N, vll(N, 0));void build() {dp[0][0] = 1ll;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-1ll)) %= mod;// (dp[a][b] *= fact_mod[a+b]) %= mod;}}}void soln() {ll n, a, b, ans;cin >> n >> a >> b;if (a+b>n) {ans = 0;cout << ans << "\n";return;}ans = dp[a][b];// cout << ans << "\n";ans *= nCr_mod[n][a+b];ans %= mod;// cout << ans << "\n";ans *= fact_mod[n];ans %= mod;cout << ans << "\n";}int main() {ios_base::sync_with_stdio(false);cin.tie(NULL);build_fact();build_nCr();build();int tc;cin >> tc;while (tc--) soln();return 0;}
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: ACCEPTED
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: ACCEPTED
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 249098285 0 ... |
Test 6
Group: 5
Verdict: ACCEPTED
input |
---|
1000 2000 1107 508 2000 1372 249 2000 588 65 2000 1739 78 ... |
correct output |
---|
750840601 678722180 744501884 159164549 868115056 ... |
user output |
---|
750840601 678722180 744501884 159164549 868115056 ... |