# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
394332 | EncryptingWolf | 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.
using namespace std;
typedef long long ll;
int find_subset(int l, int u, int w[], int n, int result[])
{
ll left = 0;
ll right = 0;
for (int i = 0; i < n; i++)
{
left += result[0];
right += result[n - i - 1];
if (l <= left && left <= u)
{
for (int j = 0; j <= i; j++)
{
result[j] = w[j];
}
return i + 1;
}
else if (l <= right && right <= u)
{
for (int j = 0; j <= i; j++)
{
result[n-j-1] = w[n-j-1];
}
return i + 1;
}
else if (l > left && u < right)
{
long double avg = ((long double) l + u) / 2;
ll li = 1;
ll ri = n - 1;
ll total = w[0];
for (int j = 0; j < i; j++)
{
if ((long double)total / (j + 1) > avg)
{
total += w[li];
result[j] = w[li];
li++;
}
else
{
result[j] = w[ri];
total += w[ri];
ri--;
}
}
return i + 1;
}
}
return 0;
}
/*int main()
{
return 0;
}*/