Submission #260209

#	Time	Username	Problem	Language	Result	Execution time	Memory
260209		kshitij_sodani	Koala Game (APIO17_koala)	C++14	4 / 100	7 ms	384 KiB

koala

#include <bits/stdc++.h>
using namespace std;
typedef int64_t llo;
#define mp make_pair
#define pb push_back
#define a first 
#define b second

#include "koala.h"
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.
    int arr[101];
    for(int i=0;i<n;i++){
        if(i==0){
            arr[i]=1;
        }
        else{
            arr[i]=0;
        }
    }
    int arr2[101];
    playRound(arr,arr2);
    for(int j=1;j<n;j++){
        if(arr2[j]==0){
            return j;
        }
    }
    return 0;




    return 0;
}

int maxValue(int N, int W) {
    int co[101];
    int co2[101];
    vector<int> ac;
    for(int i=0;i<100;i+=10){
        for(int j=0;j<100;j++){
            co[j]=0;
            co2[j]=0;
        }
        for(int j=i;j<i+10;j++){
            co[j]=9;
        }
        playRound(co,co2);
        for(int j=i;j<i+10;j++){
            if(co2[j]>9){
                ac.pb(j);
            }
        }

    }
    if(ac.size()<10){
        while(true){
            continue;
        }
    }

    for(int j=0;j<100;j++){
        co[j]=0;
        co2[j]=0;
    }
    for(auto j:ac){
        co[j]=9;
    }
    playRound(co,co2);
    for(int i=0;i<100;i++){
        if(co2[i]>9){
            return i;
        }
    }

    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