# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
1054079 | 2024-08-12T06:00:37 Z | ㅇ(#11107) | 코알라 (APIO17_koala) | C++14 | 0 ms | 0 KB |
#include "koala.h" #include <bits/stdc++.h> using namespace std; #ifdef LOCAL #include "debug.h" #else #define debug(...) #endif const int N=105; int B[105],R[105]; int minValue(int n,int w){ B[0]=2; for(int i=1;i<n;i++) B[i]=1; playRound(B,R); for(int i=0;i<n;i++) if(B[i]>=R[i]) return i; } 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. } }