oj.uz

Submission #68641

# Submission time Handle Problem Language Result Execution time Memory
68641 2018-08-17T18:25:42 Z KLPP Koala Game (APIO17_koala) C++14
33 / 100
 73 ms 3748 KB 
#include "koala.h"
#include<vector>
#include<iostream>

using namespace std;
int minValue(int N, int W) {
	int arr[N];
	for(int i=0;i<N;i++)arr[i]=0;
	arr[0]=1;
	int R[N];
	playRound(arr,R);
	if(R[0]<2){
		return 0;
	}else{
		for(int i=0;i<N;i++){
			if(R[i]==0)return i;
		}
	}
    return 0;
}



int maxValue(int N, int W) {
	vector<int> v;
	for(int i=0;i<N;i++)v.push_back(i);
	while(v.size()>1){
		int d=N/v.size();
		d=min(d,13);
		int arr[N];
		for(int i=0;i<N;i++){
			arr[i]=0;
		}
		for(int i=0;i<v.size();i++){
			arr[v[i]]=d;
		}/*for(int i=0;i<N;i++)cout<<arr[i]<<" ";
		cout<<endl;*/
		int sol[N];
		playRound(arr,sol);
		vector<int> V;
		for(int i=0;i<N;i++){
			if(sol[i]>d)V.push_back(i);
		}
		v=V;
	}
	
    return v[0];
}

int greaterValue(int N, int W) {
	int lo,hi;
	lo=-1;
	hi=14;
	while(hi-lo>1){
		int n=N;
		int mid=(hi+lo)/2;
		int arr[n];
		for(int i=0;i<n;i++)arr[i]=0;
		arr[0]=mid;
		arr[1]=mid;
		int b[n];
		playRound(arr,b);
		
		
		if(b[0]>b[1])return 0;
		if(b[1]>b[0])return 1;
		if(b[0]==0)hi=mid;
		else lo=mid;
		
	}
    return 0;
}

void allValues(int N, int W, int *P) {
    if (W == 2*N) {
	int n=N;
        int arr[n];
	for(int i=0;i<n;i++)arr[i]=-1;
	for(int i=0;i<14;i++){
		int b[n];
		int r[n];
		for(int j=0;j<n;j++){
			if(arr[j]==-1)b[i]=0;
			else b[i]=arr[i];
		}
	}
    } else {
	int n=N;
	for(int i=0;i<n;i++){
		int b[14][n];
		int max=0;
		for(int t=1;t<14;t++){
			int arr[n];
			for(int x=0;x<n;x++)arr[x]=0;
			arr[0]=t;
			playRound(arr,b[t-1]);
			//if(arr[i]
		}
		
	}
    }
}

Compilation message

koala.cpp: In function 'int maxValue(int, int)':
koala.cpp:34:16: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for(int i=0;i<v.size();i++){
               ~^~~~~~~~~
koala.cpp: In function 'void allValues(int, int, int*)':
koala.cpp:80:7: warning: variable 'b' set but not used [-Wunused-but-set-variable]
   int b[n];
       ^
koala.cpp:81:7: warning: unused variable 'r' [-Wunused-variable]
   int r[n];
       ^
koala.cpp:91:7: warning: unused variable 'max' [-Wunused-variable]
   int max=0;
       ^~~

Subtask #1
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 248 KB Output is correct
2 Correct 6 ms 356 KB Output is correct
3 Correct 7 ms 576 KB Output is correct
4 Correct 6 ms 576 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 18 ms 576 KB Output is correct
2 Correct 19 ms 596 KB Output is correct
3 Correct 20 ms 596 KB Output is correct
4 Correct 17 ms 736 KB Output is correct

Subtask #3
14.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 61 ms 736 KB Output is correct
2 Partially correct 73 ms 1008 KB Output is partially correct
3 Correct 55 ms 1392 KB Output is correct
4 Correct 55 ms 1624 KB Output is correct
5 Partially correct 64 ms 2076 KB Output is partially correct
6 Correct 61 ms 2408 KB Output is correct
7 Partially correct 57 ms 2716 KB Output is partially correct
8 Correct 59 ms 3048 KB Output is correct
9 Correct 70 ms 3372 KB Output is correct
10 Correct 57 ms 3748 KB Output is correct

Subtask #4
0 / 10.0

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

Subtask #5
0 / 53.0

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