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;
int n;
long long 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 lt=0, rt=i, mid;
while(lt+1<rt){
mid=(lt+rt)/2;
if(pref[i]-pref[mid]>=l){
lt=mid;
}else{
rt=mid;
}
}
if(pref[i]-pref[lt]>=l and pref[i]-pref[lt]<=u){
return answer(lt+1,i);
}
}
return {};
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |