# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
118962 | 2019-06-20T06:11:47 Z | Mahdi_Jfri | Koala Game (APIO17_koala) | C++14 | 14 ms | 384 KB |
#include "koala.h" #include<bits/stdc++.h> using namespace std; #define ll long long #define pb push_back const int maxn = 1e2 + 20; int b[maxn] , r[maxn]; bool can[maxn]; int minValue(int n, int w) { memset(b , 0 , sizeof b); b[0] = 1; playRound(b , r); if(r[0] != 2) return 0; for(int i = 1; i < n - 1; i++) if(!r[i]) return i; } int maxValue(int n, int w) { for(int i = 0; i < n; i++) can[i] = 1; int rem = n; while(rem > 1) { for(int i = 0; i < n; i++) { if(can[i]) b[i] = w / rem; else b[i] = 0; } playRound(b , r); for(int i = 0; i < n; i++) if(can[i] && r[i] <= b[i]) can[i] = 0 , rem--; } for(int i = 0; i < n; i++) if(can[i]) return i; } int greaterValue(int N, int W) { return 0; } void allValues(int N, int W, int *P) { if (W == 2*N) { } else { } }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 6 ms | 384 KB | Output is correct |
2 | Correct | 5 ms | 384 KB | Output is correct |
3 | Correct | 5 ms | 384 KB | Output is correct |
4 | Correct | 7 ms | 384 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 14 ms | 384 KB | Output is correct |
2 | Correct | 13 ms | 256 KB | Output is correct |
3 | Correct | 13 ms | 384 KB | Output is correct |
4 | Correct | 13 ms | 384 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 2 ms | 256 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 2 ms | 384 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 2 ms | 256 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |