oj.uz

답안 #150669

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
150669 2019-09-01T08:48:16 Z Ragtag Volunteers(#3721, spellstaker, iamssk, ParaSpawn) 십자가 놓기 (FXCUP4_cross) C++17
8 / 100
 89 ms 3692 KB 
#include "cross.h"

#include <algorithm>

using namespace std;
using ll = long long;

long long SelectCross(const int k, std::vector<int> I, std::vector<int> O) {
	const int n = I.size();
	ll res = 0;
	for (int i = 0; i < n; i++) {
		res = max(res, ll(2 * O[i] - I[i]) * I[i]);
	}
	return res;
}

Subtask #1
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 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 11 ms 588 KB Output is correct
6 Correct 86 ms 3688 KB Output is correct
7 Correct 89 ms 3688 KB Output is correct
8 Correct 86 ms 3692 KB Output is correct

Subtask #2
0 / 55.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 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 11 ms 588 KB Output is correct
6 Correct 86 ms 3688 KB Output is correct
7 Correct 89 ms 3688 KB Output is correct
8 Correct 86 ms 3692 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 7 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 11 ms 588 KB Output is correct
6 Correct 86 ms 3688 KB Output is correct
7 Correct 89 ms 3688 KB Output is correct
8 Correct 86 ms 3692 KB Output is correct
9 Incorrect 6 ms 384 KB Output isn't correct
10 Halted 0 ms 0 KB -