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;
vector<int> find_subset(int l, int u, vector<int> w)
{
vector<pair<long long, int>> y;
for (size_t i = 0; i < w.size(); i++)
y.emplace_back(w[i], i);
sort(w.begin(), w.end());
sort(y.begin(), y.end());
vector<int> ind;
for (auto p : y)
ind.push_back(p.second);
long long x = 0;
for (size_t i = 0; i < w.size(); i++)
{
if (l <= x && x <= u)
return vector<int>(ind.begin(), ind.begin() + i);
x += w[i];
}
if (l <= x && x <= u)
return w;
x = 0;
for (size_t i = w.size() - 1; i < w.size(); i--)
{
if (l <= x && x <= u)
return vector<int>(ind.begin() + i + 1, ind.end());
x += w[i];
}
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... |