# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
70125 | Just_Solve_The_Problem | Broken Device (JOI17_broken_device) | C++11 | 4 ms | 1084 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 <bits/stdc++.h>
#include "Annalib.h"
//#include "grader.cpp"
using namespace std;
void Anna( int N, long long X, int K, int P[] ){
vector < int > used(N, 0);
vector < int > u(N, 0);
for (int i = 0; i < K; i++) {
used[P[i]] = 1;
}
int cur = 59;
for (int i = 0; i + 1 < N && cur >= 0; i++) {
if ((X >> cur) & 1) {
if (used[i] || used[i + 1]) {
continue;
} else {
u[i] = u[i + 1] = 1;
i++;
cur--;
}
} else {
if (used[i]) {
continue;
} else {
u[i] = 1;
cur--;
i++;
}
}
}
assert(cur == -1);
for (int i = 0; i < N; i++) {
Set(i, u[i]);
}
}
#include <bits/stdc++.h>
#include "Brunolib.h"
#define ll long long
using namespace std;
long long Bruno( int N, int A[] ){
ll ret = 0;
int cur = 59;
for (int i = 0; i + 1 < N; i++) {
if (A[i]) {
if (A[i + 1]) {
ret |= (1LL << cur);
}
i++;
cur--;
}
}
return ret;
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |