# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
262555 | 2020-08-13T04:08:39 Z | daniel920712 | Koala Game (APIO17_koala) | C++14 | 163 ms | 3776 KB |
#include "koala.h" #include <stdio.h> #include <vector> using namespace std; int B[105]={0},R[105]={0}; int all[105]; int where[105]; int minValue(int N, int W) { // TODO: Implement Subtask 1 solution here. // You may leave this function unmodified if you are not attempting this // subtask. int i; B[0]=1; playRound(B,R); for(i=0;i<N;i++) { if(R[i]!=B[i]+1) return i; } return 0; } void F(int l,int r,vector < int > tt) { vector < int > a,b; int now=100,i; if(l>r) return ; if(l==r) { where[l]=tt[0]; all[tt[0]]=l; return ; } for(i=0;i<100;i++) B[i]=0; for(auto i:tt) B[i]=(100-r)/(tt.size()); playRound(B,R); for(auto i:tt) { if(R[i]>1) b.push_back(i); else a.push_back(i); } F(l,l+a.size()-1,a); F(l+a.size(),r,b); } int maxValue(int N, int W) { int i,now=100,tt=0; for(i=0;i<N;i++) R[i]=2; while(1) { for(i=0;i<N;i++) { if(R[i]>1) B[i]=W/now; else B[i]=0; } playRound(B,R); now=0; for(i=0;i<N;i++) if(R[i]>1) now++; if(now==1) for(i=0;i<N;i++) if(R[i]>1) return i; } } 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. B[0]=1; B[1]=1; 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 { vector < int > tt; for(int i=0;i<N;i++) tt.push_back(i); F(1,N,tt); for(int i=0;i<N;i++) P[i]=all[i]; } }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 6 ms | 256 KB | Output is correct |
2 | Correct | 6 ms | 256 KB | Output is correct |
3 | Correct | 6 ms | 256 KB | Output is correct |
4 | Correct | 6 ms | 256 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 19 ms | 256 KB | Output is correct |
2 | Correct | 19 ms | 256 KB | Output is correct |
3 | Correct | 21 ms | 384 KB | Output is correct |
4 | Correct | 19 ms | 376 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 0 ms | 256 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 384 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 163 ms | 3776 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |