# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
112568 | tincamatei | Broken Device (JOI17_broken_device) | C++14 | 83 ms | 3072 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>
const int MAX_N = 150;
bool broken[MAX_N];
void Anna(int N, long long X, int k, int P[]) {
int lb = 0;
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; i < N; i += 2) {
if(broken[i] || broken[i + 1] || lb >= 62) {
Set(i, 0);
Set(i + 1, 0);
} else if(lb < 62) {
Set(i, 1);
Set(i + 1, ((1LL << lb) & X) > 0);
++lb;
}
}
}
#include "Brunolib.h"
#include <cstdio>
long long Bruno(int N, int A[]) {
int lb = 0;
long long rez = 0LL;
for(int i = 0; i < N; i += 2) {
if(lb < 62 && A[i] == 1) {
rez = ((((long long)A[i + 1]) << lb) | rez);
++lb;
}
}
return rez;
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |