oj.uz

Submission #913948

# Submission time Handle Problem Language Result Execution time Memory
913948 2024-01-20T15:57:16 Z LCJLY Coreputer (IOI23_coreputer) C++17
60 / 100
 1 ms 756 KB 
#include "coreputer.h"
#include <bits/stdc++.h>
using namespace std;

vector<int>malfunctioning_cores(int n) {
	int l=0;
	int r=n-1;
	int mid;
	int best=n-1;
	while(l<=r){
		mid=(l+r)/2;
		vector<int>v;
		for(int x=0;x<=mid;x++){
			v.push_back(x);
		}
		int hold=run_diagnostic(v);
		if(hold==1||hold==0){
			best=mid;
			r=mid-1;
		}
		else l=mid+1;
	}
	
	l=0;
	r=n-1;
	int best2=0;
	while(l<=r){
		mid=(l+r)/2;
		vector<int>v;
		for(int x=n-1;x>=mid;x--){
			v.push_back(x);
		}
		int hold=run_diagnostic(v);
		if(hold==1||hold==0){
			best2=mid;
			l=mid+1;
		}
		else r=mid-1;
	}
	set<int>se;
	for(int x=best;x<n;x++){
		vector<int>v;
		for(int y=0;y<=x;y++){
			if(se.find(y)!=se.end()) continue;
			v.push_back(y);
		}
		int hold=run_diagnostic(v);
		if(hold==1||hold==0){
			se.insert(x);
		}
	}
	
	set<int>se2;
	for(int x=best2;x>=0;x--){
		vector<int>v;
		for(int y=n-1;y>=x;y--){
			if(se2.find(y)!=se2.end()) continue;
			v.push_back(y);
		}
		int hold=run_diagnostic(v);
		if(hold==1||hold==0){
			se2.insert(x);
		}
	}
	
	for(auto it:se2) se.insert(it);
	vector<int>ans;
	for(int x=0;x<n;x++){
		if(se.find(x)==se.end()) ans.push_back(0);
		else ans.push_back(1);
	}
	return ans;
}

//code

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 756 KB Output is correct
3 Correct 0 ms 344 KB Output is correct

Subtask #2
20.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 0 ms 344 KB Output is correct
4 Correct 1 ms 344 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 0 ms 344 KB Output is correct
7 Correct 0 ms 344 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 0 ms 344 KB Output is correct
10 Correct 0 ms 344 KB Output is correct
11 Correct 1 ms 344 KB Output is correct
12 Correct 0 ms 344 KB Output is correct
13 Correct 0 ms 344 KB Output is correct
14 Correct 0 ms 344 KB Output is correct
15 Correct 1 ms 344 KB Output is correct
16 Partially correct 1 ms 344 KB Output is partially correct
17 Partially correct 1 ms 344 KB Output is partially correct
18 Partially correct 1 ms 344 KB Output is partially correct
19 Partially correct 1 ms 596 KB Output is partially 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 0 ms 344 KB Output is partially correct
23 Partially correct 1 ms 344 KB Output is partially correct
24 Partially correct 1 ms 344 KB Output is partially correct
25 Partially correct 1 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 596 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 0 ms 344 KB Output is partially correct
36 Partially correct 0 ms 344 KB Output is partially correct
37 Partially correct 0 ms 344 KB Output is partially correct
38 Partially correct 0 ms 344 KB Output is partially correct

Subtask #3
20.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 756 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 1 ms 344 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 0 ms 344 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 0 ms 344 KB Output is correct
10 Correct 0 ms 344 KB Output is correct
11 Correct 1 ms 344 KB Output is correct
12 Correct 0 ms 344 KB Output is correct
13 Correct 0 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 0 ms 344 KB Output is correct
18 Correct 1 ms 344 KB Output is correct
19 Partially correct 1 ms 344 KB Output is partially 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 596 KB Output is partially correct
23 Partially correct 1 ms 344 KB Output is partially correct
24 Partially correct 1 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 596 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 0 ms 344 KB Output is partially correct
39 Partially correct 0 ms 344 KB Output is partially correct
40 Partially correct 0 ms 344 KB Output is partially correct
41 Partially correct 0 ms 344 KB Output is partially correct
42 Correct 1 ms 340 KB Output is correct
43 Correct 1 ms 344 KB Output is correct
44 Correct 1 ms 344 KB Output is correct
45 Correct 0 ms 344 KB Output is correct
46 Correct 0 ms 344 KB Output is correct
47 Correct 0 ms 344 KB Output is correct
48 Correct 1 ms 344 KB Output is correct
49 Correct 0 ms 344 KB Output is correct
50 Correct 0 ms 344 KB Output is correct
51 Correct 0 ms 344 KB Output is correct
52 Correct 1 ms 344 KB Output is correct
53 Correct 1 ms 344 KB Output is correct
54 Correct 0 ms 344 KB Output is correct
55 Correct 1 ms 344 KB Output is correct
56 Correct 1 ms 344 KB Output is correct
57 Correct 1 ms 344 KB Output is correct
58 Correct 1 ms 344 KB Output is correct
59 Correct 1 ms 344 KB Output is correct
60 Correct 1 ms 344 KB Output is correct
61 Partially correct 1 ms 344 KB Output is partially correct
62 Correct 0 ms 344 KB Output is correct
63 Correct 1 ms 344 KB Output is correct
64 Partially correct 0 ms 344 KB Output is partially correct
65 Partially correct 0 ms 344 KB Output is partially correct
66 Partially correct 1 ms 344 KB Output is partially correct
67 Partially correct 1 ms 344 KB Output is partially correct
68 Partially correct 1 ms 344 KB Output is partially correct
69 Partially correct 1 ms 344 KB Output is partially correct
70 Partially correct 1 ms 596 KB Output is partially correct
71 Partially correct 0 ms 344 KB Output is partially correct
72 Partially correct 1 ms 344 KB Output is partially correct
73 Partially correct 1 ms 344 KB Output is partially correct
74 Partially correct 1 ms 344 KB Output is partially correct
75 Partially correct 1 ms 344 KB Output is partially correct
76 Partially correct 1 ms 344 KB Output is partially correct
77 Partially correct 1 ms 344 KB Output is partially correct
78 Partially correct 1 ms 344 KB Output is partially correct
79 Partially correct 1 ms 344 KB Output is partially correct
80 Partially correct 1 ms 344 KB Output is partially correct
81 Partially correct 1 ms 344 KB Output is partially correct
82 Partially correct 1 ms 344 KB Output is partially correct