Submission #334018

#	Time	Username	Problem	Language	Result	Execution time	Memory
334018		mohamedsobhi777	Koala Game (APIO17_koala)	C++14	0 / 100	1 ms	364 KiB

koala

#include "koala.h"
#include <bits/stdc++.h>
#define vi vector<int>
using namespace std;

int NN;

vector<int> play(vector<int> v)
{
    int *arr;
    int *arr2;
    arr = new int[NN];
    arr2 = new int[NN];
    for (int i = 0; i < NN; ++i)
    {
        arr[i] = v[i];
    }

    playRound(arr, arr2);
    vector<int> ret;
    for (int i = 0; i < NN; ++i)
    {
        ret.push_back(arr2[i]);
    }
    return ret;
}

int minValue(int N, int W)
{
    NN = N;
    vector<int> v(N, 0);
    v[0] = v[1] = 1;
    vi ret = play(v);
    if (v[0] && v[1])
    {
        for (int i = 0; i < N; ++i)
            v[i] = (!!ret[i]);
        ret = play(v);
        for (int i = 0; i < N; ++i)
            if (!ret[i])
                return i;
    }
    else if (v[0])
    {
        return 1;
    }
    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 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: 0 / 4
• Subtask 2: 0 / 15
• Subtask 3: 0 / 18
• Subtask 4: 0 / 10
• Subtask 5: 0 / 53