제출 #364941

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
364941		kostia244	코알라 (APIO17_koala)	C++17	4 / 100	7 ms	492 KiB

koala

#include "koala.h"
#include<bits/stdc++.h>
using namespace std;
#define all(x) begin(x), end(x)
int minValue(int n, int __w) {
	vector<int> take(n), res(n);
	take[0] = 1;
	playRound(take.data(), res.data());
    return min_element(all(res))-res.begin();
}

int maxValue(int n, int __w) {
	vector<int> take(n), res(n), bad(n);
	vector<int> alive(n);
	iota(all(alive), 0);
	while(alive.size() > 1) {
		int mid = max(alive.size()/2, (size_t)2);
		fill(all(take), 0);
		fill(all(res), 0);
		for(int i = 0; i < mid; i++) {
			take[i] = __w/mid;
		}
		playRound(take.data(), res.data());
		//cout << alive.size() << endl;
		//for(auto i : take) cout << i << " "; cout << endl;
		//for(auto i : res) cout << i << " "; cout << endl;
		vector<int> nw;
		for(auto i : alive) if(res[i]) nw.push_back(i);
		alive = nw;
	}
    return alive[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: 4 / 4
• Subtask 2: 0 / 15
• Subtask 3: 0 / 18
• Subtask 4: 0 / 10
• Subtask 5: 0 / 53