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;
#define DIM 100007
#define DIM2 2007
#define fi first
#define se second
#define mod 1000000007
typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> pll;
void solve(int n){
int w = -1;
set<int> s;
int p = 20;
if(n>100) p = 29;
for(int i=1;i<=p;i++){
if(i>n) break;
int x = rand()%n + 1;
while(s.count(x)!=0){
x = rand()%n + 1;
}
s.insert(x);
x = kth(x);
int c = cnt(x);
if(c>n*1.0/3){
w = x;
break;
}
}
say_answer(w);
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |