oj.uz

Submission #100063

# Submission time Handle Problem Language Result Execution time Memory
100063 2019-03-09T07:57:21 Z jamielim Broken Device (JOI17_broken_device) C++14
0 / 100
 67 ms 3328 KB 
#include "Annalib.h"
#include <bits/stdc++.h>
using namespace std;

void Anna( int N, long long X, int K, int P[] ){
    int arr[N];
    for(int i=0;i<K;i++){
        arr[P[i]]=-1;
    }
    int poss=0;
    int k=__builtin_ctz(X);
    X>>=k;
    for(int i=0;i<N;i++){
        if(i<poss)continue;
        if(k>0){
            if(arr[i]!=-1){
                k--;
                arr[i]=1;
                arr[i+1]=0;
                poss=i+2;
            }
        }else{
            if(arr[i]!=-1&&arr[i+1]!=-1){
                arr[i]=1;
                arr[i+1]=1;
                poss=i+2;
            }
            X--;
            k=__builtin_ctz(X); X>>=k; k--;
        }
    }
    for(int i=0;i<N;i++){
        if(arr[i]!=1&&arr[i]!=0)arr[i]=0;
        Set(i,arr[i]);
    }
    return;
}

#include "Brunolib.h"
#include <bits/stdc++.h>
using namespace std;

long long Bruno( int N, int A[] ){
    long long ans=0;
    int k=0;
    for(int i=0;i<N;i++){
        if(A[i]==1&&A[i+1]==1){
            ans+=(1<<k);
            k++;
            i++;
        }else if(A[i]==1&&A[i+1]==0){
            k++;
        }
    }
    return ans;
}

Subtask #1
0.0 / 100.0

# Verdict Execution time Memory Grader output
1 Incorrect 50 ms 3056 KB Output isn't correct - L* = 0
2 Incorrect 64 ms 3056 KB Output isn't correct - L* = 0
3 Incorrect 35 ms 3072 KB Output isn't correct - L* = 0
4 Incorrect 35 ms 3072 KB Output isn't correct - L* = 0
5 Incorrect 52 ms 2976 KB Output isn't correct - L* = 0
6 Incorrect 46 ms 3056 KB Output isn't correct - L* = 0
7 Incorrect 54 ms 3056 KB Output isn't correct - L* = 0
8 Incorrect 43 ms 2896 KB Output isn't correct - L* = 0
9 Incorrect 50 ms 3072 KB Output isn't correct - L* = 0
10 Incorrect 42 ms 3056 KB Output isn't correct - L* = 0
11 Incorrect 39 ms 3072 KB Output isn't correct - L* = 0
12 Incorrect 44 ms 3056 KB Output isn't correct - L* = 0
13 Incorrect 48 ms 3328 KB Output isn't correct - L* = 0
14 Incorrect 47 ms 3056 KB Output isn't correct - L* = 0
15 Incorrect 46 ms 3072 KB Output isn't correct - L* = 0
16 Incorrect 44 ms 3072 KB Output isn't correct - L* = 0
17 Incorrect 43 ms 3056 KB Output isn't correct - L* = 0
18 Incorrect 62 ms 3056 KB Output isn't correct - L* = 0
19 Incorrect 50 ms 3056 KB Output isn't correct - L* = 0
20 Incorrect 46 ms 3072 KB Output isn't correct - L* = 0
21 Incorrect 53 ms 3056 KB Output isn't correct - L* = 0
22 Incorrect 43 ms 3056 KB Output isn't correct - L* = 0
23 Incorrect 41 ms 3072 KB Output isn't correct - L* = 0
24 Incorrect 48 ms 3024 KB Output isn't correct - L* = 0
25 Incorrect 50 ms 3056 KB Output isn't correct - L* = 0
26 Incorrect 47 ms 3056 KB Output isn't correct - L* = 0
27 Incorrect 55 ms 3056 KB Output isn't correct - L* = 0
28 Incorrect 36 ms 3072 KB Output isn't correct - L* = 0
29 Incorrect 43 ms 3072 KB Output isn't correct - L* = 0
30 Incorrect 38 ms 3072 KB Output isn't correct - L* = 0
31 Incorrect 38 ms 3072 KB Output isn't correct - L* = 0
32 Incorrect 60 ms 3056 KB Output isn't correct - L* = 0
33 Incorrect 67 ms 3056 KB Output isn't correct - L* = 0
34 Incorrect 45 ms 3056 KB Output isn't correct - L* = 0
35 Incorrect 46 ms 3312 KB Output isn't correct - L* = 0
36 Incorrect 65 ms 3056 KB Output isn't correct - L* = 0
37 Incorrect 38 ms 3056 KB Output isn't correct - L* = 0
38 Incorrect 36 ms 3072 KB Output isn't correct - L* = 0
39 Incorrect 37 ms 3056 KB Output isn't correct - L* = 0
40 Incorrect 42 ms 3072 KB Output isn't correct - L* = 0