Submission #798303

#TimeUsernameProblemLanguageResultExecution timeMemory
798303LiudasDetecting Molecules (IOI16_molecules)C++17
31 / 100
129 ms540 KiB
#include <bits/stdc++.h>

using namespace std;
vector<int> find_subset(int L, int R, vector<int> M){
    int N = M.size();
    bitset<500000> bits;
    bits[0] = 1;
    for(int i = 0; i < N; i ++){
        int a = M[i];
        bits |= (bits << a);
    }
    int t = 0;
    for(int i = L; i <= R; i ++){
        if(bits[i]){t = i;break;}
    }
    vector<int> p;
    for(int i = 0; i < N; i ++){
        if(M[i] && t >= M[i] && bits[t - M[i]]){
            t -= M[i];
            M[i] = 0;
            p.push_back(i);
        }
    }
    return p;
}
#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...