oj.uz

Submission #632151

# Submission time Handle Problem Language Result Execution time Memory
632151 2022-08-19T14:15:59 Z boris_mihov CONSUL (info1cup19_consul) C++17
85 / 100
 29 ms 288 KB 
#include "grader.h"
#include <algorithm>
#include <iostream>
#include <numeric>
#include <vector>

typedef long long llong;
const int MAXN = 1000 + 10;
const int INF  = 1e9;
bool used[MAXN];

void solve(int n)
{
    srand(69);
    std::fill(used + 1, used + 1 + n, false);
    for (int i = 1 ; i <= std::min(n, 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);
}

Subtask #1
0.0 / 15.0

# Verdict Execution time Memory Grader output
1 Incorrect 10 ms 208 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 20 ms 208 KB Output is correct
2 Correct 8 ms 208 KB Output is correct

Subtask #3
65.0 / 65.0

# Verdict Execution time Memory Grader output
1 Correct 23 ms 208 KB Output is correct
2 Correct 20 ms 208 KB Output is correct
3 Correct 7 ms 208 KB Output is correct
4 Correct 9 ms 208 KB Output is correct
5 Correct 19 ms 208 KB Output is correct
6 Correct 23 ms 208 KB Output is correct
7 Correct 26 ms 208 KB Output is correct
8 Correct 26 ms 208 KB Output is correct
9 Correct 26 ms 288 KB Output is correct
10 Correct 20 ms 208 KB Output is correct
11 Correct 21 ms 208 KB Output is correct
12 Correct 20 ms 208 KB Output is correct
13 Correct 25 ms 208 KB Output is correct
14 Correct 29 ms 208 KB Output is correct