| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1307718 | ayaz | Detecting Molecules (IOI16_molecules) | C++20 | 0 ms | 0 KiB |
#include <bits/stdc++.h>
using namespace std;
#define isz(x) (int)x.size()
#define all(x) (x).begin(),(x).end()
using vi = vector<int>;
using ll = long long;
using pii = pair<int, int>;
vi find_subset(int l, int r, vi w) {
int n = isz(w);
vector<array<int, 2>> a(n);
for (int i = 0; i < n; i++) a[i] = {w[i], i};
sort(all(a));
for (int i = 0; i < n; i++) {
int cur = 0;
vi idx;
for (int j = i; j < n; j++) {
if (cur + a[j][0] <= r) {
idx.push_back(a[j][1]);
cur += a[j][0];
} else {
break;
}
}
if (l <= cur && cur <= r) {
return idx;
}
}
return {};
}
int main() {
int n, l, u;
assert(3 == scanf("%d %d %d", &n, &l, &u));
vi w(n);
for (int i = 0; i < n; i++)
assert(1 == scanf("%d", &w[i]));
vi result = find_subset(l, u, w);
printf("%d\n", (int)result.size());
for (int i = 0; i < (int)result.size(); i++)
printf("%d%c", result[i], " \n"[i == (int)result.size() - 1]);
}
