#include<bits/stdc++.h>
#include "grader.h"
using namespace std;
typedef long long ll;
vector<bool>used;
void solve(int n)
{
srand(12345);
used.resize(n+1);
for(int i=1;i<=n;i++)
{
used[i]=false;
}
int q=0;
int border=0;
while(q<=60 && 2*border<=n)
{
q++;
if(q==60)
return;
int left=1, right=n;
int idx=rand()%(right-left+1)+left;
while(used[idx])
{
idx=rand()%(right-left+1)+left;
}
used[idx]=true;
int val=kth(idx);
int valcnt=cnt(val);
if(3*valcnt > n)
{
say_answer(val);
return;
}
q++;
border++;
}
say_answer(-1);
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
4 ms |
344 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Partially correct |
8 ms |
344 KB |
Output is partially correct |
2 |
Correct |
3 ms |
344 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Partially correct |
9 ms |
344 KB |
Output is partially correct |
2 |
Partially correct |
9 ms |
344 KB |
Output is partially correct |
3 |
Correct |
4 ms |
340 KB |
Output is correct |
4 |
Correct |
3 ms |
344 KB |
Output is correct |
5 |
Partially correct |
9 ms |
344 KB |
Output is partially correct |
6 |
Partially correct |
10 ms |
344 KB |
Output is partially correct |
7 |
Partially correct |
11 ms |
344 KB |
Output is partially correct |
8 |
Partially correct |
12 ms |
344 KB |
Output is partially correct |
9 |
Partially correct |
9 ms |
344 KB |
Output is partially correct |
10 |
Partially correct |
10 ms |
344 KB |
Output is partially correct |
11 |
Partially correct |
10 ms |
344 KB |
Output is partially correct |
12 |
Partially correct |
8 ms |
344 KB |
Output is partially correct |
13 |
Partially correct |
10 ms |
344 KB |
Output is partially correct |
14 |
Partially correct |
10 ms |
344 KB |
Output is partially correct |