oj.uz

Submission #523270

# Submission time Handle Problem Language Result Execution time Memory
523270 2022-02-07T09:45:18 Z valerikk Koala Game (APIO17_koala) C++17
47 / 100
 80 ms 328 KB 
#include "koala.h"

#include <iostream>
#include <vector>
#include <algorithm>
#include <cassert>
#include <cstring>

using namespace std;

int B[100], R[100];

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.
    
    memset(B, 0, sizeof(B));
    B[0] = 1;
    playRound(B, R);
    for (int i = 0; i < N; ++i) {
        if (R[i] == 0) {
            return i;
        }
    }
    
    assert(false);
    return 0;
}

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.
    vector<int> cur;
    for (int i = 0; i < N; ++i) {
        cur.push_back(i);
    }
    while (cur.size() != 1) {
        int x = W / (int)cur.size();
        memset(B, 0, sizeof(B));
        for (int i : cur) {
            B[i] = x;
        }
        playRound(B, R);
        vector<int> ncur;
        for (int i : cur) {
            if (R[i] > B[i]) {
                ncur.push_back(i);
            }
        }
        cur = ncur;
    }
    return cur[0];
}

int greaterValue(int N, int W) {
    // TODO: Implement Subtask 3 solution here.
    // You may leave this function unmodified if you are not attempting this
    // subtask.
    int l = 1, r = min(N / 2, 9);
    int res = -1;
    while (r - l > 1) {
        int m = (l + r) / 2;
        memset(B, 0, sizeof(B));
        B[0] = B[1] = m;
        playRound(B, R);
        if ((B[1] < R[1]) != (B[0] < R[0])) {
            res = B[1] < R[1];
        }
        if (B[0] < R[0] || B[1] < R[1]) {
            l = m + 1;
        } else {
            r = m - 1;
        }
    }
    if (res == -1) {
        memset(B, 0, sizeof(B));
        B[0] = B[1] = l;
        playRound(B, R);
        res = B[1] < R[1];
    }
    return res;
}

void allValues(int N, int W, int *P) {
    if (W == 2*N) {
        // TODO: Implement Subtask 4 solution here.
        // You may leave this block unmodified if you are not attempting this
        // subtask.
        auto cmp = [&](int a, int b) {
            memset(B, 0, sizeof(B));
            B[a] = B[b] = N;
            playRound(B, R);
            return R[b] > B[b];
        };
        vector<int> sorted(N);
        for (int i = 0; i < N; ++i) {
            sorted[i] = i;
        }
        stable_sort(sorted.begin(), sorted.end(), cmp);
        for (int i = 0; i < N; ++i) {
            *(P + sorted[i]) = i + 1;
        }
    } else {
        // TODO: Implement Subtask 5 solution here.
        // You may leave this block unmodified if you are not attempting this
        // subtask.
    }
}

Subtask #1
4.0 / 4.0

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

Subtask #2
15.0 / 15.0

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

Subtask #3
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 64 ms 328 KB Output is correct
2 Correct 66 ms 320 KB Output is correct
3 Correct 80 ms 312 KB Output is correct
4 Correct 73 ms 316 KB Output is correct
5 Correct 74 ms 320 KB Output is correct
6 Correct 73 ms 328 KB Output is correct
7 Correct 64 ms 316 KB Output is correct
8 Correct 64 ms 320 KB Output is correct
9 Correct 65 ms 308 KB Output is correct
10 Correct 66 ms 316 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 20 ms 200 KB Output is correct
2 Correct 32 ms 292 KB Output is correct
3 Correct 32 ms 308 KB Output is correct
4 Correct 30 ms 200 KB Output is correct
5 Correct 36 ms 200 KB Output is correct
6 Correct 30 ms 288 KB Output is correct
7 Correct 30 ms 200 KB Output is correct
8 Correct 30 ms 200 KB Output is correct
9 Correct 30 ms 288 KB Output is correct
10 Correct 29 ms 200 KB Output is correct
11 Correct 35 ms 200 KB Output is correct
12 Correct 13 ms 200 KB Output is correct
13 Correct 30 ms 288 KB Output is correct
14 Correct 27 ms 200 KB Output is correct
15 Correct 29 ms 200 KB Output is correct
16 Correct 28 ms 200 KB Output is correct
17 Correct 28 ms 200 KB Output is correct
18 Correct 27 ms 200 KB Output is correct
19 Correct 27 ms 200 KB Output is correct
20 Correct 28 ms 304 KB Output is correct

Subtask #5
0 / 53.0

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