Submission #635776

#TimeUsernameProblemLanguageResultExecution timeMemory
635776Dec0DeddCONSUL (info1cup19_consul)C++14
0 / 100
1 ms336 KiB
#include <bits/stdc++.h> #include "grader.h" using namespace std; mt19937 rng(chrono::steady_clock::now().time_since_epoch().count()); int rnd(int a, int b){ return a+rng()%(b-a+1); } void solve(int n) { pair<int, int> x={0, -1}; for (int i=0; i<20; ++i) { int r=rnd(1, n); x=max(x, {cnt(r), kth(r)}); } if (x.first <= n/3) say_answer(-1); else say_answer(x.second); }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...