# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
951300 | chandu33 | 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>
using namespace std;
vector<int> find_subset(int L, int U, int[] A) {
vector<int> ans;
int N = A.length;
vector<int> pos(N);
iota(pos.begin(), pos.end(), 0);
sort(pos.begin(), pos.end(), [&A](int a, int b){
return A[a] < A[b];
});
sort(A, A + N);
int low = 0, high = N - 1;
ll sum = 0;
int i = 0, j = 0;
for(int i = 0; i < N; i++) {
sum += A[i];
while(sum > U) {
sum -= A[j++];
}
if(sum >= L && sum <= U) {
for(int k = j; k <= i; k++) {
ans.push_back(pos[k]);
}
break;
}
}
return ans;
}