# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
589433 | KrisjanisP | Detecting Molecules (IOI16_molecules) | C++14 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include "molecules.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> ii;
std::vector<int> find_subset(int l, int u, std::vector<int> w) {
ll curW = 0, curI=0;
while(curI<w.size()&&curW<l)
curW += w[curI++];
if(curW<l||curW>r) return {};
vector<int> res;
for(ll i=0;i<curI;i++)
res.push_back(i);
return res;
}