oj.uz

Submission #100463

# Submission time Handle Problem Language Result Execution time Memory
100463 2019-03-11T11:57:21 Z square1001 Koala Game (APIO17_koala) C++14
19 / 100
 109 ms 412 KB 
#include "koala.h"
#include <vector>
using namespace std;

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 B[105], R[105];
	for(int i = 0; i < N; ++i) B[i] = (i == 0 ? 1 : 0);
	playRound(B, R);
	for(int i = 0; i < N; ++i) {
		if(R[i] <= B[i]) return i;
	}
    return -1;
}

int maxValue(int N, int W) {
	// TODO: Implement Subtask 2 solution here.
	// You may leave this function unmodified if you are not attempting this
	// subtask.
	int B[105], R[105], C[105];
	for(int i = 0; i < N; ++i) C[i] = 1;
	while(true) {
		int rem = 0;
		for(int i = 0; i < N; ++i) rem += C[i];
		if(rem == 1) break;
		for(int i = 0; i < N; ++i) {
			B[i] = (C[i] ? W / rem : 0);
		}
		playRound(B, R);
		for(int i = 0; i < N; ++i) {
			if(C[i]) C[i] = (B[i] < R[i] ? 1 : 0);
		}
	}
	for(int i = 0; i < N; ++i) {
		if(C[i]) return i;
	}
	return -1;
}

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.
	int B[105], R[105];
	int T = 0;
	for(int i = 4; i >= 1; i /= 2) {
		int D = min(1 << (T + i), W / 2);
		for(int j = 0; j < N; ++j) {
			B[j] = (j <= 1 ? D : 0);
		}
		playRound(B, R);
		bool f0 = (B[0] < R[0]), f1 = (B[1] < R[1]);
		if(f0 != f1) return f0 ? 0 : 1;
		if(f0) T += i;
	}
    return -1;
}

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 {
        // 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 256 KB Output is correct
2 Correct 5 ms 256 KB Output is correct
3 Correct 6 ms 256 KB Output is correct
4 Correct 5 ms 256 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 22 ms 412 KB Output is correct
3 Correct 23 ms 384 KB Output is correct
4 Correct 22 ms 384 KB Output is correct

Subtask #3
0 / 18.0

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