oj.uz

Submission #903965

# Submission time Handle Problem Language Result Execution time Memory
903965 2024-01-11T15:45:06 Z Itamar Coreputer (IOI23_coreputer) C++17
0 / 100
 1 ms 608 KB 
#include "coreputer.h"
#include <vector>
using namespace std;
#define vi vector<int>
#include <algorithm>
std::vector<int> malfunctioning_cores(int N) {
	vi ans(N, -1);
	int l = 0, r = N-2;
	vi q;
	while (q.size()<3) {
		int mid = (l + r) / 2;
		vi v;
		for (int i = 0; i <= mid; i++)v.push_back(i);
		int a = run_diagnostic(v);
		q.push_back(a);
		if (a == 0) { l = mid, r = mid; }
		if (a == -1)l = mid+1;
		else r = mid;
	}
	int t = q.back();
	int g=-1;
	int tt=t;
	for (int i = 0; i < N; i++) {
		vi v; for (int j = 0; j <= l; j++)if (i != j && (g!=j || i<=l))v.push_back(j);
		int a;a = run_diagnostic(v);
		if (i > l) {
			v.push_back(i);
			a = run_diagnostic(v);
			ans[i] = (tt < a);
		}
		else {
			a = run_diagnostic(v);
			ans[i] = (t > a);
			if (ans[i] && t!=0) {
				g = i; tt = a;
			}
		}
	}
	return ans;
}

Subtask #1
0.0 / 20.0

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

Subtask #2
0.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 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 0 ms 344 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 344 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 608 KB Output is correct
15 Partially correct 0 ms 344 KB Output is partially correct
16 Partially correct 0 ms 344 KB Output is partially correct
17 Partially correct 0 ms 344 KB Output is partially correct
18 Partially correct 0 ms 344 KB Output is partially correct
19 Partially correct 0 ms 344 KB Output is partially correct
20 Incorrect 0 ms 344 KB too many calls
21 Halted 0 ms 0 KB -

Subtask #3
0.0 / 40.0

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