# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|
149444 | | (대충 적당한 팀명) (#200) | 십자가 놓기 (FXCUP4_cross) | C++17 | | 5 ms | 384 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.
#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 = (long long)(O[i]*O[i]) - (long long)((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... |