oj.uz

Submission #399680

# Submission time Handle Problem Language Result Execution time Memory
399680 2021-05-06T12:06:04 Z KoD Koala Game (APIO17_koala) C++17
19 / 100
 19 ms 328 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] = {};
    
}

void allValues(int N, int W, int *P) {
    if (W == 2 * N) {
        int B[100] = {}, R[100] = {};
        const auto less = [&](const int i, const int j) {
            B[i] = B[j] = W / 2;
            playRound(B, R);
            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 {
        // TODO: Implement Subtask 5 solution here.
        // You may leave this block unmodified if you are not attempting this
        // subtask.
    }
}

Compilation message

koala.cpp: In function 'int greaterValue(int, int)':
koala.cpp:39:9: warning: unused variable 'B' [-Wunused-variable]
   39 |     int B[100] = {}, R[100] = {};
      |         ^
koala.cpp:39:22: warning: unused variable 'R' [-Wunused-variable]
   39 |     int B[100] = {}, R[100] = {};
      |                      ^
koala.cpp:41:1: warning: no return statement in function returning non-void [-Wreturn-type]
   41 | }
      | ^

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 200 KB Output is correct

Subtask #2
15.0 / 15.0

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

Subtask #3
0 / 18.0

# Verdict Execution time Memory Grader output
1 Runtime error 2 ms 328 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #4
0 / 10.0

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

Subtask #5
0 / 53.0

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