oj.uz

Submission #118920

# Submission time Handle Problem Language Result Execution time Memory
118920 2019-06-20T04:56:27 Z MAMBA Koala Game (APIO17_koala) C++17
19 / 100
 14 ms 512 KB 
#include "koala.h"
#include <bits/stdc++.h>

using namespace std;

#define rep(i , j , k) for (int i = j; i < (int)k; i++)

typedef long long ll;

int b[100], r[100];

int minValue(int N, int W) {
	rep(i , 0 , 100) b[i] = 1;
	playRound(b , r);

	int id = -1;

	rep(i , 0 , 100)
		if (r[i] == 2)
			id = i;
	
	memset(b, 0 , sizeof(b));
	b[id] = 1;

	playRound(b , r);

	rep(i , 0 , 100)
		if (!r[i]) return i;
}

int maxValue(int N, int W) {
 	bitset<100> bs;
	bs.set();
	rep(i , 0 , 4) {
		int shit = bs.count();
		shit = 100 / shit;
		shit = min(shit , 13);
		memset(b , 0 , sizeof(b));
		rep(i , 0 , 100)
			if (bs[i]) b[i] = shit;
		playRound(b, r);
		rep(i , 0 , 100)
			if (bs[i] && r[i] <= shit)
				bs[i] = false;
	}
    return bs._Find_first();
}

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.
    }
}

Compilation message

koala.cpp: In function 'int minValue(int, int)':
koala.cpp:29:1: warning: control reaches end of non-void function [-Wreturn-type]
 }
 ^

Subtask #1
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 384 KB Output is correct
2 Correct 8 ms 512 KB Output is correct
3 Correct 8 ms 384 KB Output is correct
4 Correct 9 ms 384 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 384 KB Output is correct
2 Correct 13 ms 384 KB Output is correct
3 Correct 14 ms 512 KB Output is correct
4 Correct 13 ms 384 KB Output is correct

Subtask #3
0 / 18.0

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

Subtask #4
0 / 10.0

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