# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1050539 | EntityPlantt | Detecting Molecules (IOI16_molecules) | C++17 | 36 ms | 6348 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 <algorithm>
#include <array>
using namespace std;
vector <int> construct(vector <array <int, 2>> &w, int left, int right) {
vector <int> ret(left + w.size() - right - 1);
for (int i = 0; i < left; i++) ret[i] = w[i][1];
for (int i = 0; i < w.size() - right - 1; i++) ret[i + left] = w[i + right + 1][1];
return ret;
}
vector <int> find_subset(int l, int u, vector <int> _w) {
vector <array <int, 2>> w;
for (int i = 0; i < _w.size(); i++) w.push_back({_w[i], i});
long long sum = 0;
int n = w.size();
sort(w.begin(), w.end());
int left = 0, right = n - 1;
while (right >= 0 && sum < l) sum += w[right--][0];
if (sum < l) return {};
if (sum <= u) return construct(w, 0, right);
while (sum < l || sum > u) {
sum += w[left++][0];
if (left == n) return {};
while (right < n - 1 && sum > u) sum -= w[++right][0];
}
return construct(w, left, right);
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |