# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
780715 | JoenPoenMan | Detecting Molecules (IOI16_molecules) | C++17 | 1 ms | 212 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;
#define ALL(arr) begin(arr), end(arr)
typedef pair<int, int> ii;
std::vector<int> find_subset(int l, int u, std::vector<int> w) {
vector<bool> subset(w.size(), false);
priority_queue<ii> sw;
priority_queue<ii> rsw;
long int sum = 0;
for (int i = 0; i < w.size(); i++) {
sw.push({w[i], i});
rsw.push({w[i], i});
}
while (sum < l) {
auto [weight, ind] = sw.top();
sw.pop();
sum += weight;
subset[ind] = true;
}
int prevInd = -1;
int prevRemInd = -1;
for (int attempts = 2*w.size(); attempts >= 0; attempts--) {
if (sum < l) {
auto [weight, ind] = sw.top();
sw.pop();
subset[ind] = true;
sum += weight;
} else if (sum > u) {
bool suc = false;
while (!suc) {
auto [weight, ind] = rsw.top();
rsw.pop();
if (subset[ind] = true) {
suc = true;
subset[ind] = false;
sum -= weight;
}
}
} else {
vector<int> res;
for (int n = 0; n < subset.size(); n++) if (subset[n]) res.push_back(n);
return res;
}
}
return std::vector<int>(0);
}
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... |