oj.uz

Submission #57383

# Submission time Handle Problem Language Result Execution time Memory
57383 2018-07-14T17:53:58 Z fredbr Koala Game (APIO17_koala) C++17
37 / 100
 135 ms 992 KB 
#include "koala.h"
#include <bits/stdc++.h>

using namespace std;

const int maxn = 110;

int d[maxn], res[maxn];

int minValue(int N, int W) {

    d[0] = 1;
    playRound(d, res);
    if (res[0] == 0)
        return 0;
    for (int i = 1; i < N; i++)
        if (res[i] == 0)
            return i;
    return 0;
}

int maxValue(int N, int W) {
        

    for (int i = 0; i < N; i++)
        d[i] = 1;
    playRound(d, res);

    memset(d, 0, sizeof(d));
    for (int i = 0; i < N; i++)
        if (res[i] == 2)
            d[i] = 2;
    playRound(d, res);

    memset(d, 0, sizeof(d));
    for (int i = 0; i < N; i++)
        if (res[i] == 3)
            d[i] = 4;
    playRound(d, res);

    memset(d, 0, sizeof(d));
    for (int i = 0; i < N; i++)
        if (res[i] == 5)
            d[i] = 11;

    playRound(d, res);

    for (int i = 0; i < N; i++)
        if (res[i] == 12)
            return i;
    return 0;
}

void clear()
{
    memset(d, 0, sizeof(d));
}

int greaterValue(int N, int W)
{

    d[0] = d[1] = 2;

    playRound(d, res);

    if (res[0] > res[1]) return 0;
    if (res[0] < res[1]) return 1;
    
    if (res[0] > 2) {    

        d[0] = d[1] = 4;

        playRound(d, res);

        if (res[0] > res[1]) return 0;
        if (res[0] < res[1]) return 1;

        if (res[0] > 4)
            d[0] = d[1] = 8;
        else
            d[0] = d[1] = 3;
        
        playRound(d, res);

        if (res[0] > res[1]) return 0;
        if (res[0] < res[1]) return 1;
    }
    else {

        d[0] = d[1] = 3;

        playRound(d, res);

        if (res[0] > res[1]) return 0;
        if (res[0] < res[1]) return 1;

        if (res[0] > 3)
            d[0] = d[1] = 5;
        else d[0] = d[1] = 1;

        playRound(d, res);
        
        if (res[0] > res[1]) return 0;
        if (res[0] < res[1]) return 1;
    }

    return 3;
}

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 7 ms 248 KB Output is correct
2 Correct 7 ms 356 KB Output is correct
3 Correct 8 ms 408 KB Output is correct
4 Correct 7 ms 500 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 23 ms 500 KB Output is correct
2 Correct 28 ms 628 KB Output is correct
3 Correct 23 ms 628 KB Output is correct
4 Correct 21 ms 648 KB Output is correct

Subtask #3
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 126 ms 784 KB Output is correct
2 Correct 120 ms 784 KB Output is correct
3 Correct 127 ms 992 KB Output is correct
4 Correct 123 ms 992 KB Output is correct
5 Correct 126 ms 992 KB Output is correct
6 Correct 127 ms 992 KB Output is correct
7 Correct 125 ms 992 KB Output is correct
8 Correct 113 ms 992 KB Output is correct
9 Correct 135 ms 992 KB Output is correct
10 Correct 108 ms 992 KB Output is correct

Subtask #4
0 / 10.0

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

Subtask #5
0 / 53.0

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