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;
#define ll long long
vector<int> find_subset(int l, int u, vector<int> a)
{
vector<pair<ll,int > >ans;
vector<int>ans1;
int n=a.size();
ll sum=0;
for(int i=0;i<n;i++){
sum+=a[i];
ans.push_back({(ll)a[i],i});
}
if(sum<(ll)l)
return ans1;
sort(ans.begin(),ans.end());
int s=0;
sum=0;
for(int i=0;i<n;i++){
ll f=ans[i].first;
sum+=f;
while(sum>(ll)u){
sum-=ans[s].first;
s++;
}
if(sum>=(ll)l&&sum<=(ll)u){
for(int j=s;j<=i;j++){
ans1.push_back(ans[j].second);
}
return ans1;
}
}
return ans1;
}
| # | 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... |