# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
977926 | 2024-05-08T14:02:22 Z | thelegendary08 | 코알라 (APIO17_koala) | C++14 | 0 ms | 0 KB |
#include "koala.h" 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 round[N]; round[0] = 1; for(int i = 1;i<N;i++)round[i] = 0; int ret[N]; playRound(round, ret); bool isfirst = 1; int zero = 0; for(int i = 0;i<N;i++){ if(ret[i] == 2){ isfirst = 0; } if(ret[i] == 0)zero = i; } if(isfirst)return 0; else return zero; } int maxValue(int N, int W) { int poss = N; vector<bool>can(N, true); while(poss > 1){ int num = W/poss; int quer[N]; for(int i = 0;i<N;i++){ if(can[i])quer[i] = num; else quer[i] = 0; } int ret[N]; playRound(quer, ret); for(int i = 0;i<N;i++){ if(ret[i] == 0 && can[i])can[i] = 0; } poss = 0; for(int i = 0;i<N;i++){ if(can[i])poss++; } } int ans = 0; for(int i = 0;i<N;i++){ if(can[i])ans = i; } return ans; } 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. } }