# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
993667 | ramalzaher | CONSUL (info1cup19_consul) | C++14 | 578 ms | 692 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 ;
void solve(int n)
{
bool ok= 0 ;
map<int,int> mp ;
for(int i = 1; i <= n; i ++ )
{
mp[kth(i)] ++ ;
}
for(auto &[x , y ] : mp ) {
if(y > n/3&&!ok) { say_answer(x) ; ok=1;}
}
if(ok == 0)
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... |