oj.uz

답안 #779871

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
779871 2023-07-12T01:51:43 Z rxlfd314 CONSUL (info1cup19_consul) C++17
85 / 100
 30 ms 256 KB 
#include "grader.h"
#include <bits/stdc++.h>
using namespace std;

void solve(int N) {
	srand(time(NULL));
	int V[N];
	for (int i = 0; i < N; i++) {
		V[i] = rand();
	}
	int ord[N];
	iota(ord, ord+N, 0);
	sort(ord, ord+N, [&](const int &a, const int &b) {
		return V[a] < V[b];		
	});
	map<int, int> m;
	for (int x = 0, i = 0; x < 60 && i < N; x++, i++) {
		int v = kth(ord[i]+1);
		if (m.find(v) == m.end() && x < 59) {
			m[v] = cnt(v);
			x++;
		}
		if (m[v] > N/3) {
			say_answer(v);
			return;
		}
	}
	say_answer(-1);
}

Subtask #1
0.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 9 ms 208 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 9 ms 208 KB Output is correct
2 Correct 6 ms 208 KB Output is correct

Subtask #3
65.0 / 65.0

# 결과 실행 시간 메모리 Grader output
1 Correct 23 ms 208 KB Output is correct
2 Correct 22 ms 208 KB Output is correct
3 Correct 11 ms 208 KB Output is correct
4 Correct 10 ms 256 KB Output is correct
5 Correct 24 ms 208 KB Output is correct
6 Correct 26 ms 208 KB Output is correct
7 Correct 24 ms 208 KB Output is correct
8 Correct 30 ms 208 KB Output is correct
9 Correct 20 ms 208 KB Output is correct
10 Correct 19 ms 208 KB Output is correct
11 Correct 22 ms 208 KB Output is correct
12 Correct 23 ms 208 KB Output is correct
13 Correct 20 ms 208 KB Output is correct
14 Correct 27 ms 208 KB Output is correct