oj.uz

Submission #57365

# Submission time Handle Problem Language Result Execution time Memory
57365 2018-07-14T16:25:10 Z fredbr Koala Game (APIO17_koala) C++17
19 / 100
 24 ms 708 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)
{
   for (int j = 0; j <= 9; j++) {

        memset(d+2, 0, sizeof(d)-8);
        int sum = d[0] + d[1];
        for (int i = 2; i < N; i++)
            if (res[i] == j+1)
                d[i] = min(W-sum, j+1), sum = max(sum + d[i], W);
        
        playRound(d, res);

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

        if (res[0] == j+1)
            d[0] = d[1] = j+1;
        else d[0] = d[1] = 1;

        d[0] = max(d[0], 0);
        d[1] = max(d[1], 0);
    }
    // return r;
    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 8 ms 248 KB Output is correct
2 Correct 8 ms 488 KB Output is correct
3 Correct 9 ms 488 KB Output is correct
4 Correct 11 ms 488 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 488 KB Output is correct
2 Correct 24 ms 600 KB Output is correct
3 Correct 18 ms 600 KB Output is correct
4 Correct 19 ms 600 KB Output is correct

Subtask #3
0 / 18.0

# Verdict Execution time Memory Grader output
1 Incorrect 3 ms 600 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 708 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 708 KB Output isn't correct
2 Halted 0 ms 0 KB -