# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
401178 | 2021-05-09T14:23:02 Z | Hazem | Koala Game (APIO17_koala) | C++14 | 68 ms | 332 KB |
#include <bits/stdc++.h> #include "koala.h" using namespace std; int B[100],R[100]; int minValue(int N, int W) { B[0] = 1; playRound(B,R); if(!R[0])return 0; else for(int i=0;i<N;i++) if(!R[i])return i; } vector<int>vec; int maxValue(int N, int W) { vec.clear(); for(int i=0;i<N;i++) vec.push_back(i); while(vec.size()>1){ for(int i=0;i<N;i++) B[i] = 0; for(auto x:vec) B[x] = W/vec.size(); playRound(B,R); vector<int>vec1; for(int i=0;i<N;i++) if(R[i]>(W/vec.size()))vec1.push_back(i); vec = vec1; } return vec[0]; } int greaterValue(int N, int W) { int l = 0,r = 14; while(l<r){ int mid = (l+r+1)/2; B[0] = B[1] = mid; playRound(B,R); if(R[0]!=R[1]) return R[0]<R[1]; if(R[0])l = mid; else r = mid-1; } int cnt = -1; while(1) cnt++; return cnt; } 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. } }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 6 ms | 200 KB | Output is correct |
2 | Correct | 6 ms | 200 KB | Output is correct |
3 | Correct | 6 ms | 200 KB | Output is correct |
4 | Correct | 6 ms | 200 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 18 ms | 200 KB | Output is correct |
2 | Correct | 18 ms | 316 KB | Output is correct |
3 | Correct | 19 ms | 200 KB | Output is correct |
4 | Correct | 18 ms | 200 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 62 ms | 328 KB | Output is correct |
2 | Correct | 68 ms | 320 KB | Output is correct |
3 | Correct | 59 ms | 328 KB | Output is correct |
4 | Correct | 61 ms | 332 KB | Output is correct |
5 | Correct | 60 ms | 324 KB | Output is correct |
6 | Correct | 60 ms | 320 KB | Output is correct |
7 | Correct | 61 ms | 324 KB | Output is correct |
8 | Correct | 61 ms | 328 KB | Output is correct |
9 | Correct | 60 ms | 332 KB | Output is correct |
10 | Correct | 68 ms | 328 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 200 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 200 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |