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 SelectCross(int K, std::vector<int> I, std::vector<int> O) {
int N = I.size();
long long maxsize = 0;
for(int i=0;i<N;i++){
long long now = O[i]*O[i] - (O[i]-I[i])*(O[i]-I[i]);
maxsize = (maxsize>now)?maxsize:now;
}
return maxsize;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |