#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);
vis[k]=1; break;
}
}
say_answer(-1);
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
1 ms |
256 KB |
Multiple answers provided for the same testcase! |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
1 ms |
256 KB |
Multiple answers provided for the same testcase! |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
10 ms |
256 KB |
Too many queries |
2 |
Halted |
0 ms |
0 KB |
- |