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 ll long long
using namespace std;
vector<int> find_subset(int l, int u, vector<int> w) {
//return vector<int>(0);
int n = w.size();
vector<pair<int,int> > v;
for(int i = 0;i<n;i++){
v.push_back({w[i], i});
}
sort(v.begin(),v.end());
int lo = 0;
int hi = 0;
ll sum = 0;
while(hi < n && lo < n){
sum += v[hi].first;
while(sum > u && lo < n){
sum -= v[lo].first;
lo++;
}
if(sum >= l && sum <= u){
vector<int> r;
for(int i = lo;i<=hi;i++){
r.push_back(v[i].second);
}
return r;
}
hi++;
}
return vector<int>(0);
}
# | 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... |