# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1187023 | orgiloogii | Detecting Molecules (IOI16_molecules) | C++20 | 0 ms | 0 KiB |
#pragma once
#include <bits/stdc++.h>
using namespace std;
vector<int> find_subset(int l, int u, vector<int> w) {
int n = w.size();
vector <pair <int, int>> p;
p.push_back({0, 0});
for (int i = 0;i < n;i++) {
p.push_back({w[i], i});
}
sort(p.begin(), p.end());
vector <int> res;
int l = 1, r = 1;
int suml = 0, sumr = 0;
while (r <= n && l <= n) {
if (sumr - suml < l) {
sumr += p[r].first;
r++;
}
if (p[r - 1].first - p[l - 1].first > u - l) {
suml += p[l].first;
l++;
}
if (sumr - suml > u) {
suml += p[l].first;
l++;
}
if (sumr - suml <= u && sumr - suml >= l && p[r].first - p[l].first <= u - l) {
while (l <= r) {
res.push_back(p[i].second);
}
return res;
}
}
return res;
}