Submission #262538

#TimeUsernameProblemLanguageResultExecution timeMemory
262538daniel920712Koala Game (APIO17_koala)C++14
19 / 100
21 ms376 KiB
#include "koala.h" #include <stdio.h> int B[105]={0},R[105]={0}; 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 i; B[0]=1; playRound(B,R); for(i=0;i<N;i++) { if(R[i]!=B[i]+1) 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 i,now=100,tt=0; for(i=0;i<N;i++) R[i]=2; while(1) { for(i=0;i<N;i++) { if(R[i]>1) B[i]=W/now; else B[i]=0; } //for(i=0;i<N;i++) printf("%d ",B[i]); //printf("\n"); playRound(B,R); //for(i=0;i<N;i++) printf("%d ",R[i]); //printf("\n"); now=0; for(i=0;i<N;i++) if(R[i]>1) now++; if(now==1) for(i=0;i<N;i++) if(R[i]>1) return i; } } 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. B[0]=1; B[1]=1; 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 (stderr)

koala.cpp: In function 'int maxValue(int, int)':
koala.cpp:23:19: warning: unused variable 'tt' [-Wunused-variable]
   23 |     int i,now=100,tt=0;
      |                   ^~
#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...