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) {
ll n = w.size(), ptr = 0;
vector<pair<ll, ll>> a;
vector<int> ans;
a.push_back({0, 0});
for (int i = 0; i < n; i++) a.push_back({w[i], i});
sort(a.begin(), a.end());
for (int i = 1; i <= n; i++) a[i].first += a[i-1].first;
for (int i = 1; i <= n; i++) {
while (ptr < n && a[ptr].first-a[i-1].first < l) ptr++;
if (l <= a[ptr].first-a[i-1].first && a[ptr].first-a[i-1].first <= u) {
for (int j = i; j <= ptr; j++) ans.push_back(a[j].second);
return ans;
}
}
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... |