Submission #1074357

#TimeUsernameProblemLanguageResultExecution timeMemory
1074357noyancanturkKoala Game (APIO17_koala)C++17
4 / 100
7 ms416 KiB
#include "koala.h" #include<bits/stdc++.h> using namespace std; int b[100],r[100]; int minValue(int n, int w) { for(int i=0;i<n;i++){ b[i]=0; } b[0]=1; playRound(b,r); if(r[0]==2){ for(int i=1;i<n;i++){ if(r[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...