# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
339231 | 2020-12-24T23:19:11 Z | ogibogi2004 | Koala Game (APIO17_koala) | C++14 | 0 ms | 0 KB |
#include "koala.h" #include<bits/stdc++.h> using namespace std; int minValue(int N, int W) { int b[100],r[100]; int cnt[100]; memset(cnt,0,sizeof(cnt)); b[0]=98; for(int i=1;i<N;i++) { b[i]=0; } playRound(&b,&r); int j; for(int i=0;i<N;i++) { if(r[i]>0){cnt[i]++,j=i;} } b[j]=98; for(int i=0;i<N;i++) { if(i==j)continue; b[i]=0; } playRound(&b,&r); for(int i=0;i<N;i++) { if(r[i]>0){cnt[i]++;} } for(int i=0;i<N;i++) { if(cnt[i]==0)return i; } // TODO: Implement Subtask 1 solution here. // You may leave this function unmodified if you are not attempting this // subtask. } 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. } }