Submission #1194031

#TimeUsernameProblemLanguageResultExecution timeMemory
1194031petezaCONSUL (info1cup19_consul)C++20
100 / 100
12 ms412 KiB
#include "grader.h" #include <bits/stdc++.h> std::mt19937 mt(69420); void solve(int n) { /// insert your code /// for example if(n <= 50) { std::map<int, int> freq; for(int i=1;i<=n;i++) freq[kth(i)]++; for(auto &e:freq) { if(e.second > n/3) { say_answer(e.first); return ; } } say_answer(-1); return ; } for(int i=0;i<30;i++) { int res = kth(mt()%n+1); if(cnt(res) > n/3) {say_answer(res); return;} } say_answer(-1); return ; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...