# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
825361 | 2023-08-14T18:37:33 Z | Darren0724 | CONSUL (info1cup19_consul) | C++17 | 0 ms | 0 KB |
#include <bits/stdc++.h> using namespace std; mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count()); /*int kth(int p){ cout<<"kth "<<p<<endl; int ans;cin>>ans;return ans; } int cnt(int p){ cout<<"cnt "<<p<<endl; int ans;cin>>ans;return ans; }*/ void say_answer(int k){} void solve(int n){ int times=0; while(times<25){ int p=rnd()%n+1; int t=kth(p); if(cnt(t)>n/3){ say_answer(t); return; } } say_answer(-1); }