| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 774590 | JMs | Detecting Molecules (IOI16_molecules) | C++17 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
vector<long long> find_subset(long long l, long long u, vector<long long> w)
{
unsigned const long long tam = 200005;
long long v[tam], aux, c=0, ph, pl, s;
vector <long long> result;
for( long long i=0; i<w.size(); i++){
v[i]=i;
}
for( long long i=0; i<w.size()-1; i++){
for( long long j=i+1; j<w.size(); j++){
if(w[i]>w[j]){
aux=w[j];
w[j]=w[i];
w[i]=aux;
aux=v[j];
v[j]=v[i];
v[i]=aux;
}
}
}
pl=0;
ph=0;
s=w[0];
while(1){
//cout<<pl<<" "<<ph<<" "<<s<<endl;
if(s<l && ph<w.size()-1){
ph++;
s+=w[ph];
}
else if(s>u && pl<ph){
s-=w[pl];
pl++;
}
else if( ph==w.size()-1 && (s>u || s<l)){
return vector<long long>();
break;
}
else{
for( long long i=pl; i<=ph; i++){
result.push_back(v[i]);
}
break;
}
}
return result;
}