Submission #1309346

#	Time	Username	Problem	Language	Result	Execution time	Memory
1309346		shirokito	Detecting Molecules (IOI16_molecules)	C++20	69 / 100	142 ms	800 KiB

molecules

#include <bits/stdc++.h>
using namespace std;

#define all(a) (a).begin(), (a).end()

using ll = long long;

const int N = 5e5 + 5;

mt19937 rng(363636);

bitset<N> dp;

vector<int> find_subset(int l, int u, vector<int> w) {
    int n = w.size();

    dp[0] = 1;
    for (int &x: w) {
        dp |= (dp << x);
    }

    int cand_weight = -1;

    for (int x = l; x <= u; x++) {
        if (dp[x] == 1) {
            cand_weight = x;
            break;
        }
    }

    if (cand_weight == -1) {
        return vector<int> {};
    }

    vector<pair<int, int>> v;

    for (int i = 0; i < n; i++) {
        v.push_back({w[i], i});
    }

    for (int _ = 0; _ <= 100; _++) {

        shuffle(all(v), rng);

        vector<int> ans;

        int cur = cand_weight;

        for (int i = 0; i < n; i++) {
            if (cur - v[i].first >= 0 && dp[cur - v[i].first]) {
                ans.push_back(v[i].second);
                cur -= v[i].first;
            }
        }

        if (cur == 0) return ans;
    }
    
    return vector<int> {}; 
}

#ifdef LOCAL

void solve() {
    int n, l, u; cin >> n >> l >> u;
    vector<int> w(n); for (int &x: w) cin >> x;

    auto ans = find_subset(l, u, w);

    for (int x: ans) cout << x << ' ';
    cout << '\n';
}

signed main() {
    cin.tie(0) -> sync_with_stdio(0);

    int T = 1; // cin >> T;
    while (T--) {
        solve();
    }
}

#endif

Compilation message (stderr)

molecules.h:1:9: warning: #pragma once in main file
    1 | #pragma once
      |         ^~~~
molecules_c.h:1:9: warning: #pragma once in main file
    1 | #pragma once
      |         ^~~~

• Subtask 1: 9 / 9
• Subtask 2: 10 / 10
• Subtask 3: 12 / 12
• Subtask 4: 15 / 15
• Subtask 5: 23 / 23
• Subtask 6: 0 / 31