Submission #377680

# Submission time Handle Problem Language Result Execution time Memory
377680 2021-03-14T18:29:24 Z parsabahrami Koala Game (APIO17_koala) C++17
0 / 100
1 ms 364 KB
#include "koala.h"
#include <bits/stdc++.h>

using namespace std;

int A[200], B[200];

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

int maxValue(int N, int W) {
    vector<int> vec(N);
    iota(vec.begin(), vec.end(), 0);
    while (vec.size() > 1) {
        int x = 100 / (vec.size());
        memset(A, 0, sizeof A);
        for (int id : vec) A[id] = x;
        playRound(A, B);
        vector<int> tmp;
        for (int id : vec) 
            if (A[id] < B[id]) tmp.push_back(id);
        vec = tmp;
    }
    printf("%d\n", vec.back());
    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.
    }
}
# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 364 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 364 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 364 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 364 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 312 KB Output isn't correct
2 Halted 0 ms 0 KB -