# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
364679 | 2021-02-09T17:18:38 Z | valerikk | CONSUL (info1cup19_consul) | C++17 | 0 ms | 0 KB |
#include "grader.h" #include <bits/stdc++.h> using namespace std; int solve(int n) { mt19937 gen(chrono::high_resolution_clock::now().time_since_epoch().count()); uniform_int_distribution<int> rd(1, n); int q = min(60, n); for (int qq = 0; qq < q / 2; qq++) { int i = rd(gen); int x = kth(i); if (3 * cnt(x) > n) return x; } return -1; }