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> ans;
vector<int> find_subset(int l, int u, vector<int> w) {
int N = w.size();
vector<pair<int, int>> wp;
for(int i = 0; i < N; i++)
wp.push_back(make_pair(w[i], i));
sort(wp.begin(), wp.end());
long long sum = wp[0].first;
int low = 0, up = 0;
while((sum < l || sum > u) && up < N){
if(low > up)break;
if(sum < l){
up++;
sum += wp[up].first;
}else if(sum > u){
sum -= wp[low].first;
low++;
}
// cout << low << " " << up << " " << sum << "\n";
}
if(l <= sum && sum <= u){
for(int i = low; i <= up; i++){
ans.push_back(wp[i].second);
}
return ans;
}
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... |