Task: | Kortit II |
Sender: | Lytsky |
Submission time: | 2024-11-10 20:51:54 +0200 |
Language: | C++ (C++11) |
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.00 s | 1, 2, 3, 4, 5 | details |
#2 | ACCEPTED | 0.00 s | 2, 3, 4, 5 | details |
#3 | ACCEPTED | 0.01 s | 3, 4, 5 | details |
#4 | WRONG ANSWER | 0.14 s | 4, 5 | details |
#5 | TIME LIMIT EXCEEDED | -- | 5 | details |
#6 | TIME LIMIT EXCEEDED | -- | 5 | details |
Code
#include <bits/stdc++.h> using namespace std; int main() { long long n, t, c, a, b, kortit; cin >> t; for (long long index = 0LL; index < t; index++) { cin >> kortit >> a >> b; long long tasat = kortit - a - b; vector<long long> v; if (tasat < 0LL) cout << 0 << endl; else { n = kortit - tasat; long long fac = 1LL; c = 0LL; if ((a != 0LL and b != 0LL) or n == 0LL) { if (a == 0 and b == 0) c = 1LL; else { //c vector<vector<long long>> previous = {{1LL}, {2LL,3LL,2LL}, {1LL}}, now; for (long long index = 4LL; index < n; index++) { now.push_back({1LL}); now.push_back({2LL}); long long doubles = 4LL; for (long long d = 1LL; d <= index-3LL; d++) { now[1].push_back(doubles); doubles = doubles*2LL; doubles %= 1000000007LL; } now[1].push_back(doubles - 1LL); long long summa = 1; for (long long summai = 0; summai < (long long) previous[1].size(); summai++) { summa += previous[1][summai]; summa %= 1000000007LL; } now[1].push_back(summa); // for (long long i = 1LL; i < (index-1LL)/2LL; i++) { long long uusi = (previous[i].back() - previous[i][0] + now[i].back()); if (uusi < 0) uusi += 1000000007LL*(previous[i][0]/1000000007LL + 1); uusi %= 1000000007LL; if (uusi < 0)cout << "error" << endl; now.push_back({uusi}); for (long long a = 0LL; a < index-1LL; a++) { uusi = -previous[i][a] + previous[i+1][a] + now.back().back(); if (uusi < 0) { uusi += 1000000007LL*(previous[i][a]/1000000007LL + 1); } now[i+1].push_back(uusi % 1000000007LL); } } //reverse if (index % 2LL == 0LL) { v.clear(); for (long long t = index-1LL; t >= 0LL; t--) { v.push_back(now[now.size()-1][t]); } now.push_back(v); } previous = now; now.clear(); } for (long long sumi = 0; sumi < (long long) previous[min(a, b)-1].size(); sumi++) { c = (c + previous[min(a, b)-1][sumi]) ; } c %= 1000000007LL; } vector<long long> vec; for (long long num = 2; num <= tasat; num++) { vec.push_back(num); } for (long long index = kortit-tasat+1; index <= kortit; index++) { fac *= index; fac %= 1000000007LL; for (long long i = 0LL; i < (long long) vec.size(); i++) { if (fac % vec[i] == 0) { fac /= vec[i]; vec.erase(vec.begin() + i); i--; } } } for (long long index = 2; index <= kortit; index++) { fac *= index; fac %= 1000000007LL; } cout << c*fac % 1000000007LL << endl; } else cout << 0 << endl; } } }
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 314347886 0 236712823 ... |
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) |