#include "coreputer.h"
#include <bits/stdc++.h>
using namespace std;
vector<int>malfunctioning_cores(int n) {
int l=0;
int r=n-1;
int mid;
int 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>se;
for(int x=best;x<n;x++){
vector<int>v;
for(int y=0;y<=x;y++){
if(se.find(y)!=se.end()) continue;
v.push_back(y);
}
int hold=run_diagnostic(v);
if(hold==1||hold==0){
se.insert(x);
}
}
int best2=n;
set<int>se2;
best2=*se.begin();
se2.insert(*se.begin());
se.erase(se.begin());
se2.insert(*se.begin());
se.erase(se.begin());
for(int x=best2-1;x>=0;x--){
vector<int>v;
for(int y=n-1;y>=x;y--){
if(se2.find(y)!=se2.end()) continue;
v.push_back(y);
}
int hold=run_diagnostic(v);
if(hold==1||hold==0){
se2.insert(x);
}
}
for(auto it:se2) se.insert(it);
vector<int>ans;
for(int x=0;x<n;x++){
if(se.find(x)==se.end()) ans.push_back(0);
else ans.push_back(1);
}
return ans;
}
//code
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Execution timed out |
3037 ms |
344 KB |
Time limit exceeded |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
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 |
1 ms |
344 KB |
Output is correct |
| 6 |
Correct |
1 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 |
596 KB |
Output is correct |
| 11 |
Correct |
0 ms |
344 KB |
Output is correct |
| 12 |
Correct |
1 ms |
344 KB |
Output is correct |
| 13 |
Correct |
0 ms |
344 KB |
Output is correct |
| 14 |
Correct |
1 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 |
0 ms |
344 KB |
Output is correct |
| 19 |
Correct |
0 ms |
344 KB |
Output is correct |
| 20 |
Partially correct |
0 ms |
344 KB |
Output is partially correct |
| 21 |
Partially correct |
0 ms |
344 KB |
Output is partially correct |
| 22 |
Partially correct |
1 ms |
340 KB |
Output is partially correct |
| 23 |
Partially correct |
0 ms |
344 KB |
Output is partially correct |
| 24 |
Partially correct |
1 ms |
344 KB |
Output is partially correct |
| 25 |
Partially correct |
0 ms |
344 KB |
Output is partially correct |
| 26 |
Partially correct |
0 ms |
596 KB |
Output is partially correct |
| 27 |
Partially correct |
1 ms |
344 KB |
Output is partially correct |
| 28 |
Partially correct |
0 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 |
0 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 |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Execution timed out |
3037 ms |
344 KB |
Time limit exceeded |
| 2 |
Halted |
0 ms |
0 KB |
- |
