oj.uz

Submission #399659

# Submission time Handle Problem Language Result Execution time Memory
399659 2021-05-06T11:16:31 Z KoD Koala Game (APIO17_koala) C++17
14 / 100
 49 ms 456 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) {
    // TODO: Implement Subtask 2 solution here.
    // You may leave this function unmodified if you are not attempting this
    // subtask.
    return 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);
            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 {
        // 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:25:9: warning: unused variable 'B' [-Wunused-variable]
   25 |     int B[100] = {}, R[100] = {};
      |         ^
koala.cpp:25:22: warning: unused variable 'R' [-Wunused-variable]
   25 |     int B[100] = {}, R[100] = {};
      |                      ^
koala.cpp:27:1: warning: no return statement in function returning non-void [-Wreturn-type]
   27 | }
      | ^

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
0 / 15.0

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

Subtask #3
0 / 18.0

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

Subtask #4
10.0 / 10.0

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

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 -