# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
638025 | morasha3 | 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.
#include<bits/stdc++.h>
#include "molecules.h"
#include "grader.cpp"
typedef int ll;
using namespace std;
vector<int> find_subset(int l, int u, vector<int> arr) {
vector<ll>ans;
ll sum=arr[0],l1=1,s=-1,n=arr.size();
sort(arr.begin(),arr.end());
for(int i=0;i<n;i++)
{
if(i!=0)
{
sum-=arr[i-1];
}
if(sum>=l&&sum<=u)
{
s=i;
break;
}
while(l1<n&&sum<l)
{
sum+=arr[l1];
l1++;
}
if(sum>=l&&sum<=u)
{
s=i;
break;
}
}
if(s==-1)return ans;
else
{
for(int i=s;i<l1;i++)
{
if(i==n)break;
ans.push_back(i);
}
return ans;
}
}