oj.uz

Submission #466672

# Submission time Handle Problem Language Result Execution time Memory
466672 2021-08-20T04:43:07 Z flappybird Koala Game (APIO17_koala) C++14
30 / 100
 113 ms 328 KB 
#include "koala.h"
#include <bits/stdc++.h>
using namespace std;
typedef int ll;

int minValue(int N, int W) {
	int b[100];
	int r[100];
	ll i;
	for (i = 0; i < N; i++) b[i] = 0;
	b[0] = 1;
	playRound(b, r);
	for (i = 0; i < N; i++) {
		if (r[i] == 0) return i;
	}
    return 0;
}

int maxValue(int N, int W) {
	ll b[100];
	ll r[100];
	ll i;
	for (i = 0; i < N; i++) b[i] = 1;
	playRound(b, r);
	ll k = 0;
	while (1) {
		ll cnt = 0;
		ll v = -1;
		for (i = 0; i < N; i++) if (r[i] > k) cnt++, v = i;
		if (cnt == 1) return v;
		for (i = 0; i < N; i++) {
			if (r[i] > k) b[i] = N / cnt;
			else b[i] = 0;
		}
		k = N / cnt;
		playRound(b, r);
	}
    return 0;
}

int greaterValue(int N, int W) {
	ll low, high;
	low = 0, high = N / 2;
	ll i;
	ll b[100], r[100];
	for (i = 0; i < N; i++) b[i] = 0;
	while (low < high) {
		ll mid = (low + high) / 2;
		b[0] = b[1] = mid;
		playRound(b, r);
		if (r[0] > mid && r[1] > mid) low = mid;
		else if (r[0] < mid && r[1] < mid) high = mid;
		else {
			if (r[0] > mid) return 0;
			else return 1;
		}
	}
    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 328 KB Output is correct
4 Correct 5 ms 200 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 200 KB Output is correct
2 Correct 15 ms 308 KB Output is correct
3 Correct 15 ms 308 KB Output is correct
4 Correct 18 ms 304 KB Output is correct

Subtask #3
11.0 / 18.0

# Verdict Execution time Memory Grader output
1 Partially correct 100 ms 308 KB Output is partially correct
2 Partially correct 104 ms 320 KB Output is partially correct
3 Partially correct 113 ms 312 KB Output is partially correct
4 Partially correct 100 ms 308 KB Output is partially correct
5 Partially correct 100 ms 320 KB Output is partially correct
6 Partially correct 99 ms 200 KB Output is partially correct
7 Partially correct 105 ms 296 KB Output is partially correct
8 Partially correct 110 ms 308 KB Output is partially correct
9 Partially correct 101 ms 320 KB Output is partially correct
10 Partially correct 101 ms 312 KB Output is partially correct

Subtask #4
0 / 10.0

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