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;
#define isz(a) ((int)(a.size()))
typedef pair<int,int>ii;
vector<int> find_subset(int l, int u, vector<int> w){
int n=isz(w);
vector<ii>tmp;
for(int i=0;i<n;i++)
tmp.push_back(ii(w[i],i));
sort(tmp.begin(),tmp.end());
vector<int>res;
int L=0;
ll sum=0;
for(int i=0LL;i<isz(tmp);i++)
{
sum+=tmp[i].first;
while(sum>u&&L<=i)
{
sum-=tmp[L].first;
L++;
}
if(sum>=l&&sum<=u)
{
for(int j=L;j<=i;j++)
res.push_back(tmp[j].second);
sort(res.begin(),res.end());
return res;
}
}
return res;
}
# | 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... |