Submission #1235066

#TimeUsernameProblemLanguageResultExecution timeMemory
1235066SolikhaCONSUL (info1cup19_consul)C++20
100 / 100
6 ms412 KiB
#include "grader.h"
#include "bits/stdc++.h"
using namespace std;

mt19937 rng(123);

void solve(int n)
{
    map<int, int> us, mp;
    for(int i = 0; i < 30; i++){
        int x = rng() % n;
        while(us[x] == 1) x = rng() % n;
        us[x] = 1;
        int c = kth(x + 1);
        if(mp[c] == 0){
            mp[c] = 1;
            int k = cnt(c);
            if(k > n / 3){
                say_answer(c); return;
            }
        }
    }
   say_answer(-1);
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...