oj.uz

Submission #406575

# Submission time Handle Problem Language Result Execution time Memory
406575 2021-05-17T18:40:28 Z BERNARB01 Koala Game (APIO17_koala) C++17
4 / 100
 5 ms 200 KB 
#include "koala.h"
#include <bits/stdc++.h>

using namespace std;

const int N = 100;
int r[N], b[N], p[N];

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.
	r[0] = 1;
	playRound(r, b);
	for (int i = 0; i < n; i++) {
		if (r[i] >= b[i]) {
			return i;
		}
	}
	return 0;
}

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.
	return 0;
}

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.
	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 {
		// 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 5 ms 200 KB Output is correct
2 Correct 5 ms 200 KB Output is correct
3 Correct 5 ms 200 KB Output is correct
4 Correct 5 ms 200 KB Output is correct

Subtask #2
0 / 15.0

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

Subtask #3
0 / 18.0

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

Subtask #4
0 / 10.0

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