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) {
vector<int> v = w;
int n = (int)v.size();
vector<int> redosled(n);
iota(redosled.begin(), redosled.end(), 0);
sort(redosled.begin(), redosled.end(), [&](int a, int b) {
return v[a] < v[b];
});
sort(v.begin(), v.end());
ll suma = 0;
for(int i = 0, j = 0; i < n; ++i) {
suma += v[i];
while(j <= i && suma > u) {
suma -= v[j++];
}
if(l <= suma && suma <= u) {
vector<int> ans;
for(int k = j; k <= i; ++k) {
ans.push_back(redosled[k]);
}
return ans;
}
}
return {};
}
# | 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... |