| Task: | Yhdistelmät |
| Sender: | Yytsi |
| Submission time: | 2025-11-29 11:26:50 +0200 |
| Language: | C++ (C++20) |
| Status: | READY |
| Result: | 33 |
| group | verdict | score |
|---|---|---|
| #1 | ACCEPTED | 16 |
| #2 | ACCEPTED | 17 |
| #3 | WRONG ANSWER | 0 |
| #4 | WRONG ANSWER | 0 |
| test | verdict | time | group | |
|---|---|---|---|---|
| #1 | ACCEPTED | 0.15 s | 1, 2, 3, 4 | details |
| #2 | ACCEPTED | 0.18 s | 1, 3, 4 | details |
| #3 | ACCEPTED | 0.15 s | 1, 4 | details |
| #4 | ACCEPTED | 0.19 s | 1, 4 | details |
| #5 | ACCEPTED | 0.17 s | 1, 4 | details |
| #6 | ACCEPTED | 0.18 s | 1, 4 | details |
| #7 | ACCEPTED | 0.17 s | 1, 4 | details |
| #8 | ACCEPTED | 0.18 s | 1, 4 | details |
| #9 | ACCEPTED | 0.23 s | 1, 4 | details |
| #10 | ACCEPTED | 0.17 s | 1, 4 | details |
| #11 | ACCEPTED | 0.00 s | 2, 3, 4 | details |
| #12 | WRONG ANSWER | 0.00 s | 3, 4 | details |
| #13 | WRONG ANSWER | 0.00 s | 4 | details |
| #14 | WRONG ANSWER | 0.00 s | 4 | details |
| #15 | WRONG ANSWER | 0.00 s | 4 | details |
| #16 | WRONG ANSWER | 0.00 s | 4 | details |
| #17 | WRONG ANSWER | 0.00 s | 4 | details |
| #18 | ACCEPTED | 0.00 s | 1, 2, 3, 4 | details |
| #19 | ACCEPTED | 0.00 s | 1, 2, 3, 4 | details |
| #20 | WRONG ANSWER | 0.00 s | 4 | details |
| #21 | WRONG ANSWER | 0.00 s | 4 | details |
Code
#pragma GCC target("avx2,bmi,bmi2,popcnt,lzcnt")
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#ifdef LOCAL
#include "debug.hpp"
#else
#define debug(...) 0xffff
#endif
int n, m;
int costs[101];
vector<pair<int, vector<int>>> combinations;
void solve1() {
int best = 0;
auto bestseq = vector<int>();
for (int S = 0; S < (1<<n); S++) {
int cost = 0, rewards = 0;
for (int j = 0; j < n; j++) {
if (S & (1 << j)) {
cost += costs[j];
}
}
for (auto& comb : combinations) {
bool has = true;
for (int& thing : comb.second) {
if (!(S & (1<<thing))) {
has = false;
break;
}
}
if (has) rewards += comb.first;
}
if (rewards - cost > best) {
best = rewards - cost;
bestseq.clear();
for (int j = 0; j < n; j++) {
if (S & (1 << j)) {
bestseq.push_back(j);
}
}
}
}
cout << best << "\n";
cout << bestseq.size() << "\n";
for (int x : bestseq) cout << x+1 << " ";
}
void solve2() {
int best = 0;
auto bestseq = vector<int>();
for (int i = 0; i < n; i++) {
// should we take this at all?
int total_reward = 0;
for (auto& comb : combinations) {
if (comb.second[0] == i) {
total_reward += comb.first;
}
}
if (total_reward > costs[i]) {
best += total_reward - costs[i];
bestseq.push_back(i);
}
}
cout << best << "\n";
cout << bestseq.size() << "\n";
for (int x : bestseq) cout << x+1 << " ";
}
int main() {
ios_base::sync_with_stdio(0); cin.tie(0);
cin>>n>>m;
for (int i = 0; i < n; i++) cin>>costs[i];
int max_k = 1;
for (int i = 0; i < m; i++) {
int k, reward;
cin>>k>>reward;
max_k = max(max_k, k);
vector<int> pkg;
for (int j = 0; j < k; j++) {
int obj; cin>>obj;
pkg.push_back(obj - 1);
}
combinations.push_back({reward, pkg});
}
if (n <= 20 && m <= 20) return solve1(), 0;
if (max_k == 1) return solve2(), 0;
}Test details
Test 1
Group: 1, 2, 3, 4
Verdict: ACCEPTED
| input |
|---|
| 20 20 80 69 91 47 74 75 94 22 100 43... |
| correct output |
|---|
| 446 11 2 3 5 8 10 13 14 15 17 19 20 |
| user output |
|---|
| 446 11 2 3 5 8 10 13 14 15 17 19 20 |
Test 2
Group: 1, 3, 4
Verdict: ACCEPTED
| input |
|---|
| 20 20 5 42 7 18 55 64 64 83 73 44 22... |
| correct output |
|---|
| 425 11 1 2 3 4 7 10 13 16 18 19 20 |
| user output |
|---|
| 425 11 1 2 3 4 7 10 13 16 18 19 20 |
Test 3
Group: 1, 4
Verdict: ACCEPTED
| input |
|---|
| 20 20 30 98 55 69 40 3 95 12 64 56 3... |
| correct output |
|---|
| 284 8 1 3 8 10 15 16 18 19 |
| user output |
|---|
| 284 7 1 3 8 10 15 18 19 |
Test 4
Group: 1, 4
Verdict: ACCEPTED
| input |
|---|
| 20 20 11 44 58 8 16 52 20 43 24 31 4... |
| correct output |
|---|
| 348 10 2 4 5 7 11 13 15 16 18 20 |
| user output |
|---|
| 348 10 2 4 5 7 11 13 15 16 18 20 |
Test 5
Group: 1, 4
Verdict: ACCEPTED
| input |
|---|
| 20 20 53 44 5 37 88 36 81 47 85 97 3... |
| correct output |
|---|
| 119 13 1 2 4 8 10 11 13 14 16 17 18 1... |
| user output |
|---|
| 119 13 1 2 4 8 10 11 13 14 16 17 18 1... |
Test 6
Group: 1, 4
Verdict: ACCEPTED
| input |
|---|
| 20 20 20 27 75 94 48 62 37 55 49 67 ... |
| correct output |
|---|
| 478 11 1 2 5 7 10 12 13 15 16 17 18 |
| user output |
|---|
| 478 11 1 2 5 7 10 12 13 15 16 17 18 |
Test 7
Group: 1, 4
Verdict: ACCEPTED
| input |
|---|
| 20 20 32 28 67 72 32 76 53 30 47 67 ... |
| correct output |
|---|
| 215 10 2 4 5 7 8 9 11 13 16 20 |
| user output |
|---|
| 215 10 2 4 5 7 8 9 11 13 16 20 |
Test 8
Group: 1, 4
Verdict: ACCEPTED
| input |
|---|
| 20 20 39 72 74 79 49 45 73 44 37 4 7... |
| correct output |
|---|
| 185 13 1 3 5 6 7 8 10 13 14 16 17 18 ... |
| user output |
|---|
| 185 11 1 3 7 8 10 13 14 16 17 18 20 |
Test 9
Group: 1, 4
Verdict: ACCEPTED
| input |
|---|
| 20 20 41 56 65 78 2 13 17 42 83 76 9... |
| correct output |
|---|
| 95 11 2 4 5 6 7 8 13 14 17 18 19 |
| user output |
|---|
| 95 11 2 4 5 6 7 8 13 14 17 18 19 |
Test 10
Group: 1, 4
Verdict: ACCEPTED
| input |
|---|
| 20 20 43 1 20 61 25 46 2 18 36 1 85 ... |
| correct output |
|---|
| 111 8 1 2 3 7 8 10 16 19 |
| user output |
|---|
| 111 8 1 2 3 7 8 10 16 19 |
Test 11
Group: 2, 3, 4
Verdict: ACCEPTED
| input |
|---|
| 100 100 992248 852673 366775 737068 56... |
| correct output |
|---|
| 30642743 46 3 5 6 9 11 12 15 16 17 18 21 2... |
| user output |
|---|
| 30642743 46 3 5 6 9 11 12 15 16 17 18 21 2... |
Test 12
Group: 3, 4
Verdict: WRONG ANSWER
| input |
|---|
| 100 100 153790 361741 45017 47184 9422... |
| correct output |
|---|
| 16529629 39 2 3 4 5 10 12 14 17 24 25 26 3... |
| user output |
|---|
| (empty) |
Test 13
Group: 4
Verdict: WRONG ANSWER
| input |
|---|
| 100 100 186797 446409 957173 150683 17... |
| correct output |
|---|
| 14928280 62 1 2 8 9 10 11 12 14 15 16 17 2... |
| user output |
|---|
| (empty) |
Test 14
Group: 4
Verdict: WRONG ANSWER
| input |
|---|
| 100 100 343213 582494 707357 104682 66... |
| correct output |
|---|
| 11308944 72 1 3 4 5 6 7 8 9 10 11 12 13 14... |
| user output |
|---|
| (empty) |
Test 15
Group: 4
Verdict: WRONG ANSWER
| input |
|---|
| 100 100 922546 12088 805566 351521 644... |
| correct output |
|---|
| 3311952 10 14 17 26 29 64 65 70 76 83 95 |
| user output |
|---|
| (empty) |
Test 16
Group: 4
Verdict: WRONG ANSWER
| input |
|---|
| 100 100 923042 35929 531316 587665 845... |
| correct output |
|---|
| 519209 6 2 18 45 61 64 86 |
| user output |
|---|
| (empty) |
Test 17
Group: 4
Verdict: WRONG ANSWER
| input |
|---|
| 100 100 493725 218022 417464 531537 83... |
| correct output |
|---|
| 1255541 11 16 19 24 29 30 50 60 62 67 74 ... |
| user output |
|---|
| (empty) |
Test 18
Group: 1, 2, 3, 4
Verdict: ACCEPTED
| input |
|---|
| 1 1 2 1 1 1 |
| correct output |
|---|
| 0 0 |
| user output |
|---|
| 0 0 |
Test 19
Group: 1, 2, 3, 4
Verdict: ACCEPTED
| input |
|---|
| 1 1 1 1 2 1 |
| correct output |
|---|
| 1 1 1 |
| user output |
|---|
| 1 1 1 |
Test 20
Group: 4
Verdict: WRONG ANSWER
| input |
|---|
| 100 100 1000000 1000000 1000000 100000... |
| correct output |
|---|
| 0 100 1 2 3 4 5 6 7 8 9 10 11 12 13 ... |
| user output |
|---|
| (empty) |
Test 21
Group: 4
Verdict: WRONG ANSWER
| input |
|---|
| 100 100 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ... |
| correct output |
|---|
| 99999900 100 1 2 3 4 5 6 7 8 9 10 11 12 13 ... |
| user output |
|---|
| (empty) |
