Submission #624926

#	Time	Username	Problem	Language	Result	Execution time	Memory
624926		QwertyPi	Koala Game (APIO17_koala)	C++14	33 / 100	66 ms	332 KiB

koala

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

using namespace std;

int minValue(int N, int W) {
	int a[N], b[N];
	a[0] = 1;
	for(int i = 1; i < N; i++){
		a[i] = 0;
	}
	playRound(a, b);
	if(b[0] <= 1){
		return 0;
	}else{
		for(int i = 1; i < N; i++){
			if(b[i] == 0){
				return i;
			}
		}
	}
}

int maxValue(int N, int W) {
	int a[N], b[N];
	
	vector<int> v;
	for(int i = 0; i < N; i++){
		v.push_back(i);
	}
	while(v.size() != 1){
		for(int i = 0; i < N; i++) a[i] = 0;
		int k = v.size();
		int sq = 0; while((sq + 1) * (sq + 2) / 2 < N - k + 1) sq++;
		
		for(auto i : v){
			a[i] = min(W / k, k + sq - 1);
		}
		
		playRound(a, b);
		
		vector<int> nv;
		for(int i = 0; i < N; i++){
			if(a[i] != 0 && b[i] > a[i]){
				nv.push_back(i);
			}
		}
		v = nv;
	}
    return v[0];
}

int greaterValue(int N, int W) {
	int a[N], b[N];
	int l = 1, r = 8;
	for(int k = 1; k <= 4; k++){
		int mid = (l + r + 1) / 2;
		a[0] = a[1] = mid;
		for(int i = 2; i < N; i++){
			a[i] = 0;
		}
		playRound(a, b);
		if(b[0] > mid && mid >= b[1]){
			return 0;
		}else if(b[0] <= mid && mid < b[1]){
			return 1;
		}else{
			if(b[0] <= mid){
				r = mid - 1;
			}else{
				l = mid;
			}
		}
	}
}

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 minValue(int, int)':
koala.cpp:22:1: warning: control reaches end of non-void function [-Wreturn-type]
   22 | }
      | ^
koala.cpp: In function 'int greaterValue(int, int)':
koala.cpp:75:1: warning: control reaches end of non-void function [-Wreturn-type]
   75 | }
      | ^

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