| # | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 24099 | jiaqiyang | Broken Device (JOI17_broken_device) | C++14 | 55 ms | 2836 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 <cstdio>
#include <cstring>
typedef long long i64;
static bool ans[200];
inline void append(int x, bool a, bool b, bool c) {
ans[x] = a;
ans[x + 1] = b;
ans[x + 2] = c;
}
void Anna(int n, i64 x, int k, int p[]) {
static bool flag[200];
memset(flag, 0, sizeof flag);
for (int i = 0; i < k; ++i) flag[p[i]] = true;
memset(ans, 0, sizeof ans);
for (int i = 0; i < n; i += 3) {
int cnt = flag[i] + flag[i + 1] + flag[i + 2];
if (cnt > 1) continue;
if (flag[i]) {
if (x & 1) append(i, 0, 1, 0); else append(i, 0, 0, 1);
x >>= 1;
} else if (flag[i + 1]) {
if (x & 1) append(i, 1, 0, 1); else append(i, 0, 0, 1);
x >>= 1;
} else if (flag[i + 2]) {
if (x & 1) {
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||