oj.uz

Submission #251810

# Submission time Handle Problem Language Result Execution time Memory
251810 2020-07-22T10:31:23 Z atoiz Koala Game (APIO17_koala) C++14
37 / 100
 100 ms 520 KB 
#include "koala.h"
#include <cassert>
#include <algorithm>
#include <iostream>

using namespace std;

#define FOR(i, a, b) for (int i = a; i <= b; ++i)
int A[100], B[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.
    FOR(i, 1, N - 1) A[i] = 0;
    A[0] = 1;
    playRound(A, B);
    FOR(i, 0, N - 1) if (A[i] >= B[i]) 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.
    bool C[N];
    FOR(i, 0, N - 1) C[i] = 1;

    for (int _ = 0; _ < 4; ++_) {
        int cnt = count(C, C + N, 1);
        FOR(i, 0, N - 1) A[i] = C[i] * N / cnt;
        playRound(A, B);
        FOR(i, 0, N - 1) C[i] = C[i] && (A[i] < B[i]);
    }

    assert(count(C, C + N, 1) == 1);
    FOR(i, 0, N - 1) if (C[i]) return i;
    assert(false);
    return 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 lo = 1, hi = 7;
    while (true) {
        assert(lo <= hi);
        int mid = (lo + hi) >> 1;
        FOR(i, 2, N - 1) A[i] = 0;
        A[0] = A[1] = mid + (mid == 7);
        playRound(A, B);
        if ((A[0] < B[0]) != (A[1] < B[1])) return A[1] < B[1];
        if (A[0] < B[0]) lo = mid + 1;
        else hi = mid - 1;
    }
    assert(false);
    return 0;
}

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.
    } 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 6 ms 384 KB Output is correct
2 Correct 7 ms 384 KB Output is correct
3 Correct 6 ms 384 KB Output is correct
4 Correct 6 ms 384 KB Output is correct

Subtask #2
15.0 / 15.0

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

Subtask #3
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 90 ms 412 KB Output is correct
2 Correct 100 ms 508 KB Output is correct
3 Correct 87 ms 384 KB Output is correct
4 Correct 84 ms 512 KB Output is correct
5 Correct 86 ms 384 KB Output is correct
6 Correct 88 ms 520 KB Output is correct
7 Correct 91 ms 504 KB Output is correct
8 Correct 86 ms 384 KB Output is correct
9 Correct 89 ms 384 KB Output is correct
10 Correct 92 ms 392 KB Output is correct

Subtask #4
0 / 10.0

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

Subtask #5
0 / 53.0

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