Submission #73262

#TimeUsernameProblemLanguageResultExecution timeMemory
73262FedericoS코알라 (APIO17_koala)C++14
9 / 100
207 ms3708 KiB
#include "koala.h" #include <iostream> using namespace std; int minValue(int N, int W) { int B[N],R[N]; fill(B,B+N,0); B[0]=1; playRound(B,R); int res=0; for(int i=0;i<N;i++) if(R[i]==0) res=i; return res; } int maxValue(int N, int W) { } int greaterValue(int N, int W) { int B[N],R[N]; fill(B,B+N,0); fill(R,R+N,0); while(R[0]==R[1]){ B[0]++; B[1]++; playRound(B,R); } return R[0]<R[1]; } 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. } }

Compilation message (stderr)

koala.cpp: In function 'int maxValue(int, int)':
koala.cpp:26:1: warning: no return statement in function returning non-void [-Wreturn-type]
 }
 ^
#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...