Submission #1342206

#TimeUsernameProblemLanguageResultExecution timeMemory
1342206javkhlantogs코알라 (APIO17_koala)C++20
4 / 100
3 ms412 KiB
#include<bits/stdc++.h>
#include "koala.h"
#define ll long long
using namespace std;
ll i,j,k,q;
int b[201],r[201];
int minValue(int n,int w){
	for(i=0 ; i<n ; i++) b[i]=0;
	b[0]=1;
	playRound(b,r);
	for(i=0 ; i<n ; i++){
		if(r[i]<=b[i]) return i;
	}
	return 0;
}
int maxValue(int n,int w){
	for(i=0 ; i<n ; i++) b[i]=1;
	playRound(b,r);
	while(1){
		ll cnt=0;
		for(i=0 ; i<n ; i++) if(r[i]>b[i]) cnt++; 
		if(cnt==1) for(i=0 ; i<n ; i++) if(r[i]>b[i]) return i;
		for(i=0 ; i<n ; i++){
			if(r[i]>b[i]) b[i]=100/cnt;
				else b[i]=0;
		}
		playRound(b,r);
	}
	return 0;
}
int greaterValue(int n,int w){
	
	return 0;	
}
void allValues(int n,int w,int *p){
	
}
#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...