Submission #1208962

#TimeUsernameProblemLanguageResultExecution timeMemory
1208962jasonicKoala Game (APIO17_koala)C++20
4 / 100
2 ms412 KiB
#include "koala.h" #include <bits/stdc++.h> using namespace std; int toSend[100]; int response[100]; int minValue(int n, int w) { toSend[0] = 1; playRound(toSend, response); for(int i = 1; i < n; i++) { if(response[i] == 0) 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...