# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1153608 | fryingduc | CONSUL (info1cup19_consul) | C++20 | 11 ms | 412 KiB |
#include "bits/stdc++.h"
#include "grader.h"
using namespace std;
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
int rand(int l, int r) {
assert(l <= r);
return uniform_int_distribution<int> (l, r)(rng);
}
void solve(int n) {
vector<int> a(n + 1, -1);
if (n <= 50) {
for (int i = 1; i <= n; ++i) {
a[i] = kth(i);
}
for (int i = 1; i <= n; ++i) {
int c = 0;
for (int j = 1; j <= n; ++j) {
c += a[j] == a[i];
}
if (c > n / 3) {
say_answer(a[i]);
return;
}
}
say_answer(-1);
return;
}
for (int ite = 1; ite <= 30; ++ite) {
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |