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;
typedef vector<long long> vi;
typedef vector<pair<long long, long long>> vii;
std::vector<int> find_subset(int l, int r, std::vector<int> w) {
int n = w.size();
vii a(n);
for (int i = 0; i < n; i++)
a[i] = {w[i], i};
sort(a.begin(), a.end());
int tl, tr;
tl = tr = 0;
int yi = a[0].first;
while (tr < n - 1) {
if (l <= yi && yi <= r) {
vector<int> jv;
for (int i = tl; i <= tr; i++) {
jv.push_back(a[i].second);
}
return jv;
}
tr++;
yi += a[tr].first;
while (yi > r && tl < tr) {
yi -= a[tl].first;
tl++;
}
if (l <= yi && yi <= r) {
vector<int> jv;
for (int i = tl; i <= tr; i++) {
jv.push_back(a[i].second);
}
return jv;
}
}
return vector<int>();
}
# | 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... |