oj.uz

Submission #954889

# Submission time Handle Problem Language Result Execution time Memory
954889 2024-03-28T18:55:58 Z leo_2727 Broken Device (JOI17_broken_device) C++17
0 / 100
 30 ms 2812 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}, s[60]={0};
    for(int i=0;i<60;i++)
        if(X & ((ll)1<<i))  s[i]=1;
    for(int i=0;i<K;i++)    ar[P[i]]=-1;
    int curr=0;
    for(int i=0;i<N;i++){
        if(curr>59 || i+2>=N || (ar[i]==-1 || ar[i+1]==-1 || ar[i+2]==-1))
            ar[i]=-1;
        else{
            ar[i]=1;
            ar[i+1]=s[curr++];
            ar[i+2]=s[curr++];
            i+=2;
        }
    }
    for(int i=0;i<N;i++)
        (ar[i]==1)  ?   Set(i, 1)   :   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;
    for(int i=0;i<N;i++){
        if(i==1){
            if(A[i+1]==1)   ans|=((ll)1<<curr);
            curr++;
            if(A[i+2]==1)   ans|=((ll)1<<curr);
            curr++;
            i+=2;
            if(curr>59) break;
        }
    }
    return ans;
}

Subtask #1
0.0 / 100.0

# Verdict Execution time Memory Grader output
1 Partially correct 27 ms 2308 KB Output isn't correct - L* = 0
2 Partially correct 25 ms 2396 KB Output isn't correct - L* = 0
3 Partially correct 26 ms 2396 KB Output isn't correct - L* = 0
4 Partially correct 26 ms 2396 KB Output isn't correct - L* = 0
5 Partially correct 30 ms 2688 KB Output isn't correct - L* = 0
6 Partially correct 25 ms 2404 KB Output isn't correct - L* = 0
7 Partially correct 25 ms 2404 KB Output isn't correct - L* = 0
8 Partially correct 27 ms 2812 KB Output isn't correct - L* = 0
9 Partially correct 30 ms 2392 KB Output isn't correct - L* = 0
10 Partially correct 25 ms 2600 KB Output isn't correct - L* = 0
11 Partially correct 27 ms 2396 KB Output isn't correct - L* = 0
12 Partially correct 26 ms 2504 KB Output isn't correct - L* = 0
13 Partially correct 25 ms 2484 KB Output isn't correct - L* = 0
14 Partially correct 27 ms 2396 KB Output isn't correct - L* = 0
15 Partially correct 25 ms 2396 KB Output isn't correct - L* = 0
16 Partially correct 27 ms 2396 KB Output isn't correct - L* = 0
17 Partially correct 26 ms 2396 KB Output isn't correct - L* = 0
18 Partially correct 26 ms 2392 KB Output isn't correct - L* = 0
19 Partially correct 25 ms 2400 KB Output isn't correct - L* = 0
20 Partially correct 26 ms 2400 KB Output isn't correct - L* = 0
21 Partially correct 25 ms 2584 KB Output isn't correct - L* = 0
22 Partially correct 26 ms 2580 KB Output isn't correct - L* = 0
23 Partially correct 26 ms 2304 KB Output isn't correct - L* = 0
24 Partially correct 26 ms 2456 KB Output isn't correct - L* = 0
25 Partially correct 26 ms 2508 KB Output isn't correct - L* = 0
26 Partially correct 26 ms 2372 KB Output isn't correct - L* = 0
27 Partially correct 25 ms 2392 KB Output isn't correct - L* = 0
28 Partially correct 26 ms 2740 KB Output isn't correct - L* = 0
29 Partially correct 26 ms 2396 KB Output isn't correct - L* = 0
30 Partially correct 25 ms 2408 KB Output isn't correct - L* = 0
31 Partially correct 25 ms 2400 KB Output isn't correct - L* = 0
32 Partially correct 25 ms 2372 KB Output isn't correct - L* = 0
33 Partially correct 26 ms 2396 KB Output isn't correct - L* = 0
34 Partially correct 25 ms 2372 KB Output isn't correct - L* = 0
35 Partially correct 26 ms 2396 KB Output isn't correct - L* = 0
36 Partially correct 25 ms 2452 KB Output isn't correct - L* = 0
37 Partially correct 26 ms 2372 KB Output isn't correct - L* = 0
38 Partially correct 26 ms 2404 KB Output isn't correct - L* = 0
39 Partially correct 25 ms 2392 KB Output isn't correct - L* = 0
40 Partially correct 25 ms 2504 KB Output isn't correct - L* = 0