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;
int n;
long long suma=0,mina=(1<<31);
std::vector<int> find_subset(int l, int u, std::vector<int> w) {
n=w.size();
for(auto x:w){
suma+=x;
mina=min(mina,1ll*x);
}
if(l>suma||u<mina){
return {};
}
int suf=n-1,ps=-1,unnow=w[suf];
while(ps<n){
if(unnow>=l&&unnow<=u){
vector<int>ret;
for(int i=0;i<=ps;i++){
ret.push_back(i);
}
for(int i=suf;i<n;i++){
ret.push_back(i);
}
return ret;
}
if(unnow<l){
unnow+=w[suf-1];
suf--;
}else{
unnow-=w[suf];
suf++;
unnow+=w[ps+1];
ps++;
}
}
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... |