| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 390246 | mariowong | CONSUL (info1cup19_consul) | C++14 | 3091 ms | 464 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 <bits/stdc++.h>
using namespace std;
int val,pos,ct,x,a[15];
map <int,int> m,now;
void solve(int n){
mt19937 gen(time(NULL));
uniform_int_distribution <int> dis(1,1e9);
now[0]=true;
for (int i=1;i<=25;i++){
while (now[pos])
pos=dis(gen)%n+1;
now[pos]=true;
val=kth(pos);
if (m[val])
ct++;
else
{
m[val]=true;
if (cnt(val) > n/3){
say_answer(val);
return;
}
ct+=2;
}
}
say_answer(-1);
}| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
