Submission #1344114

#	Time	Username	Problem	Language	Result	Execution time	Memory
1344114		sdan	Detecting Molecules (IOI16_molecules)	C++20	31 / 100	1096 ms	12868 KiB

molecules

#include "molecules.h"
#include<bits/stdc++.h>
using namespace std;
#define f first
#define s second
#define pb push_back
const int N = 1e4+1;

vector<int> find_subset(int l, int r, vector<int> w) {
    int n = w.size();
    vector<pair<int, int>> a;
    vector<bitset<N>> dp(N);

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

    sort(a.begin(), a.end());

    queue<int> q; q.push(0);
    while(q.size()) {
        int i = q.front(); q.pop();

        if(l <= i && i <= r) {
            vector<int> s;
            for(int j = 0; j < n; ++j)
                if(dp[i][j]) s.pb(a[j].s);
            return s;
        }

        for(int j = 0; j < n; ++j) {
            if(dp[i][j] || i + a[j].f > r || dp[i + a[j].f] != 0) continue;

            dp[i + a[j].f] = dp[i];
            dp[i + a[j].f][j] = 1;
            q.push(i + a[j].f);
        }
    }

    return {};
}

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