# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1064794 | 2024-08-18T17:47:13 Z | Hectorungo_18 | Koala Game (APIO17_koala) | C++14 | 0 ms | 0 KB |
#include <bits/stdc++.h> #include "koala.h" using namespace std; // #define int long long // void playRound(vector<int> v, vector<int>& r); int minValue(int n, int w){ vector<int> v(n, 0); v[n-1]=1; // for(int i = 0; i < n-1; i++) v[i]=1; vector<int> r; playRound(v, r); int mn = -1; for(int i = 0; i < n; i++) if(r[i] == 0) mn = i; return mn; } int maxValue(int n, int w){ return 33; } int greaterValue(int n, int w){ 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 { // TODO: Implement Subtask 5 solution here. // You may leave this block unmodified if you are not attempting this // subtask. } }