#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;
}
# |
Verdict |
Execution time |
Memory |
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 |
# |
Verdict |
Execution time |
Memory |
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 |
- |
# |
Verdict |
Execution time |
Memory |
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 |
- |