oj.uz

답안 #764202

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
764202 2023-06-23T08:33:38 Z idkhandle 십자가 놓기 (FXCUP4_cross) C++17
8 / 100
 40 ms 7400 KB 
#include "cross.h"
#include <bits/stdc++.h>
using namespace std;

using ll = long long;

ll SelectCross(int K, vector<int> I, vector<int> O) {
	int n = I.size();
	ll ans = 0;
	for (int i = 0; i < n; i++) {
		ans = max(ans, 2LL * O[i] * I[i] - (ll)I[i] * I[i]);
		// O^2 - 4 * ((O - I) / 2)^2 = O^2 - (O - I)^2 = 2OI - I^2
	}
	return ans;
}

Subtask #1
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 296 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 3 ms 724 KB Output is correct
6 Correct 37 ms 7400 KB Output is correct
7 Correct 38 ms 7308 KB Output is correct
8 Correct 40 ms 7380 KB Output is correct

Subtask #2
0 / 55.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 296 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 3 ms 724 KB Output is correct
6 Correct 37 ms 7400 KB Output is correct
7 Correct 38 ms 7308 KB Output is correct
8 Correct 40 ms 7380 KB Output is correct
9 Incorrect 0 ms 212 KB Output isn't correct
10 Halted 0 ms 0 KB -

Subtask #3
0 / 37.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 296 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 3 ms 724 KB Output is correct
6 Correct 37 ms 7400 KB Output is correct
7 Correct 38 ms 7308 KB Output is correct
8 Correct 40 ms 7380 KB Output is correct
9 Incorrect 0 ms 212 KB Output isn't correct
10 Halted 0 ms 0 KB -