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>
const int MAX_N = 200000;
std::vector<int> find_subset(int l, int u, std::vector<int> wo)
{
std::vector<int> ret;
std::vector<std::pair<int, int>> w;
for (int i = 0; i < (int)wo.size(); ++i)
w.push_back(std::make_pair(wo[i], i));
std::sort(w.begin(), w.end());
int i, sum;
for (i = 0, sum = 0; i < MAX_N; ++i) {
sum += w[i].first;
if (sum >= l) {
++i;
break;
}
}
if (sum < l)
return {};
else if (sum <= u)
for (int j = 0; j < i; ++j)
ret.push_back(j + 1);
else {
int j;
for (j = 0; j < i; ++j) {
sum -= w[j].first;
if (sum <= u) {
++j;
break;
}
}
if (sum < l)
return {};
for (; j < i; ++j)
ret.push_back(w[j].second);
}
return ret;
}
# | 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... |