| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 365227 | tengiz05 | CONSUL (info1cup19_consul) | C++17 | 34 ms | 492 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"
#ifndef EVAL
#include "grader.cpp"
#endif
#include <bits/stdc++.h>
using namespace std;
void solve(int n){
vector<int> inds;
for(int i=1;i<=n;i++)inds.push_back(i);
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
shuffle(inds.begin(), inds.end(), rng);
int numq = min(n,30);
for(int i=0;i<numq;i++){
int x = kth(inds[i]);
int c = cnt(x);
if(c > n/3){
say_answer(x);
return;
}
}
say_answer(-1);
return;
}
/*
2
9
4 2 3 4 1 2 5 4
9
4 2 3 4 4 2 5 4
*/
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
