oj.uz

Submission #406876

# Submission time Handle Problem Language Result Execution time Memory
406876 2021-05-18T06:47:39 Z benedict0724 Koala Game (APIO17_koala) C++17
18 / 100
 63 ms 428 KB 
#include "koala.h"
#include <assert.h>

int B[100], R[100];

void initialize(int N)
{
    for(int i=0;i<N;i++)
    {
        B[i] = 0;
        R[i] = 0;
    }
    return;
}
int minValue(int N, int W) {
    initialize(N);
    B[0] = 1;
    playRound(B, R);
    int ans = 0;
    for(int i=1;i<N;i++)
    {
        if(R[i] == 0) ans = i;
    }
    return ans;
}

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 l = 1, r = 15;
    while(l <= r)
    {
        initialize(N);
        int mid = (l + r)/2;
        B[0] = B[1] = mid;
        playRound(B, R);

        if(R[0] != R[1])
        {
            return (R[0] == 0) ? 1 : 0;
        }

        if(R[0] == 0) r = mid-1;
        else l = mid+1;
    }
}

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 greaterValue(int, int)':
koala.cpp:51:1: warning: control reaches end of non-void function [-Wreturn-type]
   51 | }
      | ^

Subtask #1
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 200 KB Output is correct
2 Correct 5 ms 200 KB Output is correct
3 Correct 5 ms 200 KB Output is correct
4 Correct 5 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
14.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 52 ms 296 KB Output is correct
2 Partially correct 57 ms 296 KB Output is partially correct
3 Correct 52 ms 316 KB Output is correct
4 Correct 54 ms 300 KB Output is correct
5 Partially correct 52 ms 428 KB Output is partially correct
6 Correct 55 ms 200 KB Output is correct
7 Partially correct 63 ms 296 KB Output is partially correct
8 Correct 57 ms 200 KB Output is correct
9 Correct 54 ms 420 KB Output is correct
10 Correct 54 ms 408 KB Output is correct

Subtask #4
0 / 10.0

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

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 -