#include <bits/stdc++.h>
using namespace std;
int run_diagnostic(std::vector<int> T);
vector<int> malfunctioning_cores(int n)
{
int l = 0, r = n - 1, mid = 0, best = n - 1;
while (l <= r)
{
mid = (l + r) / 2;
vector<int> v;
for (int x = 0; x <= mid; x++)
v.push_back(x);
int hold = run_diagnostic(v);
if (hold == 1 || hold == 0)
{
best = mid;
r = mid - 1;
}
else
l = mid + 1;
}
set<int> st;
for (int x = best; x < n; x++)
{
vector<int> v;
for (int y = 0; y <= x; y++)
{
if (st.find(y) != st.end())
continue;
v.push_back(y);
}
int hold = run_diagnostic(v);
if (hold == 1 || hold == 0)
st.insert(x);
}
set<int> st1;
int best2 = n;
if (st.size() % 2 == 0)
{
best2 = *st.begin();
st1.insert(*st.begin());
st.erase(st.begin());
st1.insert(*st.begin());
st.erase(st.begin());
}
else
{
best2 = *st.begin();
st1.insert(*st.begin());
st.erase(st.begin());
}
for (int x = best2 - 1; x >= 0; x--)
{
vector<int> v;
for (int y = n - 1; y >= x; y--)
{
if (st1.find(y) != st1.end())
continue;
v.push_back(y);
}
int hold = run_diagnostic(v);
if (hold == 1 || hold == 0)
{
st1.insert(x);
}
}
for (auto it : st1)
st.insert(it);
vector<int> ans;
for (int x = 0; x < n; x++)
{
if (st.find(x) == st.end())
ans.push_back(0);
else
ans.push_back(1);
}
return ans;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
596 KB |
Output is correct |
2 |
Correct |
0 ms |
596 KB |
Output is correct |
3 |
Correct |
0 ms |
344 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
344 KB |
Output is correct |
2 |
Correct |
0 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 |
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 |
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 |
0 ms |
344 KB |
Output is correct |
17 |
Correct |
1 ms |
344 KB |
Output is correct |
18 |
Incorrect |
0 ms |
344 KB |
Incorrect |
19 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
596 KB |
Output is correct |
2 |
Correct |
0 ms |
596 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 |
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 |
1 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 |
0 ms |
344 KB |
Output is correct |
16 |
Correct |
0 ms |
344 KB |
Output is correct |
17 |
Correct |
0 ms |
344 KB |
Output is correct |
18 |
Correct |
1 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 |
Incorrect |
0 ms |
344 KB |
Incorrect |
22 |
Halted |
0 ms |
0 KB |
- |