# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1187015 | rhm_gan | Detecting Molecules (IOI16_molecules) | C++20 | 51 ms | 3656 KiB |
#include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#include "debug.h"
#else
#define dbg(...) 42
#endif
vector<int> find_subset(int k, int u, vector<int> w) {
int n = w.size();
vector<pair<int, int>> a(n);
for (int i = 0; i < n; i++) {
a[i] = {w[i], i};
}
sort(a.begin(), a.end());
long long sum = 0;
for (int l = 0, r = 0; r < n; r++) {
sum += a[r].first;
while (sum > u) {
sum -= a[l++].first;
}
if (k <= sum && sum <= u) {
vector<int> res;
for (int i = l; i <= r; i++) {
res.push_back(a[i].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... |