# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
315206 | yjojdkgk5bp | CONSUL (info1cup19_consul) | C++14 | 53 ms | 256 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"
using namespace std;
void solve(int n)
{
int v,sum=0,k;
set<int> vis;
for(int i=1; i<=n; i++)
{
v=kth(i);
//if(!vis.empty()&&vis.count(v)) continue;
k=cnt(v);// sum+=k; vis.insert(v);
if(k>(n/3))
{
say_answer(v); return;
}
//if(sum >= (n*2)/3) break;
}
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... |