oj.uz

답안 #149590

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
149590 2019-09-01T06:47:52 Z (대충 적당한 팀명)(#3621, rose0310, cos18, baikdohyup) 십자가 놓기 (FXCUP4_cross) C++17
8 / 100
 87 ms 3688 KB 
#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]*(long long)O[i] - ((long long)O[i]-(long long)I[i])*((long long)O[i]-(long long)I[i]);
		maxsize = (maxsize>now)?maxsize:now;
	}
	return maxsize;
}

Subtask #1
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 6 ms 384 KB Output is correct
5 Correct 12 ms 640 KB Output is correct
6 Correct 84 ms 3688 KB Output is correct
7 Correct 87 ms 3564 KB Output is correct
8 Correct 86 ms 3684 KB Output is correct

Subtask #2
0 / 55.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 6 ms 384 KB Output is correct
5 Correct 12 ms 640 KB Output is correct
6 Correct 84 ms 3688 KB Output is correct
7 Correct 87 ms 3564 KB Output is correct
8 Correct 86 ms 3684 KB Output is correct
9 Incorrect 5 ms 384 KB Output isn't correct
10 Halted 0 ms 0 KB -

Subtask #3
0 / 37.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 6 ms 384 KB Output is correct
5 Correct 12 ms 640 KB Output is correct
6 Correct 84 ms 3688 KB Output is correct
7 Correct 87 ms 3564 KB Output is correct
8 Correct 86 ms 3684 KB Output is correct
9 Incorrect 5 ms 384 KB Output isn't correct
10 Halted 0 ms 0 KB -