oj.uz

Submission #118977

# Submission time Handle Problem Language Result Execution time Memory
118977 2019-06-20T06:51:55 Z Mahdi_Jfri Koala Game (APIO17_koala) C++14
19 / 100
 44 ms 424 KB 
#include "koala.h"
#include<bits/stdc++.h>

using namespace std;

#define ll long long
#define pb push_back

const int maxn = 1e2 + 20;

int b[maxn] , r[maxn];
bool can[maxn];

int minValue(int n, int w)
{
	memset(b , 0 , sizeof b);
	b[0] = 1;

	playRound(b , r);
	if(r[0] != 2)
		return 0;

	for(int i = 1; i < n - 1; i++)
		if(!r[i])
			return i;
}

int maxValue(int n, int w)
{
	for(int i = 0; i < n; i++)
		can[i] = 1;

	int rem = n;
	while(rem > 1)
	{
		for(int i = 0; i < n; i++)
		{
			if(can[i])
				b[i] = w / rem;
			else
				b[i] = 0;
		}
		playRound(b , r);

		for(int i = 0; i < n; i++)
			if(can[i] && r[i] <= b[i])
				can[i] = 0 , rem--;
	}

	for(int i = 0; i < n; i++)
		if(can[i])
			return i;
}

int greaterValue(int n, int w)
{
	// p[0] < p[1]?

	int l = 1 , rx = 14;
	while(rx - l > 1)
	{
		memset(b , 0 , sizeof b);

		int m = (l + rx) / 2;
		b[0] = b[1] = m;
		playRound(b , r);

		if(b[0] < r[0] && b[1] < r[1])
		{
			l = m;
			continue;
		}
		if(b[0] < r[0] && b[1] >= r[1])
			return 0;
		if(b[0] >= r[0] && b[1] < r[1])
			return 1;
		rx = m;
	}
}

void allValues(int N, int W, int *P)
{
	if (W == 2*N)
	{
	}
	else
	{
	}
}

Compilation message

koala.cpp: In function 'int minValue(int, int)':
koala.cpp:26:1: warning: control reaches end of non-void function [-Wreturn-type]
 }
 ^
koala.cpp: In function 'int maxValue(int, int)':
koala.cpp:53:1: warning: control reaches end of non-void function [-Wreturn-type]
 }
 ^
koala.cpp: In function 'int greaterValue(int, int)':
koala.cpp:79: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 6 ms 384 KB Output is correct
2 Correct 6 ms 384 KB Output is correct
3 Correct 6 ms 384 KB Output is correct
4 Correct 5 ms 384 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 384 KB Output is correct
2 Correct 14 ms 384 KB Output is correct
3 Correct 13 ms 384 KB Output is correct
4 Correct 17 ms 384 KB Output is correct

Subtask #3
0 / 18.0

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

Subtask #4
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 304 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 384 KB Output isn't correct
2 Halted 0 ms 0 KB -