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 ll long long
std::vector<int> find_subset(int l, int u, std::vector<int> w) {
int N = w.size();
vector<int> perm(N);iota(perm.begin(),perm.end(),0);
sort(perm.begin(),perm.end(),[&](int a,int b){return w[a]>w[b];});
ll sum = 0;
vector<int> ans;
for(auto &now:perm){
if(w[now]>u)continue;
if(sum+w[now]>=l){
sum += w[now];
ans.push_back(now);
break;
}
if(sum+w[now]<=l&&sum+w[now]<=u){
ans.push_back(now);
sum += w[now];
}
}
if(sum>=l&&sum<=u)return ans;
else return vector<int>();
}
# | 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... |