# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
303010 | noob_c0de | Connecting Supertrees (IOI20_supertrees) | C++17 | 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.
#include<bits/stdc++.h>
using namespace std;
#define ar array
const int mxn=2e5+3;
ar<int,2> a[mxn];
vector<int> find_subset(int l,int u,vector<int> w)
{
int n=w.size();
for (int i=0;i<n;i++)
a[i][0]=w[i],a[i][1]=i;
sort(a,a+n);
vector<int> ans;
int lf=0;
int sum=0;
for (int r=0;r<n;r++)
{
sum+=a[r][0];
if (sum>u)
{
sum-=a[lf][0];
lf++;
}
if (sum>=l)
{
for (int i=lf;i<=r;i++) ans.push_back(a[i][1]);
return ans;
}
}
return ans;
}