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 int ll;
std::vector<int> find_subset(int l, int u, std::vector<int> w) {
int n = w.size();
vector <pair<int, int>> a(n);
for (int i = 0; i < n; i++){
a[i] = {w[i], i};
}
sort(a.begin(), a.end());
vector <int> ans;
for (int i = 0; i < n; i++){
ll sum = 0;
for (int j = i; j < n; j++){
sum += a[j].first;
if (sum >= l and sum <= u){
for (int k = i; k <= j; k++){
ans.push_back(a[k].second);
}
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... |