# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
380140 | vishesh312 | 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"
using namespace std;
using ll = long long;
vector<int> find_subset(int l, int u, vector<int> w) {
vector<pair<ll, int>> v;
for (int i = 0; i < (int)w.size(); ++i) {
v.push_back({w[i], i});
}
int n = w.size();
sort(v.begin(), v.end());
ll sum = 0;
int i = 0;
while (sum < l) {
sum += v[i].first;
++i;
}
int end = i;
i = 0;
while (sum > u and !dq.empty()) {
sum -= v[i].first;
++i;
}
vector<int> ret;
for (; i < end; ++i) {
ret.push_back(v[i].second);
}
sort(ret.begin(), ret.end());
bool fsum = (sum >= l and sum <= u);
i = n-1;
sum = 0;
while (sum < l) {
sum += v[i].first;
--i;
}
end = i;
i = n-1;
while (sum > u) {
sum -= v[i].first;
--i;
}
vector<int> r2;
for (; i > end; --i) {
r2.push_back(v[i].second);
}
sort(r2.begin(), r2.end());
if (fsum) return ret;
return r2;
}
int main() {
int l, r, n;
cin >> l >> r >> n;
vector<int> v(n);
for (auto &x : v) cin >> x;
v = find_subset(l, r, v);
for (auto x : v) cout << x << " ";
}