# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
391597 | 2021-04-19T12:19:28 Z | BorisBarca | 코알라 (APIO17_koala) | C++14 | 0 ms | 0 KB |
#include <koala.h> #include <bits/stdc++.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. for (int i = 0; i < N; ++i) B[i] = 0; B[0] = 1; playRound(B, R); if (R[0] == 0) return 1; for (int i = 0; i < N; ++i) if (R[i] == 0) return i + 1; 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. } }