제출 #1335092

#제출 시각아이디문제언어결과실행 시간메모리
1335092boclobanchatCONSUL (info1cup19_consul)C++20
0 / 100
1 ms344 KiB
#include<bits/stdc++.h>
#include"grader.h"
using namespace std;
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
int Rand(int l,int r) { return uniform_int_distribution<int>(l,r)(rng); }
int P[1234];
void solve(int n)
{
	for(int i=1;i<=n;i++) P[i]=i;
	for(int i=1;i<=n*2;i++) swap(P[Rand(1,n)],P[Rand(1,n)]);
	for(int t=1;t<=min(n,25);t++)
	{
		int val=kth(P[t]);
		if(cnt(val)>n/3+1)
		{
			say_answer(val);
			return ;
		}
	}
	say_answer(-1);
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...