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 pb push_back
#define pii pair<int, int>
#define ff first
#define ss second
#define ll long long
pii a[200100];
ll pref[200100];
vector<int> find_subset(int L, int U, vector<int> w) {
int n = w.size();
for(int i=1; i<=n; i++){
a[i] = {w[i - 1], i - 1};
}
sort(a + 1, a + 1 + n);
for(int i=1; i<=n; i++){
pref[i] = pref[i - 1] + a[i].ff;
}
for(int i=1; i<=n; i++){
if(pref[i] > U) break;
if(pref[n] - pref[n-i] < L) continue;
int l=i, r=n;
while(l < r){
int mid=(l + r)/2;
if(pref[mid] - pref[mid - i] < L) l = mid + 1;
else r = mid;
}
vector<int> ans;
for(int j=r-i+1; j<=r; j++) ans.pb(a[j].ss);
return ans;
}
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... |