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 TRACE(x) cout << #x << " :: " << x << endl;
#define _ << " " <<
#define FOR(i,a,b) for(int i=(a);i<=(b);++i)
#define RFOR(i,a,b) for(int i=(a);i>=(b);--i)
#define SZ(x) ((int)(x).size())
#define ALL(x) (x).begin(),(x).end()
vector<int> find_subset(int l, int u, vector<int> w) {
int N = SZ(w);
vector<int> ind(N);
iota(ALL(ind),0);
sort(ALL(ind),[=](int a, int b){ return (w[a] != w[b] ? w[a] > w[b] : a < b); });
vector<int> ans;
long long sum = 0;
for (int i : ind) {
if (sum+w[i] <= u) {
sum += w[i];
ans.push_back(i);
if (sum >= l) break;
}
}
if (sum < l) ans.clear();
return ans;
}
# | 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... |