Submission #1092418

#	Time	Username	Problem	Language	Result	Execution time	Memory
1092418		Luvidi	Coreputer (IOI23_coreputer)	C++17	100 / 100	1 ms	344 KiB

coreputer

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

std::vector<int> malfunctioning_cores(int n) {
	int idx,s=1;
	int l=0,r=n-1;
	while(l<r){
		int m=(l+r)/2;
		vector<int> v;
		for(int i=0;i<=m;i++)v.push_back(i);
		int x=run_diagnostic(v);
		if(x==-1)l=m+1;
		else{
		    r=m;
		    s=x;
		}
	}
	idx=l;
	vector<int> ans(n);
	if(s){
		int x;
		if(idx==n-1)x=0;
		else x=n-1;
		vector<int> v;
		for(int i=0;i<idx;i++)v.push_back(i);
		ans[idx]=1;
		for(int i=idx+1;i<n;i++)if(i!=x){
			v.push_back(i);
			ans[i]=run_diagnostic(v)==1;
			v.pop_back();
		}
		v.clear();
		for(int i=idx+1;i<n;i++)v.push_back(i);
		for(int i=0;i<idx;i++)if(i!=x){
			v.push_back(i);
			ans[i]=run_diagnostic(v)==1;
			v.pop_back();
		}
		ans[x]=1;
		for(int i=0;i<n;i++)if(i!=x)ans[x]^=ans[i];
	}else{
		vector<int> v;
		for(int i=0;i<=idx;i++)v.push_back(i);
		ans[idx]=1;
		for(int i=idx+1;i<n-1;i++){
			v.push_back(i);
			ans[i]=run_diagnostic(v)==1;
			v.pop_back();
		}
		v.clear();
		for(int i=idx+1;i<n;i++)v.push_back(i);
		for(int i=0;i<idx;i++){
			v.push_back(i);
			ans[i]=run_diagnostic(v)==1;
			v.pop_back();
		}
		for(int i=0;i<n-1;i++)ans[n-1]^=ans[i];
	}
	return ans;
}

• Subtask 1: 20 / 20
• Subtask 2: 40 / 40
• Subtask 3: 40 / 40