# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1169808 | 8pete8 | Koala Game (APIO17_koala) | C++20 | 8 ms | 432 KiB |
#include "koala.h"
#include<iostream>
using namespace std;
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.
int B[N],R[N];
for(int i=0;i<N;i++)B[i]=R[i]=0;
B[0]=1;
playRound(B,R);
for(int i=0;i<N;i++)if(R[i]==0)return i;
return 0;
}
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.
int B[N],R[N];
for(int i=0;i<N;i++)B[i]=1,R[i]=0;
int c=2;
for(int j=0;j<10;j++){
/*
for(int j=0;j<N;j++)cout<<B[j]<<" ";
cout<<'\n';*/
playRound(B,R);
int x=0,y=0;
for(int j=0;j<N;j++){
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |