Submission #895577

#TimeUsernameProblemLanguageResultExecution timeMemory
895577Tenis0206Koala Game (APIO17_koala)C++11
4 / 100
3 ms344 KiB
#include <bits/stdc++.h> #include "koala.h" using namespace std; const int nmax = 100; int n; int b[nmax + 5], r[nmax + 5]; int minValue(int N, int W) { n = N; for(int i=0; i<n; i++) { b[i] = 0; r[i] = 0; } b[0] = 1; playRound(b,r); for(int i=0;i<n;i++) { if(r[i] <= b[i]) { return i; } } return 0; } int maxValue(int N, int W) { // TODO: Implement Subtask 2 solution here. // You may leave this function unmodified if you are not attempting this // subtask. return 0; } 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. 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. } }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...