Submission #1344090

#TimeUsernameProblemLanguageResultExecution timeMemory
1344090sdanDetecting Molecules (IOI16_molecules)C++20
31 / 100
1095 ms12868 KiB
#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());

    for(set<int> q = {0}; q.size();) {
        int i = *q.begin(); q.erase(q.begin());

        if(i > 0 && dp[i] == 0) continue;
        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.insert(i + a[j].f);
        }
    }

    return {};
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...