Submission #655038

#	Time	Username	Problem	Language	Result	Execution time	Memory
655038		benjaminkleyn	Detecting Molecules (IOI16_molecules)	C++17	31 / 100	787 ms	65536 KiB

molecules

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

const int max_n = 100000;

vector<int> find_subset(int l, int u, vector<int> w)
{
    int n = w.size();
    vector<ll> pref(n+1);
    for (int i = 0; i < n; i++)
        pref[i+1] = pref[i] + w[i];
    unordered_map<ll, bitset<max_n>> subsets;
    subsets[0] = bitset<max_n>(0);
    for (int i = 0; i < n; i++)
    {
        vector<pair<ll, bitset<max_n>>> new_subsets;
        vector<ll> too_smol;
        for (auto [sum, subset] : subsets)
        {
            subset[i] = 1;
            if (sum + w[i] <= u)
                new_subsets.push_back({sum + w[i], subset});
            if (sum + pref[n] - pref[i+1] < l)
                too_smol.push_back(sum);
        }
        for (ll sum : too_smol)
            subsets.erase(sum);

        for (auto [sum, subset] : new_subsets)
        {
            subsets[sum] = subset;
            if (l <= sum)
            {
                vector<int> res;
                for (int j = 0; j <= i; j++)
                    if (subset[j])
                        res.push_back(j);
                return res;
            }
        }
    }
    return vector<int>(0,0);
}

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