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<bits/stdc++.h>
#include<molecules.h>
#define ll long long
using namespace std;
const int N = 2e5 + 500;
long long pr[N];
vector<int> find_subset(int l , int u , vector<int> w){
int n = w.size();
pr[0] = w[0];
for(int i = 1; i < n; ++i){
pr[i] = pr[i - 1] + w[i];
}
vector<int> res; res.resize(0);
for(int i = 0; i < n; ++i){
int x = pr[i] - l;
int lw = 0 , rh = i;
ll ans = -1;
while(lw <= rh){
int m =(lw + rh) >> 1;
if(w[m] <= x){
ans = m;
lw = m + 1;
} else {
rh = m - 1;
}
}
if(ans != -1){
if(w[ans] >= l && w[ans] <= u){
for(int k = ans; k <= i; ++i){
res.emplace_back(w[k]);
}return res;
}
}
}
return res;
}
# | 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... |