Submission #148747

#TimeUsernameProblemLanguageResultExecution timeMemory
148747Little Piplup (#200)Crosses on the Grid (FXCUP4_cross)C++17
8 / 100
90 ms3692 KiB
#include "cross.h"

long long crossSize(int inner, int outer)
{
	long long ins = inner;
	long long outs = outer;
	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 timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...