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) {
srand(time(NULL));
map<int, int> mp;
for (int i = 1; i <= 50 / 2; i++) {
int x = rand() % n + 1;
if (mp.find(x) != mp.end()) {
continue;
}
mp[x] = true;
x = kth(x);
if (cnt(x) > n / 3) {
say_answer(x);
return;
}
}
say_answer(-1);
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |