Submission #903983

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
903983	2024-01-11T16:01:09 Z	Itamar	Coreputer (IOI23_coreputer)	C++17	40 / 100	1 ms	604 KB

coreputer

#include "coreputer.h"
#include <vector>
using namespace std;
#define vi vector<int>
#include <algorithm>
#include <map>
map<vi, int> m;
int run_diagnostici(vi v) {
	if (m[v])return m[v] - 2;
	m[v] = 2+run_diagnostic(v);
	return m[v] - 2;
}
std::vector<int> malfunctioning_cores(int N) {
	vi ans(N, -1);
	int l = 0, r = N-1;
	vi q;
	while (q.size()<5) {
		int mid = (l + r) / 2;
		vi v;
		for (int i = 0; i <= mid; i++)v.push_back(i);
		int a = run_diagnostici(v);
		q.push_back(a);
		if (a == 0) { l = mid, r = mid; }
		if (a == -1)l = mid+1;
		else r = mid;
	}
	if (l == N - 1) { ans[N - 1] = 1; return ans; }
	int t = q.back();
	int g=-1;
	int tt=t;
	for (int i = 0; i < N-1; i++) {
		vi v; for (int j = 0; j <= l; j++)if (i != j && (g!=j || i<=l))v.push_back(j);
		int a;
		if (i > l) {
			v.push_back(i);
			a = run_diagnostici(v);
			ans[i] = (tt < a);
		}
		else {
			a = run_diagnostici(v);
			ans[i] = (t > a);
			if (ans[i] && t!=0) {
				g = i; tt = a;
			}
		}
	}
	int x1=0;
	for (int i = 0; i < N - 1; i++) {
		if (ans[i] && i <= l)x1++;
		else if (ans[i])x1--;
	}
	ans[N - 1] = (x1 > (t));
	return ans;
}

Subtask #1

0.0 / 20.0

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

Subtask #2

40.0 / 40.0

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

Subtask #3

0.0 / 40.0

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