# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
900108 | mannshah1211 | 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>
std::vector<long long> find_subset(long long l, long long u, std::vector<long long> w) {
std::vector<std::pair<long long, long long>> indices;
for (long long i = 0; i < w.size(); i++) {
indices.push_back(std::make_pair(w[i], i));
}
std::sort(indices.begin(), indices.end());
long long n = indices.size();
std::vector<long long> prefix_sums(n);
for (long long i = 0; i < n; i++) {
if (i == 0) {
prefix_sums[i] = indices[i].first;
} else {
prefix_sums[i] = prefix_sums[i - 1] + indices[i].first;
}
}
std::function<long long(long long, long long)> segment_sum = [&](long long l, long long r) {
if (l == 0) {
return prefix_sums[r];
} else {
return prefix_sums[r] - prefix_sums[l - 1];
}
};
for (long long i = 0; i < n; i++) {
long long low = i, high = n - 1, index = -1;
while (low <= high) {
long long middle = (low + high) / 2;
if (segment_sum(i, middle) >= l) {
index = middle;
high = middle - 1;
} else {
low = middle + 1;
}
}
if (index != -1 && segment_sum(i, index) <= u) {
std::vector<long long> answer;
for (long long j = i; j <= index; j++) {
answer.push_back(indices[j].second);
}
return answer;
}
}
return {};
}