Submission #1260228

#	Time	Username	Problem	Language	Result	Execution time	Memory
1260228		arashmemar	Koala Game (APIO17_koala)	C++20	0 / 100	2 ms	408 KiB

koala

#include <bits/stdc++.h>
#include "koala.h"

using namespace std;

bool mark[100];

int minValue(int N, int W) {
	if (W != 100)
	{
		return 0;
	}
	int r[N];
	int b[N];
	for (int i = 0;i < N;i++)
	{
		b[i] = mark[i];
	}
	for (int i = 0;i < N;i++)
	{
		if (mark[i] == 0)
		{
			b[0] = 1;
			break;
		}
	}
	playRound(b, r);
	for (int i = 0;i < N;i++)
	{
		if (b[i] == 0 and r[i] == 0)
		{
			mark[i] = 1;
			return i;
		}
		if (b[i] and r[i] > b[i])
		{
			mark[i] = 1;
			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) {
    // 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 {
		for (int i = 1;i <= N;i++)
		{
			P[minValue(N, W)] = i;
		}
		return ;
    }
}

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