Submission #512068

#TimeUsernameProblemLanguageResultExecution timeMemory
512068InternetPerson10코알라 (APIO17_koala)C++17
Compilation error
0 ms0 KiB
#include "koala.h" #include <bits/stdc++.h> using namespace std; int B[100], R[100]; int minValue(int N, int W) { // TODO: Implement Subtask 1 solution here. // You may leave this function unmodified if you are not attempting this // subtask. 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. for(int i = 0; i < 100; i++) { B[i] = 1; } playRound(B, R); for(int i = 0; i < 100; i++) { B[i] = R[i]; } playRound(B, R); for(int i = 0; i < 100; i++) { if(R[i] == 3) B[i] = 4; else B[i] = 0; } playRound(B, R); for(int i = 0; i < 100; i++) { if(R[i] == 5) B[i] = 11; else B[i] = 0; } playRound(B, R); for(int i = 0; i < 100; i++) { if(R[i] == 12) return i; } } int greaterValue(int N, int W, int X = 0, int Y = 1) { // TODO: Implement Subtask 3 solution here. // You may leave this function unmodified if you are not attempting this // subtask. for(int i = 1; i < 15; i++) { B[X] = B[Y] = i; playRound(B, R); if(R[X] > R[Y]) return X; if(R[Y] > R[X]) return Y; } 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. } }

Compilation message (stderr)

koala.cpp: In function 'int maxValue(int, int)':
koala.cpp:47:1: warning: control reaches end of non-void function [-Wreturn-type]
   47 | }
      | ^
/usr/bin/ld: /tmp/cceZJo9b.o: in function `runGame(int)':
grader.cpp:(.text+0x207): undefined reference to `greaterValue(int, int)'
collect2: error: ld returned 1 exit status