# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1077635 | speedcode | 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;
typedef long long ll;
int find_subset(int l, int u, int* w, int n, int* result){
vector<pair<int, int>> dat(n);
for(int i = 0; i < n; i++){
dat[i] = {w[i], i};
}
sort(dat.begin(), dat.end());
ll s1 = dat[0].first;
ll s2 = dat[n-1].first;
int k = 1;
while(k <= n){
if(s1 > u || s2 < l){
k++;
s1 += dat[k-1].first;
s2 += dat[n-k].first;
}else{
int ind = 0;
for(int i = 0; i < k; i++){
result[i] = dat[i].second;
}
while(s1 < u){
s1 -= dat[ind].first;
s1 += dat[n-ind-1].first;
result[ind] = dat[n-ind-1].second;
}
return k;
}
}
return 0;
}