# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1144535 | erering | Broken Device (JOI17_broken_device) | C++20 | 0 ms | 320 KiB |
#include <bits/stdc++.h>
#include "Annalib.h"
using namespace std;
void Anna( int N, long long X, int K, int P[] ){
bool bad[N];
for(int i=0;i<N;i++)bad[i]=0;
for(int i=0;i<K;i++){
bad[P[i]]=1;
}
long long bit[60],cnt=0;
while(X>0){
bit[cnt]=X%2;
X/=2; cnt++;
}
cnt=0;
for( int i = 0; i < N-1; i++ ){
if(!bad[i] && !bad[i+1]) {
Set(i + 1, 1);
Set(i, bit[cnt++]);
i++;
}
else Set(i,0);
}
}
#include <bits/stdc++.h>
#include "Brunolib.h"
using namespace std;
long long Bruno( int N, int A[] ){
long long cnt=0,ans=0;
for(int i=0;i<N-1;i++){
if(A[i]==1){
ans+=(1<<cnt)*A[i+1];
i++;
cnt++;
}
}
return ans;
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |