oj.uz

Submission #401017

# Submission time Handle Problem Language Result Execution time Memory
401017 2021-05-09T07:27:08 Z dolphingarlic CONSUL (info1cup19_consul) C++14
100 / 100
 19 ms 296 KB 
#include "grader.h"

#include <bits/stdc++.h>
typedef long long ll;
using namespace std;

void solve(int n) {
    srand(69420);
    set<int> found;
    int unknown = n;
    vector<int> rem(n);
    iota(rem.begin(), rem.end(), 1);
    random_shuffle(rem.begin(), rem.end());

    int queries = 60;
    while (unknown > n / 3 && queries > 1) {
        int curr = rem.back();
        rem.pop_back();
        int v = kth(curr);
        queries--;
        if (found.count(v)) continue;
        found.insert(v);
        int c = cnt(v);
        queries--;
        if (c > n / 3) {
            say_answer(v);
            return;
        }
        unknown -= c;
    }
    say_answer(-1);
}

Subtask #1
15.0 / 15.0

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

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 200 KB Output is correct
2 Correct 10 ms 204 KB Output is correct

Subtask #3
65.0 / 65.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 200 KB Output is correct
2 Correct 14 ms 200 KB Output is correct
3 Correct 10 ms 200 KB Output is correct
4 Correct 11 ms 200 KB Output is correct
5 Correct 11 ms 200 KB Output is correct
6 Correct 14 ms 200 KB Output is correct
7 Correct 11 ms 200 KB Output is correct
8 Correct 14 ms 200 KB Output is correct
9 Correct 15 ms 200 KB Output is correct
10 Correct 15 ms 200 KB Output is correct
11 Correct 15 ms 200 KB Output is correct
12 Correct 14 ms 200 KB Output is correct
13 Correct 19 ms 296 KB Output is correct
14 Correct 10 ms 200 KB Output is correct