# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
364139 | yasseenkamel | CONSUL (info1cup19_consul) | C++14 | 37 ms | 620 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"
//#include "grader.cpp"
using namespace std;
map<int,int> vis;
void solve(int n){
int a[1005];
for(int i = 0 ; i < 30 ; i ++){
int idx = (rand() % n) + 1;
int x = kth(idx);
if(!vis[x]){
int y = cnt(x);
if(y > n / 3){
say_answer(x);
return;
}
}
}
//sort(a,a + n);
//int cnt = 1;
say_answer(-1);
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |