Submission #1029225

#TimeUsernameProblemLanguageResultExecution timeMemory
1029225_8_8_Koala Game (APIO17_koala)C++17
19 / 100
9 ms344 KiB
#include "koala.h" #include <bits/stdc++.h> using namespace std; int minValue(int N, int W) { int a[N],b[N]; for(int i = 0;i < N;i++){ a[i] = b[i] = 0; } a[0]=1; playRound(a,b); if(b[0] <= 1) return 0; for(int i = 0;i < N;i++){ if(!b[i]) return i; } } int maxValue(int N, int W) { vector<int> a(N); iota(a.begin(),a.end(),0); int b[N],c[N]; while((int)a.size() != 1){ int L = N / ((int)a.size()); memset(b,0,sizeof(b)); for(int k:a){ b[k]=L; } vector<int> bf; playRound(b,c); for(int k:a){ if(c[k] > L){ bf.push_back(k); } } a=bf; } return a[0]; } int greaterValue(int N, int W) { return 0; } void allValues(int N, int W, int *P) { if (W == 2*N) { } else { } }

Compilation message (stderr)

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