Submission #106749

#TimeUsernameProblemLanguageResultExecution timeMemory
106749kimjg1119Koala Game (APIO17_koala)C++17
19 / 100
19 ms504 KiB
#include "koala.h" #include <bits/stdc++.h> using namespace std; int minValue(int N, int W) { int b[100]={},r[100]; b[0]=1; playRound(b,r); if(r[0]==2){ for(int i=0;i<100;i++) if(r[i]==0) return i; } else{ return 0; } return 0; } int maxValue(int N, int W) { vector<int> k; for(int i=0;i<100;i++) k.push_back(i); int b[100], r[100]; while(k.size()>1){ memset(b,0,sizeof(b)); int sz=k.size(), t=100/sz; for(int e : k) b[e]=t; playRound(b,r); vector<int> k2; for(int i=0;i<100;i++) if(r[i]>t) k2.push_back(i); k=k2; } return k[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 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...