Submission #1359148

#TimeUsernameProblemLanguageResultExecution timeMemory
1359148cansu_mutluKoala Game (APIO17_koala)C++20
22 / 100
21 ms472 KiB
#include "koala.h"
#include<bits/stdc++.h>
using namespace std;
int minValue(int n, int W) {
    int cur = 0;
    int b[n],r[n];
    for(int i=1;i<n;i++) b[i]=0;
    b[0] = 1;
    playRound(b,r);
    for(int i=1;i<n;i++)
    {
        if(r[i]==0)cur = i;
    }
    return cur;
}

int maxValue(int N, int W) {
    // TODO: Implement Subtask 2 solution here.
    // You may leave this function unmodified if you are not attempting this
    // subtask.
    return 0;
}

int greaterValue(int n, int W) {
    int cur = 0;
    int b[n],r[n];
    for(int i=0;i<n;i++) b[i] = 0;
    int l = 1,ri = 14;
    while(l<=ri)
    {
        int mid = (l+ri)/2;
        b[0] = b[1] = mid;
        playRound(b,r);
        if((r[0]>mid && r[1]>mid))
        {
            l = mid+1;
        }
        else 
        {
            ri = mid-1;
            if(max(r[0],r[1])>mid && min(r[0],r[1])<=mid)
            {
                cur = r[1]>r[0];
                break;
            }
        }
    }
    return cur;
}

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.
    }
}
#Result Execution timeMemoryGrader output
Fetching results...
#Result Execution timeMemoryGrader output
Fetching results...
#Result Execution timeMemoryGrader output
Fetching results...
#Result Execution timeMemoryGrader output
Fetching results...
#Result Execution timeMemoryGrader output
Fetching results...