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 pb push_back
#define ll long long
#define fi first
#define si second
#define ar array
typedef pair<int,int> pi;
vector<int> find_subset(int l, int u, vector<int> w) {
vector<pi> A;
for (int i = 0; i < (int)w.size(); ++i) {
A.pb({(ll)w[i], i});
}
int N = A.size();
sort(A.begin(), A.end());
vector<int> ans;
ll sum = 0, idx = 0;
for (int i = 0; i < N; ++i) {
sum += A[i].fi;
while (sum > u) {
sum -= A[idx++].fi;
}
if (sum >= l) {
for (int j = idx; j <= i; ++j) ans.pb(A[j].si);
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... |