oj.uz

Submission #51203

# Submission time Handle Problem Language Result Execution time Memory
51203 2018-06-17T08:22:49 Z TAMREF Koala Game (APIO17_koala) C++11
19 / 100
 24 ms 696 KB 
#include "koala.h"
#include <bits/stdc++.h>
using namespace std;

int B[105], R[105];

int minValue(int N, int W) {
    B[0] = 1;
    playRound(B,R);
    return (R[0] ? min_element(R,R+N) - R : 0);
}

int maxValue(int N, int W) {
    fill(B,B+N,1);
    playRound(B,R);

    for(int i = 0; i < N; i++) B[i] = (R[i] ? 2 : 0);
    playRound(B,R);

    for(int i = 0; i < N; i++) {
        if(B[i] == 2){
            B[i] = (R[i] ? 3 : 1);
        }else{
            B[i] = 0;
        }
    }
    playRound(B,R);

    for(int i = 0; i < N; i++) B[i] = (B[i] == 3 && R[i] > B[i] ? 16 : 0);
    playRound(B,R);

    for(int i = 0; i < N; i++){
        if(B[i] == 16 && R[i] > B[i]) return i;
    }
    return -1;
}

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 11 ms 376 KB Output is correct
2 Correct 9 ms 488 KB Output is correct
3 Correct 7 ms 604 KB Output is correct
4 Correct 8 ms 604 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 20 ms 604 KB Output is correct
2 Correct 24 ms 604 KB Output is correct
3 Correct 21 ms 696 KB Output is correct
4 Correct 18 ms 696 KB Output is correct

Subtask #3
0 / 18.0

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

Subtask #4
0 / 10.0

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

Subtask #5
0 / 53.0

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