# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1214675 | michael12 | Detecting Molecules (IOI16_molecules) | C++20 | 36 ms | 4120 KiB |
#include "molecules.h"
#include <vector>
#include <algorithm>
using namespace std;
vector<int> find_subset(int l, int u, vector<int> w) {
int n = w.size();
vector<pair<int, int>> a;
for (int i = 0; i < n; ++i) {
a.push_back({w[i], i});
}
sort(a.begin(), a.end());
long long sum = 0;
for (int i = 0, j = 0; i < n; ++i) {
sum += a[i].first;
while (sum > u && j <= i) {
sum -= a[j].first;
++j;
}
if (sum >= l && sum <= u) {
vector<int> res;
for (int k = j; k <= i; ++k) {
res.push_back(a[k].second);
}
return res;
}
}
return {};
}
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... |