제출 #1279266

#제출 시각아이디문제언어결과실행 시간메모리
1279266sheercold코알라 (APIO17_koala)C++20
4 / 100
3 ms336 KiB
#include "koala.h"

#include <bits/stdc++.h>

using namespace std;

int minValue(int N, int W) {
  assert(N == W);
  int input[100];
  int output[100];
  fill(input, input + 100, 0);
  input[0] = 1;
  playRound(input, output);
  for (int i = 0; i < 100; i++) {
    if (output[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...