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> arr) {
int n = arr.size();
vector<int64_t>pref(n+1,0);
vector<pair<int,int>>brr(n);
for (int i = 0;i<n;++i){
brr[i] = {arr[i],i};
}
sort(brr.begin(),brr.end());
for (int i = 0;i<n;++i){
pref[i+1] = pref[i] + brr[i].first;
}
vector<int>ans;
int r = 0;
for (int i = 0;i<=n;++i){
if (pref[i] - pref[r]>=l&&pref[i]-pref[r]<=u){
for (int j = r+1;j<=i;++j){
ans.push_back(brr[j - 1].second);
return ans;
}
}
while (r<i&&pref[i] - pref[r]>u){
++r;
}
}
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... |