// correct/solution-full-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);
std::vector<int> results(N);
for(int i=0; i<N; i++) c[i] = 0;
int a = 0, b = N-1;
int finish = 0;
while(a!=b){
int half = (a+b)/2;
T.clear();
for(int i=0; i<=half; i++) T.push_back(i);
results[half] = diagnostic(T);
if(results[half]>=0){
b = half;
} else {
a = half+1;
}
}
finish = results[a];
int h = a;
c[h] = 1;
if(h!=N-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-1; 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;
}
int fp = 0, sp = 0;
for(int i=0; i<=h+1; i++) fp += c[i];
for(int i=h+2; i<N; i++) sp += c[i];
if((finish == 0 && fp > sp) || (finish == 1 && fp-1 > sp)) c[N-1] = 1;
}
std::vector<int> actC(N);
for(int i=0; i<N; i++) actC[ids[i]] = c[i];
return actC;
}
