# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
434908 | ToroTN | Detecting Molecules (IOI16_molecules) | C++14 | 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.
#include<bits/stdc++.h>
using namespace std;
#include "molecules.h"
long long it=-1,sum=0,type;
vector<long long> emptyvec;
vector<pair<long long,long long> > v;
std::vector<long long> find_subset(long long l, long long u, std::vector<long long> w) {
for(int i=0;i<w.size();i++)
{
v.push_back(make_pair(w[i],i));
}
for(int i=0;i<v.size();i++)
{
sum+=v[i].first;
if(sum>=l)
{
if(sum<=u)
{
for(int j=0;j<=i;j++)
{
emptyvec.push_back(v[j].second);
}
return emptyvec;
}
it=i;
break;
}
}
if(it==-1)
{
return emptyvec;
}
for(int i=1;i<v.size();i++)
{
type=-1;
sum-=v[i-1].first;
if(sum>=l)
{
if(sum<=u)
{
for(int j=i-1;j<=it;j++)
{
emptyvec.push_back(v[j].second);
}
return emptyvec;
}
continue;
}
for(int j=it+1;j<v.size();j++)
{
sum+=v[j].first;
if(sum>=l)
{
if(sum<=u)
{
for(int k=i;i<=j;i++)
{
emptyvec.push_back(v[k].second);
}
return emptyvec;
}
type=0;
break;
}
}
if(type==-1)
{
return emptyvec;
}
}
return emptyvec;
}