Submission #73264

#	Time	Username	Problem	Language	Result	Execution time	Memory
73264		FedericoS	Koala Game (APIO17_koala)	C++14	4 / 100	11 ms	800 KiB

koala

#include "koala.h"
#include <iostream>
using namespace std;

int minValue(int N, int W) {
    
	int B[N],R[N];
	fill(B,B+N,0);

	B[0]=1;

	playRound(B,R);

	int res=0;

	for(int i=0;i<N;i++)
		if(R[i]==0)
			res=i;

    return res;
}

int maxValue(int N, int W) {
    

}

int greaterValue(int N, int W) {

    int B[N],R[N];
	fill(B,B+N,0);
	fill(R,R+N,0);

	int l=0,r=min(N,8),m;

	while(l<r){
		
		m=(l+r)/2;

		B[0]=B[1]=m;
		playRound(B,R);

		if(R[0]!=R[1])
    		return R[0]<R[1];

    	if(R[0]==0)
    		r=m;
    	else
    		l=m+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:26:1: warning: no return statement in function returning non-void [-Wreturn-type]
 }
 ^
koala.cpp: In function 'int greaterValue(int, int)':
koala.cpp:53:1: warning: control reaches end of non-void function [-Wreturn-type]
 }
 ^

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