// - Art -
#include <bits/stdc++.h>
#define el cout << '\n'
#define FOR(i, a, b) for (int i = (a), _b = (b); i <= _b; ++i)
#define REV(i, b, a) for (int i = (b), _a = (a); i >= _a; --i)
#define REP(i, c) for (int i = 0, _c = (c); i < _c; ++i)
const int N = 2e5 + 7;
using namespace std;
int idx[N];
vector<int> find_subset(int l, int r, vector<int> w) {
int it = 0, n = w.size();
long long sum = 0;
REP (i, n) {
idx[i] = i;
}
sort(idx, idx + n, [&](int i, int j) {
return w[i] < w[j];
});
REP (i, n) {
sum += w[idx[i]];
while (sum > r) {
sum -= w[idx[it++]];
}
if (l <= sum) {
int sz = 0;
vector<int> result(i - it + 1);
FOR (j, it, i) {
result[sz++] = idx[j];
}
return result;
}
}
return vector<int>();
}
Compilation message (stderr)
molecules.h:1:9: warning: #pragma once in main file
1 | #pragma once
| ^~~~
molecules_c.h:1:9: warning: #pragma once in main file
1 | #pragma once
| ^~~~
# | 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... |