# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
409233 | 2021-05-20T11:46:38 Z | leinad2 | Koala Game (APIO17_koala) | C++17 | 0 ms | 0 KB |
#include<bits/stdc++.h> using namespace std; int minValue(int N, int W) { int B[110]={}, R[110]={}; B[0]=1; playRound(B, R); for(int i=0;i<N;i++)if(R[i]<=B[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. } }