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 <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
#define f first
#define s second
#define ll long long
#define ld long double
#define all(_v) _v.begin(), _v.end()
#define sz(_v) (int)_v.size()
#define pii pair <int, int>
#define pll pair <ll, ll>
#define veci vector <int>
#define vecll vector <ll>
veci find_subset(int asd, int asdas, veci w) {
ll l = asd, r = asdas;
vector <pair <ll, int> > a;
for(int i = 0; i < sz(w); ++i) {
if(l <= w[i] && w[i] <= r) return {i};
if(w[i] <= r)
a.pb(mp(w[i], i));
}
sort(all(a));
reverse(all(a));
ll sum = 0;
veci res;
for(int i = 0; i < sz(a); ++i) {
res.pb(a[i].s);
sum += a[i].f;
if(l <= sum && sum <= r) return res;
}
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... |