Submission #923166

#TimeUsernameProblemLanguageResultExecution timeMemory
923166NValchanovCONSUL (info1cup19_consul)C++17
100 / 100
12 ms500 KiB
#include<bits/stdc++.h> #include "grader.h" using namespace std; typedef long long ll; vector<bool>used; void solve(int n) { used.resize(n+1); for(int i=1;i<=n;i++) { used[i]=false; } int q=0; int border=0; while(q<=60 && 2*border<=n) { q++; if(q>60) return; int left=1, right=n; int idx=rand()%(right-left+1)+left; while(used[idx]) { idx=rand()%(right-left+1)+left; } used[idx]=true; int val=kth(idx); int valcnt=cnt(val); if(3*valcnt > n) { say_answer(val); return; } q++; border++; } say_answer(-1); }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...