제출 #981262

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

koala

#include "koala.h"

#include <bits/stdc++.h>
const int mxn = 110;

int ask[mxn],res[mxn];

namespace S1{
	int GO(int N,int W){
		memset(ask,0,sizeof(ask));
		ask[0] = 1;
		playRound(ask,res);
		 if(res[0] == 2){
			for(int i = 1;i<N;i++)if(!res[i])return i;
			assert(false);
		}
		else return 1;
		memset(ask,0,sizeof(ask));
		ask[1] = 1;
		playRound(ask,res);
		for(int i = 2;i<N;i++)if(!res[i])return i;
		assert(false);
		return -1;
	}
}

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.
	return S1::GO(N,W);
}

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