oj.uz

Submission #73272

# Submission time Handle Problem Language Result Execution time Memory
73272 2018-08-28T06:27:29 Z FedericoS Koala Game (APIO17_koala) C++14
29 / 100
 73 ms 988 KB 
#include <assert.h>
#include <iostream>
#include "koala.h"
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 B[N],R[N];
	int V[N];
	fill(V,V+N,1);
	fill(B,B+N,0);
	fill(R,R+N,0);

	for(int k=1;;k++){
		
		for(int i=0;i<N;i++)
			B[i]=V[i]*k;

		//for(int i=0;i<N;i++)cout<<B[i]<<" ";cout<<endl;
		playRound(B,R);

		int res=0;
		for(int i=0;i<N;i++){
			if(V[i] and !R[i])
				V[i]=false;
			if(V[i] and R[i])
				res++;
		}

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

		assert(res);

	}

}

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=10,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

koala.cpp: In function 'int greaterValue(int, int)':
koala.cpp:84:1: warning: control reaches end of non-void function [-Wreturn-type]
 }
 ^

Subtask #1
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 376 KB Output is correct
2 Correct 10 ms 552 KB Output is correct
3 Correct 7 ms 552 KB Output is correct
4 Correct 7 ms 552 KB Output is correct

Subtask #2
7.0 / 15.0

# Verdict Execution time Memory Grader output
1 Partially correct 31 ms 564 KB Output is partially correct
2 Partially correct 34 ms 700 KB Output is partially correct
3 Partially correct 35 ms 712 KB Output is partially correct
4 Partially correct 32 ms 828 KB Output is partially correct

Subtask #3
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 69 ms 828 KB Output is correct
2 Correct 70 ms 828 KB Output is correct
3 Correct 72 ms 948 KB Output is correct
4 Correct 69 ms 948 KB Output is correct
5 Correct 72 ms 948 KB Output is correct
6 Correct 73 ms 948 KB Output is correct
7 Correct 70 ms 988 KB Output is correct
8 Correct 69 ms 988 KB Output is correct
9 Correct 64 ms 988 KB Output is correct
10 Correct 59 ms 988 KB Output is correct

Subtask #4
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 988 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 53.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 988 KB Output isn't correct
2 Halted 0 ms 0 KB -