# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
313383 | ly20 | Broken Device (JOI17_broken_device) | C++17 | 53 ms | 3328 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"
void Anna( int N, long long X, int K, int P[] ){
bool rs[200], marc[200];
int n = N, k = K;
for(int i = 0; i < n; i++) {
rs[i] = 0;
marc[i] = 0;
}
for(int i = 0; i < k; i++) {
marc[P[i]] = 1;
}
long long pot = 59;
for(int i = 0; i < n - 1; i++) {
if(pot < 0) break;
if(marc[i] == 0 && marc[i + 1] == 0) {
rs[i] = 1;
if((1LL << pot) & X) rs[i + 1] = 1;
else rs[i + 1] = 0;
i++;
pot--;
}
}
for( int i = 0; i < N; i++ ){
Set( i, rs[i] );
}
}
#include "Brunolib.h"
long long Bruno( int N, int A[] ){
long long pot = 59;
long long resp = 0;
for(int i = 0; i < N - 1; i++) {
if(pot < 0) break;
if(A[i] == 1) {
resp += ((long long) A[i + 1] << pot);
i++;
pot--;
}
}
return resp;
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |