# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
1132957 | Math4Life2020 | Koala Game (APIO17_koala) | C++20 | 0 ms | 0 KiB |
//#include "koala.h"
#include <bits/stdc++.h>
using namespace std;
using ll = int; using pii = pair<ll,ll>;
const int N = 100;
//playRound(a,b): int a[N] (you enter this in), int b[N] (it enters this in)
int minValue(int N1, int W) {
int a[N],b[N];
for (int i=0;i<N;i++) {
a[i]=1;
}
playRound(a,b);
ll xm = -1;
for (int i=0;i<N;i++) {
if (b[i]==2) {
xm = i;
}
}
for (int i=0;i<N;i++) {
a[i]=0;
if (i==xm) {
a[i]=1;
}
}
playRound(a,b);
for (int i=0;i<N;i++) {
if (b[i]==0) {
return i;
}
}
}
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.
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.
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.
}
}