oj.uz

Submission #502205

# Submission time Handle Problem Language Result Execution time Memory
502205 2022-01-05T13:28:58 Z bigo CONSUL (info1cup19_consul) C++14
0 / 100
 8 ms 316 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);
    }
    for (auto u : vec) {
        if (his[u] > n / 3){
            say_answer(u);
        	break;
        }
    }
    say_answer(-1);
}

Subtask #1
0.0 / 15.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 200 KB Multiple answers provided for the same testcase!

Subtask #2
0.0 / 20.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 200 KB Multiple answers provided for the same testcase!
2 Halted 0 ms 0 KB -

Subtask #3
0.0 / 65.0

# Verdict Execution time Memory Grader output
1 Incorrect 8 ms 316 KB Multiple answers provided for the same testcase!
2 Halted 0 ms 0 KB -