Submission #909337

#	Time	Username	Problem	Language	Result	Execution time	Memory
909337		emptypringlescan	Coreputer (IOI23_coreputer)	C++17	100 / 100	1 ms	600 KiB

coreputer

#include <bits/stdc++.h>
using namespace std;
#include "coreputer.h"
vector<int> malfunctioning_cores(int n){
	int lo=0,hi=n-1,mid;
	int st=-1;
	while(lo<hi){
		mid=(lo+hi)/2;
		vector<int> arr(mid+1);
		for(int i=0; i<=mid; i++) arr[i]=i;
		int x=run_diagnostic(arr);
		if(x==-1) lo=mid+1;
		else hi=mid,st=x;
	}
	vector<int> ans(n);
	ans[lo]=1;
	if(lo==n-1){
		for(int i=0; i<n-1; i++) ans[i]=0;
		return ans;
	}
	vector<int> qu(lo+1);
	for(int i=0; i<=lo; i++) qu[i]=i;
	for(int i=lo+1; i<n-1; i++){
		qu[lo]=i;
		int x=run_diagnostic(qu);
		if(x==-1) ans[i]=0;
		else ans[i]=1;
	}
	vector<int> qu2(lo);
	for(int i=0; i<lo; i++) qu2[i]=i;
	for(int i=lo-1; i>=0; i--){
		qu2[i]=lo;
		int x=run_diagnostic(qu2);
		if(x==-1) ans[i]=1;
		else ans[i]=0,st=x;
		qu2[i]=i;
	}
	assert(st!=-1);
	int a=0,b=0;
	for(int i=lo+1; i<n-1; i++) a+=ans[i];
	for(int i=0; i<=lo; i++) b+=ans[i];
	ans[n-1]=0;
	assert(b>=a);
	if(b-a==2&&st==1) ans[n-1]=1;
	else if(b-a==1&&st==0) ans[n-1]=1;
	return ans;
}

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