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;
#define ll long long
#define ln '\n'
const int N = 2e5 + 5;
ll pfx[N], idx[N], n;
vector<ll> vec;
vector<int> ans;
vector<int> find_subset(int l, int u, std::vector<int> w) {
n = w.size(); vec.resize(n+1);
iota(idx, idx+n, 0);
sort(idx, idx+n, [&](int x, int y){return w[x] < w[y];});
for (int i = 1; i <= n; i++) vec[i] = w[idx[i-1]];
for (int i = 1; i <= n; i++) pfx[i] = pfx[i-1] + vec[i];
for (int i = 1; i <= n; i++){
int j = upper_bound(pfx, pfx+n+1, pfx[i] - l) - pfx - 1;
if (j == n+1) continue;
if (l <= pfx[i] - pfx[j] && pfx[i] - pfx[j] <= u){
for (j++; j <= i; j++) ans.push_back(idx[j-1]);
break;
}
}
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... |