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