Submission #911171

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
911171	2024-01-18T14:29:52 Z	kachu	Coreputer (IOI23_coreputer)	C++17	50 / 100	1 ms	344 KB

coreputer

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include "coreputer.h"
 
using namespace std;
using namespace __gnu_pbds;
 
#define oset tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> 
#define ofind find_by_order
#define okey order_of_key
 
#define pque priority_queue
#define dque deque
#define que queue
#define umap unordered_map
#define uset unordered_set
#define pipii pair<int, pair<int,int>>
#define pii pair<int,int>
#define mp make_pair
#define pb push_back
#define ppb pop_back
#define pf push_front
#define ppf pop_front
#define iter iterator
#define endl '\n'
#define MOD 1000000007
#define INF 1e18
 
vector<int> malfunctioning_cores(int N){
	vector<int> ans;
	for (int i = 0; i < N; i++)
		ans.pb(0);
	
	int low = 0, high = N, pivot;
	int res[N];
	
	
	while (low <= high){
		int mid = (low + high) / 2;
		
		vector<int> query;
		for (int i = 0; i <= mid; i++)
			query.pb(i);
		
		res[mid] = run_diagnostic(query);
		
		if (res[mid] == 0 || res[mid] == 1)
			high = mid - 1;
		else
			low = mid + 1;
	}
	
	pivot = low;
	ans[pivot] = 1;
	
	if (res[pivot] == 0){
		for (int i = 0; i < pivot; i++){
			vector<int> query;
			query.pb(i);
			for (int j = pivot + 1; j < N; j++)
				query.pb(j);
			
			int re = run_diagnostic(query);
			
			if (re == 1)
				ans[i] = 1;
		}
		
		int cnt1 = 0;
		for (int i = 0; i <= pivot; i++)
			cnt1 += ans[i];
			
		for (int i = pivot + 1; i < N - 1; i++){
			vector<int> query;
			for (int j = 0; j <= pivot; j++)
				query.pb(j);
			query.pb(i);
			
			int re = run_diagnostic(query);
			
			if (re == 1)
				ans[i] = 1;
		}
		
		int cnt2 = 0;
		for (int i = pivot + 1; i < N - 1; i++)
			cnt2 += ans[i];
		
		ans[N - 1] = (cnt1 - cnt2);
	}
 
	return ans;
}

Subtask #1

20.0 / 20.0

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

Subtask #2

30.0 / 40.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 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	0 ms	344 KB	Output is correct
6	Correct	1 ms	344 KB	Output is correct
7	Correct	0 ms	344 KB	Output is correct
8	Correct	0 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	Correct	0 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	0 ms	344 KB	Output is correct
16	Correct	1 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	Correct	0 ms	344 KB	Output is correct
20	Correct	0 ms	344 KB	Output is correct
21	Correct	0 ms	344 KB	Output is correct
22	Correct	1 ms	344 KB	Output is correct
23	Correct	0 ms	344 KB	Output is correct
24	Correct	0 ms	344 KB	Output is correct
25	Correct	0 ms	344 KB	Output is correct
26	Correct	1 ms	344 KB	Output is correct
27	Partially correct	0 ms	344 KB	Output is partially correct
28	Correct	0 ms	344 KB	Output is correct
29	Correct	0 ms	344 KB	Output is correct
30	Partially correct	0 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	0 ms	344 KB	Output is partially correct
35	Correct	0 ms	344 KB	Output is correct
36	Correct	1 ms	344 KB	Output is correct
37	Partially correct	0 ms	344 KB	Output is partially correct
38	Correct	1 ms	344 KB	Output is correct

Subtask #3

0.0 / 40.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 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	0 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	0 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	Correct	0 ms	344 KB	Output is correct
12	Correct	1 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	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	0 ms	344 KB	Output is correct
19	Correct	1 ms	344 KB	Output is correct
20	Correct	0 ms	344 KB	Output is correct
21	Correct	1 ms	344 KB	Output is correct
22	Correct	0 ms	344 KB	Output is correct
23	Correct	0 ms	344 KB	Output is correct
24	Correct	0 ms	344 KB	Output is correct
25	Correct	1 ms	344 KB	Output is correct
26	Correct	0 ms	344 KB	Output is correct
27	Correct	0 ms	344 KB	Output is correct
28	Correct	0 ms	344 KB	Output is correct
29	Correct	1 ms	344 KB	Output is correct
30	Partially correct	0 ms	344 KB	Output is partially correct
31	Correct	0 ms	344 KB	Output is correct
32	Correct	0 ms	344 KB	Output is correct
33	Partially correct	0 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	0 ms	344 KB	Output is partially correct
38	Correct	0 ms	344 KB	Output is correct
39	Correct	1 ms	344 KB	Output is correct
40	Partially correct	0 ms	344 KB	Output is partially correct
41	Correct	1 ms	344 KB	Output is correct
42	Correct	0 ms	344 KB	Output is correct
43	Correct	0 ms	344 KB	Output is correct
44	Correct	0 ms	344 KB	Output is correct
45	Correct	1 ms	344 KB	Output is correct
46	Incorrect	1 ms	344 KB	Incorrect
47	Halted	0 ms	0 KB	-