Submission #1116741

#	Time	Username	Problem	Language	Result	Execution time	Memory
1116741		OI_Account	Koala Game (APIO17_koala)	C++17	4 / 100	6 ms	384 KiB

koala

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

const int N = 100;

int n = 100;
int a[N + 10], b[N + 10];

int minValue(int N, int W) {
    for (int i = 0; i < n; i++)
        a[i] = 1;
    playRound(a, b);
    vector<int> vec;
    for (int i = 0; i < n; i++)
        if (b[i] == 2)
            vec.push_back(i);
    fill(a, a + n, 0);
    a[vec[0]] = 1;
    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.
    return 0;
}

int greaterValue(int N, int W) {
    for (int i = 2; i < n; i++) 
        a[i] = 0;
    a[0] = a[1] = 1;
    playRound(a, b);
    return b[1] == 2;
    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 / 4
• Subtask 2: 0 / 15
• Subtask 3: 0 / 18
• Subtask 4: 0 / 10
• Subtask 5: 0 / 53