# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
332197 | 2020-12-01T16:19:23 Z | Sho10 | CONSUL (info1cup19_consul) | C++14 | 0 ms | 0 KB |
#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; ll 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; } } return -1; } /* int32_t main(){ CODE_START; */