oj.uz

답안 #149707

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
149707 2019-09-01T07:00:07 Z 티셔츠 콜렉터(#3632, yoni, jisunchae, jsg1504) 십자가 놓기 (FXCUP4_cross) C++17
8 / 100
 85 ms 3692 KB 
#include "cross.h"

long long SelectCross(int K, std::vector<int> I, std::vector<int> O) {
	int N = I.size();
	if (K == 1) {
		long long max = 0;
		for (int i=0; i<N; i++) {
			long long R = O[i];
			long long r = O[i]-I[i];
			long long rec = R*R-r*r;
			if (rec > max) {
				max = rec;
			}
		}
		return max;
	}
	return 0;
}

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 6 ms 384 KB Output is correct
4 Correct 5 ms 128 KB Output is correct
5 Correct 10 ms 640 KB Output is correct
6 Correct 83 ms 3692 KB Output is correct
7 Correct 85 ms 3692 KB Output is correct
8 Correct 85 ms 3688 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 6 ms 384 KB Output is correct
4 Correct 5 ms 128 KB Output is correct
5 Correct 10 ms 640 KB Output is correct
6 Correct 83 ms 3692 KB Output is correct
7 Correct 85 ms 3692 KB Output is correct
8 Correct 85 ms 3688 KB Output is correct
9 Incorrect 6 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 6 ms 384 KB Output is correct
4 Correct 5 ms 128 KB Output is correct
5 Correct 10 ms 640 KB Output is correct
6 Correct 83 ms 3692 KB Output is correct
7 Correct 85 ms 3692 KB Output is correct
8 Correct 85 ms 3688 KB Output is correct
9 Incorrect 6 ms 384 KB Output isn't correct
10 Halted 0 ms 0 KB -