# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
954871 | leo_2727 | Broken Device (JOI17_broken_device) | C++17 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
void Anna( int N, ll X, int K, int P[] ){
int ar[N]={0};
ll curr=0;
for(int i=0;i<K;i++) ar[P[i]]=-1;
int i;
bool br=false;
for(i=0;i<N;i++){
if(br) break;
if(i+2>=N || (ar[i]!=0 && ar[i+1]!=0 && ar[i+2]!=0)){
Set( i, 0 );
continue;
}
Set( i, 1 );
ll b1=X & ((ll)1<<curr);
curr++;
ll b2=X & ((ll)1<<curr);
curr++;
(b1>0) ? Set( i+1, 1 ) : Set( i+1, 0 );
(b2>0) ? Set( i+2, 1 ) : Set( i+2, 0 );
i+=2;
if(curr>62) br=true;
}
for(;i<N;i++) Set( i, 0 );
}
ll Bruno(int N, int A[]){
ll ans=0, curr=0;
bool br=false;
for(int i=0;i<N;i++){
if(i==1){
i+=2;
if(A[i+1]==1) ans|=((ll)1<<curr);
curr++;
if(A[i+2]==1) ans|=((ll)1<<curr);
curr++;
if(curr>62) br=true;
}
if(br) break;
}
return ans;
}