Submission #839561

#TimeUsernameProblemLanguageResultExecution timeMemory
839561model_codeCoreputer (IOI23_coreputer)C++17
80 / 100
1 ms260 KiB
// partially_correct/solution-N+Half-random.cpp

#include "coreputer.h"

#include <algorithm>
#include <random>

int ids[16];

int diagnostic(const std::vector<int>& T){
	std::vector<int> actT(T.size());
	for(int i = 0; i<(int)T.size(); i++) actT[i] = ids[T[i]];
	return run_diagnostic(actT);
}

std::vector<int> malfunctioning_cores(int N) {
	for(int i=0; i<N; i++) ids[i] = i;
	srand(time(0));
	std::random_shuffle(ids,ids+N);

	std::vector<int> T;
	std::vector<int> c(N);

	int h = (N-1)/2;
	T.clear();
	for(int i=0; i<=h; i++) T.push_back(i);

	int res = diagnostic(T);
	if(res >= 0){
		while(h > 0){
			h--;
			T.clear();
			for(int i=0; i<=h; i++) T.push_back(i);
			if(diagnostic(T)==-1){
				h++;
				break;
			}
		}
	} else {
		while(++h < N-1){
			T.clear();
			for(int i=0; i<=h; i++) T.push_back(i);
			if(diagnostic(T)>=0) break;
		}
	}

	c[h] = 1;
	for(int i=0; i<h; i++){
		T.clear();
		for(int j=0; j<=h; j++){
			if(i!=j) T.push_back(j);
		}

		if(diagnostic(T)==-1) c[i] = 1;
	}

	h--;
	for(int i=h+2; i<N; i++){
		T.clear();
		for(int j=h+1; j<N; j++){
			if(i!=j) T.push_back(j);
		}

		if(diagnostic(T)<=0) c[i] = 1;
	}

	std::vector<int> actC(N);
	for(int i=0; i<N; i++) actC[ids[i]] = c[i];
	return actC;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...