# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1270510 | SnowRaven52 | Detecting Molecules (IOI16_molecules) | C++20 | 34 ms | 4132 KiB |
#include <bits/stdc++.h>
using namespace std;
vector<int> find_subset(int l, int u, vector<int> w) {
int n = (int)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 s = 0;
int i = 0;
for (int j = 0; j < n; j++) {
s += a[j].first;
while (s > u && i <= j) { s -= a[i].first; i++; }
if (l <= s && s <= u) {
vector<int> r;
for (int k = i; k <= j; k++) r.push_back(a[k].second);
return r;
}
}
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... |