| Task: | Kortit II |
| Sender: | PMak |
| Submission time: | 2024-10-30 17:08:20 +0200 |
| Language: | C++ (C++17) |
| Status: | READY |
| Result: | 0 |
| group | verdict | score |
|---|---|---|
| #1 | WRONG ANSWER | 0 |
| #2 | WRONG ANSWER | 0 |
| #3 | WRONG ANSWER | 0 |
| #4 | WRONG ANSWER | 0 |
| #5 | WRONG ANSWER | 0 |
| test | verdict | time | group | |
|---|---|---|---|---|
| #1 | WRONG ANSWER | 0.01 s | 1, 2, 3, 4, 5 | details |
| #2 | WRONG ANSWER | 0.09 s | 2, 3, 4, 5 | details |
| #3 | TIME LIMIT EXCEEDED | -- | 3, 4, 5 | details |
| #4 | TIME LIMIT EXCEEDED | -- | 4, 5 | details |
| #5 | TIME LIMIT EXCEEDED | -- | 5 | details |
| #6 | TIME LIMIT EXCEEDED | -- | 5 | details |
Compiler report
input/code.cpp:22:19: warning: use of 'auto' in parameter declaration only available with '-std=c++20' or '-fconcepts'
22 | void print(vector<auto> v) {
| ^~~~Code
#include <bits/stdc++.h>
#define F0R(n) for (int i=0; i<n; i++)
#define FOR(from, to) for (int 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";
}
vector<vi> adj(int(1e5+1), vi());
vi vis(int(1e5+1));
pii score(vi& p2) {
int sca=0, scb=0, n = p2.size();
F0R (n) {
if (p2[i]<i+1)
++sca;
else if (p2[i]>i+1)
++scb;
}
return {sca, scb};
}
void soln() {
int n, a, b;
cin >> n >> a >> b;
ll ans = 0, fact_mod = 1;
F0R (n) {
(fact_mod *= i+1) %= mod;
}
// printf("fact_mod=%lld", fact_mod);
set<int> st;
vi p1(n);
vi p2(n, 0);
F0R (n) p1[i]=i+1, p2[i] = i+1;
auto [sca, scb] = score(p2);
pii p;
if ((sca == a) && (scb == b)) {
++ans;
}
while (next_permutation(p2.begin(), p2.end())) {
p = score(p2);
sca = p.first; scb = p.second;
if ((sca == a) && (scb == b)) {
// print(p2);
ans += fact_mod;
ans %= mod;
}
}
cout << ans << "\n";
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int tc;
cin >> tc;
while (tc--) soln();
return 0;
}
Test details
Test 1
Group: 1, 2, 3, 4, 5
Verdict: WRONG ANSWER
| 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: WRONG ANSWER
| 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: TIME LIMIT EXCEEDED
| 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: TIME LIMIT EXCEEDED
| 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: TIME LIMIT EXCEEDED
| 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: TIME LIMIT EXCEEDED
| input |
|---|
| 1000 2000 1107 508 2000 1372 249 2000 588 65 2000 1739 78 ... |
| correct output |
|---|
| 750840601 678722180 744501884 159164549 868115056 ... |
| user output |
|---|
| (empty) |
