# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
390232 | mariowong | CONSUL (info1cup19_consul) | C++14 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include "grader.h"
#include <bits/stdc++.h>
using namespace std;
int val,pos,ct;
map <int,int> m;
void solve(int n){
mt19937 gen(time(NULL));
uniform_int_distribution <int> dis(1,1e9);
while (ct+2 <= 60){
pos=dis(gen)%n+1; val=kth(pos);
if (m[val])
ct++;
else
{
m[val]=true;
if (cnt(val) > n/3){
say_answer(val);
return 0;
}
ct+=2;
}
}
say_answer(-1);
return 0;
}