# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
981262 |
2024-05-13T03:16:56 Z |
pcc |
Koala Game (APIO17_koala) |
C++17 |
|
2 ms |
344 KB |
#include "koala.h"
#include <bits/stdc++.h>
const int mxn = 110;
int ask[mxn],res[mxn];
namespace S1{
int GO(int N,int W){
memset(ask,0,sizeof(ask));
ask[0] = 1;
playRound(ask,res);
if(res[0] == 2){
for(int i = 1;i<N;i++)if(!res[i])return i;
assert(false);
}
else return 1;
memset(ask,0,sizeof(ask));
ask[1] = 1;
playRound(ask,res);
for(int i = 2;i<N;i++)if(!res[i])return i;
assert(false);
return -1;
}
}
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.
return S1::GO(N,W);
}
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.
return 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.
}
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
2 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 |
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 |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
344 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |