제출 #969601

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
969601		socpite	코알라 (APIO17_koala)	C++14	29 / 100	58 ms	472 KiB

koala

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

int B[105], R[105];

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 0;
}


int maxValue(int N, int W) {
    vector<int> vec = {1, 2, 4, 11};
    vector<int> good(N);
    iota(good.begin(), good.end(), 0);
    for(auto v: vec){
        fill(B, B + N, 0);
        for(auto id: good)B[id] = v;
        playRound(B, R);
        good.clear();
        for(int i = 0; i < N; i++)if(R[i] > v)good.push_back(i);
    }
    return good.back();
}

int greaterValue(int N, int W) {
    int l = 1, r = 8;
    while(l < r){
        int mid = (l+r)>>1;
        B[0] = B[1] = mid;
        playRound(B, R);
        if (R[0] > mid and R[1] <= mid) return 0;
        if (R[1] > mid and R[0] <= mid) return 1;
        if(R[0] > mid && R[1] > mid)l = mid + 1;
        else r = mid - 1;
    }
    B[0] = B[1] = l;
    playRound(B, R);
    if (R[0] > l and R[1] <= l) return 0;
    if (R[1] > l and R[0] <= l) return 1;
    return 0;

    // k p0 <= sum (k+1)so dau tien < p1
}

bool cmp_subtask_4(int a, int b){
    fill(B, B+100, 0);
    B[a] = B[b] = 100;
    playRound(B, R);
    return R[a] < R[b];
}

void allValues(int N, int W, int *P) {
    if (W == 2*N) {
        iota(P, P + N, 0);
        sort(P, P+N, cmp_subtask_4);
    } 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: 15 / 15
• Subtask 3: 14 / 18
• Subtask 4: 0 / 10
• Subtask 5: 0 / 53