Submission #739540

#TimeUsernameProblemLanguageResultExecution timeMemory
739540Jarif_RahmanKoala Game (APIO17_koala)C++17
4 / 100
4 ms316 KiB
#include "koala.h" #include <bits/stdc++.h> #define pb push_back #define f first #define sc second using namespace std; typedef long long int ll; typedef string str; int B[100], R[100]; int minValue(int n, int w){ B[0] = 1; for(int i = 1; i < n; i++) B[i] = 0; 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){ return 0; } int greaterValue(int n, int w){ return 0; } void allValues(int n, int w, int *P){ return; }
#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...