# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
1029225 |
2024-07-20T14:00:03 Z |
_8_8_ |
Koala Game (APIO17_koala) |
C++17 |
|
9 ms |
344 KB |
#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
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 time |
Memory |
Grader output |
1 |
Correct |
4 ms |
344 KB |
Output is correct |
2 |
Correct |
3 ms |
344 KB |
Output is correct |
3 |
Correct |
3 ms |
344 KB |
Output is correct |
4 |
Correct |
3 ms |
344 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
9 ms |
344 KB |
Output is correct |
2 |
Correct |
8 ms |
344 KB |
Output is correct |
3 |
Correct |
8 ms |
344 KB |
Output is correct |
4 |
Correct |
8 ms |
344 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
344 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
344 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
344 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |