Submission #1234620

#TimeUsernameProblemLanguageResultExecution timeMemory
1234620AishaCONSUL (info1cup19_consul)C++20
0 / 100
2 ms412 KiB
#include "grader.h"
#include "bits/stdc++.h"

using namespace std;

mt19937 rng(143);

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

    int q = 0;
    int sum = 0;

    while (q < 60) {
        int r = rng() % n + 1;
        while (mp[r]) r = rng() % n + 1;
        mp[r] ++;
        int x = kth(r);
     //   cout << x << ' ' << r << ' ' << sum << endl;

        if (mp2[x]) continue;
        
        mp2[x] ++;

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

        if (sum > n / 2) break;
        q ++;
    }
   
    say_answer(-1);
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...