# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
384614 | fadi57 | CONSUL (info1cup19_consul) | C++14 | 11 ms | 364 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.cpp"
#include<bits/stdc++.h>
#include "grader.h"
using namespace std;
void solve(int n)
{
map<int,int>mp;
/// insert your code
/// for example
int z=n/3;
int ok=0;
int mid=n/2;
for(int i=1;i<=mid;i++){
// int me=kth(i);
// mp[me]++;
int myfreq=cnt(i);
if(myfreq>z){
ok=1;
say_answer(kth(i));
break;
}
}
if(ok==0){
for(int i=mid+1;i<=n;i++){
int me=kth(i);
// mp[me]++;
int myfreq=cnt(i);
if(myfreq>z){
ok=1;
say_answer(kth(i));
break;
}
}
if(!ok){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... |