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;
std::vector<int> find_subset(int l, int r, std::vector<int> w) {
int n = w.size();
vector <pair<int, int>> a(n);
for (int i = 0; i < n; i++){
a[i] = make_pair(w[i], i);
}
sort(a.begin(), a.end());
vector <long long> p(n + 1, 0);
for (int i = 1; i <= n; i++) p[i] = p[i - 1] + a[i - 1].first;
for (int i = 1; i <= n; i++){
long long mi = p[i];
long long mx = p[n] - p[n - i];
if (mx < l || mi > r) continue;
for (int j = i; j <= n; j++){
long long sum = p[j] - p[j - i];
if (sum >= l && sum <= r){
vector <int> ans;
for (int k = j - i + 1; k <= j; k++) ans.push_back(a[k - 1].second);
return ans;
}
}
}
return std::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... |