# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1211230 | madamadam3 | Detecting Molecules (IOI16_molecules) | C++20 | 0 ms | 328 KiB |
#include "molecules.h"
#include <bits/stdc++.h>
using namespace std;
// const int MAX_SUM = 500'000;
// using bset = bitset<MAX_SUM+1>;
vector<int> find_subset(int l, int u, vector<int> w) {
int n = w.size();
vector<int> o(n); iota(o.begin(), o.end(), 0);
sort(o.begin(), o.end(), [&](int a, int b) {return w[a] < w[b];});
reverse(o.begin(), o.end());
int cur_sum = 0;
vector<int> ans;
for (int idx = 0; idx < n; idx++) {
int i = o[idx];
if (cur_sum + w[i] <= u) {
cur_sum += w[i];
ans.push_back(i);
}
}
if (cur_sum < l || cur_sum > u) ans.clear();
return ans;
}
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... |