oj.uz

Submission #502206

# Submission time Handle Problem Language Result Execution time Memory
502206 2022-01-05T13:30:06 Z bigo CONSUL (info1cup19_consul) C++14
19 / 100
 725 ms 200 KB 
#include <bits/stdc++.h>
#include "grader.h"
using namespace std;
void solve(int n) {
    map<int, int>his;
    set<int>vec;
    for (int i = 0; i < n; i++) {
        int k = kth(i+1);
        his[k]++;
        vec.insert(k);
    }
    bool flag = false;
    for (auto u : vec) {
        if (his[u] > n / 3) {
            say_answer(u);
            flag = true;
            break;
        }
    }
    if(!flag)
        say_answer(-1);
}

Subtask #1
15.0 / 15.0

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

Subtask #2
4.0 / 20.0

# Verdict Execution time Memory Grader output
1 Partially correct 94 ms 200 KB Output is partially correct
2 Partially correct 68 ms 200 KB Output is partially correct

Subtask #3
0.0 / 65.0

# Verdict Execution time Memory Grader output
1 Partially correct 725 ms 200 KB Output is partially correct
2 Halted 0 ms 0 KB -