This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
//Coded by Chirath Nirodha
#include<bits/stdc++.h>
#define F first
#define S second
#define PB push_back
#define MP make_pair
#define P push
#define I insert
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
using namespace std;
const ll mod=1e9+7;
vector<int> find_subset(int l, int u, vector<int> w) {
ll n=w.size();
vector<pair<ll,ll> > v;
for(int i=0;i<n;i++)v.PB(MP(w[i],i));
sort(v.begin(),v.end());
ll cur=0;ll x,y;x=0;
vector<int> ans;
for(y=0;y<n;y++){
cur+=v[y].F;
while(cur>u){cur-=v[x].F;x++;}
if(l<=cur){
for(int i=x;i<=y;i--)ans.PB(v[i].S);
break;
}
}
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... |