제출 #1336644

#제출 시각아이디문제언어결과실행 시간메모리
1336644mayac코알라 (APIO17_koala)C++20
0 / 100
0 ms344 KiB
#include <iostream>
#include "koala.h"
using namespace std;


int minValue(int N, int W) {
    int B[100],R[100];
    B[0]==98;
    int x,y;
    playRound(B,R);
    if(R[1]==0){
        B[0]=0;
        B[2]=98;
        playRound(B,R);
        if(R[1]==0)return 1;
        return 0;
    }
    B[0]=0;B[1]=98;
    playRound(B,R);
    for(int i=2;i<N;i++){
        if(R[i]==0)return i;
    }
    return 0;
}

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) {
    // 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.
    }
}
#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...