Submission #701184

#TimeUsernameProblemLanguageResultExecution timeMemory
701184Abrar_Al_SamitKoala Game (APIO17_koala)C++17
19 / 100
14 ms356 KiB
#include "koala.h" #include<bits/stdc++.h> using namespace std; int minValue(int N, int W) { int B[N], R[N]; for(int i=0; i<N; ++i) { B[i] = R[i] = 0; } B[0] = 1; playRound(B, R); if(R[0]<=1) { return 0; } for(int i=1; i<N; ++i) { if(R[i]==0) return i; } } int maxValue(int N, int W) { int B[N] = {0}, R[N] = {0}; set<int>s; for(int i=0; i<N; ++i) { s.insert(i); } while(s.size()>1) { int val = W / s.size(); memset(B, 0, sizeof B); memset(R, 0, sizeof R); for(int x : s) { B[x] = val; } playRound(B, R); set<int>new_s; for(int i=0; i<N; ++i) if(R[i]>B[i]) { if(s.count(i)) new_s.insert(i); } s = new_s; } return *s.begin(); } 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. } }

Compilation message (stderr)

koala.cpp: In function 'int minValue(int, int)':
koala.cpp:20:1: warning: control reaches end of non-void function [-Wreturn-type]
   20 | }
      | ^
#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...