# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1089792 | 2024-09-17T07:08:43 Z | LilPluton | CONSUL (info1cup19_consul) | C++14 | 0 ms | 0 KB |
#include "grader.h" #include <bits/stdc++.h> using namespace std; #define int long long int n; vector<int>v; int l, c = 0, ans; void solve(int N){ n = N; v.assign(n + 1, 0); l = 60; c = 0; ans = -1; while(l && c * 2 <= n){ l--; if(!l){ return; } int x = rand() % n + 1; while(v[x]){ x = rand() % n + 1; } v[x] = 1; int u = kth(x); int cc = cnt(u); if(cc * 3 > n){ ans = u;break; } ++c; l--; } say_answer(ans); }