# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
111423 | 2019-05-15T10:43:48 Z | Segtree | Koala Game (APIO17_koala) | C++14 | 0 ms | 0 KB |
#include<iostream> #include<algorithm> #include"koala.h" using namespace std; typedef long long ll; int B[110],R[110]; int minValue(int N,int W){ for(int i=1;i<N;i++){B[i]=0;} B[0]=1; playRound(B,R); for(int i=0;i<N;i++){ if(R[i]==0)return i; } return -1; } int maxValue(int N,int W){ return -1; } int greaterValue(int N,int W){ return -1; } void allValues(int N,int W,int P){ } /* int main(){ return 0; }*/