# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
991567 | coolboy19521 | 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"
#define int long long
std::vector<int> find_subset(int l, int u, std::vector<int> w) {
int le, ri, sm;
le = ri = sm = 0;
std::vector <std::pair <int, int>> wi(w.size());
for (int i = 0; i < (int) w.size(); i ++) {
wi[i] = std::make_pair(w[i], i);
}
std::sort(begin(wi), end(wi));
while (ri < (int) wi.size()) {
sm += wi[ri].first;
if (sm > u) {
sm -= wi[le].first;
le ++;
}
if (sm >= l && sm <= u) {
std::vector <int> v;
for (int i = le; i <= ri; i ++) {
v.push_back(wi[i].second);
}
return v;
}
ri ++;
}
return std::vector<int>(0);
}