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 <bits/stdc++.h>
#include "molecules.h"
using namespace std;
const int mxN = 200005;
vector<int> find_subset(int l, int u, vector<int> w) {
vector<pair<int, int> > arr;
int n = w.size();
for(int i = 0; i < n; i++)
arr.push_back({w[i], i});
sort(arr.begin(), arr.end());
vector<int> ans;
int i = 0, j = 0;
long long sum = 0;
while(j < n) {
while(j < n && sum+arr[j].first <= u)
sum += arr[j++].first;
if(l <= sum) {
for(int k = i; k < j; k++)
ans.push_back(arr[k].second);
break;
}
sum -= arr[i++].first;
}
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... |