oj.uz

Submission #401163

# Submission time Handle Problem Language Result Execution time Memory
401163 2021-05-09T13:49:51 Z Hazem Koala Game (APIO17_koala) C++14
11 / 100
 128 ms 424 KB 
#include "koala.h"

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.
    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.
    return 0;
}

int B[100],R[100];

int greaterValue(int N, int W) {
    
    int l = 0,r = W/2;
    while(l<r){

        int mid = (l+r+1)/2;
        B[0] = B[1] = mid;
        playRound(B,R);

        if(R[0]!=R[1])
            return R[0]<R[1];
        
        if(R[0])l = mid;
        else r = mid-1;
    }   
    
    int cnt = -1;
    while(1)
        cnt++;
    return cnt;
}

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
0 / 4.0

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

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
11.0 / 18.0

# Verdict Execution time Memory Grader output
1 Partially correct 128 ms 292 KB Output is partially correct
2 Partially correct 126 ms 296 KB Output is partially correct
3 Partially correct 125 ms 416 KB Output is partially correct
4 Partially correct 125 ms 200 KB Output is partially correct
5 Partially correct 127 ms 424 KB Output is partially correct
6 Partially correct 127 ms 300 KB Output is partially correct
7 Partially correct 126 ms 376 KB Output is partially correct
8 Partially correct 125 ms 296 KB Output is partially correct
9 Partially correct 126 ms 296 KB Output is partially correct
10 Partially correct 128 ms 328 KB Output is partially 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 -