#include<bits/stdc++.h>
#include "grader.h"
//#define int long long
using namespace std;
bool bylo[2000];
/*void say_answer(int N)
{
cout<<N<<"\n";
}
int kth(int x)
{
cout<<"ile tu "<<x<<"\n";
int co;
cin>>co;
return co;
}
int cnt(int x)
{
cout<<"ile tego "<<x<<"\n";
cin>>x;
return x;
}*/
void solve(int N)
{
for(int i=0;i<=N;i++)
bylo[i]=0;
srand(time(0));
int pytan=0;
while(pytan<50)
{
int gdzie=rand()%N;
gdzie++;
if(bylo[gdzie])
continue;
int ile=kth(gdzie);
pytan++;
int essa=cnt(ile);
if(essa>N/3)
{
say_answer(ile);
return;
}
}
say_answer(-1);
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
13 ms |
208 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Partially correct |
30 ms |
300 KB |
Output is partially correct |
2 |
Correct |
7 ms |
208 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Partially correct |
40 ms |
208 KB |
Output is partially correct |
2 |
Partially correct |
32 ms |
296 KB |
Output is partially correct |
3 |
Correct |
7 ms |
208 KB |
Output is correct |
4 |
Correct |
8 ms |
208 KB |
Output is correct |
5 |
Partially correct |
28 ms |
208 KB |
Output is partially correct |
6 |
Partially correct |
37 ms |
208 KB |
Output is partially correct |
7 |
Partially correct |
27 ms |
296 KB |
Output is partially correct |
8 |
Partially correct |
43 ms |
208 KB |
Output is partially correct |
9 |
Partially correct |
43 ms |
208 KB |
Output is partially correct |
10 |
Partially correct |
53 ms |
296 KB |
Output is partially correct |
11 |
Partially correct |
33 ms |
292 KB |
Output is partially correct |
12 |
Partially correct |
29 ms |
208 KB |
Output is partially correct |
13 |
Partially correct |
66 ms |
208 KB |
Output is partially correct |
14 |
Partially correct |
31 ms |
296 KB |
Output is partially correct |