제출 #400670

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
400670		my99n	코알라 (APIO17_koala)	C++14	4 / 100	6 ms	324 KiB

koala

#include "koala.h"
#include <bits/stdc++.h>
using namespace std;
int b[110], r[110];

int minValue(int N, int W) {
  memset(b, 0, sizeof b);
  memset(r, 0, sizeof r);
  b[0] = 1; playRound(b, r);
  if (r[0] != 2) return 0;
  for (int i = 0; i < N; i++) {
    if (r[i] == 0) return i;
  }
  return -1;
}

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

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