Submission #839563

# Submission time Handle Problem Language Result Execution time Memory
839563 2023-08-30T08:59:32 Z model_code Coreputer (IOI23_coreputer) C++17
80 / 100
1 ms 208 KB
// partially_correct/solution-N+log+c-random.cpp

#include "coreputer.h"

#include <algorithm>
#include <random>

int ids[16];

int diagnostic(const std::vector<int>& T){
	std::vector<int> actT(T.size());
	for(int i = 0; i<(int)T.size(); i++) actT[i] = ids[T[i]];
	return run_diagnostic(actT);
}

std::vector<int> malfunctioning_cores(int N) {
	for(int i=0; i<N; i++) ids[i] = i;
	srand(time(0));
	std::random_shuffle(ids,ids+N);

	std::vector<int> T;
	std::vector<int> c(N);

	int a = 0, b = N-1;
	while(a!=b){
		int half = (a+b)/2;
		T.clear();
		for(int i=0; i<=half; i++) T.push_back(i);

		if(diagnostic(T)>=0){
			b = half;
		} else {
			a = half+1;
		}
	}

	int h = a;
	c[h] = 1;
	for(int i=0; i<h; i++){
		T.clear();
		for(int j=0; j<=h; j++){
			if(i!=j) T.push_back(j);
		}

		if(diagnostic(T)==-1) c[i] = 1;
	}

	h--;
	for(int i=h+2; i<N; i++){
		T.clear();
		for(int j=h+1; j<N; j++){
			if(i!=j) T.push_back(j);
		}

		if(diagnostic(T)<=0) c[i] = 1;
	}

	std::vector<int> actC(N);
	for(int i=0; i<N; i++) actC[ids[i]] = c[i];
	return actC;
}
# Verdict Execution time Memory Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 0 ms 208 KB Output is correct
3 Correct 0 ms 208 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 0 ms 208 KB Output is correct
3 Correct 0 ms 208 KB Output is correct
4 Correct 0 ms 208 KB Output is correct
5 Correct 0 ms 208 KB Output is correct
6 Correct 0 ms 208 KB Output is correct
7 Correct 0 ms 208 KB Output is correct
8 Correct 0 ms 208 KB Output is correct
9 Correct 0 ms 208 KB Output is correct
10 Correct 0 ms 208 KB Output is correct
11 Correct 1 ms 208 KB Output is correct
12 Correct 0 ms 208 KB Output is correct
13 Correct 1 ms 208 KB Output is correct
14 Correct 0 ms 208 KB Output is correct
15 Correct 0 ms 208 KB Output is correct
16 Correct 0 ms 208 KB Output is correct
17 Correct 1 ms 208 KB Output is correct
18 Correct 0 ms 208 KB Output is correct
19 Correct 0 ms 208 KB Output is correct
20 Correct 0 ms 208 KB Output is correct
21 Correct 0 ms 208 KB Output is correct
22 Correct 0 ms 208 KB Output is correct
23 Correct 0 ms 208 KB Output is correct
24 Correct 0 ms 208 KB Output is correct
25 Correct 1 ms 208 KB Output is correct
26 Correct 0 ms 208 KB Output is correct
27 Partially correct 0 ms 208 KB Output is partially correct
28 Partially correct 0 ms 208 KB Output is partially correct
29 Partially correct 0 ms 208 KB Output is partially correct
30 Partially correct 1 ms 208 KB Output is partially correct
31 Partially correct 0 ms 208 KB Output is partially correct
32 Partially correct 1 ms 208 KB Output is partially correct
33 Partially correct 0 ms 208 KB Output is partially correct
34 Partially correct 1 ms 208 KB Output is partially correct
35 Partially correct 0 ms 208 KB Output is partially correct
36 Partially correct 0 ms 208 KB Output is partially correct
37 Partially correct 0 ms 208 KB Output is partially correct
38 Partially correct 0 ms 208 KB Output is partially correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 0 ms 208 KB Output is correct
3 Correct 0 ms 208 KB Output is correct
4 Correct 0 ms 208 KB Output is correct
5 Correct 0 ms 208 KB Output is correct
6 Correct 0 ms 208 KB Output is correct
7 Correct 0 ms 208 KB Output is correct
8 Correct 0 ms 208 KB Output is correct
9 Correct 0 ms 208 KB Output is correct
10 Correct 0 ms 208 KB Output is correct
11 Correct 0 ms 208 KB Output is correct
12 Correct 0 ms 208 KB Output is correct
13 Correct 0 ms 208 KB Output is correct
14 Correct 1 ms 208 KB Output is correct
15 Correct 0 ms 208 KB Output is correct
16 Correct 1 ms 208 KB Output is correct
17 Correct 0 ms 208 KB Output is correct
18 Correct 0 ms 208 KB Output is correct
19 Correct 0 ms 208 KB Output is correct
20 Correct 1 ms 208 KB Output is correct
21 Correct 0 ms 208 KB Output is correct
22 Correct 0 ms 208 KB Output is correct
23 Correct 0 ms 208 KB Output is correct
24 Correct 0 ms 208 KB Output is correct
25 Correct 0 ms 208 KB Output is correct
26 Correct 0 ms 208 KB Output is correct
27 Correct 0 ms 208 KB Output is correct
28 Correct 1 ms 208 KB Output is correct
29 Correct 0 ms 208 KB Output is correct
30 Partially correct 0 ms 208 KB Output is partially correct
31 Partially correct 0 ms 208 KB Output is partially correct
32 Partially correct 0 ms 208 KB Output is partially correct
33 Partially correct 1 ms 208 KB Output is partially correct
34 Partially correct 0 ms 208 KB Output is partially correct
35 Partially correct 1 ms 208 KB Output is partially correct
36 Partially correct 0 ms 208 KB Output is partially correct
37 Partially correct 1 ms 208 KB Output is partially correct
38 Partially correct 0 ms 208 KB Output is partially correct
39 Partially correct 0 ms 208 KB Output is partially correct
40 Partially correct 0 ms 208 KB Output is partially correct
41 Partially correct 0 ms 208 KB Output is partially correct
42 Correct 0 ms 208 KB Output is correct
43 Correct 0 ms 208 KB Output is correct
44 Correct 0 ms 208 KB Output is correct
45 Correct 0 ms 208 KB Output is correct
46 Correct 0 ms 208 KB Output is correct
47 Correct 0 ms 208 KB Output is correct
48 Correct 1 ms 208 KB Output is correct
49 Correct 0 ms 208 KB Output is correct
50 Correct 0 ms 208 KB Output is correct
51 Correct 0 ms 208 KB Output is correct
52 Correct 0 ms 208 KB Output is correct
53 Correct 0 ms 208 KB Output is correct
54 Correct 0 ms 208 KB Output is correct
55 Correct 0 ms 208 KB Output is correct
56 Correct 0 ms 208 KB Output is correct
57 Correct 0 ms 208 KB Output is correct
58 Correct 0 ms 208 KB Output is correct
59 Correct 1 ms 208 KB Output is correct
60 Correct 0 ms 208 KB Output is correct
61 Correct 0 ms 208 KB Output is correct
62 Correct 0 ms 208 KB Output is correct
63 Correct 1 ms 208 KB Output is correct
64 Correct 0 ms 208 KB Output is correct
65 Correct 1 ms 208 KB Output is correct
66 Correct 1 ms 208 KB Output is correct
67 Correct 1 ms 208 KB Output is correct
68 Correct 0 ms 208 KB Output is correct
69 Correct 1 ms 208 KB Output is correct
70 Correct 0 ms 208 KB Output is correct
71 Partially correct 0 ms 208 KB Output is partially correct
72 Partially correct 0 ms 208 KB Output is partially correct
73 Partially correct 1 ms 208 KB Output is partially correct
74 Partially correct 0 ms 208 KB Output is partially correct
75 Partially correct 1 ms 208 KB Output is partially correct
76 Partially correct 0 ms 208 KB Output is partially correct
77 Partially correct 0 ms 208 KB Output is partially correct
78 Partially correct 1 ms 208 KB Output is partially correct
79 Partially correct 0 ms 208 KB Output is partially correct
80 Partially correct 0 ms 208 KB Output is partially correct
81 Partially correct 0 ms 208 KB Output is partially correct
82 Partially correct 0 ms 208 KB Output is partially correct