| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1351209 | Iwantbemaster | Detecting Molecules (IOI16_molecules) | C11 | 0 ms | 0 KiB |
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
vector<int> find_subset(int l, int u, vector<int> w) {
int n = w.size();
vector<pair<int, int>> sorted_w(n);
for (int i = 0; i < n; i++) {
sorted_w[i] = {w[i], i};
}
sort(sorted_w.begin(), sorted_w.end());
long long sum = 0;
int left = 0;
for (int right = 0; right < n; right++) {
sum += sorted_w[right].first;
while (sum > u && left <= right) {
sum -= sorted_w[left].first;
left++;
}
if (sum >= l && sum <= u) {
vector<int> result;
for (int i = left; i <= right; i++) {
result.push_back(sorted_w[i].second);
}
return result;
}
}
return {};
}
int main() {
int n, l, u;
cin >> n >> l >> u;
vector<int> w(n);
for (int i = 0; i < n; i++) {
cin >> w[i];
}
vector<int> result = find_subset(l, u, w);
cout << result.size() << "\n";
for (int idx : result) {
cout << idx << " ";
}
if (!result.empty()) cout << "\n";
return 0;
}
