# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
315056 | Seanliu | CONSUL (info1cup19_consul) | C++14 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include "grader.h"
//#include <iostream>
//using namespace std;
int seed = 101;
inline int rnd(){
return seed = (seed * 3 + 1) % 0xdefaced;
}
void solve(int N){
for(int i = 0; i < min(30, N / 2); i++){
int r = rnd() % N + 1;
int v = kth(r);
int c = cnt(v);
//cout << "loc = " << r << ", val = " << v << ", cnt = " << c << endl;
if(c > (N / 3)){
say_answer(v);
return;
}
}
say_answer(-1);
}