# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
101303 | chunghan | 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<bits/stdc++.h>
//#include"molecules.h"
using namespace std;
typedef long long int lld;
typedef pair<int, int> pii;
vector<int> find_subset(int l, int u, vector<int> w) {
vector<pii> p;
vector<int> rst;
int a = 0, b = 0;
lld sum = 0;
for (int i = 0; i < (int)w.size(); i++)
p.push_back({w[i], i});
sort(p.begin(), p.end());
while (b < w.size() && sum < l) {
//cout << 'a';
sum += p[b++].first;
if (l <= sum && sum <= u) break;
while (a <= b && sum > u)
sum -= p[a++].first;
}
//cout << sum << endl;
if (l <= sum && sum <= u)
for (int i = a; i < b; i++)
rst.push_back(p[i].second);
return rst;
}
int main() {
vector<int> w;
w.push_back(6);
w.push_back(8);
w.push_back(8);
w.push_back(7);
vector<int> r = find_subset(15, 17, w);
for (int i = 0; i < r.size(); i++) cout << r[i] << ' ';
return 0;
}