제출 #1359087

#제출 시각아이디문제언어결과실행 시간메모리
1359087hexopiaCoreputer (IOI23_coreputer)C++20
80 / 100
0 ms416 KiB
#include "coreputer.h"
#include <bits/stdc++.h>
using namespace std;
/*static inline constexpr int maxDiagnostics = 32;
static int diagnostic_counter = 0;
static int malfunctioningCores = 0;

static int N;
static std::vector<int> M;

static inline void protocol_violation(std::string message) {
	printf("Protocol Violation: %s\n", message.c_str());
	exit(0);
}


int run_diagnostic(std::vector<int> T) {
	++diagnostic_counter;
	if (diagnostic_counter > maxDiagnostics) {
		for(int x:T) cout << x << " ";
		protocol_violation("too many calls");
	}

	int l = T.size();
	if (l > N) {
		for(int x:T) cout << x << " ";
		protocol_violation("invalid array");
	}

	for (int i = 0; i < l; ++i) {
		if (T[i] < 0 || T[i] >= N) {
			for(int x:T) cout << x << " ";
			protocol_violation("invalid array");
		}
		for (int j = 0; j < i; ++j) {
			if (T[i] == T[j]) {
				for(int x:T) cout << x << " ";
				protocol_violation("invalid array");
			}
		}
	}

	int malfunctioningTaggedCores = 0;
    for (int i : T) {
        if (M[i] == 1) malfunctioningTaggedCores++;
    }

    int malfunctioningUntaggedCores = malfunctioningCores - malfunctioningTaggedCores;
    if (malfunctioningTaggedCores > malfunctioningUntaggedCores) {
        return 1;
    }
    if (malfunctioningTaggedCores == malfunctioningUntaggedCores) {
        return 0;
    }
    return -1;
}*/


int query(vector<int> &v) {
	return run_diagnostic(v);
}
std::vector<int> malfunctioning_cores(int n) {
	vector<int> vv,v;
	vector<int> ans(n,0);
	int l = 0,r = n-1,get;
	bool ch = 1;
	while(l<r) {
		int md = (l+r)>>1;
		v.clear();
		for(int i = 0 ; i<=md ; ++i) v.push_back(i);
		get = query(v);
		if(get == 0) ch = 0;
		if(get >= 0) r = md;
		else l = md+1;
	}
	vv.push_back(l);
	v.clear();
	for(int i = 0 ; i<l ; ++i) v.push_back(i);
	for(int i = l+1 ; i<n ; ++i) {
		v.push_back(i);
		if(query(v) >= 0) vv.push_back(i);
		v.pop_back();
	}
	int cnt = vv.size()-1-(ch?0:1);
	v.clear();
	for(int x:vv) if(x != l) v.push_back(x);
	for(int i = 0 ; i<l ; ++i) {
		if(i == l-1) {
			if(cnt != 0) vv.push_back(i);
			continue;
		}
		v.push_back(i);
		if(query(v) > 0) vv.push_back(i),cnt--;
		v.pop_back();
	}
	for(int x:vv) ans[x] = 1;
	return ans;
}
#결과 실행 시간메모리채점기 출력
결과를 불러오는 중입니다…
#결과 실행 시간메모리채점기 출력
결과를 불러오는 중입니다…
#결과 실행 시간메모리채점기 출력
결과를 불러오는 중입니다…