oj.uz

Submission #954886

# Submission time Handle Problem Language Result Execution time Memory
954886 2024-03-28T18:38:31 Z leo_2727 Broken Device (JOI17_broken_device) C++17
0 / 100
 32 ms 3248 KB 
#include <bits/stdc++.h>
#include <Annalib.h>
typedef long long ll;
using namespace std;
void Anna( int N, ll X, int K, int P[] ){
    int ar[N]={0};
    ll curr=0;
    for(int i=0;i<K;i++)    ar[P[i]]=-1;
    int i;
    bool br=false;
    for(i=0;i<N;i++){
        if(br)  break;
        if(i+2>=N || (ar[i]!=0 || ar[i+1]!=0 || ar[i+2]!=0)){
            Set( i, 0 );
            continue;
        }
        Set( i, 1 );
        ll b1=X & ((ll)1<<curr);
        curr++;
        ll b2=X & ((ll)1<<curr);
        curr++;
        (b1>0)  ?   Set( i+1, 1 )    :   Set( i+1, 0 );
        (b2>0)  ?   Set( i+2, 1 )    :   Set( i+2, 0 );
        i+=2;
        if(curr>62) br=true;
    }
    for(;i<N;i++)   Set( i, 0 );
}
#include <bits/stdc++.h>
#include <Brunolib.h>
typedef long long ll;
using namespace std;
ll Bruno(int N, int A[]){
    ll ans=0, curr=0;
    bool br=false;
    for(int i=0;i<N;i++){
        if(i==1){
            i+=2;
            if(A[i+1]==1)   ans|=((ll)1<<curr);
            curr++;
            if(A[i+2]==1)   ans|=((ll)1<<curr);
            curr++;
            if(curr>62) br=true;
        }
        if(br)  break;
    }
    return ans;
}

Subtask #1
0.0 / 100.0

# Verdict Execution time Memory Grader output
1 Partially correct 26 ms 2776 KB Output isn't correct - L* = 0
2 Partially correct 26 ms 2692 KB Output isn't correct - L* = 0
3 Partially correct 25 ms 2780 KB Output isn't correct - L* = 0
4 Partially correct 26 ms 2636 KB Output isn't correct - L* = 0
5 Partially correct 25 ms 2776 KB Output isn't correct - L* = 0
6 Partially correct 26 ms 2844 KB Output isn't correct - L* = 0
7 Partially correct 26 ms 2672 KB Output isn't correct - L* = 0
8 Partially correct 28 ms 2780 KB Output isn't correct - L* = 0
9 Partially correct 25 ms 2752 KB Output isn't correct - L* = 0
10 Partially correct 25 ms 2848 KB Output isn't correct - L* = 0
11 Partially correct 26 ms 2776 KB Output isn't correct - L* = 0
12 Partially correct 26 ms 2784 KB Output isn't correct - L* = 0
13 Partially correct 27 ms 2776 KB Output isn't correct - L* = 0
14 Partially correct 26 ms 2848 KB Output isn't correct - L* = 0
15 Partially correct 27 ms 2612 KB Output isn't correct - L* = 0
16 Partially correct 27 ms 2872 KB Output isn't correct - L* = 0
17 Partially correct 25 ms 2680 KB Output isn't correct - L* = 0
18 Partially correct 26 ms 2772 KB Output isn't correct - L* = 0
19 Partially correct 26 ms 2776 KB Output isn't correct - L* = 0
20 Partially correct 26 ms 2684 KB Output isn't correct - L* = 0
21 Partially correct 26 ms 3116 KB Output isn't correct - L* = 0
22 Partially correct 25 ms 2712 KB Output isn't correct - L* = 0
23 Partially correct 26 ms 2744 KB Output isn't correct - L* = 0
24 Partially correct 26 ms 2752 KB Output isn't correct - L* = 0
25 Partially correct 32 ms 2740 KB Output isn't correct - L* = 0
26 Partially correct 26 ms 2784 KB Output isn't correct - L* = 0
27 Partially correct 25 ms 2872 KB Output isn't correct - L* = 0
28 Partially correct 28 ms 2888 KB Output isn't correct - L* = 0
29 Partially correct 25 ms 2848 KB Output isn't correct - L* = 0
30 Partially correct 26 ms 2784 KB Output isn't correct - L* = 0
31 Partially correct 26 ms 2768 KB Output isn't correct - L* = 0
32 Partially correct 26 ms 2772 KB Output isn't correct - L* = 0
33 Partially correct 26 ms 2808 KB Output isn't correct - L* = 0
34 Partially correct 25 ms 2704 KB Output isn't correct - L* = 0
35 Partially correct 26 ms 2684 KB Output isn't correct - L* = 0
36 Partially correct 28 ms 2700 KB Output isn't correct - L* = 0
37 Partially correct 26 ms 2776 KB Output isn't correct - L* = 0
38 Partially correct 26 ms 2784 KB Output isn't correct - L* = 0
39 Partially correct 26 ms 2772 KB Output isn't correct - L* = 0
40 Partially correct 26 ms 3248 KB Output isn't correct - L* = 0