oj.uz

Submission #976137

# Submission time Handle Problem Language Result Execution time Memory
976137 2024-05-06T08:14:55 Z siewjh Koala Game (APIO17_koala) C++17
19 / 100
 11 ms 452 KB 
#include "koala.h"
#include <bits/stdc++.h>
using namespace std;

const int MAXN = 105;
int qa[MAXN], ra[MAXN];

int minValue(int N, int W){ // N = 100, W = 100, 2 times
    qa[0] = 1;
    for (int i = 1; i < N; i++) qa[i] = 0;
    playRound(qa, ra);
    if (ra[0] <= 1) return 0;
    for (int i = 1; i < N; i++)
		if (ra[i] == 0)
			return i;
}

int maxValue(int N, int W){ // N = 100, W = 100, 4 times
    vector<int> loc;
    for (int i = 0; i < N; i++) loc.push_back(i);
    while (loc.size() > 1){ // 100, 50, 25, 9, 1
		int amt = W / loc.size();
		for (int i = 0; i < N; i++) qa[i] = 0;
		for (int x : loc) qa[x] = amt;
		playRound(qa, ra);
		vector<int> ori; swap(ori, loc);
		for (int x : ori) 
			if (ra[x] > amt)
				loc.push_back(x);
	}
	return loc[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.
    }
}

Compilation message

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

Subtask #1
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 344 KB Output is correct
2 Correct 4 ms 344 KB Output is correct
3 Correct 4 ms 344 KB Output is correct
4 Correct 4 ms 452 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 452 KB Output is correct
2 Correct 11 ms 344 KB Output is correct
3 Correct 10 ms 344 KB Output is correct
4 Correct 10 ms 452 KB Output is correct

Subtask #3
0 / 18.0

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

Subtask #4
0 / 10.0

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