# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1228727 | PenguinsAreCute | Broken Device (JOI17_broken_device) | C++17 | 13 ms | 1856 KiB |
#include "Annalib.h"
#include <bits/stdc++.h>
using namespace std;
void Anna( int N, long long X, int K, int P[] ){
int cnt = 0;
for(int i=0;i<=K;i++) {
int l = (i ? P[i-1] + 1 : 0);
int r = (i < K ? P[i] - 1 : N - 1);
printf("fill %d %d\n",l,r);
if(l > r)
continue;
while(l + 2 <= r) {
Set(l, 1);
Set(l + 1, !!(X & (1LL << (cnt++))));
Set(l + 2, !!(X & (1LL << (cnt++))));
l += 3;
}
while(l <= r)
Set(l++, 0);
}
for(int i=0;i<K;i++)
Set(P[i], 0);
}
#include "Brunolib.h"
#include <bits/stdc++.h>
using namespace std;
long long Bruno( int N, int A[] ){
long long X = 0;
int cnt = 0;
for(int i=0;i<N;) {
if(A[i]) {
X |= A[i+1] * (1LL << (cnt++));
X |= A[i+2] * (1LL << (cnt++));
i += 3;
} else
i++;
}
return X;
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |