oj.uz

Submission #637600

# Submission time Handle Problem Language Result Execution time Memory
637600 2022-09-02T13:00:58 Z tvladm2009 CONSUL (info1cup19_consul) C++14
100 / 100
 26 ms 208 KB 
#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);
}

Subtask #1
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 208 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 208 KB Output is correct
2 Correct 7 ms 208 KB Output is correct

Subtask #3
65.0 / 65.0

# Verdict Execution time Memory Grader output
1 Correct 20 ms 208 KB Output is correct
2 Correct 19 ms 208 KB Output is correct
3 Correct 6 ms 208 KB Output is correct
4 Correct 6 ms 208 KB Output is correct
5 Correct 19 ms 208 KB Output is correct
6 Correct 11 ms 208 KB Output is correct
7 Correct 17 ms 208 KB Output is correct
8 Correct 24 ms 208 KB Output is correct
9 Correct 19 ms 208 KB Output is correct
10 Correct 23 ms 208 KB Output is correct
11 Correct 23 ms 208 KB Output is correct
12 Correct 20 ms 208 KB Output is correct
13 Correct 26 ms 208 KB Output is correct
14 Correct 12 ms 208 KB Output is correct