oj.uz

답안 #832428

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
832428 2023-08-21T10:15:50 Z _martynas 십자가 놓기 (FXCUP4_cross) C++17
8 / 100
 65 ms 4340 KB 
#include "cross.h"
#include <vector>
#include <algorithm>
#include <numeric>
#include <set>

using namespace std;

long long SelectCross(int K, vector<int> I, vector<int> O) {
	int N = I.size();
	long long mx = 0;
	vector<int> orderI(N);
	iota(orderI.begin(), orderI.end(), 0);
	sort(orderI.begin(), orderI.end(), [&](int i, int j) { return I[i] > I[j]; });
	long long mndi = 1e15;
	multiset<long long> maxo;
	for(int i = 0, j = 0; i < N; i++) {
		mndi = I[orderI[i]];
		if(maxo.size() < K || (*maxo.begin()) < O[orderI[i]]) {
			maxo.insert(O[orderI[i]]);
			if(maxo.size() > K) maxo.erase(maxo.begin());
		}
		mx = max(mx, mndi*(2*(*maxo.begin())-mndi));
	}
	return mx;
}

Compilation message

cross.cpp: In function 'long long int SelectCross(int, std::vector<int>, std::vector<int>)':
cross.cpp:19:18: warning: comparison of integer expressions of different signedness: 'std::multiset<long long int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   19 |   if(maxo.size() < K || (*maxo.begin()) < O[orderI[i]]) {
      |      ~~~~~~~~~~~~^~~
cross.cpp:21:19: warning: comparison of integer expressions of different signedness: 'std::multiset<long long int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   21 |    if(maxo.size() > K) maxo.erase(maxo.begin());
      |       ~~~~~~~~~~~~^~~
cross.cpp:17:17: warning: unused variable 'j' [-Wunused-variable]
   17 |  for(int i = 0, j = 0; i < N; i++) {
      |                 ^

Subtask #1
8.0 / 8.0

# 결과 실행 시간 메모리 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 0 ms 212 KB Output is correct
5 Correct 4 ms 468 KB Output is correct
6 Correct 55 ms 4268 KB Output is correct
7 Correct 57 ms 4208 KB Output is correct
8 Correct 65 ms 4340 KB Output is correct

Subtask #2
0 / 55.0

# 결과 실행 시간 메모리 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 0 ms 212 KB Output is correct
5 Correct 4 ms 468 KB Output is correct
6 Correct 55 ms 4268 KB Output is correct
7 Correct 57 ms 4208 KB Output is correct
8 Correct 65 ms 4340 KB Output is correct
9 Incorrect 1 ms 212 KB Output isn't correct
10 Halted 0 ms 0 KB -

Subtask #3
0 / 37.0

# 결과 실행 시간 메모리 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 0 ms 212 KB Output is correct
5 Correct 4 ms 468 KB Output is correct
6 Correct 55 ms 4268 KB Output is correct
7 Correct 57 ms 4208 KB Output is correct
8 Correct 65 ms 4340 KB Output is correct
9 Incorrect 1 ms 212 KB Output isn't correct
10 Halted 0 ms 0 KB -