oj.uz

Submission #908415

# Submission time Handle Problem Language Result Execution time Memory
908415 2024-01-16T11:57:33 Z shoryu386 Coreputer (IOI23_coreputer) C++17
30 / 100
 1 ms 596 KB 
#include "coreputer.h"
#include <bits/stdc++.h>
using namespace std;

vector<int> malfunctioning_cores(int N) {
	int firstZero = -1, lastZero = -1;
	
	/*
	for (int m = 0; m < N; m++){
		vector<int> bruh;
		for (int y = 0; y <= m; y++) bruh.push_back(y);
		
		int res = run_diagnostic(bruh);
		
		cout << res << " ";
	}
	cout << "!!!\n";
	for (int m = 0; m < N; m++){
		vector<int> bruh;
		for (int y = m; y < N; y++) bruh.push_back(y);
		
		int res = run_diagnostic(bruh);
		
		cout << res << " ";
	}
	cout << "!!!\n";
	*/
	
	int l = 0, r = N-1;
	while (l <= r){
		int m = (l+r)/2;
		
		vector<int> bruh;
		for (int y = 0; y <= m; y++) bruh.push_back(y);
		
		int res = run_diagnostic(bruh);
		
		
		//cerr << m << ' ' << run_diagnostic(bruh) << "???\n" ;
		
		if (res == 1){
			r = m-1;
		}
		else if (res == 0){
			r = m-1;
			firstZero = m;
		}
		else{
			l = m+1;
		}
	}
	
	if (firstZero != -1){
		int l = 0, r = N-1;
		while (l <= r){
			int m = (l+r)/2;
			
			vector<int> bruh;
			for (int y = m; y < N; y++) bruh.push_back(y);
			
			int res = run_diagnostic(bruh);
			
			if (res == 1){
				l = m+1;
				
			}
			else if (res == 0){
				l = m+1;
				lastZero = m;
			}
			else{
				r = m-1;
			}
		}
		//even case
		//cerr << firstZero << ' ' << lastZero << '\n';
		
		//our malfunctions are at firstZero, and lastZero
		//we also now know that there are an equal number of malfunctions in the two segments [0, firstZero-1] and [lastZero+2, 15]
		
		vector<int> ans(N, 0);
		ans[firstZero] = 1;
		ans[lastZero] = 1;
		
		for (int x = N-1; x > lastZero; x--){
			//include [0, firstZero], include [lastZero+1, 15], except one element
			
			vector<int> cur;
			
			#define ADDRANGE(a, b) for (int y = a; y <= b; y++) cur.push_back(y); 
			
			ADDRANGE(0, firstZero);
			ADDRANGE(x, x);
			
			int res = run_diagnostic(cur);
			
			//cerr << "\n run: \n";
			//for (auto y : cur) cerr << y << ' ';
			//cerr << '\n';
			//cerr << res << '\n';
			
			if (res == 0){
				ans[x] = 0;
			}
			else ans[x] = 1;
		}
		
		for (int x = 0; x < firstZero; x++){
			//include [0, firstZero], exclude [lastZero+1, 15], except one element
			vector<int> cur;
			
			#define ADDRANGE(a, b) for (int y = a; y <= b; y++) cur.push_back(y); 
			
			ADDRANGE(lastZero, N-1);
			ADDRANGE(x, x);
			
			int res = run_diagnostic(cur);
			
			if (res == 0){
				ans[x] = 0;
			}
			else ans[x] = 1;
		}
		
		return ans;
		
		
	}
	else{
		
		vector<int> ans(N, 0);
		
		int lastOne = -1;
		int l = 1, r = N-1;
		while (l <= r){
			int m = (l+r)/2;
			
			vector<int> bruh;
			for (int y = m; y < N; y++) bruh.push_back(y);
			
			int res = run_diagnostic(bruh);
			
			
			//cerr << m << ' ' << run_diagnostic(bruh) << "???\n" ;
			
			if (res == 1){
				l = m+1;
				lastOne = m;
			}
			else{
				r = m-1;
			}
		}
		
		ans[lastOne] = 1;
		
		assert(0 <= lastOne && lastOne < N);
		
		for (int x = 0; x < lastOne; x++){
			
			vector<int> cur;
			
			#define ADDRANGE(a, b) for (int y = a; y <= b; y++) cur.push_back(y); 
			
			ADDRANGE(0, lastOne);
			cur.erase(find(cur.begin(), cur.end(), x));
			
			int res = run_diagnostic(cur);
			
			if (res != 1){
				ans[x] = 1;
			}
			else ans[x] = 0;
		}
		
		for (int x = lastOne+1; x < N; x++){
			
			vector<int> cur;
			ADDRANGE(lastOne, N-1);
			cur.erase(find(cur.begin(), cur.end(), x));
			
			int res = run_diagnostic(cur);
			
			if (res != 1){
				ans[x] = 1;
			}
			else ans[x] = 0;
		}
		
		return ans;
	}
	
}

Subtask #1
0.0 / 20.0

# Verdict Execution time Memory Grader output
1 Runtime error 1 ms 344 KB Execution killed with signal 6
2 Halted 0 ms 0 KB -

Subtask #2
30.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 1 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 344 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Correct 1 ms 596 KB Output is correct
9 Correct 0 ms 344 KB Output is correct
10 Correct 0 ms 596 KB Output is correct
11 Correct 0 ms 344 KB Output is correct
12 Correct 1 ms 344 KB Output is correct
13 Correct 1 ms 344 KB Output is correct
14 Correct 1 ms 344 KB Output is correct
15 Correct 0 ms 344 KB Output is correct
16 Correct 0 ms 344 KB Output is correct
17 Correct 1 ms 344 KB Output is correct
18 Correct 1 ms 344 KB Output is correct
19 Correct 0 ms 344 KB Output is correct
20 Partially correct 1 ms 344 KB Output is partially correct
21 Partially correct 1 ms 344 KB Output is partially correct
22 Partially correct 1 ms 344 KB Output is partially correct
23 Partially correct 1 ms 344 KB Output is partially correct
24 Partially correct 0 ms 344 KB Output is partially correct
25 Partially correct 0 ms 344 KB Output is partially correct
26 Partially correct 1 ms 344 KB Output is partially correct
27 Partially correct 1 ms 344 KB Output is partially correct
28 Partially correct 1 ms 344 KB Output is partially correct
29 Partially correct 1 ms 344 KB Output is partially correct
30 Partially correct 1 ms 344 KB Output is partially correct
31 Partially correct 1 ms 344 KB Output is partially correct
32 Partially correct 1 ms 344 KB Output is partially correct
33 Partially correct 1 ms 344 KB Output is partially correct
34 Partially correct 1 ms 344 KB Output is partially correct
35 Partially correct 1 ms 344 KB Output is partially correct
36 Partially correct 1 ms 344 KB Output is partially correct
37 Partially correct 1 ms 344 KB Output is partially correct
38 Partially correct 1 ms 344 KB Output is partially correct

Subtask #3
0.0 / 40.0

# Verdict Execution time Memory Grader output
1 Runtime error 1 ms 344 KB Execution killed with signal 6
2 Halted 0 ms 0 KB -