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 <bits/stdc++.h>
#include "grader.h"
using namespace std;
void solve(int n)
{
srand(time(0));
int v;
map<int,int> can;
int vis[2001]={0};
for(int i=1; i<=n; i++)
{
while(1)
{
int k=(rand()%n)+1;
if(vis[k]) continue;
v=kth(k);
if(cnt(v)>n/3)
{
say_answer(v); return;
}
vis[k]=1; break;
}
}
say_answer(-1);
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |