# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
401120 | 2021-05-09T12:07:56 Z | A_D | 코알라 (APIO17_koala) | C++14 | 0 ms | 0 KB |
#include "koala.h" int minValue(int N, int W) { int ans=0; int B[N]; int R[N]; memset(B,0,sizeof(B)); memset(R,0,sizeof(R)); B[0]=1; playRound(B,R); for(int i=1;i<N;i++)if(R[i]==0)ans=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. } }