Submission #632155

# Submission time Handle Problem Language Result Execution time Memory
632155 2022-08-19T14:18:35 Z boris_mihov CONSUL (info1cup19_consul) C++17
100 / 100
35 ms 220 KB
#include "grader.h"
#include <algorithm>
#include <iostream>
#include <numeric>
#include <vector>
#include <map>

typedef long long llong;
const int MAXN = 1000 + 10;
const int INF  = 1e9;

std::map <int,int> map;
bool used[MAXN];

void solve(int n)
{
    if (n <= 50)
    {
        map.clear();
        for (int i = 1 ; i <= n ; ++i)
        {
            map[kth(i)]++;
        }

        for (auto [key, value] : map)
        {
            if (value > n/3)
            {
                say_answer(key);
                return;
            }
        }

        say_answer(-1);
        return;
    }

    srand(69);
    std::fill(used + 1, used + 1 + n, false);
    for (int i = 1 ; i <= std::min(n/2, 30) ; ++i)
    {
        int curr;
        do
        {
            curr = rand()%n + 1;
        } while (used[curr]);
        used[curr] = true;
        curr = kth(curr);
        if (cnt(curr) > n/3) 
        {
            say_answer(curr);
            return;
        }
    }    

    say_answer(-1);
}
# Verdict Execution time Memory Grader output
1 Correct 32 ms 208 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 19 ms 208 KB Output is correct
2 Correct 6 ms 208 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 16 ms 208 KB Output is correct
2 Correct 30 ms 208 KB Output is correct
3 Correct 6 ms 208 KB Output is correct
4 Correct 6 ms 208 KB Output is correct
5 Correct 14 ms 208 KB Output is correct
6 Correct 20 ms 208 KB Output is correct
7 Correct 17 ms 208 KB Output is correct
8 Correct 26 ms 220 KB Output is correct
9 Correct 24 ms 208 KB Output is correct
10 Correct 20 ms 208 KB Output is correct
11 Correct 35 ms 208 KB Output is correct
12 Correct 20 ms 208 KB Output is correct
13 Correct 22 ms 208 KB Output is correct
14 Correct 24 ms 208 KB Output is correct