# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1099652 | Trn115 | Detecting Molecules (IOI16_molecules) | C++17 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include "molecules.h"
#include <bits/stdc++.h>
#define int long long
#define fi first
#define se second
#define all(v) v.begin(), v.end()
#define dbg(v) cerr << "\n" << #v << " = " << v << "\n"
using namespace std;
vector<int> find_subset(int l, int u, vector<int> w) {
int n = w.size();
vector<pair<int,int>> a;
for (int i = 0; i < n; ++i) a.push_back({w[i], i});
sort(all(a));
int le = 0, sum = 0;
vector<int> res;
for (int i = 0; i < n; ++i) {
sum += a[i].fi;
while (i-le+1 > 1 && sum > u) sum -= a[le++].fi;
if (l <= sum && sum <= u) {
for (int j = le; j <= i; ++j) res.push_back(a[j].se);
break;
}
}
return res;
}
int main() {
int n, l, u;
assert(3 == scanf("%d %d %d", &n, &l, &u));
std::vector<int> w(n);
for (int i = 0; i < n; i++)
assert(1 == scanf("%d", &w[i]));
std::vector<int> 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]);
}