# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
100097 | rocketninja7 | Broken Device (JOI17_broken_device) | C++14 | 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.
#include "Brunolib.h"
#include <vector>
using namespace std;
long long Bruno( int N, int A[] ){
vector<int> available;
for(int i=0;i<N;i++){
if(A[i]==1){
available.push_back(i);
i+=2;
}
}
long long ans=0;
for(int i=0;i<available.size();i++){
if(A[available[i]+1]){
ans+=(1LL<<(2*i));
}
if(A[available[i]+2]){
ans+=(1LL<<(2*i+1));
}
}
return ans;
}
#include "Brunolib.h"
#include <vector>
using namespace std;
long long Bruno( int N, int A[] ){
vector<int> available;
for(int i=0;i<N;i++){
if(A[i]==1){
available.push_back(i);
i+=2;
}
}
long long ans=0;
for(int i=0;i<available.size();i++){
if(A[available[i]+1]){
ans+=(1LL<<(2*i));
}
if(A[available[i]+2]){
ans+=(1LL<<(2*i+1));
}
}
return ans;
}