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"
long long crossSize(int ins, int outs)
{
return (2*ins*outs-ins*ins);
}
long long SelectCross(int K, std::vector<int> I, std::vector<int> O) {
int N = I.size();
long long ans = 0;
for (int i = 0; i<N; i++)
{
//printf("%d %d -> %lld\n",I[i],O[i],crossSize(I[i],O[i]));
ans = std::max(ans, crossSize(I[i],O[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... |