# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1114057 | Wansur | Broken Device 2 (JOI22_device2) | 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.
#include "Bruno.h"
#include <bits/stdc++.h>
typedef long long ll;
using namespace std;
int tk = 20;
long long Bruno(vector<int> u) {
int n = (int) u.size();
ll ans = 0, b = 0;
for(int i = 0; i + 1 < (int)u.size(); i++) {
if(u[i] == 0) {
continue;
}
int fg = 0;
for(int j = i + 1; j <= i + tk; j++) {
fg |= u[j];
}
if(fg) {
ans |= (1ll << b);
int cnt = 0, j = i;
while(cnt < tk) {
j++;
cnt += u[j];
}
i = j;
}
b++;
}
return ans;
}