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 pii pair<int,int>
using namespace std;
std::vector<int> find_subset(int l, int u, std::vector<int> w) {
vector<pii> a;
int n = (int)w.size();
for(int i = 0 ; i < n ;i++){
a.push_back(make_pair(w[i],i));
}
sort(a.begin(),a.end());
int left=0;
int right=0;
long long actSum=0;
while(true){
if(actSum>u){
if(left==right)return {};
actSum-=a[left++].first;
}else if(actSum<l){
if(right==n)return {};
actSum+=a[right++].first;
}else{
break;
}
}
vector<int> ans;
for(int i=left;i<right;i++){
ans.push_back(a[i].second);
}
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... |