# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1034983 | adaawf | 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.
#include "Annalib.h"
#include <bits/stdc++.h>
using namespace std;
int dd[1005];
void Anna(int N, long long int X, int K, int P[]) {
for (int i = 0; i < K; i++) {
dd[P[i]] = 1;
}
int z = 0, t = 0;
string s = "";
for (int i = 0; i < 60; i++) {
if (X & (1ll << i)) {
s += '1';
}
else s += '0';
Set(i, s[i] - '0');
}
z = s.size() - 1;
while (z >= t) {
if (s[t] == '0' || dd[t] == 1) {
if (s[t] == '0') {
z++;
s += '1';
Set(z, 1);
}
else {
z++;
s += '0';
Set(z, 0);
}
}
t++;
}
for (int i = s.size(); i < N; i++) Set(i, 0);
}
#include "Brunolib.h"
#include <bits/stdc++.h>
long long int Bruno(int N, int A[]) {
int z = 0;
vector<int> v, res(61, 0);
while (!v.empty()) {
vector<int> vv;
for (int i = z; i < z + v.size(); i++) {
if (A[i] == 0) {
res[v[i - z]] ^= 1;
vv.push_back(v[i - z]);
}
}
z += v.size();
v = vv;
}
long long int c = 0;
for (int i = 0; i < 60; i++) {
if (res[i] == 1) {
c += (1ll << i);
}
}
return c;
}