Submission #774403

#	Time	Username	Problem	Language	Result	Execution time	Memory
774403		MohamedFaresNebili	Koala Game (APIO17_koala)	C++14	4 / 100	3 ms	316 KiB

koala

#include <bits/stdc++.h>
#include "koala.h"

            using namespace std;

            int minValue(int N, int W) {
                int B[N], R[N]; B[0] = 1;
                for(int l = 1; l < N; l++) B[l] = 0;
                playRound(B, R);
                for(int l = 1; l < N; l++)
                    if(R[l] == 0) return l;
                B[0] = 0, B[1] = 1;
                playRound(B, R);
                for(int l = 0; l < N; l++)
                    if(R[l] == 0 && l != 1) return l;
                return 0;
            }

            int maxValue(int N, int W) {
                int B[N], R[N];
                for(int l = 0; l < N; l++) B[l] = 1, R[l] = 0;
                playRound(B, R);
                for(int l = 1; l < 4; l++) {
                    for(int i = 0; i < N; i++) {
                        if(R[i] > l) B[i]++;
                        else B[i] = 0;
                    }
                    playRound(B, R);
                }
                for(int l = 0; l < N; l++)
                    if(R[l] == 5) return l;
                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.
                }
            }

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