# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
200354 | 2020-02-06T11:47:01 Z | Nordway | 코알라 (APIO17_koala) | C++14 | 0 ms | 0 KB |
#include "koala.h" #include<bits/stdc++.h> using namespace std; int b[111],R[111]; int minValue(int N, int W) { b[0]=1; playRound(b,R); int w=0; for(int i=0;i<N;i++){ if(R[i]==0)return i; } return 0; } int maxValue(int N, int W) { return 0; } int greaterValue(int N, int W) { int l=1,r=13,res=0; while(l<=r){ int mid=(l+r)/2; b[0]=mid; b[1]=mid; playRound(b,R); for(int i=0;i<N;i++){ sum+=R[i]; } assert(sum==W); if(R[0]+R[1]<=2*mid+1)r=mid-1; else l=mid+1,res=mid; } b[0]=res+1; b[1]=res+1; playRound(b,R); if(R[0]>R[1])return 0; return 1; } 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. } }