# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
988054 |
2024-05-24T01:21:37 Z |
CSQ31 |
Koala Game (APIO17_koala) |
C++17 |
|
11 ms |
456 KB |
#include "koala.h"
#include <bits/stdc++.h>
using namespace std;
#define sz(a) (int)(a.size())
int b[100],r[100];
void clearb(){
for(int i=0;i<100;i++)b[i] = 0;
}
void playround(int *b,int *r){
playRound(b,r);
clearb();
}
int minValue(int N, int W) {
b[0] = 1;
playround(b,r);
for(int i=0;i<N;i++){
if(r[i] <= b[i])return i;
}
}
int maxValue(int N, int W) {
vector<int>v;
for(int i=0;i<N;i++)v.push_back(i);
while(sz(v)>1){
int k = 100/sz(v);
for(int x:v)b[x] = k;
playround(b,r);
vector<int>u;
for(int x:v){
if(r[x] > b[x])u.push_back(x);
}
v = u;
}
return v[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.
}
}
Compilation message
koala.cpp: In function 'int minValue(int, int)':
koala.cpp:19:1: warning: control reaches end of non-void function [-Wreturn-type]
19 | }
| ^
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
4 ms |
344 KB |
Output is correct |
2 |
Correct |
4 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 |
11 ms |
344 KB |
Output is correct |
2 |
Correct |
11 ms |
344 KB |
Output is correct |
3 |
Correct |
11 ms |
456 KB |
Output is correct |
4 |
Correct |
10 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 |
1 ms |
344 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
1 ms |
344 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |