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 "molecules.h"
#include<bits/stdc++.h>
using namespace std;
const int N=2e5+5;
#define ll long long
#define pb push_back
#define ff first
#define ss second
std::vector<int> find_subset(int l, int u, std::vector<int> w) {
int n=w.size();
vector<pair<ll,ll>>vc;
for(int i=0;i<n;i++){
vc.pb({w[i],i});
}
sort(vc.begin(),vc.end());
int L=0,R=-1;
ll s=0;
int x=-1,y=-1;
while(1){
if(s<l){
R++;
if(R==n)break;
s+=vc[R].ff;
}
else if(l<=s and s<=u){
x=L;
y=R;
break;
}
else{
s-=vc[L].ff;
L++;
}
}
vector<int>ans;
if(x==y and x==-1)return ans;
for(int i=x;i<=y;i++){
ans.pb(vc[i].ss);
}
return ans;
}
# | 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... |