oj.uz

Submission #557628

# Submission time Handle Problem Language Result Execution time Memory
557628 2022-05-05T16:10:05 Z nutella Koala Game (APIO17_koala) C++17
37 / 100
 52 ms 464 KB 
#include "koala.h"

#include <bits/stdc++.h>

using namespace std;

typedef long long ll;

const int maxN = 100;
int B[maxN], R[maxN];

void cl() {
    memset(B, 0, sizeof(B));
    memset(R, 0, sizeof(R));
}

int minValue(int N, int W) {
    // TODO: Implement Subtask 1 solution here.
    // You may leave this function unmodified if you are not attempting this
    // subtask.
    cl();
    B[0] = 1;
    playRound(B, R);
    if (R[0]) {
        return int(min_element(R, R + N) - R);
    } else {
        return 0;
    }
}

int maxValue(int N, int W) {
    // return i such as P[i] = n
    vector<int> left(N);
    iota(begin(left), end(left), 0);
    while (size(left) > 1) {
        int x = W / (int) size(left);
        cl();
        for (int i: left)
            B[i] = x;
        playRound(B, R);
        vector<int> tmp;
        for (int i: left)
            if (B[i] < R[i])
                tmp.push_back(i);
        swap(tmp, left);
    }
    assert(size(left) == 1);
    return left[0];
}

int greaterValue(int N, int W) {
    // compare P[0] and P[1]
    int l = 0, r = W / 8;
    while (l + 1 < r) {
        int m = (l + r) >> 1;
        cl();
        B[0] = B[1] = m;
        playRound(B, R);
        bool took1 = R[0] > B[0];
        bool took2 = R[1] > B[1];
        if (took1 && took2) l = m;
        else if (!took1 && !took2) r = m;
        else if (took1) return 0;
        else return 1;
    }
    return 0;
}

void allValues(int N, int W, int *P) {
    for (int v = N; v > 0; --v) {
        W = v;
        vector<int> left;
        for (int i = 0; i < N; ++i) {
            if (P[i] == 0)
                left.push_back(i);
        }
        while (size(left) > 1) {
            int x = W / (int) size(left);
            cl();
            for (int i: left)
                B[i] = x;
            playRound(B, R);
            vector<int> tmp;
            for (int i: left)
                if (B[i] < R[i])
                    tmp.push_back(i);
            swap(tmp, left);
        }
        assert(size(left) == 1);
        P[left[0]] = v;
    }
}

Subtask #1
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 208 KB Output is correct
2 Correct 3 ms 316 KB Output is correct
3 Correct 4 ms 208 KB Output is correct
4 Correct 4 ms 208 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 208 KB Output is correct
2 Correct 13 ms 312 KB Output is correct
3 Correct 12 ms 208 KB Output is correct
4 Correct 11 ms 208 KB Output is correct

Subtask #3
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 47 ms 336 KB Output is correct
2 Correct 50 ms 336 KB Output is correct
3 Correct 45 ms 332 KB Output is correct
4 Correct 43 ms 336 KB Output is correct
5 Correct 43 ms 332 KB Output is correct
6 Correct 46 ms 332 KB Output is correct
7 Correct 44 ms 328 KB Output is correct
8 Correct 46 ms 328 KB Output is correct
9 Correct 45 ms 324 KB Output is correct
10 Correct 52 ms 328 KB Output is correct

Subtask #4
0 / 10.0

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

Subtask #5
0 / 53.0

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