Submission #249284

#	Time	Username	Problem	Language	Result	Execution time	Memory
249284		SamAnd	Koala Game (APIO17_koala)	C++17	19 / 100	18 ms	640 KiB

koala

#include "koala.h"
#include <bits/stdc++.h>
using namespace std;
#define m_p make_pair
#define all(x) (x).begin(),(x).end()
#define sz(x) ((int)(x).size())
#define fi first
#define se second
const int N = 102;

int n;

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.
    n = N;

    int* a;
    a = new int[n];
    for (int i = 0; i < n; ++i)
        a[i] = 0;

    a[0] = 1;

    int* b = new int[n];
    playRound(a, b);

    for (int i = 0; i < n; ++i)
    {
        if (b[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.
    n = N;

    vector<int> v;
    for (int i = 0; i < n; ++i)
        v.push_back(i);

    while (1)
    {
        if (sz(v) == 1)
            return v[0];

        int* a;
        a = new int[n];
        for (int i = 0; i < n; ++i)
            a[i] = 0;

        for (int i = 0; i < v.size(); ++i)
        {
            a[v[i]] = W / sz(v);
        }

        int* b;
        b = new int[n];
        playRound(a, b);

        vector<int> nv;
        for (int i = 0; i < v.size(); ++i)
        {
            if (b[v[i]] > a[v[i]])
                nv.push_back(v[i]);
        }
        v = nv;
    }
    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.
    n = N;

    int* a;
    a = new int[n];
    for (int i = 0; i < n; ++i)
        a[i] = 0;

    a[0] = W / 2;
    a[1] = W / 2;

    int* b;
    b = new int[n];
    playRound(a, b);

    if (b[0] > b[1])
        return 0;
    return 1;
}

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.
    }
}

Compilation message (stderr)

koala.cpp: In function 'int maxValue(int, int)':
koala.cpp:59:27: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for (int i = 0; i < v.size(); ++i)
                         ~~^~~~~~~~~~
koala.cpp:69:27: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for (int i = 0; i < v.size(); ++i)
                         ~~^~~~~~~~~~

• Subtask 1: 4 / 4
• Subtask 2: 15 / 15
• Subtask 3: 0 / 18
• Subtask 4: 0 / 10
• Subtask 5: 0 / 53