# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
687601 | Rares | 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 <bits/stdc++.h>
#include <grader.h>
using namespace std;
void Solve (int N){
int op=0;
srand (time (0));
vector <int> a;
while (1){
int x=kth (rand ());
op++;
if (op>=59){
say_answer (-1);
break;
}
bool ok=0;
for (int i=0;i<int (a.size ());++i){
if (a[i]==x){
ok=1;
break;
}
}
if (ok==0){
a.push_back (x);
int f=cnt (x);
op++;
if (f>N/3){
say_answer (x);
break;
}
if (op>=59){
say_answer (-1);
}
}
}
}