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;
std::vector<int> find_subset(int l, int u, std::vector<int> z) {
int n=(int)(z.size());
vector<pair<int,int>> w(n);
for (int i=0; i<n; i++) w[i]={z[i],i};
sort(w.begin(),w.end());
int pre=0, x=0;
for (auto i: w){
if (pre+i.first<l) pre+=i.first, x++;
}
vector<int> ans;
if (x==0){
return {w[0].second};
}
int sum=pre, nxt=x, prev=0;
while (sum<l and nxt<n){
sum-=w[prev].first; sum+=w[nxt].first;
nxt++;
prev++;
}
if (sum<l){
return {};
}
for (int i=prev; i<nxt; i++){
ans.push_back(w[i].second);
}
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... |