oj.uz

Submission #945081

# Submission time Handle Problem Language Result Execution time Memory
945081 2024-03-13T11:36:20 Z ifateen Koala Game (APIO17_koala) C++17
15 / 100
 75 ms 708 KB 
#include <bits/stdc++.h>
#include "koala.h"
using namespace std;
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.

    int b[N], r[N];
    memset(b, 0, sizeof(b)); b[0] = 1;
    playRound(b, r);
    if (r[0] <= 1) {
        // he couldnt care less to take this
        return 0;
    }
    // he could sad
    for (int i = 1; i < N; i++) {
        if (r[i] == 0) return i;
    }
}

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) {
    // TODO: Implement Subtask 3 solution here.
    // You may leave this function unmodified if you are not attempting this
    // subtask.

    int b[N], R[N];
    memset(b, 0, sizeof(b));
    int l = 1, r = 50;
    while (l <= r) {
        int mid = (l + r) >> 1;
        b[0] = mid, b[1] = mid;
        playRound(b, R);
        if (min(R[0], R[1]) > mid /*he took both so idk*/) l = mid + 1;
        else if (max(R[0], R[1]) <= mid /*he took neither so spend less lol*/) r = mid - 1;
        else {
            if (R[0] < R[1]) return 1;
            else return 0;
        }
    }
    assert(false);
}

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.
    }
}

Compilation message

koala.cpp: In function 'int minValue(int, int)':
koala.cpp:20:1: warning: control reaches end of non-void function [-Wreturn-type]
   20 | }
      | ^

Subtask #1
4.0 / 4.0

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

Subtask #2
0 / 15.0

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

Subtask #3
11.0 / 18.0

# Verdict Execution time Memory Grader output
1 Partially correct 75 ms 464 KB Output is partially correct
2 Partially correct 72 ms 452 KB Output is partially correct
3 Partially correct 70 ms 464 KB Output is partially correct
4 Partially correct 70 ms 456 KB Output is partially correct
5 Partially correct 69 ms 460 KB Output is partially correct
6 Partially correct 69 ms 468 KB Output is partially correct
7 Partially correct 70 ms 484 KB Output is partially correct
8 Partially correct 73 ms 708 KB Output is partially correct
9 Partially correct 69 ms 468 KB Output is partially correct
10 Partially correct 71 ms 460 KB Output is partially correct

Subtask #4
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 344 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 344 KB Output isn't correct
2 Halted 0 ms 0 KB -