# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1134240 | TroySer | Detecting Molecules (IOI16_molecules) | C++20 | 38 ms | 6176 KiB |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
vector<int> find_subset(int l, int u, vector<int> w) {
ll n = w.size();
vector<pair<ll, ll> > w1;
for (ll i = 0; i < n; i++) {
w1.push_back({w[i], i});
}
sort(w1.begin(), w1.end());
ll cSum = 0;
vector<int> r;
for (ll i = 0, j = 0; j < n; j++) {
cSum += w1[j].first;
while (cSum > u) {
cSum -= w1[i++].first;
}
if (cSum >= l) {
for (ll k = i; k <= j; k++) {
r.push_back(w1[k].second);
}
break;
}
}
return r;
}
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... |