oj.uz

답안 #502244

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
502244 2022-01-05T15:19:52 Z bigo CONSUL (info1cup19_consul) C++14
100 / 100
 46 ms 284 KB 
#include <bits/stdc++.h>
#include "grader.h"
using namespace std;
void solve(int n) {
    if (n <= 50) {
        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);
        return;
    }
    set<int>vec;
    for (int i = 0; i < 60; i++) {
        int k = kth(rand() % n + 1);
        if (vec.find(k) == vec.end()) {
            i++;
            if (cnt(k) > n / 3) {
                say_answer(k);
            	return;
            }
        }
    }
    say_answer(-1);
}

Subtask #1
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 46 ms 200 KB Output is correct

Subtask #2
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 9 ms 200 KB Output is correct
2 Correct 8 ms 200 KB Output is correct

Subtask #3
65.0 / 65.0

# 결과 실행 시간 메모리 Grader output
1 Correct 24 ms 200 KB Output is correct
2 Correct 26 ms 200 KB Output is correct
3 Correct 7 ms 200 KB Output is correct
4 Correct 4 ms 276 KB Output is correct
5 Correct 22 ms 264 KB Output is correct
6 Correct 24 ms 200 KB Output is correct
7 Correct 18 ms 200 KB Output is correct
8 Correct 33 ms 260 KB Output is correct
9 Correct 30 ms 200 KB Output is correct
10 Correct 24 ms 200 KB Output is correct
11 Correct 25 ms 200 KB Output is correct
12 Correct 23 ms 200 KB Output is correct
13 Correct 35 ms 284 KB Output is correct
14 Correct 26 ms 284 KB Output is correct