# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
334257 | dolphingarlic | Broken Device (JOI17_broken_device) | C++14 | 54 ms | 3144 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"
void Anna(int N, long long X, int K, int P[]) {
bool broken[150];
for (int i = 0; i < N; i++) broken[i] = false;
for (int i = 0; i < K; i++) broken[P[i]] = true;
for (int i = 0, j = 0; i < N; i += 3) {
if (j > 60) Set(i, 0), Set(i + 1, 0), Set(i + 2, 0);
else if (!broken[i] && !broken[i + 1] && !broken[i + 2]) {
Set(i, 1);
Set(i + 1, (X & (1ll << j)) >> j);
Set(i + 2, (X & (1ll << j + 1)) >> j + 1);
j += 2;
} else if ((X & (1ll << j)) && !broken[i + 1] && !broken[i + 2]) {
Set(i, 0), Set(i + 1, 1), Set(i + 2, 1);
j++;
} else if (!(X & (1ll << j)) && (!broken[i + 1] || !broken[i + 2])) {
Set(i, 0);
if (!broken[i + 1]) Set(i + 1, 1), Set(i + 2, 0);
else Set(i + 1, 0), Set(i + 2, 1);
j++;
} else Set(i, 0), Set(i + 1, 0), Set(i + 2, 0);
}
}
#include "Brunolib.h"
long long Bruno(int N, int A[]) {
long long ans = 0;
for (int i = 0, j = 0; i < N && j <= 60; i += 3) {
if (A[i]) {
ans += A[i + 1] * (1ll << j) + A[i + 2] * (1ll << j + 1);
j += 2;
} else if (A[i + 1] || A[i + 2]) {
ans += (A[i + 1] + A[i + 2] - 1) * (1ll << j);
j++;
}
}
return ans;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |