제출 #106913

#제출 시각아이디문제언어결과실행 시간메모리
106913AngusRitossa코알라 (APIO17_koala)C++14
9 / 100
230 ms968 KiB
#include "koala.h"
#include <bits/stdc++.h>
using namespace std;
int b[500], r[500], n, w;
int minValue(int N, int W) 
{
    n = N, w = W;
    b[0] = 1;
    playRound(b, r);
    for (int i = 0; i < n; i++) if (b[i] >= r[i]) return i;
    return 0;
}

int maxValue(int N, int W) 
{
    n = N, w = W;
    return 0;
}

int greaterValue(int N, int W) 
{
    n = N, w = W;
    // TODO: Find optimal numbers
    for (int i = 1; 1; i++)
    {
        b[0] = b[1] = i;
        playRound(b, r);
        if (b[0] >= r[0] && b[1] < r[1]) return 1;
        if (b[0] < r[0] && b[1] >= r[1]) return 0;
    }
    return 0;
}

void allValues(int N, int W, int *P) {
    n = N, w = W;
    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.
    }
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...