Submission #403348

#	Time	Username	Problem	Language	Result	Execution time	Memory
403348		wiwiho	Koala Game (APIO17_koala)	C++14	4 / 100	6 ms	312 KiB

koala

#include "koala.h"

#include <bits/stdc++.h>

#define mp make_pair
#define F first
#define S second
#define printv(a, b) { \
    for(auto pv : a) b << pv << " "; \
    b << "\n"; \
}

using namespace std;

typedef long long ll;

using pii = pair<int, int>;

const ll MAX = 1LL << 60;

int minValue(int n, int w){

    int b[100] = {0}, r[100] = {0};
    b[0] = 1;
    playRound(b, r);
    /*for(int i = 0; i < n; i++) cerr << b[i] << " ";
    cerr << "\n";
    for(int i = 0; i < n; i++) cerr << r[i] << " ";
    cerr << "\n";*/

    for(int i = 0; i < n; i++){
        if(r[i] <= b[i]) return i;
    }

}

int maxValue(int n, int w){
    
    int b[100] = {0}, r[100] = {0};
    fill(b, b + n, 1);

    playRound(b, r);

    fill(b, b + n, 0);
    for(int i = 0; i < n; i++){
        if(r[i] > 1) b[i] = 2;
    }
    playRound(b, r);

    fill(b, b + n, 0);
    for(int i = 0; i < n; i++){
        if(r[i] > 2) b[i] = 4;
    }
    playRound(b, r);

    fill(b, b + n, 0);
    for(int i = 0; i < n; i++){
        if(r[i] > 4) b[i] = 11;
    }
    playRound(b, r);

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

Compilation message (stderr)

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

• Subtask 1: 4 / 4
• Subtask 2: 0 / 15
• Subtask 3: 0 / 18
• Subtask 4: 0 / 10
• Subtask 5: 0 / 53