oj.uz

Submission #175845

# Submission time Handle Problem Language Result Execution time Memory
175845 2020-01-07T11:30:39 Z Saboon Koala Game (APIO17_koala) C++14
37 / 100
 56 ms 760 KB 
#include "koala.h"
#include <bits/stdc++.h>
using namespace std;

int B[100], R[100];
bool mark[100];

int minValue(int N, int W){
    for (int i = 0; i < N; i++)
		B[i] = 0;
	B[0] = 1;
	playRound(B, R);
	for (int i = 0; i < N; i++)
		if (R[i] == 0)
			return i;
	return 0;
}

int maxValue(int N, int W) {
    int k = N;
	for (int i = 0; i < N; i++)
		mark[i] = 0;
	while (k > 1){
		int cost = min(13, W / k);
		for (int i = 0; i < N; i++){
			if (!mark[i])
				B[i] = cost;
			else
				B[i] = 0;
		}
		playRound(B, R);
		for (int i = 0; i < N; i++)
			if (!mark[i] and R[i] <= B[i])
				mark[i] = 1;
		k = 0;
		for (int i = 0; i < N; i++)
			if (mark[i] == 0)
				k ++;
	}
	for (int i = 0; i < N; i++)
		if (!mark[i])
			return i;
	return 0;
}

int v = 0, u = 1;

int greaterValue(int N, int W){
	int lo = 0, hi = 14;
	while (hi - lo > 1){
		int mid = (lo + hi) >> 1;
		for (int i = 0; i < N; i++)
			B[i] = 0;
		B[v] = B[u] = mid;
		playRound(B, R);
		bool fi = (R[v] > B[v]);
		bool se = (R[u] > B[u]);
		if (fi == se){
			if (fi == 1)
				lo = mid;
			else
				hi = mid;
		}
		else
			return se;
	}
	return 0;
}

bool cmp(int fi, int se){
	if (fi == se)
		return false;
	v = fi, u = se;
	return greaterValue(100, 200);
}

int T[100];

void allValues(int N, int W, int *P) {
    if (W == 2*N) {
    	for (int i = 0; i < N; i++)
			T[i] = i;
		sort(T, T + N, cmp);
		for (int i = 0; i < N; i++)
			P[T[i]] = i + 1;
	}
	else {
        // TODO: Implement Subtask 5 solution here.
        // You may leave this block unmodified if you are not attempting this
        // subtask.
    }
}

Subtask #1
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 504 KB Output is correct
2 Correct 6 ms 376 KB Output is correct
3 Correct 6 ms 508 KB Output is correct
4 Correct 6 ms 376 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 376 KB Output is correct
2 Correct 16 ms 376 KB Output is correct
3 Correct 16 ms 376 KB Output is correct
4 Correct 16 ms 504 KB Output is correct

Subtask #3
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 50 ms 376 KB Output is correct
2 Correct 56 ms 632 KB Output is correct
3 Correct 50 ms 632 KB Output is correct
4 Correct 50 ms 760 KB Output is correct
5 Correct 51 ms 760 KB Output is correct
6 Correct 51 ms 760 KB Output is correct
7 Correct 50 ms 632 KB Output is correct
8 Correct 50 ms 760 KB Output is correct
9 Correct 51 ms 760 KB Output is correct
10 Correct 51 ms 724 KB Output is correct

Subtask #4
0 / 10.0

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