Submission #160476

#	Time	Username	Problem	Language	Result	Execution time	Memory
160476		Benq	CONSUL (info1cup19_consul)	C++14	100 / 100	46 ms	376 KiB

consul

#include "grader.h"
#include <bits/stdc++.h>

#define F0R(i,a) for (int i = 0; i < (a); ++i)
#define pb push_back
#define f first
#define s second

using namespace std;

void solve(int n)
{
	srand(2358198);
	map<int,int> m;
	F0R(i,30) {
		int ind = rand()%n+1;
		int x = kth(ind);
		m[x] ++;
	}
	vector<pair<int,int>> tri;
	for (auto& t: m) tri.pb({t.s,t.f});
	sort(tri.rbegin(),tri.rend());
	for (auto& t: tri) if (3*cnt(t.s) > n) { say_answer(t.s); return; }
}

• Subtask 1: 15 / 15
• Subtask 2: 20 / 20
• Subtask 3: 65 / 65