# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
754691 | alexander707070 | Detecting Molecules (IOI16_molecules) | C++14 | 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.
/******************************************************************************
Online C++ Compiler.
Code, Compile, Run and Debug C++ program online.
Write your code in this editor and press "Run" button to compile and execute i
*/
#include <bits/stdc++.h>
using namespace std;
int n,pref[200007];
pair<int,int> a[200007];
vector<int> answer(int l,int r){
vector<int> res;
for(int i=l;i<=r;i++){
res.push_back(a[i].second);
}
return res;
}
vector<int> find_subset(int l,int u,vector<int> w){
n=w.size();
for(int i=1;i<=n;i++){
a[i]={w[i-1],i-1};
}
sort(a+1,a+n+1);
for(int i=1;i<=n;i++){
pref[i]=pref[i-1]+a[i].first;
}
for(int i=1;i<=n;i++){
int ll=0,int rr=i;
while(ll+1<rr){
mid=(ll+rr)/2;
if(pref[i]-pref[mid]>=l){
ll=mid;
}else{
rr=mid;
}
}
if(pref[i]-pref[ll-1]>=l and pref[i]-pref[ll-1]<=u){
return answer(ll,i);
}
}
}
return {};
}