Submission #1260240

#TimeUsernameProblemLanguageResultExecution timeMemory
1260240ebrambill코알라 (APIO17_koala)C++17
19 / 100
8 ms440 KiB
//In the name of GOD

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

const int maxN=1e3;
int B[maxN], R[maxN];

int minValue(int n, int w){
	for (int i=0; i<n; i++) B[i]=!i;
	playRound(B, R);
	for (int i=0; i<n; i++){
		if(R[i]<=B[i]) return i;
	}
	return 0;
}

int maxValue(int n, int w){
	vector<int> rem;
	for (int i=0; i<n; i++) rem.push_back(i);
	while(rem.size()>1){
		fill(B, B+n, 0);
		for (int i: rem) B[i]=w/rem.size();
		playRound(B, R);
		vector<int> tmp;
		for (int i: rem) if(R[i]>B[i]) tmp.push_back(i);
		rem=tmp;
	}
	return rem.front();
}

int greaterValue(int n, int w){
	return 0;
}

void allValues(int n, int w, int *p){
	if(n==w){
	}
	else{
	}
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...