Task: | Kortit I |
Sender: | NoelMatero |
Submission time: | 2024-10-31 20:27:19 +0200 |
Language: | C++ (C++11) |
Status: | READY |
Result: | 12 |
group | verdict | score |
---|---|---|
#1 | ACCEPTED | 12 |
#2 | TIME LIMIT EXCEEDED | 0 |
#3 | TIME LIMIT EXCEEDED | 0 |
test | verdict | time | group | |
---|---|---|---|---|
#1 | ACCEPTED | 0.00 s | 1, 2, 3 | details |
#2 | TIME LIMIT EXCEEDED | -- | 2, 3 | details |
#3 | TIME LIMIT EXCEEDED | -- | 3 | details |
#4 | TIME LIMIT EXCEEDED | -- | 3 | details |
#5 | TIME LIMIT EXCEEDED | -- | 3 | details |
#6 | TIME LIMIT EXCEEDED | -- | 3 | details |
#7 | TIME LIMIT EXCEEDED | -- | 3 | details |
#8 | TIME LIMIT EXCEEDED | -- | 3 | details |
#9 | TIME LIMIT EXCEEDED | -- | 3 | details |
#10 | TIME LIMIT EXCEEDED | -- | 3 | details |
#11 | TIME LIMIT EXCEEDED | -- | 3 | details |
#12 | TIME LIMIT EXCEEDED | -- | 3 | details |
#13 | TIME LIMIT EXCEEDED | -- | 3 | details |
#14 | TIME LIMIT EXCEEDED | -- | 3 | details |
#15 | TIME LIMIT EXCEEDED | -- | 3 | details |
#16 | TIME LIMIT EXCEEDED | -- | 3 | details |
#17 | TIME LIMIT EXCEEDED | -- | 3 | details |
#18 | TIME LIMIT EXCEEDED | -- | 3 | details |
#19 | TIME LIMIT EXCEEDED | -- | 3 | details |
#20 | TIME LIMIT EXCEEDED | -- | 3 | details |
Code
#include <iostream> #include <vector> #include <algorithm> #include <functional> using namespace std; bool solve(int n, int a, int b, vector<int>& p1, vector<int>& p2) { if (a + b > n) return false; vector<bool> used1(n + 1, false), used2(n + 1, false); vector<int> cards1, cards2; function<bool(int, int, int)> backtrack = [&](int a_score, int b_score, int k) { if (k == n) return a_score == a && b_score == b; for (int i = 1; i <= n; ++i) { if (!used1[i]) { for (int j = 1; j <= n; ++j) { if (!used2[j]) { used1[i] = used2[j] = true; cards1.push_back(i); cards2.push_back(j); int next_a = a_score, next_b = b_score; if (i > j) next_a++; else if (j > i) next_b++; if (backtrack(next_a, next_b, k + 1)) return true; used1[i] = used2[j] = false; cards1.pop_back(); cards2.pop_back(); } } } } return false; }; if (backtrack(0, 0, 0)) { p1 = cards1; p2 = cards2; return true; } return false; } int main() { int t; cin >> t; while (t--) { int n, a, b; cin >> n >> a >> b; vector<int> p1, p2; if (solve(n, a, b, p1, p2)) { cout << "YES" << endl; for (int i = 0; i < n; ++i) cout << p1[i] << (i == n - 1 ? "" : " "); cout << endl; for (int i = 0; i < n; ++i) cout << p2[i] << (i == n - 1 ? "" : " "); cout << endl; } else { cout << "NO" << endl; } } return 0; }
Test details
Test 1
Group: 1, 2, 3
Verdict: ACCEPTED
input |
---|
54 4 4 0 3 1 3 3 2 2 4 0 4 ... |
correct output |
---|
NO NO NO NO NO ... |
user output |
---|
NO NO NO NO NO ... |
Test 2
Group: 2, 3
Verdict: TIME LIMIT EXCEEDED
input |
---|
284 6 1 0 5 0 2 7 1 5 7 7 5 ... |
correct output |
---|
NO NO YES 1 2 3 4 5 6 7 2 3 4 5 6 1 7 ... |
user output |
---|
(empty) |
Test 3
Group: 3
Verdict: TIME LIMIT EXCEEDED
input |
---|
955 14 2 10 12 2 5 10 4 9 14 1 13 ... |
correct output |
---|
YES 1 2 3 4 5 6 7 8 9 10 11 12 13 ... |
user output |
---|
(empty) |
Test 4
Group: 3
Verdict: TIME LIMIT EXCEEDED
input |
---|
869 17 12 9 16 8 4 15 9 9 17 11 15 ... |
correct output |
---|
NO YES 1 2 3 4 5 6 7 8 9 10 11 12 13 ... |
user output |
---|
(empty) |
Test 5
Group: 3
Verdict: TIME LIMIT EXCEEDED
input |
---|
761 18 3 15 19 1 15 18 8 1 19 19 17 ... |
correct output |
---|
YES 1 2 3 4 5 6 7 8 9 10 11 12 13 ... |
user output |
---|
(empty) |
Test 6
Group: 3
Verdict: TIME LIMIT EXCEEDED
input |
---|
925 21 14 21 20 18 18 20 7 6 21 14 9 ... |
correct output |
---|
NO NO YES 1 2 3 4 5 6 7 8 9 10 11 12 13 ... |
user output |
---|
(empty) |
Test 7
Group: 3
Verdict: TIME LIMIT EXCEEDED
input |
---|
529 22 3 3 22 17 5 22 6 15 22 22 20 ... |
correct output |
---|
YES 1 2 3 4 5 6 7 8 9 10 11 12 13 ... |
user output |
---|
(empty) |
Test 8
Group: 3
Verdict: TIME LIMIT EXCEEDED
input |
---|
576 23 18 9 23 16 8 23 16 13 23 16 22 ... |
correct output |
---|
NO NO NO NO NO ... |
user output |
---|
(empty) |
Test 9
Group: 3
Verdict: TIME LIMIT EXCEEDED
input |
---|
625 24 2 22 24 15 21 24 6 3 24 21 1 ... |
correct output |
---|
YES 1 2 3 4 5 6 7 8 9 10 11 12 13 ... |
user output |
---|
(empty) |
Test 10
Group: 3
Verdict: TIME LIMIT EXCEEDED
input |
---|
676 25 16 25 25 15 2 25 15 7 25 15 16 ... |
correct output |
---|
NO YES 1 2 3 4 5 6 7 8 9 10 11 12 13 ... |
user output |
---|
(empty) |
Test 11
Group: 3
Verdict: TIME LIMIT EXCEEDED
input |
---|
729 26 2 18 26 14 18 26 5 18 26 19 13 ... |
correct output |
---|
YES 1 2 3 4 5 6 7 8 9 10 11 12 13 ... |
user output |
---|
(empty) |
Test 12
Group: 3
Verdict: TIME LIMIT EXCEEDED
input |
---|
784 27 26 7 27 14 0 27 14 5 27 14 14 ... |
correct output |
---|
NO NO YES 1 2 3 4 5 6 7 8 9 10 11 12 13 ... |
user output |
---|
(empty) |
Test 13
Group: 3
Verdict: TIME LIMIT EXCEEDED
input |
---|
841 28 26 16 28 13 19 28 5 8 28 26 4 ... |
correct output |
---|
NO NO YES 1 2 3 4 5 6 7 8 9 10 11 12 13 ... |
user output |
---|
(empty) |
Test 14
Group: 3
Verdict: TIME LIMIT EXCEEDED
input |
---|
900 29 24 15 29 13 2 29 13 7 29 13 16 ... |
correct output |
---|
NO YES 1 2 3 4 5 6 7 8 9 10 11 12 13 ... |
user output |
---|
(empty) |
Test 15
Group: 3
Verdict: TIME LIMIT EXCEEDED
input |
---|
961 30 24 26 30 12 24 30 4 29 30 24 14 ... |
correct output |
---|
NO NO NO NO YES ... |
user output |
---|
(empty) |
Test 16
Group: 3
Verdict: TIME LIMIT EXCEEDED
input |
---|
1000 15 12 6 33 18 30 44 4 26 6 6 5 ... |
correct output |
---|
NO NO YES 1 2 3 4 5 6 7 8 9 10 11 12 13 ... |
user output |
---|
(empty) |
Test 17
Group: 3
Verdict: TIME LIMIT EXCEEDED
input |
---|
1000 45 32 30 4 0 3 46 23 10 71 19 46 ... |
correct output |
---|
NO NO YES 1 2 3 4 5 6 7 8 9 10 11 12 13 ... |
user output |
---|
(empty) |
Test 18
Group: 3
Verdict: TIME LIMIT EXCEEDED
input |
---|
1000 51 29 37 75 11 72 5 2 4 31 8 26 ... |
correct output |
---|
NO NO NO NO YES ... |
user output |
---|
(empty) |
Test 19
Group: 3
Verdict: TIME LIMIT EXCEEDED
input |
---|
1000 50 20 37 99 45 58 86 79 73 85 70 54 ... |
correct output |
---|
NO NO NO NO NO ... |
user output |
---|
(empty) |
Test 20
Group: 3
Verdict: TIME LIMIT EXCEEDED
input |
---|
1000 26 23 5 73 53 59 64 47 41 80 75 55 ... |
correct output |
---|
NO NO NO NO NO ... |
user output |
---|
(empty) |