#include "cross.h"
using namespace std;
long long SelectCross(int K, vector<int> I, vector<int> O) {
int N = I.size();
long long mx = 0;
for(int i = 0; i < N; i++) {
mx = max(mx, 1LL*I[i]*(2*O[i]-I[i]));
}
return mx;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
212 KB |
Output is correct |
2 |
Correct |
0 ms |
212 KB |
Output is correct |
3 |
Correct |
0 ms |
212 KB |
Output is correct |
4 |
Correct |
1 ms |
212 KB |
Output is correct |
5 |
Correct |
2 ms |
468 KB |
Output is correct |
6 |
Correct |
49 ms |
3524 KB |
Output is correct |
7 |
Correct |
36 ms |
3456 KB |
Output is correct |
8 |
Correct |
35 ms |
3536 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
212 KB |
Output is correct |
2 |
Correct |
0 ms |
212 KB |
Output is correct |
3 |
Correct |
0 ms |
212 KB |
Output is correct |
4 |
Correct |
1 ms |
212 KB |
Output is correct |
5 |
Correct |
2 ms |
468 KB |
Output is correct |
6 |
Correct |
49 ms |
3524 KB |
Output is correct |
7 |
Correct |
36 ms |
3456 KB |
Output is correct |
8 |
Correct |
35 ms |
3536 KB |
Output is correct |
9 |
Incorrect |
0 ms |
212 KB |
Output isn't correct |
10 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
212 KB |
Output is correct |
2 |
Correct |
0 ms |
212 KB |
Output is correct |
3 |
Correct |
0 ms |
212 KB |
Output is correct |
4 |
Correct |
1 ms |
212 KB |
Output is correct |
5 |
Correct |
2 ms |
468 KB |
Output is correct |
6 |
Correct |
49 ms |
3524 KB |
Output is correct |
7 |
Correct |
36 ms |
3456 KB |
Output is correct |
8 |
Correct |
35 ms |
3536 KB |
Output is correct |
9 |
Incorrect |
0 ms |
212 KB |
Output isn't correct |
10 |
Halted |
0 ms |
0 KB |
- |