// correct/solution-subtask2.cpp
#include "coreputer.h"
#include <iostream>
std::vector<int> malfunctioning_cores(int N) {
std::vector<int> T;
std::vector<int> c(N);
std::vector<int> results(N);
for(int i=0; i<N; i++) c[i] = 0;
int a = 0, b = N-1;
int finish = 0;
while(a!=b){
int half = (a+b)/2;
T.clear();
for(int i=0; i<=half; i++) T.push_back(i);
results[half] = run_diagnostic(T);
if(results[half]>=0){
b = half;
} else {
a = half+1;
}
}
finish = 0;
int h = a;
c[h] = 1;
if(h!=N-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(run_diagnostic(T)==-1) c[i] = 1;
}
h--;
for(int i=h+2; i<N-1; i++){
T.clear();
for(int j=h+1; j<N; j++){
if(i!=j) T.push_back(j);
}
if(run_diagnostic(T)<=0) c[i] = 1;
}
int fp = 0, sp = 0;
for(int i=0; i<=h+1; i++) fp += c[i];
for(int i=h+2; i<N; i++) sp += c[i];
if((finish == 0 && fp > sp) || (finish == 1 && fp-1 > sp)) c[N-1] = 1;
}
return c;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
0 ms |
208 KB |
Incorrect |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 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 |
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 |
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 |
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 |
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 |
0 ms |
208 KB |
Output is correct |
29 |
Correct |
0 ms |
208 KB |
Output is correct |
30 |
Correct |
0 ms |
208 KB |
Output is correct |
31 |
Correct |
0 ms |
208 KB |
Output is correct |
32 |
Correct |
0 ms |
208 KB |
Output is correct |
33 |
Correct |
0 ms |
208 KB |
Output is correct |
34 |
Correct |
0 ms |
208 KB |
Output is correct |
35 |
Correct |
1 ms |
208 KB |
Output is correct |
36 |
Correct |
0 ms |
208 KB |
Output is correct |
37 |
Correct |
0 ms |
208 KB |
Output is correct |
38 |
Correct |
0 ms |
208 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
0 ms |
208 KB |
Incorrect |
2 |
Halted |
0 ms |
0 KB |
- |