Submission #1234599

#	Time	Username	Problem	Language	Result	Execution time	Memory
1234599		Aisha	CONSUL (info1cup19_consul)	C++20	0 / 100	3 ms	412 KiB

consul

#include "grader.h"
#include "bits/stdc++.h"

using namespace std;

mt19937 rng(532426425243);

void solve(int n) {
    map <int, int> mp;
    map <int, int> mp2;

    for (int i = 1; i <= 40; i ++) {
        int r = rng() % n;
        while (mp[r]) r = rng() % n;
        mp[r] ++;
        int x = kth(r);

        if (mp2[x]) {
            i --;
            continue;
        }
        mp2[x] ++;

        int c = cnt(x);
        if (c > n / 3) {
            say_answer(x);
            return;
        } 

        if (mp.size() > n / 2) break;
    }
   
    say_answer(-1);
}

• Subtask 1: 0 / 15
• Subtask 2: 0 / 20
• Subtask 3: 0 / 65