# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
996745 | stdfloat | Detecting Molecules (IOI16_molecules) | C++17 | 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 "bits/stdc++.h"
#include "molecules.h"
#include "grader.cpp"
using namespace std;
using ll = long long;
vector<int> find_subset(int L, int R, vector<int> w) {
int n = (int)w.size();
pair<int, int> p[n];
for (int i = 0; i < n; i++)
p[i] = {w[i], i};
sort(p, p + n);
ll sm = 0;
int l = 0;
for (int i = 0; i < n; i++) {
sm += p[i].first;
while (sm > R) sm -= p[l++].first;
if (L <= sm) {
vector<int> v;
while (l <= i) v.push_back(p[l++].second);
return v;
}
}
return {};
}