제출 #1168900

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1168900		12345678	Koala Game (APIO17_koala)	C++20	24 / 100	93 ms	460 KiB

koala

#include "koala.h"
#include <bits/stdc++.h>

using namespace std;

const int nx=1e2+5;

int minValue(int N, int W) {
    int qrs[nx], ans[nx];
    for (int i=0; i<N; i++) qrs[i]=(i==0);
    playRound(qrs, ans);
    for (int i=1; i<N; i++) if (ans[i]==0) return i;
    return 0;
}

int maxValue(int N, int W) {
    int qrs[nx], ans[nx], per, t=4;
    vector<int> idx, nidx;
    for (int i=0; i<N;i ++) idx.push_back(i);
    while (t--)
    {
        per=W/idx.size();
        for (int i=0; i<N; i++) qrs[i]=0;
        for (auto x:idx) qrs[x]=per;
        playRound(qrs, ans);
        for (int i=0; i<N; i++) if (qrs[i]>0&&ans[i]>qrs[i]) nidx.push_back(i);
        idx=nidx;
        nidx.clear();
    }
    return idx[0];
}

int greaterValue(int N, int W) {
    int qrs[nx], ans[nx];
    for (int i=0; i<N; i++) qrs[i]=0;
    for (int i=1; i<=10; i++)
    {
        qrs[0]=qrs[1]=i;
        playRound(qrs, ans);
        if (ans[0]>qrs[0]&&ans[1]<=qrs[1]) return 0;
        if (ans[1]>qrs[1]&&ans[0]<=qrs[0]) 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.
    }
}

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