oj.uz

Submission #364682

# Submission time Handle Problem Language Result Execution time Memory
364682 2021-02-09T17:20:41 Z valerikk CONSUL (info1cup19_consul) C++17
100 / 100
 35 ms 364 KB 
#include "grader.h"
#include <bits/stdc++.h>
using namespace std;

void solve(int n) {
    mt19937 gen(chrono::high_resolution_clock::now().time_since_epoch().count());
    uniform_int_distribution<int> rd(1, n);
    int q = min(60, n);
    for (int qq = 0; qq < q / 2; qq++) {
        int i = rd(gen);
        int x = kth(i);
        if (3 * cnt(x) > n) { 
            say_answer(x);
            return;
        }
    }
    say_answer(-1);
}

Subtask #1
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 364 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 18 ms 364 KB Output is correct
2 Correct 6 ms 364 KB Output is correct

Subtask #3
65.0 / 65.0

# Verdict Execution time Memory Grader output
1 Correct 22 ms 364 KB Output is correct
2 Correct 23 ms 364 KB Output is correct
3 Correct 11 ms 364 KB Output is correct
4 Correct 10 ms 364 KB Output is correct
5 Correct 24 ms 364 KB Output is correct
6 Correct 16 ms 364 KB Output is correct
7 Correct 22 ms 364 KB Output is correct
8 Correct 25 ms 364 KB Output is correct
9 Correct 27 ms 364 KB Output is correct
10 Correct 23 ms 364 KB Output is correct
11 Correct 25 ms 364 KB Output is correct
12 Correct 27 ms 364 KB Output is correct
13 Correct 35 ms 364 KB Output is correct
14 Correct 30 ms 364 KB Output is correct