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;
#define m_p make_pair
#define fi first
#define se second
#define sz(x) ((int)(x).size())
#define all(x) (x).begin(),(x).end()
typedef long long ll;
std::vector<int> find_subset(int l, int r, std::vector<int> w)
{
ll s = 0;
for (int i = 0; i < sz(w); ++i)
s += w[i];
vector<pair<int, int> > v;
for (int i = 0; i < sz(w); ++i)
v.push_back(m_p(w[i], i));
sort(all(v));
if (l <= s && s <= r)
{
vector<int> ans;
for (int i = 0; i < sz(v); ++i)
ans.push_back(i);
return ans;
}
for (int i = 0; i < sz(v); ++i)
{
s -= v[i].fi;
if (l <= s && s <= r)
{
vector<int> ans;
for (int j = i + 1; j < sz(v); ++j)
ans.push_back(v[j].se);
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... |