# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
109468 | popovicirobert | Broken Device (JOI17_broken_device) | C++14 | 66 ms | 3584 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;
void Anna( int N, long long X, int K, int P[] ){
vector <int> arr(N);
int i;
for(i = 0; i < K; i++) {
arr[P[i]] = 1;
}
vector <int> sol(N);
i = 0;
while(i < N - 1) {
if(arr[i] + arr[i + 1]) {
sol[i] = sol[i + 1] = 0;
}
else {
if(X & 1) {
sol[i] = 1;
sol[i + 1] = 0;
}
else {
sol[i] = sol[i + 1] = 1;
}
X >>= 1;
}
i += 2;
}
for(i = 0; i < N; i++) {
Set(i, sol[i]);
}
}
#include "Brunolib.h"
#include <bits/stdc++.h>
#define ll long long
long long Bruno( int N, int A[] ){
ll ans = 0, pw = 1;
int i = 0;
while(i < N - 1) {
int cur = A[i] + A[i + 1];
if(cur == 1) {
ans += pw;
pw *= 2;
}
else if(cur == 2) {
pw *= 2;
}
i += 2;
}
return ans;
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |