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 "cross.h"
#include <bits/stdc++.h>
using namespace std;
long long SelectCross(int k,vector<int> d1,vector<int> d2)
{
int n=d1.size();
long long ans=0;
/*for (int i=0;i<(1<<n);i++)
{
if (__builtin_popcount(i)!=k)
continue;
long long mn1=1e18,mn2=1e18;
for (int j=0;j<n;j++)
{
if (i&(1<<j))
{
mn1=min(mn1,1LL*d2[j]);
mn2=min(mn2,1LL*d1[j]);
}
}
ans=max(ans,mn1*mn1-(mn1-mn2)*(mn1-mn2));
}*/
for (int i=0;i<n;i++)
ans=max(ans,1LL*d2[i]*d2[i]-1LL*(d2[i]-d1[i])*(d2[i]-d1[i]));
return ans;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |