Submission #779870

#	Time	Username	Problem	Language	Result	Execution time	Memory
779870		rxlfd314	CONSUL (info1cup19_consul)	C++17	85 / 100	30 ms	336 KiB

consul

#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 / 15
• Subtask 2: 20 / 20
• Subtask 3: 65 / 65