#include <bits/stdc++.h> //Andrei Alexandru a.k.a Sho10
#include "grader.h"
#define ll long long
#define double long double
#pragma GCC optimize("O3")
#pragma GCC optimize("Ofast")
#define all(a) (a).begin(), (a).end()
#define f first
#define s second
#define pb push_back
#define mp make_pair
#define pi pair
#define rc(s) return cout<<s,0
#define endl '\n'
#define mod 1000007
#define PI 3.14159265359
#define MAXN 100005
#define INF 1000000005
#define LINF 1000000000000000005ll
#define CODE_START ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
using namespace std;
void solve(int n){
ll pos=0;
auto seed = chrono::high_resolution_clock::now().time_since_epoch().count();
mt19937 mt_rand(seed);
auto nr=bind(uniform_int_distribution<int> (1, n),mt_rand);
for(ll i=1;i<=25;i++)
{
pos=nr();
pos=kth(pos);
if(cnt(pos)>n/3){
say_answer(pos);
return;
}
}
say_answer(-1);
}
/*
int32_t main(){
CODE_START;
*/
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
14 ms |
364 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
11 ms |
364 KB |
Output is correct |
2 |
Correct |
8 ms |
364 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
26 ms |
364 KB |
Output is correct |
2 |
Correct |
13 ms |
364 KB |
Output is correct |
3 |
Correct |
8 ms |
364 KB |
Output is correct |
4 |
Correct |
9 ms |
364 KB |
Output is correct |
5 |
Correct |
26 ms |
364 KB |
Output is correct |
6 |
Correct |
32 ms |
364 KB |
Output is correct |
7 |
Correct |
25 ms |
364 KB |
Output is correct |
8 |
Correct |
36 ms |
364 KB |
Output is correct |
9 |
Correct |
26 ms |
364 KB |
Output is correct |
10 |
Correct |
23 ms |
364 KB |
Output is correct |
11 |
Correct |
28 ms |
364 KB |
Output is correct |
12 |
Correct |
26 ms |
384 KB |
Output is correct |
13 |
Correct |
32 ms |
364 KB |
Output is correct |
14 |
Correct |
26 ms |
364 KB |
Output is correct |