# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
68635 | 2018-08-17T18:06:37 Z | KLPP | Koala Game (APIO17_koala) | C++14 | 23 ms | 684 KB |
#include "koala.h" #include<vector> #include<iostream> using namespace std; int minValue(int N, int W) { int arr[N]; for(int i=0;i<N;i++)arr[i]=0; arr[0]=1; int R[N]; playRound(arr,R); if(R[0]<2){ return 0; }else{ for(int i=0;i<N;i++){ if(R[i]==0)return i; } } return 0; } int maxValue(int N, int W) { vector<int> v; for(int i=0;i<N;i++)v.push_back(i); while(v.size()>1){ int d=N/v.size(); d=min(d,13); int arr[N]; for(int i=0;i<N;i++){ arr[i]=0; } for(int i=0;i<v.size();i++){ arr[v[i]]=d; }/*for(int i=0;i<N;i++)cout<<arr[i]<<" "; cout<<endl;*/ int sol[N]; playRound(arr,sol); vector<int> V; for(int i=0;i<N;i++){ if(sol[i]>d)V.push_back(i); } v=V; } return v[0]; } int greaterValue(int N, int W) { int lo,hi; lo=0; hi=7; while(hi-lo>1){ int n=N; int mid=(hi+lo)/2; int arr[n]; for(int i=0;i<n;i++)arr[i]=0; arr[0]=mid; arr[1]=mid; int b[n]; playRound(arr,b); /*for(int i=0;i<n;i++)cout<<b[i]<<" "; cout<<endl;*/ int cnt=0; for(int i=2;i<n;i++){ if(b[i]==0)cnt++; } if(b[0]>b[1] && cnt>0)return 1; if(b[1]>b[0] && cnt>0)return 0; if(b[0]>b[1] && cnt==0)return 0; if(b[1]>b[0] && cnt==0)return 1; if(b[0]==0)hi=mid; else lo=mid; } return 0; } void allValues(int N, int W, int *P) { if (W == 2*N) { int n=N; int arr[n]; for(int i=0;i<n;i++)arr[i]=-1; for(int i=0;i<14;i++){ int b[n]; int r[n]; for(int j=0;j<n;j++){ if(arr[j]==-1)b[i]=0; else b[i]=arr[i]; } } } else { // TODO: Implement Subtask 5 solution here. // You may leave this block unmodified if you are not attempting this // subtask. } }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 7 ms | 248 KB | Output is correct |
2 | Correct | 10 ms | 356 KB | Output is correct |
3 | Correct | 10 ms | 448 KB | Output is correct |
4 | Correct | 7 ms | 668 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 17 ms | 668 KB | Output is correct |
2 | Correct | 23 ms | 668 KB | Output is correct |
3 | Correct | 18 ms | 680 KB | Output is correct |
4 | Correct | 19 ms | 684 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 3 ms | 684 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 3 ms | 684 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 3 ms | 684 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |