# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
991375 | onbert | Broken Device (JOI17_broken_device) | C++17 | 28 ms | 2692 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 int long long
const int m = 37;
void Anna(int32_t n, long long X, int32_t k, int32_t p[]){
int pwr[m+1];
pwr[0] = 1;
for (int i=1;i<=m;i++) pwr[i] = pwr[i-1] * 3;
int a[n];
for (int i=0;i<n;i++) a[i] = 1;
for (int i=0;i<k;i++) a[p[i]] = 0;
for (int i=0;i<n;i+=2) {
int val = X%3;
int x = 1, y = 1;
if (val==0) x = 0, y = 1;
if (val==1) x = 1, y = 0;
if (((!a[i]) && x) || ((!a[i+1]) && y)) {
a[i] = a[i+1] = 0;
continue;
}
a[i] = x, a[i+1] = y;
X /= 3;
}
for (int i=0;i<n;i++) Set(i, (int32_t)a[i]);
}
#include "Brunolib.h"
#include <bits/stdc++.h>
using namespace std;
#define int long long
const int m = 37;
long long Bruno(int32_t n, int32_t a[]){
int pwr[m+1];
pwr[0] = 1;
for (int i=1;i<=m;i++) pwr[i] = pwr[i-1] * 3;
int x = 0;
int cur = 0;
for (int i=0;i<n && cur<=m;i+=2) if (a[i]==1 || a[i+1]==1) {
if (a[i]==1 && a[i+1]==0) x += pwr[cur];
if (a[i]==1 && a[i+1]==1) x += 2*pwr[cur];
cur++;
}
return x;
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |