# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
885620 | 2023-12-10T10:23:34 Z | Pikachu | 코알라 (APIO17_koala) | C++17 | 0 ms | 0 KB |
#include <bits/stdc++.h> #include "koala.h" int minValue(int N, int W) { int B[100], R[100]; B[0] = 1; playRound(B, R); if (R[0] <= 1) return 0; for (int i = 1; i < N; i++) { if (!R[i]) return i; } return 0; } int maxValue(int N, int W) { int B[100], R[100]; bool done[100]; int rem = N; while (rem > 1) { for (int i = 0; i < N; i++) { if (!done[i]) B[i] = min(W / rem, 13); else B[i] = 0; } playRound(B, R); for (int i = 0; i < N; i++) { if (!done[i] && R[i] <= B[i]) { done[i] = true; rem--; } } } for (int i = 0; i < N; i++) { if (!done[i]) return i; } 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. } }