oj.uz

답안 #911992

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
911992 2024-01-19T06:54:36 Z dsyz Coreputer (IOI23_coreputer) C++17
80 / 100
 1 ms 808 KB 
#include <bits/stdc++.h>
#include "coreputer.h"
using namespace std;
using ll = long long;
#define MAXN (1000005)

vector<int> malfunctioning_cores(int N) {
	ll high = N - 1;
	ll low = -1;
	while(high - low > 1){ //binary search for leftmost position such that prefix sum of malfunctioning cores > half of total malfunctioning cores
		ll mid = (high + low) / 2;
		vector<int> T;
		for(ll i = 0;i <= mid;i++){
			T.push_back(i);
		}
		ll a = run_diagnostic(T);
		if(a == 1){
			high = mid;
		}else{
			low = mid;
		}
	}
	ll checked = 1;
	ll parity = 0; //parity of total number of malfunctioning cores
	vector<ll> malfunctioning;
	malfunctioning.push_back(high);
	for(ll i = 0;i < high;i++){
		vector<int> T;
		for(ll j = 0;j <= high;j++){
			if(i == j) continue;
			T.push_back(j);
		}
		ll a = run_diagnostic(T);
		if(a == 0){
			parity = 0;
			malfunctioning.push_back(i);
		}else if(a == -1){
			parity = 1;
			malfunctioning.push_back(i);
		}
		checked++;
	}
	for(ll i = high + 1;i < N && malfunctioning.size() >= 2;i++){
		vector<int> T;
		for(ll j = high;j < N;j++){
			if(i == j) continue;
			T.push_back(j);
		}
		ll a = run_diagnostic(T);
		if(a == -1){
			malfunctioning.push_back(i);
		}
		checked++;
	}
	vector<int> ans;
	for(ll i = 0;i < N;i++){
		ans.push_back(0);
	}
	for(auto u : malfunctioning){
		ans[u] = 1;
	}
	return ans;
}

Compilation message

coreputer.cpp: In function 'std::vector<int> malfunctioning_cores(int)':
coreputer.cpp:24:5: warning: variable 'parity' set but not used [-Wunused-but-set-variable]
   24 |  ll parity = 0; //parity of total number of malfunctioning cores
      |     ^~~~~~

Subtask #1
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 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

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 1 ms 596 KB Output is correct
4 Correct 1 ms 344 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 0 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 0 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 1 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 1 ms 344 KB Output is correct
18 Correct 1 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 0 ms 344 KB Output is correct
22 Correct 0 ms 344 KB Output is correct
23 Correct 1 ms 344 KB Output is correct
24 Correct 0 ms 344 KB Output is correct
25 Correct 1 ms 516 KB Output is correct
26 Correct 0 ms 344 KB Output is correct
27 Partially correct 1 ms 344 KB Output is partially correct
28 Partially correct 1 ms 344 KB Output is partially correct
29 Partially correct 0 ms 344 KB Output is partially correct
30 Partially correct 1 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 Partially correct 1 ms 344 KB Output is partially correct
36 Partially correct 1 ms 344 KB Output is partially correct
37 Partially correct 1 ms 344 KB Output is partially correct
38 Partially correct 1 ms 344 KB Output is partially correct

Subtask #3
30.0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 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 0 ms 344 KB Output is correct
6 Correct 1 ms 596 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Correct 1 ms 340 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 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 1 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 0 ms 344 KB Output is correct
19 Correct 1 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 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 Correct 0 ms 344 KB Output is correct
28 Correct 1 ms 516 KB Output is correct
29 Correct 0 ms 344 KB Output is correct
30 Partially correct 1 ms 344 KB Output is partially correct
31 Partially correct 1 ms 344 KB Output is partially correct
32 Partially correct 0 ms 344 KB Output is partially correct
33 Partially correct 1 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 Partially correct 1 ms 344 KB Output is partially correct
39 Partially correct 1 ms 344 KB Output is partially correct
40 Partially correct 1 ms 344 KB Output is partially correct
41 Partially correct 1 ms 344 KB Output is partially 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 Correct 0 ms 344 KB Output is correct
47 Correct 0 ms 344 KB Output is correct
48 Correct 0 ms 344 KB Output is correct
49 Correct 0 ms 344 KB Output is correct
50 Correct 0 ms 344 KB Output is correct
51 Correct 1 ms 344 KB Output is correct
52 Correct 1 ms 344 KB Output is correct
53 Correct 0 ms 344 KB Output is correct
54 Correct 1 ms 808 KB Output is correct
55 Correct 0 ms 344 KB Output is correct
56 Correct 0 ms 404 KB Output is correct
57 Correct 0 ms 344 KB Output is correct
58 Correct 1 ms 344 KB Output is correct
59 Correct 0 ms 344 KB Output is correct
60 Correct 1 ms 344 KB Output is correct
61 Correct 1 ms 344 KB Output is correct
62 Correct 1 ms 344 KB Output is correct
63 Correct 1 ms 344 KB Output is correct
64 Correct 1 ms 344 KB Output is correct
65 Correct 0 ms 344 KB Output is correct
66 Correct 1 ms 344 KB Output is correct
67 Correct 1 ms 344 KB Output is correct
68 Correct 0 ms 344 KB Output is correct
69 Correct 0 ms 344 KB Output is correct
70 Correct 1 ms 344 KB Output is correct
71 Correct 0 ms 344 KB Output is correct
72 Partially correct 0 ms 344 KB Output is partially correct
73 Partially correct 0 ms 344 KB Output is partially correct
74 Partially correct 1 ms 344 KB Output is partially correct
75 Partially correct 0 ms 344 KB Output is partially correct
76 Partially correct 1 ms 344 KB Output is partially correct
77 Partially correct 1 ms 344 KB Output is partially correct
78 Partially correct 1 ms 344 KB Output is partially correct
79 Correct 0 ms 344 KB Output is correct
80 Correct 1 ms 344 KB Output is correct
81 Correct 0 ms 344 KB Output is correct
82 Partially correct 1 ms 344 KB Output is partially correct