Submission #798294

#	Time	Username	Problem	Language	Result	Execution time	Memory
798294		Liudas	Detecting Molecules (IOI16_molecules)	C++17	31 / 100	1086 ms	1008 KiB

molecules

#include <bits/stdc++.h>

using namespace std;
vector<int> find_subset(int L, int R, vector<int> M){
    int N = M.size();
    set<int> pos;
    for(int i = 0; i < N; i ++){
        pos.insert(i);
    }
    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;
    while(t){
        for(int i : pos){
            if(t >= M[i] && bits[t - M[i]]){
                t -= M[i];
                pos.erase(i);
                p.push_back(i);
                break;
            }
        }
    }
    return p;
}

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