| # | Time | Username | Problem | Language | Result | Execution time | Memory | 
|---|---|---|---|---|---|---|---|
| 1077163 | AMO5 | Broken Device (JOI17_broken_device) | C++17 | 1 ms | 1056 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"
void Anna( int N, long long X, int K, int P[] ){
    std::vector<int>bad(N, 0);
    for(int i=0; i<K; i++)bad[P[i]]=1;
    long long tmp = X;
    for(int i=0; i<N; i++){
        if(bad[i] || (i + 1 < N && bad[i+1]) || tmp == 0){
            Set(i, 0);
        }else{
            int bit = tmp % 2;
            Set(i, 1);
            Set(i+1, bit);
            i++;
            tmp /= 2;
        }
    }
}
#include "Brunolib.h"
#include "bits/stdc++.h"
long long Bruno( int N, int A[] ){
    std::vector<int>bits;
    for(int i=0; i<N; i++){
        if(A[i] == 0)continue;
        else{
            bits.emplace_back(A[i+1]);
            i++;
        }
    }
    long long answer = 0LL;
    while(!bits.empty()){
        answer *= 2LL;
        answer += bits.back();
        bits.pop_back();
    }
    return answer;
}
| # | Verdict | Execution time | Memory | Grader output | 
|---|---|---|---|---|
| Fetching results... | ||||
