oj.uz

Submission #909299

# Submission time Handle Problem Language Result Execution time Memory
909299 2024-01-17T06:57:39 Z emptypringlescan Coreputer (IOI23_coreputer) C++17
0 / 100
 1 ms 596 KB 
#include <bits/stdc++.h>
using namespace std;
#include "coreputer.h"
vector<int> malfunctioning_cores(int n){
	int lo=0,hi=n-1,mid;
	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;
	}
	vector<int> ans(n);
	ans[lo]=1;
	vector<int> qu(lo+1);
	for(int i=0; i<=lo; i++) qu[i]=i;
	for(int i=lo+1; i<n; 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++) qu[i]=i;
	for(int i=lo-1; i>=0; i--){
		qu[i]=lo;
		int x=run_diagnostic(qu);
		if(x==-1) ans[i]=1;
		else ans[i]=0;
		qu[i]=i;
	}
	/*int a=0,b=0;
	for(int i=lo; i<n-1; i++) a+=ans[i];
	for(int i=0; i<lo; i++) b+=ans[i];
	if(b==a) ans[n-1]=1;
	else ans[n-1]=0;*/
	return ans;
}

Subtask #1
0.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Incorrect 0 ms 344 KB invalid array
3 Halted 0 ms 0 KB -

Subtask #2
0.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 1 ms 344 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 1 ms 596 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 1 ms 344 KB Output is correct
10 Correct 0 ms 344 KB Output is correct
11 Incorrect 0 ms 344 KB Incorrect
12 Halted 0 ms 0 KB -

Subtask #3
0.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Incorrect 0 ms 344 KB invalid array
3 Halted 0 ms 0 KB -