제출 #260118

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
260118		kshitij_sodani	코알라 (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) {
    // 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