# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
321832 | nikatamliani | Detecting Molecules (IOI16_molecules) | C++14 | 73 ms | 4844 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>
using namespace std;
vector<int> find_subset(int l, int u, vector<int>w) {
int n = w.size();
vector<int> indices(n);
for(int i = 0; i < n; ++i) {
indices[i] = i;
}
sort(indices.begin(), indices.end(), [&](int x, int y) {
return w[x] > w[y];
});
#define ll long long
vector<int> result;
ll sum = 0, save = n + 1;
for(int i = 0; i < n; ++i) {
int index = indices[i];
sum += w[index];
result.push_back(index);
if(sum >= l) {
save = i + 1;
break;
}
}
if(save == n + 1) {
return vector<int>{};
}
int from = n - 1;
int ptr = 0;
while(from >= save && sum > u && ptr < result.size()) {
sum -= w[result[ptr]];
result[ptr] = indices[from--];
sum += w[result[ptr++]];
ptr %= (int)result.size();
}
if(sum <= u) {
if(sum < l)while(true) {}
assert(sum >= l);
return result;
}
return vector<int>{};
}
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... |