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;
typedef long long ll;
vector<int> find_subset(int l, int u, vector<int> w) {
int n = w.size();
vector<pair<int, int>> v(n);
vector<int> ans;
for(int i = 0; i < n; i++){
v[i].first = w[i];
v[i].second = i;
}
sort(v.begin(), v.end());
ll sum = v[0].first, s = 0, e = 0;
while(e < n and s < n){
if(sum >= l and sum <= u){
for(int i = s; i <= e; i++)
ans.push_back(v[i].second);
return ans;
}
if(sum < l)
sum += v[++e].first;
if(sum > u)
sum -= v[s++].first;
}
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... |