# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
21025 | joisino | Broken Device (JOI17_broken_device) | C++14 | 62 ms | 2836 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 <cassert>
static int dat[150];
static int it;
static int ans[150];
void Anna( int N, long long X, int K, int P[] ){
it = 0;
for( int i = 0; i < N; i++ ){
dat[i] = ans[i] = 0;
}
while( X > 0 ){
dat[it++] = X % 2;
X /= 2;
}
if( P[0] >= 75 ){
ans[74] = 1;
for( int i = 0; i < 60; i++ ){
ans[i] = dat[i];
}
} else {
ans[149] = 1;
for( int i = 0; i < 60; i++ ){
ans[75+i] = dat[i];
}
}
for( int i = 0; i < N; i++ ){
Set( i, ans[i] );
}
}
#include "Brunolib.h"
#include <cstdio>
static int it;
static int dat[150];
long long Bruno( int N, int A[] ){
it = 0;
for( int i = 0; i < N; i++ ){
dat[i] = 0;
}
if( A[74] == 1 ){
for( int i = 0; i < 60; i++ ){
dat[i] = A[i];
}
} else {
for( int i = 0; i < 60; i++ ){
dat[i] = A[75+i];
}
}
long long d = 1;
long long ans = 0;
for( int i = 0; i < 60; i++ ){
if( dat[i] == 1 ){
ans += d;
}
d *= 2;
}
return ans;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |