# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
260529 | sjimed | Broken Device (JOI17_broken_device) | C++14 | 49 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;
#define fast ios::sync_with_stdio(false); cin.tie(0);
#define fi first
#define se second
#define em emplace
#define eb emplace_back
#define all(v) (v).begin(), (v).end()
#define mp make_pair
void Anna( int N, long long X, int K, int P[] ){
int chk[222] = {};
for(int i=0; i<K; i++) {
chk[P[i]] = 0;
}
for(int i=0, j=0; i<N; i+=3) {
if(!chk[i] && !chk[i+1] && !chk[i+2]) {
if(((X >> j) & 3LL) == 3) chk[i] = chk[i+1] = chk[i+2] = 1;
if(((X >> j) & 3LL) == 2) chk[i] = 1, chk[i+1] = 0, chk[i+2] = 1;
if(((X >> j) & 3LL) == 1) chk[i] = 0, chk[i+1] = 1, chk[i+2] = 0;
if(((X >> j) & 3LL) == 0) chk[i] = 0, chk[i+1] = chk[i+2] = 1;
j += 2;
}
else if(chk[i] + chk[i+1] + chk[i+2] == 1) {
if(chk[i]) {
if((X >> j) & 1LL) chk[i] = chk[i+1] = 0, chk[i+2] = 1;
else if((X >> j+1) & 1LL) chk[i] = 0, chk[i+1] = 1, chk[i+2] = 0, j++;
else chk[i] = 0, chk[i+1] = chk[i+2] = 1, j++;
j++;
}
else if(chk[i+1]) {
if((X >> j) & 1LL) chk[i] = chk[i+1] = 0, chk[i+2] = 1;
else chk[i] = 1, chk[i+1] = chk[i+2] = 0;
j++;
}
else {
if((X >> j) & 1LL) chk[i] = chk[i+1] = 1, chk[i+2] = 0;
else chk[i] = 1, chk[i+1] = chk[i+2] = 0;
j++;
}
}
else chk[i] = chk[i+1] = chk[i+2] = 0;
}
for(int i=0; i<N; i++) Set(i, chk[i]);
}
#include "Brunolib.h"
#include<bits/stdc++.h>
using namespace std;
#define fast ios::sync_with_stdio(false); cin.tie(0);
#define fi first
#define se second
#define em emplace
#define eb emplace_back
#define all(v) (v).begin(), (v).end()
#define mp make_pair
typedef long long ll;
long long Bruno( int N, int A[] ){
ll ans = 0;
for(int i=0, j=0; i<N; i++) {
int x = A[i]*4 + A[i+1]*2 + A[i+2];
if(x == 7) ans |= 3LL << j, j+=2;
else if(x == 5) ans |= 2LL << j, j+=2;
else if(x == 2) ans |= 1LL << j, j+=2;
else if(x == 3) j+=2;
else if(x == 4) j++;
else if(x == 1 || x == 6) ans |= 1LL << j, j++;
}
return ans;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |