Submission #384629

#TimeUsernameProblemLanguageResultExecution timeMemory
384629fadi57CONSUL (info1cup19_consul)C++14
19 / 100
823 ms364 KiB
#include "grader.h" #include<bits/stdc++.h> using namespace std; void solve(int n) { map<int,int>mp; /// insert your code /// for example int z=n/3; int ok=0; int zz=n-z+n/2; map<int,int>mp2; for(int i=1;i<=n;i++){ int me=kth(i); mp[me]++; if(mp[me]>z){ ok=1; say_answer(me); break; } if(i>=zz&&mp2[me]==0&&ok==0){ int w=cnt(me); mp2[me]=w; if(w>n/3){ ok=1; say_answer(me); break;} } } if(!ok){say_answer(-1);} }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...