# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
753740 | piOOE | Broken Device (JOI17_broken_device) | C++17 | 46 ms | 2668 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 set(int i, int x, int y, int z) {
Set(i, x), Set(i + 1, y), Set(i + 2, z);
}
void Anna(int N, long long X, int K, int P[]) {
bool used[150]{};
for (int i = 0; i < K; ++i) {
used[P[i]] = true;
}
for (int i = 0, c = 0; i < N; i += 3) {
if (!used[i]) {
set(i, 1, X >> c & 1, X >> (c + 1) & 1);
c += 2;
} else {
set(i, 0, X >> c & 1, X >> c & 1);
c += 1;
}
}
}
#include "Brunolib.h"
long long Bruno(int N, int A[]) {
long long X = 0;
for (int i = 0, c = 0; i < N; i += 3) {
if (A[i]) {
X += (A[i + 1] + A[i + 2] * 2LL) << c;
c += 2;
} else {
X += ((long long) (A[i + 1] || A[i + 2])) << c;
c += 1;
}
}
return X;
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |