oj.uz

Submission #399705

# Submission time Handle Problem Language Result Execution time Memory
399705 2021-05-06T13:29:42 Z KoD Koala Game (APIO17_koala) C++17
82 / 100
 57 ms 316 KB 
#include <bits/stdc++.h>
#include "koala.h"

int minValue(int N, int W) {
    int B[100] = {}, R[100] = {};
    B[0] = 1;
    playRound(B, R);
    for (int i = 0; i < N; ++i) {
        if (R[i] <= B[i]) {
            return i;
        }
    }
    assert(false);
    return -1;
}

int maxValue(int N, int W) {
    int B[100] = {}, R[100] = {};
    std::vector<int> cand(N);
    std::iota(cand.begin(), cand.end(), 0);
    while (cand.size() > 1) {
        std::fill(B, B + N, 0);
        for (const auto x: cand) {
            B[x] = W / cand.size();
        }
        playRound(B, R);
        std::vector<int> next;
        for (const auto x: cand) {
            if (R[x] > B[x]) {
                next.push_back(x);
            }
        }
        cand = std::move(next);
    }
    return cand[0];
}

int greaterValue(int N, int W) {
    int B[100] = {}, R[100] = {};
    int low = 1, high = 8;
    while (low != high) {
        const auto md = (low + high) / 2;
        B[0] = B[1] = md;
        playRound(B, R);
        if (R[0] > B[0] and R[1] > B[1]) {
            low = md + 1;
            continue;
        }
        if (R[0] <= B[0] and R[1] >= B[1]) {
            low = high - 1;
        }
        return (R[0] > B[0] ? 0 : 1);
    }
    B[0] = B[1] = low;
    playRound(B, R);
    return (R[0] > B[0] ? 0 : 1);
}

void allValues(int N, int W, int *P) {
    int B[100] = {}, R[100] = {};
    if (W == 2 * N) {
        const auto less = [&](const int i, const int j) {
            B[i] = B[j] = W / 2;
            playRound(B, R);
            B[i] = B[j] = 0;
            return R[j] > W / 2;
        };
        int order[100] = {};
        std::iota(order, order + N, 0);
        auto dfs = [&](auto&& dfs, const int l, const int r) -> void {
            if (r - l == 1) return;
            const auto m = (l + r) / 2;
            dfs(dfs, l, m);
            dfs(dfs, m, r);
            std::inplace_merge(order + l, order + m, order + r, less);
        };
        dfs(dfs, 0, N);
        for (int i = 0; i < N; ++i) {
            P[order[i]] = i + 1;
        }
    } else {
        auto dfs = [&](auto&& dfs, std::vector<int> vec, const int L) -> void {
            if (vec.size() == 1) {
                P[vec[0]] = L;
                return;
            }
            const auto x = std::min<int>(std::sqrt(2 * L), W / vec.size());
            std::fill(B, B + N, 0);
            for (const auto i: vec) {
                B[i] = x;
            }
            playRound(B, R);
            std::vector<int> left, right;
            for (const auto i: vec) {
                (R[i] > B[i] ? right : left).push_back(i);
            }
            dfs(dfs, left, L);
            dfs(dfs, right, L + left.size());
        };
        std::vector<int> vec(N);
        std::iota(vec.begin(), vec.end(), 0);
        dfs(dfs, vec, 1);
    }
}

Subtask #1
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 200 KB Output is correct
2 Correct 6 ms 200 KB Output is correct
3 Correct 6 ms 200 KB Output is correct
4 Correct 6 ms 312 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 18 ms 308 KB Output is correct
2 Correct 18 ms 200 KB Output is correct
3 Correct 21 ms 200 KB Output is correct
4 Correct 18 ms 200 KB Output is correct

Subtask #3
0 / 18.0

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

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 26 ms 200 KB Output is correct
2 Correct 46 ms 288 KB Output is correct
3 Correct 46 ms 204 KB Output is correct
4 Correct 44 ms 200 KB Output is correct
5 Correct 43 ms 200 KB Output is correct
6 Correct 44 ms 200 KB Output is correct
7 Correct 46 ms 200 KB Output is correct
8 Correct 43 ms 200 KB Output is correct
9 Correct 43 ms 288 KB Output is correct
10 Correct 43 ms 200 KB Output is correct
11 Correct 43 ms 300 KB Output is correct
12 Correct 28 ms 200 KB Output is correct
13 Correct 43 ms 200 KB Output is correct
14 Correct 40 ms 200 KB Output is correct
15 Correct 40 ms 292 KB Output is correct
16 Correct 39 ms 292 KB Output is correct
17 Correct 39 ms 200 KB Output is correct
18 Correct 40 ms 296 KB Output is correct
19 Correct 40 ms 200 KB Output is correct
20 Correct 39 ms 200 KB Output is correct

Subtask #5
53.0 / 53.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 316 KB Output is correct
2 Correct 5 ms 200 KB Output is correct
3 Correct 5 ms 200 KB Output is correct
4 Correct 5 ms 200 KB Output is correct
5 Correct 5 ms 200 KB Output is correct
6 Correct 5 ms 200 KB Output is correct
7 Correct 5 ms 200 KB Output is correct
8 Correct 5 ms 200 KB Output is correct
9 Correct 5 ms 200 KB Output is correct
10 Correct 5 ms 200 KB Output is correct
11 Correct 5 ms 200 KB Output is correct
12 Correct 5 ms 200 KB Output is correct
13 Correct 5 ms 200 KB Output is correct
14 Correct 5 ms 200 KB Output is correct
15 Correct 5 ms 200 KB Output is correct
16 Correct 5 ms 200 KB Output is correct
17 Correct 5 ms 200 KB Output is correct
18 Correct 5 ms 200 KB Output is correct
19 Correct 5 ms 312 KB Output is correct
20 Correct 5 ms 200 KB Output is correct
21 Correct 5 ms 200 KB Output is correct
22 Correct 5 ms 200 KB Output is correct
23 Correct 5 ms 200 KB Output is correct
24 Correct 5 ms 200 KB Output is correct
25 Correct 5 ms 200 KB Output is correct
26 Correct 5 ms 200 KB Output is correct
27 Correct 5 ms 200 KB Output is correct
28 Correct 5 ms 200 KB Output is correct
29 Correct 5 ms 200 KB Output is correct
30 Correct 5 ms 200 KB Output is correct
31 Correct 5 ms 200 KB Output is correct
32 Correct 5 ms 316 KB Output is correct
33 Correct 5 ms 200 KB Output is correct
34 Correct 5 ms 200 KB Output is correct
35 Correct 5 ms 200 KB Output is correct
36 Correct 5 ms 200 KB Output is correct
37 Correct 5 ms 200 KB Output is correct
38 Correct 5 ms 204 KB Output is correct
39 Correct 5 ms 200 KB Output is correct
40 Correct 5 ms 312 KB Output is correct