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>
#define F first
#define S second
#define pb push_back
using namespace std;
vector<pair<int,int> >a;
vector<int>ans;
bool x;
vector<int> find_subset(int L, int R, vector<int> w)
{
for(int i=0; i<(int)w.size(); i++)
a.pb({w[i], i});
sort(a.begin(), a.end());
int l=0, r=0;
long long sum=0;
while(r<(int)w.size())
{
sum+=a[r].F;
if(L<=sum and sum<=R)
{
x=1;
break;
}
while(R<sum) sum-=a[l++].F;
if(L<=sum and sum<=R)
{
x=1;
break;
}
r++;
}
if(x)
for(int i=l; i<=r; i++) ans.pb(a[i].S);
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... |