CSES - Putka Open 2025 – 5/5

Submission details
Task:	Yhdistelmät
Sender:	Yytsi
Submission time:	2025-11-30 20:59:12 +0200
Language:	C++ (C++20)
Status:	READY
Result:	100

Feedback
group	verdict	score
#1	ACCEPTED	16
#2	ACCEPTED	17
#3	ACCEPTED	29
#4	ACCEPTED	38

Test results
test	verdict	time	group
#1	ACCEPTED	0.00 s	1, 2, 3, 4	details
#2	ACCEPTED	0.00 s	1, 3, 4	details
#3	ACCEPTED	0.00 s	1, 4	details
#4	ACCEPTED	0.00 s	1, 4	details
#5	ACCEPTED	0.00 s	1, 4	details
#6	ACCEPTED	0.00 s	1, 4	details
#7	ACCEPTED	0.00 s	1, 4	details
#8	ACCEPTED	0.00 s	1, 4	details
#9	ACCEPTED	0.00 s	1, 4	details
#10	ACCEPTED	0.00 s	1, 4	details
#11	ACCEPTED	0.01 s	2, 3, 4	details
#12	ACCEPTED	0.01 s	3, 4	details
#13	ACCEPTED	0.01 s	4	details
#14	ACCEPTED	0.01 s	4	details
#15	ACCEPTED	0.01 s	4	details
#16	ACCEPTED	0.01 s	4	details
#17	ACCEPTED	0.01 s	4	details
#18	ACCEPTED	0.00 s	1, 2, 3, 4	details
#19	ACCEPTED	0.00 s	1, 2, 3, 4	details
#20	ACCEPTED	0.01 s	4	details
#21	ACCEPTED	0.01 s	4	details

Compiler report

input/code.cpp: In function 'int main()':
input/code.cpp:55:21: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, std::vector<int> > >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   55 |   for (int i = 0; i < combinations.size(); i++) {
      |                   ~~^~~~~~~~~~~~~~~~~~~~~
input/code.cpp:68:25: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   68 |       for (int i = 0; i < P.size()-1; i++) {
      |                       ~~^~~~~~~~~~~~
input/code.cpp: In instantiation of 'main()::<lambda(auto:47&, int)> [with auto:47 = main()::<lambda(auto:47&, int)>]':
input/code.cpp:100:10:   required from here
input/code.cpp:85:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, std::vector<int> > >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   85 |...

Code

#pragma GCC target("avx2,bmi,bmi2,popcnt,lzcnt")
#include <bits/stdc++.h>
using namespace std;
using ll = long long;

int n, m, sink;
int costs[101], v[1010], taken[1010];
vector<pair<int, vector<int>>> combinations;

vector<int> P, A, adj[1010];
ll edgeCost[1010][1010], edgeExists[1010][1010];

ll dfs(int x, ll lim, ll min_c, int id) {
  if (v[x] == id) return -1;
  v[x] = id;
  P.push_back(x);
  if (x == sink) return min_c;

  for (int u : adj[x]) {
    if (edgeCost[x][u] < lim) continue;
    ll r = dfs(u, lim, min(min_c, edgeCost[x][u]), id);
    if (r != -1) return r;
  }

  P.pop_back();
  return -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];
  for (int i = 0; i < m; i++) {
    int k, reward;
    cin>>k>>reward;
    vector<int> pkg;
    for (int j = 0, obj = 0; j < k; j++) {
      cin>>obj;
      pkg.push_back(obj - 1);
    }
    combinations.push_back({reward, pkg});
  }

  ll z = 0, INF = 999999999999LL;

  auto addEdge = [&](int a, int b, ll c) {
    adj[a].push_back(b);
    adj[b].push_back(a);
    edgeCost[a][b] = c;
    edgeExists[a][b] = 1;
    if (c != INF) z += c;
  };

  for (int i = 0; i < combinations.size(); i++) {
    addEdge(1, i + 2, combinations[i].first);
    for (int x : combinations[i].second) addEdge(i+2, x + 2 + combinations.size(), INF);
  }

  sink = 2 + combinations.size() + n;
  for (int j = 0; j < n; j++) addEdge(j + 2 + combinations.size(), sink, costs[j]);

  int id = 0;
  for (;;) {
    P.clear();
    ll r = dfs(1, z, INF, ++id);
    if (r != -1) {
      for (int i = 0; i < P.size()-1; i++) {
        edgeCost[P[i]][P[i+1]] -= r;
        edgeCost[P[i+1]][P[i]] += r;
      }
    } else if (!(z /= 2)) break;
  }

  
  id++;
  ll win = 0;
  vector<int> ans;
  
  auto createA = [&](auto& self, int x) {
    if (v[x] == id) return;
    v[x] = id;
    A.push_back(x);

    if (!(x < 2 || x > 1 + combinations.size())) {
      auto& comb = combinations[x - 2];
      win += comb.first;
      for (int it : comb.second) {
        if (!taken[it]) {
          taken[it] = 1;
          ans.push_back(it + 1);
          win -= costs[it];
        }
      }
    }

    for (int u : adj[x]) if (edgeCost[x][u] > 0) self(self, u);
  };

  createA(createA, 1);

  cout << win << "\n";
  cout << ans.size() << "\n";
  for (int x : ans) cout << x << " ";
  cout<<"\n";
}

Test details

Test 1

Group: 1, 2, 3, 4

Verdict: ACCEPTED

input
`20 20 80 69 91 47 74 75 94 22 100 43...` view save

correct output
`446 11 2 3 5 8 10 13 14 15 17 19 20` view save

user output
`446 11 10 15 5 20 17 2 8 19 14 13 3` view save

Test 2

Group: 1, 3, 4

Verdict: ACCEPTED

input
`20 20 5 42 7 18 55 64 64 83 73 44 22...` view save

correct output
`425 11 1 2 3 4 7 10 13 16 18 19 20` view save

user output
`425 11 4 18 10 1 13 2 3 19 20 7 16` view save

Test 3

Group: 1, 4

Verdict: ACCEPTED

input
`20 20 30 98 55 69 40 3 95 12 64 56 3...` view save

correct output
`284 8 1 3 8 10 15 16 18 19` view save

user output
`284 7 10 19 18 15 8 1 3` view save

Test 4

Group: 1, 4

Verdict: ACCEPTED

input
`20 20 11 44 58 8 16 52 20 43 24 31 4...` view save

correct output
`348 10 2 4 5 7 11 13 15 16 18 20` view save

user output
`348 10 16 2 15 5 4 7 20 13 11 18` view save

Test 5

Group: 1, 4

Verdict: ACCEPTED

input
`20 20 53 44 5 37 88 36 81 47 85 97 3...` view save

correct output
`119 13 1 2 4 8 10 11 13 14 16 17 18 1...` view save

user output
`119 13 14 18 2 1 8 20 17 19 10 4 13 1...` view save

Test 6

Group: 1, 4

Verdict: ACCEPTED

input
`20 20 20 27 75 94 48 62 37 55 49 67 ...` view save

correct output
`478 11 1 2 5 7 10 12 13 15 16 17 18` view save

user output
`478 11 12 18 13 15 16 5 7 1 17 2 10` view save

Test 7

Group: 1, 4

Verdict: ACCEPTED

input
`20 20 32 28 67 72 32 76 53 30 47 67 ...` view save

correct output
`215 10 2 4 5 7 8 9 11 13 16 20` view save

user output
`215 10 2 4 20 8 5 13 16 11 7 9` view save

Test 8

Group: 1, 4

Verdict: ACCEPTED

input
`20 20 39 72 74 79 49 45 73 44 37 4 7...` view save

correct output
`185 13 1 3 5 6 7 8 10 13 14 16 17 18 ...` view save

user output
`185 11 8 20 13 10 16 14 7 18 3 17 1` view save

Test 9

Group: 1, 4

Verdict: ACCEPTED

input
`20 20 41 56 65 78 2 13 17 42 83 76 9...` view save

correct output
`95 11 2 4 5 6 7 8 13 14 17 18 19` view save

user output
`95 11 13 4 5 18 6 17 14 7 8 19 2` view save

Test 10

Group: 1, 4

Verdict: ACCEPTED

input
`20 20 43 1 20 61 25 46 2 18 36 1 85 ...` view save

correct output
`111 8 1 2 3 7 8 10 16 19` view save

user output
`111 8 10 8 2 3 7 16 1 19` view save

Test 11

Group: 2, 3, 4

Verdict: ACCEPTED

input
`100 100 992248 852673 366775 737068 56...` view save

correct output
`30642743 46 3 5 6 9 11 12 15 16 17 18 21 2...` view save

user output
`30642743 46 42 12 46 53 66 16 89 27 9 65 5...` view save

Test 12

Group: 3, 4

Verdict: ACCEPTED

input
`100 100 153790 361741 45017 47184 9422...` view save

correct output
`16529629 39 2 3 4 5 10 12 14 17 24 25 26 3...` view save

user output
`16529629 39 65 17 95 53 66 5 77 2 40 46 63...` view save

Test 13

Group: 4

Verdict: ACCEPTED

input
`100 100 186797 446409 957173 150683 17...` view save

correct output
`14928280 62 1 2 8 9 10 11 12 14 15 16 17 2...` view save

user output
`14928280 62 8 37 94 73 72 48 64 68 20 83 4...` view save

Test 14

Group: 4

Verdict: ACCEPTED

input
`100 100 343213 582494 707357 104682 66...` view save

correct output
`11308944 72 1 3 4 5 6 7 8 9 10 11 12 13 14...` view save

user output
`11308944 72 49 4 30 8 83 81 82 84 34 31 48...` view save

Test 15

Group: 4

Verdict: ACCEPTED

input
`100 100 922546 12088 805566 351521 644...` view save

correct output
`3311952 10 14 17 26 29 64 65 70 76 83 95` view save

user output
`3311952 10 29 14 64 83 65 95 70 76 26 17` view save

Test 16

Group: 4

Verdict: ACCEPTED

input
`100 100 923042 35929 531316 587665 845...` view save

correct output
`519209 6 2 18 45 61 64 86` view save

user output
`519209 6 61 2 18 64 45 86` view save

Test 17

Group: 4

Verdict: ACCEPTED

input
`100 100 493725 218022 417464 531537 83...` view save

correct output
`1255541 11 16 19 24 29 30 50 60 62 67 74 ...` view save

user output
`1255541 11 60 24 19 16 30 50 74 96 67 62 ...` view save

Test 18

Group: 1, 2, 3, 4

Verdict: ACCEPTED

input
`1 1 2 1 1 1` view save

correct output
`0 0` view save

user output
`0 0` view save

Test 19

Group: 1, 2, 3, 4

Verdict: ACCEPTED

input
`1 1 1 1 2 1` view save

correct output
`1 1 1` view save

user output
`1 1 1` view save

Test 20

Group: 4

Verdict: ACCEPTED

input
`100 100 1000000 1000000 1000000 100000...` view save

correct output
`0 100 1 2 3 4 5 6 7 8 9 10 11 12 13 ...` view save

user output
`0 0` view save

Test 21

Group: 4

Verdict: ACCEPTED

input
`100 100 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ...` view save

correct output
`99999900 100 1 2 3 4 5 6 7 8 9 10 11 12 13 ...` view save

user output
`99999900 100 49 69 53 9 84 100 17 52 89 75 ...` view save

Putka Open 2025 – 5/5

Yhdistelmät

Compiler report

Code

Test details

Test 1

Test 2

Test 3

Test 4

Test 5

Test 6

Test 7

Test 8

Test 9

Test 10

Test 11

Test 12

Test 13

Test 14

Test 15

Test 16

Test 17

Test 18

Test 19

Test 20

Test 21

Tasks

Submissions (Yytsi)