Submission #890157

#	Time	Username	Problem	Language	Result	Execution time	Memory
890157		MercubytheFirst	Detecting Molecules (IOI16_molecules)	C++17	0 / 100	0 ms	348 KiB

molecules

#include "molecules.h"
#include<algorithm>
#include<assert.h>
using namespace std;
using ll = long long;

vector<int> find_subset(int weight_low, int weight_hi, vector<int> w) {
    sort(w.begin(), w.end());
    ll l = 0, r = 0, sum = 0, n = w.size();
    while(sum < weight_low or weight_hi < sum){
        if(sum < weight_low){
            if(n <= r)
                return vector<int>();
            sum += w[r];
            ++r;
        }
        else if(sum > weight_hi){
            assert(l <= r);
            sum -= w[l];
            l++;
        }
    }
    vector<int> ans(w.begin() + l, w.begin() + r);
    return ans;
}

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