# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
61192 | ainta | Broken Device (JOI17_broken_device) | C++17 | 77 ms | 3840 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"
int v[200], res[220];
void Anna( int N, long long X, int K, int P[] ){
int i, j, k;
for (i = 0; i < N; i++)res[i] = v[i] = 0;
for (i = 0; i < K; i++) {
v[P[i]] = 1;
}
for (i = 0; i < N; i+=3) {
if (v[i] + v[i + 1] + v[i+2] >= 2)continue;
if (v[i] + v[i + 1] + v[i + 2] == 1) {
if (X % 2 == 0) {
if (v[i]) {
res[i + 2] = 1;
}
if (v[i + 1]) {
res[i + 2] = 1;
}
if (v[i + 2]) {
res[i] = res[i + 1] = 1;
}
}
else {
if (v[i]) {
if (X % 4 == 1) {
res[i + 1] = 1;
}
else {
res[i + 1] = res[i + 2] = 1;
}
X /= 2;
}
if (v[i + 1]) {
res[i] = 1;
}
if (v[i + 2]) {
res[i] = 1;
}
}
X /= 2;
}
else {
res[i] = res[i + 1] = res[i + 2] = 1;
if (X % 4 == 1) res[i] = res[i + 2] = 0;
if (X % 4 == 2) res[i + 1] = 0;
if (X % 4 == 3) res[i] = 0;
X /= 4;
}
}
for (i = 0; i < N; i++)Set(i, res[i]);
}
#include "Brunolib.h"
#include <algorithm>
using namespace std;
#define pii pair<int,int>
pii Get(int x, int y, int z) {
int t = x * 4 + y * 2 + z;
if (t == 7)return pii(0,4);
if (t == 6)return pii(0,2);
if (t == 5)return pii(2,4);
if (t == 4)return pii(1,2);
if (t == 3)return pii(3,4);
if (t == 2)return pii(1,4);
if (t == 1)return pii(0,2);
if (t == 0)return pii(0,1);
}
long long Bruno( int N, int A[] ){
int i;
long long res = 0;
for (i = N-3; i >=0; i-=3) {
pii tp = Get(A[i], A[i + 1], A[i + 2]);
res = res*tp.second + tp.first;
}
return res;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |