Submission #493318

#TimeUsernameProblemLanguageResultExecution timeMemory
493318jamezzzKoala Game (APIO17_koala)C++17
37 / 100
59 ms448 KiB
#include "koala.h" #include <bits/stdc++.h> using namespace std; #define pf printf #define pb push_back #define sz(x) (int)x.size() int n,b[105],r[105]; void reset(){ memset(b,0,sizeof b); } void play(){ playRound(b,r); #ifdef DEBUG for(int i=0;i<n;++i)pf("%2d ",b[i]);pf("\n"); for(int i=0;i<n;++i)pf("%2d ",r[i]);pf("\n"); #endif } int minValue(int N, int W) { // TODO: Implement Subtask 2 solution here. // You may leave this function unmodified if you are not attempting this // subtask. n=N; reset(); b[0]=1; play(); int ans=0; if(r[0]==2){ for(int i=0;i<n;++i)if(r[i]==0)ans=i; } return ans; } 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. n=N; reset(); for(int i=0;i<n;++i)b[i]=1; play(); reset(); for(int i=0;i<n;++i)if(r[i]==2)b[i]=2; play(); reset(); for(int i=0;i<n;++i)if(r[i]==3)b[i]=4; play(); reset(); for(int i=0;i<n;++i)if(r[i]==5)b[i]=11; play(); for(int i=0;i<n;++i)if(r[i]==12)return i; 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. n=N; int lo=1,hi=11,mid,res; while(lo<=hi){ mid=(lo+hi)/2; reset(); for(int i=0;i<2;++i)b[i]=mid; play(); if(r[0]==0&&r[1]==0)hi=mid-1; else if(r[0]>0&&r[1]>0)lo=mid+1; else if(r[0]>r[1])return 0; else return 1; } return 0; } void allValues(int N, int W, int *P) { n=N; 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 greaterValue(int, int)':
koala.cpp:70:24: warning: unused variable 'res' [-Wunused-variable]
   70 |     int lo=1,hi=11,mid,res;
      |                        ^~~
#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...