oj.uz

Submission #401015

# Submission time Handle Problem Language Result Execution time Memory
401015 2021-05-09T07:24:11 Z dolphingarlic CONSUL (info1cup19_consul) C++14
35.0142 / 100
 17 ms 296 KB 
#include "grader.h"

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

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

    while (unknown > n / 3) {
        int curr = rem.back();
        rem.pop_back();
        int v = kth(curr);
        if (found.count(v)) continue;
        found.insert(v);
        int c = cnt(v);
        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 10 ms 200 KB Output is correct

Subtask #2
20.0 / 20.0

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

Subtask #3
0.0142008425 / 65.0

# Verdict Execution time Memory Grader output
1 Partially correct 16 ms 200 KB Output is partially correct
2 Partially correct 12 ms 200 KB Output is partially correct
3 Correct 14 ms 288 KB Output is correct
4 Correct 11 ms 200 KB Output is correct
5 Correct 14 ms 200 KB Output is correct
6 Correct 15 ms 204 KB Output is correct
7 Correct 7 ms 296 KB Output is correct
8 Correct 12 ms 200 KB Output is correct
9 Correct 8 ms 280 KB Output is correct
10 Correct 10 ms 200 KB Output is correct
11 Correct 10 ms 284 KB Output is correct
12 Correct 15 ms 288 KB Output is correct
13 Correct 9 ms 284 KB Output is correct
14 Correct 17 ms 200 KB Output is correct