제출 #673065

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
673065		Dan4Life	코알라 (APIO17_koala)	C++17	0 / 100	0 ms	208 KiB

koala

#include "koala.h"
#include <bits/stdc++.h>
using namespace std;

using namespace std;

int minValue(int N, int W) {
	int x[N], y[N];
	for(int i = 0; i < N; i++) x[i]=1;
	set<int> S; S.clear();
	for(int i = 0; i < N; i++) S.insert(i);
    playRound(x,y);
    for(int i = 0; i < N; i++){
		if(y[i]==2) x[i]=0, S.erase(i);
		else x[i]=1;
	}
	for(int i = 0; i < N; i++){
		if(x[i]) continue;
		x[i] = W-accumulate(x,x+N,0); break;
	}
	playRound(x,y);
	for(int i = 0; i < N; i++){
		if(!S.count(i)) continue;
		if(y[i]>=2) S.erase(i);
	}
    return *S.begin();
}

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.
    }
}

• Subtask 1: 0 / 4
• Subtask 2: 0 / 15
• Subtask 3: 0 / 18
• Subtask 4: 0 / 10
• Subtask 5: 0 / 53