제출 #58001

#제출 시각아이디문제언어결과실행 시간메모리
58001awake코알라 (APIO17_koala)C++14
4 / 100
12 ms504 KiB
#include "koala.h" #include <bits/stdc++.h> using namespace std; typedef int ll; ll B[105], R[105]; int minValue(int N, int W) { memset(B, 0, sizeof(B)); memset(R, 0, sizeof(R)); B[0] = 1; playRound(B, R); for (ll i = 0; i < N; i++) { if (R[i] <= B[i]) { return i; } } } 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. } }

컴파일 시 표준 에러 (stderr) 메시지

koala.cpp: In function 'int minValue(int, int)':
koala.cpp:18:1: warning: control reaches end of non-void function [-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...