# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
26808 | wangyenjen | Broken Device (JOI17_broken_device) | C++14 | 52 ms | 4636 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.
/// Author: Wang, Yen-Jen
#include "Annalib.h"
#include <bits/stdc++.h>
using namespace std;
static bool st[150];
void Anna(int N , long long X , int K , int P[]) {
memset(st , 0 , sizeof(st));
for(int i = 0; i < K; i++) st[P[i]] = 1;
int c = 0;
for(int i = 0; i < N; i++) {
if(c == 60) Set(i , 0);
else {
if(i + 1 < N && !st[i] && !st[i + 1]) {
Set(i , 1);
Set(i + 1 , ((X>>c)&1));
c++;
i++;
}
else Set(i , 0);
}
}
}
/// Author: Wang, Yen-Jen
#include "Brunolib.h"
#include <bits/stdc++.h>
using namespace std;
long long Bruno(int N , int A[]) {
long long X = 0;
int cc = 0;
for(int i = 0; i < N - 1; i++) {
if(cc == 60) break;
if(A[i]) {
if(A[i + 1]) X |= (1ll<<cc);
cc++;
i++;
}
}
return X;
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |