# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
416959 | DEQK | 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>
#define ll long long
using namespace std;
const int N = 100100;
int find_subset(int l,int u, vector<int> w, int n, vector<int> result) {
vector<pair<int, int>> a(n);
vector<ll> pref = {0};
for(int i = 0; i < n; i++) {
a[i] = {w[i], i};
}
sort(a.begin(), a.end());
for(int i = 0; i < n; i++) {
pref.push_back(pref.back() + a[i].first);
}
int ans = -1;
for(int i = 0; i < n; i++) {
int j = lower_bound(pref.begin(), pref.end(), pref[i] + l) - pref.begin();
if(j < pref.size() && pref[j] - pref[i] <= r) {
ans = 0;
for(i++; i <= j; i++) {
result.push_back(a[i].second);
ans++;
}
break;
}
}
return ans;
}