# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
53058 | 2018-06-28T00:02:21 Z | arthur_nascimento | Koala Game (APIO17_koala) | C++14 | 0 ms | 0 KB |
#include "koala.h" int minValue(int N, int W) { int v[N]; v[0] = 1; for(int i=1;i<N;i++) v[i] = 0; int ans[N]; playRound(v,ans); for(int i=0;i<N;i++) if(ans[i] == 0) return i; return 0; } int maxValue(int N, int W) { int maxValue(int N, int W) { int v[N]; int ans[N]; int tot[N]; for(int i=0;i<N;i++) v[i] = 1, tot[i] = 0; playRound(v,ans); for(int i=0;i<N;i++){ tot[i] += (ans[i] > v[i]); v[i] = (ans[i]?2:0); } playRound(v,ans); int u = 0; for(int i=0;i<N;i++){ tot[i] += (ans[i] > v[i]); if(tot[i] == 2) v[i] = 4, u++; else v[i] = 0; } playRound(v,ans); for(int i=0;i<N;i++){ tot[i] += (ans[i] > v[i]); if(tot[i] == 3) v[i] = 11; else v[i] = 0; } playRound(v,ans); for(int i=0;i<N;i++) if(tot[i]+(ans[i]>v[i]) == 4) 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. } }