# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
418246 | saleh | 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 "molecules.h"
#include <bits/stdc++.h>
#define int long long
using namespace std;
vector<int32_t> find_subset(int32_t l, int32_t u, vector<int32_t> w) {
int n = w.size(), sum = 0;
int p = 0, q = n;
if (accumulate(w.begin(), w.end(), 0ll) < l) return {};
while (p < n && sum + w[p] <= u) sum += w[p++];
if (sum >= l) {
vector<int> v;
for (int i = 1; i <= p; i++) v.push_back(i - 1);
return v;
}
while (p > 0 && sum < l) {
sum += w[--q];
sum -= w[--p];
}
if (sum < l) return {};
else {
vector<int> v;
for (int i = 1; i <= p; i++) v.push_back(i - 1);
for (int i = n; i > q; i--) v.push_back(i - 1);
return v;
}
}
//int32_t main() {}