oj.uz

Submission #1040784

# Submission time Handle Problem Language Result Execution time Memory
1040784 2024-08-01T09:15:34 Z Dalek_of_Rivia Koala Game (APIO17_koala) C++17
19 / 100
 8 ms 432 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.
    int B[N], R[N];
    for(int i=0; i<N; i++) B[i]=0;
    B[0]=1;
    playRound(B, R);
    for(int i=1; i<N; i++) if(R[i]==0) return i;
    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.
    int B[N], R[N];
    bool b[N];
    for(int i=0; i<N; i++){
        b[i]=true;
        B[i]=1;
    }
    playRound(B, R);
    for(int i=0; i<N; i++){
        if(R[i]<=B[i]) b[i]=false;
    }
    for(int i=0; i<N; i++){
        if(b[i]){
            B[i]=2;
        }else{
            B[i]=0;
        }
    }
    playRound(B, R);
    for(int i=0; i<N; i++){
        if(R[i]<=B[i]) b[i]=false;
    }
    for(int i=0; i<N; i++){
        if(b[i]){
            B[i]=4;
        }else{
            B[i]=0;
        }
    }
    playRound(B, R);
    for(int i=0; i<N; i++){
        if(R[i]<=B[i]) b[i]=false;
    }
    for(int i=0; i<N; i++){
        if(b[i]){
            B[i]=11;
        }else{
            B[i]=0;
        }
    }
    playRound(B, R);
    for(int i=0; i<N; i++){
        if(R[i]<=B[i]) b[i]=false;
    }
    for(int i=1; i<N; i++) if(b[i]) return i;
    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.
    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 4 ms 344 KB Output is correct
2 Correct 2 ms 344 KB Output is correct
3 Correct 2 ms 344 KB Output is correct
4 Correct 2 ms 344 KB Output is correct

Subtask #2
15.0 / 15.0

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

Subtask #3
0 / 18.0

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

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 -