제출 #1179384

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1179384		MarwenElarbi	코알라 (APIO17_koala)	C++17	4 / 100	2 ms	408 KiB

koala

#include "koala.h"
#include <bits/stdc++.h>
#include <stdio.h>
#include <stdlib.h>
using namespace std;

int minValue(int N, int W) {
    int n=N;
    int tab[N];
    int ans[N];
    memset(tab,0,sizeof tab);
    tab[0]=1;
    playRound(tab,ans);
    int res=-1;
    for (int i = 0; i < n; ++i)
    {
        if(ans[i]==0) res=i;
    }
    if(res!=-1) return res;
    tab[0]=0;
    tab[1]=1;
    playRound(tab,ans);
    for (int i = 0; i < n; ++i)
    {
        if(ans[i]==0) res=i;
    }
    return res;
}

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.
    }
}

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