# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
1151727 | byunjaewoo | 코알라 (APIO17_koala) | C++20 | 0 ms | 0 KiB |
#include "koala.h"
#include <bits/stdc++.h>
using namespace std;
int minValue(int N, int W) {
int v[100]={0}, t[100]={0};
v[0]=1;
playRound(v, t);
if(t[0]<=1) return 0;
for(int i=1; i<N; i++) if(t[i]==0) return i;
}
int maxValue(int N, int W) {
int v[100]={0}, t[100]={0};
vector<int> c;
for(int i=0; i<100; i++) c.push_back(i);
for(int i=0; i<4; i++) {
if(c.size()==1) break;
vector<int> c2;
fill(v, v+100, 0);
for(int j:c) v[j]=100/c.size();
playRound(v, t);
for(int j:c) if(t[j]>(100/c.size())) c2.push_back(j);
c=c2;
}
return c[0];
}
int greaterValue(int N, int W) {
int p=minValue(N, W);
int v[100]={0}, t[100]={0};
if(p<=1) return 1-p;
v[0]=v[1]=v[p]=1;
playRound();
if(t[1]>1) return 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.
}
}