oj.uz

Submission #262567

# Submission time Handle Problem Language Result Execution time Memory
262567 2020-08-13T04:27:23 Z daniel920712 Koala Game (APIO17_koala) C++14
19 / 100
 20 ms 384 KB 
#include "koala.h"
#include <stdio.h>
#include <vector>
using namespace std;
int B[105]={0},R[105]={0};
int all[105];
int where[105];
bool have[105];
int minValue(int N, int W) {
    // TODO: Implement Subtask 1 solution here.
    // You may leave this function unmodified if you are not attempting this
    // subtask.
    int i;
    B[0]=1;
    playRound(B,R);
    for(i=0;i<N;i++)
    {
        if(R[i]!=B[i]+1) return i;
    }
    return 0;
}
int maxValue(int N, int W) 
{    
    int i,now=N,tt=0;
    for(i=0;i<100;i++) if(!have[i])R[i]=2;
    while(1)
    {
    	for(i=0;i<N;i++) 
		{
			if(have[i]) continue;
			if(R[i]>1) B[i]=W/now;
			else B[i]=0;
		}
	    playRound(B,R);
	    now=0;
	    for(i=0;i<N;i++) 
		{
			if(have[i]) continue;
			if(R[i]>1) now++;
		}
	    if(now==1) for(i=0;i<N;i++) if(R[i]>1) return i;
	}
	
    

}

int greaterValue(int N, int W) {
    // TODO: Implement Subtask 3 solution here.
    // You may leave this function unmodified if you are not attempting this
    // subtask.
    B[0]=1;
    B[1]=1;
    
    return 0;
}

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 
	{
		for(int i=N;i>=1;i--)
		{
			int t=maxValue(i,i);
			P[t]=i;
			have[t]=1;
		}
    }
}

Compilation message

koala.cpp: In function 'int maxValue(int, int)':
koala.cpp:24:17: warning: unused variable 'tt' [-Wunused-variable]
   24 |     int i,now=N,tt=0;
      |                 ^~

Subtask #1
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 256 KB Output is correct
2 Correct 7 ms 256 KB Output is correct
3 Correct 6 ms 256 KB Output is correct
4 Correct 6 ms 288 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 256 KB Output is correct
2 Correct 20 ms 376 KB Output is correct
3 Correct 19 ms 256 KB Output is correct
4 Correct 19 ms 256 KB Output is correct

Subtask #3
0 / 18.0

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

Subtask #4
0 / 10.0

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

Subtask #5
0 / 53.0

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