oj.uz

답안 #118999

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
118999 2019-06-20T07:12:48 Z Mahdi_Jfri 코알라 (APIO17_koala) C++14
67 / 100
 48 ms 508 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] , ind[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;
}

bool cmp(int p1 , int p2)
{
	int l = 1 , rx = 14;
	while(1)
	{
		memset(b , 0 , sizeof b);

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

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

int greaterValue(int n, int w)
{
	return cmp(0 , 1);
}

int tmp[maxn];
void merge_sort(int l , int r)
{
	if(r - l < 2)
		return;

	int m = (l + r) / 2;
	merge_sort(l , m);
	merge_sort(m , r);

	int pt1 = l , pt2 = m , sz = 0;
	while(pt1 < m && pt2 < r)
	{
		if(cmp(ind[pt1] , ind[pt2]))
			tmp[sz++] = ind[pt1++];
		else
			tmp[sz++] = ind[pt2++];
	}

	while(pt1 < m)
		tmp[sz++] = ind[pt1++];
	while(pt2 < r)
		tmp[sz++] = ind[pt2++];

	for(int i = l; i < r; i++)
		ind[i] = tmp[i - l];
}

void allValues(int n, int w, int *p)
{
	if (w == 2*n)
	{
	}
	else
	{
		for(int i = 0; i < n; i++)
			ind[i] = i;
		merge_sort(0 , n);
		for(int i = 0; i < n; i++)
			p[ind[i]] = i + 1;
	}
}

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]
 }
 ^

Subtask #1
4.0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 384 KB Output is correct
2 Correct 6 ms 384 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 5 ms 384 KB Output is correct

Subtask #2
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 14 ms 384 KB Output is correct
2 Correct 13 ms 384 KB Output is correct
3 Correct 14 ms 384 KB Output is correct
4 Correct 13 ms 384 KB Output is correct

Subtask #3
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 44 ms 428 KB Output is correct
2 Correct 48 ms 396 KB Output is correct
3 Correct 43 ms 416 KB Output is correct
4 Correct 44 ms 384 KB Output is correct
5 Correct 43 ms 384 KB Output is correct
6 Correct 43 ms 384 KB Output is correct
7 Correct 42 ms 384 KB Output is correct
8 Correct 43 ms 384 KB Output is correct
9 Correct 43 ms 384 KB Output is correct
10 Correct 44 ms 384 KB Output is correct

Subtask #4
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 2 ms 256 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
30.0 / 53.0

# 결과 실행 시간 메모리 Grader output
1 Partially correct 12 ms 384 KB Output is partially correct
2 Partially correct 20 ms 384 KB Output is partially correct
3 Partially correct 20 ms 384 KB Output is partially correct
4 Partially correct 19 ms 504 KB Output is partially correct
5 Partially correct 20 ms 384 KB Output is partially correct
6 Partially correct 19 ms 384 KB Output is partially correct
7 Partially correct 18 ms 384 KB Output is partially correct
8 Partially correct 19 ms 384 KB Output is partially correct
9 Partially correct 20 ms 384 KB Output is partially correct
10 Partially correct 18 ms 384 KB Output is partially correct
11 Partially correct 19 ms 384 KB Output is partially correct
12 Partially correct 13 ms 384 KB Output is partially correct
13 Partially correct 20 ms 384 KB Output is partially correct
14 Partially correct 19 ms 384 KB Output is partially correct
15 Partially correct 19 ms 384 KB Output is partially correct
16 Partially correct 19 ms 384 KB Output is partially correct
17 Partially correct 19 ms 384 KB Output is partially correct
18 Partially correct 20 ms 384 KB Output is partially correct
19 Partially correct 20 ms 384 KB Output is partially correct
20 Partially correct 19 ms 508 KB Output is partially correct
21 Partially correct 20 ms 384 KB Output is partially correct
22 Partially correct 19 ms 376 KB Output is partially correct
23 Partially correct 18 ms 384 KB Output is partially correct
24 Partially correct 19 ms 384 KB Output is partially correct
25 Partially correct 19 ms 376 KB Output is partially correct
26 Partially correct 18 ms 384 KB Output is partially correct
27 Partially correct 19 ms 376 KB Output is partially correct
28 Partially correct 19 ms 384 KB Output is partially correct
29 Partially correct 19 ms 384 KB Output is partially correct
30 Partially correct 19 ms 384 KB Output is partially correct
31 Partially correct 19 ms 384 KB Output is partially correct
32 Partially correct 19 ms 256 KB Output is partially correct
33 Partially correct 20 ms 384 KB Output is partially correct
34 Partially correct 18 ms 384 KB Output is partially correct
35 Partially correct 19 ms 376 KB Output is partially correct
36 Partially correct 18 ms 384 KB Output is partially correct
37 Partially correct 18 ms 384 KB Output is partially correct
38 Partially correct 18 ms 376 KB Output is partially correct
39 Partially correct 17 ms 384 KB Output is partially correct
40 Partially correct 18 ms 384 KB Output is partially correct