oj.uz

답안 #786902

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
786902 2023-07-18T14:26:10 Z borisAngelov CONSUL (info1cup19_consul) C++17
85 / 100
 30 ms 288 KB 
#include "grader.h"
#include <bits/stdc++.h>

using namespace std;

void solve(int n)
{
    if (n <= -1)
    {
        map<int, int> mp;

        for (int i = 1; i <= n; ++i)
        {
            ++mp[kth(i)];
        }

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

        say_answer(-1);

        return;
    }

    srand(time(NULL));

    map<int, bool> visited;

    for (int i = 1; i <= 30; ++i)
    {
        int idx = 0;

        while (true)
        {
            idx = rand() % n + 1;

            if (visited.find(idx) == visited.end())
            {
                visited[idx] = true;
                break;
            }
        }

        int guess = kth(idx);

        if (cnt(guess) > n / 3)
        {
            say_answer(guess);
            return;
        }
    }

    say_answer(-1);
}

Subtask #1
0.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 10 ms 208 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
20.0 / 20.0

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

Subtask #3
65.0 / 65.0

# 결과 실행 시간 메모리 Grader output
1 Correct 22 ms 208 KB Output is correct
2 Correct 30 ms 208 KB Output is correct
3 Correct 5 ms 288 KB Output is correct
4 Correct 5 ms 288 KB Output is correct
5 Correct 17 ms 208 KB Output is correct
6 Correct 21 ms 208 KB Output is correct
7 Correct 25 ms 288 KB Output is correct
8 Correct 24 ms 208 KB Output is correct
9 Correct 22 ms 208 KB Output is correct
10 Correct 22 ms 208 KB Output is correct
11 Correct 23 ms 208 KB Output is correct
12 Correct 20 ms 208 KB Output is correct
13 Correct 23 ms 208 KB Output is correct
14 Correct 20 ms 208 KB Output is correct