# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
718832 | Hacv16 | Broken Device (JOI17_broken_device) | C++17 | 40 ms | 2596 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 <bits/stdc++.h>
using namespace std;
typedef long long ll;
void Anna(int N, ll X, int K, int P[]){
vector<bool> blocked(N);
for(int i = 0; i < K; i++){
int curBit = P[i];
blocked[curBit] = true;
}
for(int i = 0, j = 0; i < N; i += 2){
if(blocked[i] || (i != N - 1 && blocked[i + 1])){ Set(i, 0); Set(i + 1, 0); }
else{ int bitOn = (bool)((1LL << j) & X); Set(i, 1); Set(i + 1, bitOn); j++; }
}
}
#include "Brunolib.h"
#include <bits/stdc++.h>
typedef long long ll;
ll Bruno(int N, int A[]){
ll ans = 0;
for(int i = 0, j = 0; i < N; i += 2){
if(A[i] == 0) continue;
ans |= (((ll) A[i + 1]) << j); j++;
}
return ans;
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |