Submission #1180062

#	Time	Username	Problem	Language	Result	Execution time	Memory
1180062		wood	Koala Game (APIO17_koala)	C++20	19 / 100	8 ms	432 KiB

koala

#include "koala.h"
#include <bits/stdc++.h>
using namespace std;

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

int maxValue(int N, int W) {
    vector<int> v;
    int n = N;
    for(int i = 0; i<n; i++) v.push_back(i);
    int b[n],r[n]; memset(b,0,sizeof b); memset(r,0,sizeof r);
    while(v.size()>1){
        int cur = N/v.size();
        for(int x : v){
            b[x] = cur;
        }
        playRound(b,r);
        v.clear();
        memset(b,0,sizeof b);
        for(int i = 0; i<n; i++){
            if(r[i]==cur+1){
                v.push_back(i);
            }
        }
    }
    return v[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 / 4
• Subtask 2: 15 / 15
• Subtask 3: 0 / 18
• Subtask 4: 0 / 10
• Subtask 5: 0 / 53