Submission #909065

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
909065	2024-01-17T05:03:41 Z	pavement	Coreputer (IOI23_coreputer)	C++17	40 / 100	1 ms	344 KB

coreputer

#include "coreputer.h"
#include <bits/stdc++.h>
using namespace std;

#define pb push_back

vector<int> malfunctioning_cores(int N) {
	vector<int> mal(N);
	int lo = 0, hi = N - 1, ans = -1, ret = -1;
	while (lo <= hi) {
		int mid = (lo + hi) / 2;
		vector<int> qu_vec;
		for (int i = 0; i <= mid; i++) {
			qu_vec.pb(i);
		}
		int tmp = run_diagnostic(qu_vec);
		if (tmp >= 0) {
			ans = mid;
			ret = tmp;
			hi = mid - 1;
		} else {
			lo = mid + 1;
		}
	}
	assert(ans != -1);
	vector<int> qu_vec;
	for (int i = 0; i <= ans; i++) {
		qu_vec.pb(i);
	}
	for (int i = 0; i < ans; i++) {
		qu_vec.erase(find(qu_vec.begin(), qu_vec.end(), i));
		if (run_diagnostic(qu_vec) == -1) {
			mal[i] = 1;
		}
		qu_vec.pb(i);
	}
	mal[ans] = 1;
	qu_vec.erase(find(qu_vec.begin(), qu_vec.end(), ans));
	for (int i = ans + 1; i + 1 < N; i++) {
		qu_vec.pb(i);
		if (run_diagnostic(qu_vec) >= 0) {
			mal[i] = 1;
		}
		qu_vec.pop_back();
	}
	int parity = count(mal.begin(), mal.end(), 1) % 2;
	mal.back() = (parity != ret);
	return mal;
}

Subtask #1

0.0 / 20.0

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

Subtask #2

40.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	0 ms	344 KB	Output is correct
5	Correct	0 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	1 ms	344 KB	Output is correct
11	Correct	1 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	1 ms	344 KB	Output is correct
18	Correct	0 ms	344 KB	Output is correct
19	Correct	0 ms	344 KB	Output is correct
20	Correct	1 ms	344 KB	Output is correct
21	Correct	1 ms	344 KB	Output is correct
22	Correct	1 ms	344 KB	Output is correct
23	Correct	1 ms	344 KB	Output is correct
24	Correct	1 ms	344 KB	Output is correct
25	Correct	1 ms	344 KB	Output is correct
26	Correct	1 ms	344 KB	Output is correct
27	Correct	1 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	Correct	0 ms	344 KB	Output is correct
31	Correct	1 ms	344 KB	Output is correct
32	Correct	1 ms	344 KB	Output is correct
33	Correct	1 ms	344 KB	Output is correct
34	Correct	0 ms	344 KB	Output is correct
35	Correct	1 ms	344 KB	Output is correct
36	Correct	0 ms	344 KB	Output is correct
37	Correct	0 ms	344 KB	Output is 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	Incorrect	1 ms	344 KB	Incorrect
3	Halted	0 ms	0 KB	-