# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
646886 | tigar | 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;
typedef long long ll;
int find_subset(int l, int u, int* w, int n, int* result)
{
sort(w, w+n);
long long sums[n+1];
sums[0]=(ll)0;
for(int i=1; i<=n; i++)sums[i]=(ll)w[i-1]+sums[i-1];
for(int i=1, j=1; i<=n;)
{
int sum=sums[i]-sums[j-1];
if(sum>=l and sum<=u)
{
for(int k=j-1, l=0; k<i; k++, l++)result[l]=w[k];
break;
}
else if(sum<l)i++;
else if(sum>u)j++;
}
return 0;
}