| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1297934 | kokoue | Detecting Molecules (IOI16_molecules) | C11 | 0 ms | 0 KiB |
#include<bits/stdc++.h>
#define ll long long
#define f first
#define s second
using namespace std;
const int maxn = 2e5+10;
int[] find_subset(int l, int u, int[] w)
{
vector<int> dumb;
int n=sizeof(w)/sizeof(w[0]);
for(int i=0;i<n;i++)
{
dumb.push_back(w[i]);
}
sort(dumb.begin(),dumb.end());
int ll=0,r=0;
ll sum=w[0];
int cntr=2*n+1;
while(cntr)
{
cntr--;
if(l<=sum && sum<=u)
{
///answer
int arr[r-ll+1];
for(int i=ll;i<=r;i++) arr[i-ll]=i;
return arr;
}
if(sum<l)
{
if(r==n-1) return {};
r++;
sum+=w[r];
continue;
}
if(sum>u)
{
if(ll==n-1) return {};
sum-=w[ll];
ll++;
}
}
}
