oj.uz

Submission #97555

# Submission time Handle Problem Language Result Execution time Memory
97555 2019-02-17T03:28:17 Z silxikys Broken Device (JOI17_broken_device) C++14
0 / 100
 73 ms 3568 KB 
#include "Annalib.h"
#include <vector>

void Anna(int N, long long X, int K, int P[]) {
    int pos = 0;
    std::vector<int> ans(N,-1);
    for (int i = 0; i < K; i++) {
        ans[P[i]] = 0;
    }
    for (int i = 0; i < N; i += 2) {
        if (ans[i] == 0 || ans[i+1] == 0) {
            ans[i] = 0;
            ans[i+1] = 0;
        }
        else {
            if (pos > 60) {
                ans[i] = 0;
                ans[i+1] = 0;
                continue;
            }
            int b = ((1LL<<pos) & X);
            if (b == 0) {
                ans[i] = 0;
                ans[i+1] = 1;
            }
            else {
                ans[i] = 1;
                ans[i+1] = 1;
            }
            pos++;
        }
    }
    for (int i = 0; i < N; i++) {
        //assert(ans[i] == 0 || ans[i] == 1);
        Set(i,ans[i]);            
    }
}

#include "Brunolib.h"

long long Bruno(int N, int A[]) {
    long long ans = 0;
    int pos = 0;
    for (int i = 0; i < N; i += 2) {
        int r = A[i] * 2 + A[i+1];
        if (pos > 60) continue;
        if (r == 0) continue;
        else if (r == 1) {
            pos++;    
        }
        else {
            ans |= (1LL<<pos);
            pos++;
        }
    }
    return ans;
}

Subtask #1
0.0 / 100.0

# Verdict Execution time Memory Grader output
1 Incorrect 59 ms 3056 KB Output isn't correct - L* = 0
2 Incorrect 61 ms 3304 KB Output isn't correct - L* = 0
3 Incorrect 39 ms 3568 KB Output isn't correct - L* = 0
4 Incorrect 51 ms 3056 KB Output isn't correct - L* = 0
5 Incorrect 66 ms 3056 KB Output isn't correct - L* = 0
6 Incorrect 61 ms 3312 KB Output isn't correct - L* = 0
7 Incorrect 68 ms 3312 KB Output isn't correct - L* = 0
8 Incorrect 49 ms 3312 KB Output isn't correct - L* = 0
9 Incorrect 70 ms 3056 KB Output isn't correct - L* = 0
10 Incorrect 55 ms 3112 KB Output isn't correct - L* = 0
11 Incorrect 49 ms 3168 KB Output isn't correct - L* = 0
12 Incorrect 64 ms 3064 KB Output isn't correct - L* = 0
13 Incorrect 73 ms 3312 KB Output isn't correct - L* = 0
14 Incorrect 62 ms 3312 KB Output isn't correct - L* = 0
15 Incorrect 60 ms 3144 KB Output isn't correct - L* = 0
16 Incorrect 62 ms 3312 KB Output isn't correct - L* = 0
17 Incorrect 48 ms 3232 KB Output isn't correct - L* = 0
18 Incorrect 46 ms 3056 KB Output isn't correct - L* = 0
19 Incorrect 52 ms 3312 KB Output isn't correct - L* = 0
20 Incorrect 53 ms 3320 KB Output isn't correct - L* = 0
21 Incorrect 46 ms 3056 KB Output isn't correct - L* = 0
22 Incorrect 57 ms 3312 KB Output isn't correct - L* = 0
23 Incorrect 52 ms 3104 KB Output isn't correct - L* = 0
24 Incorrect 45 ms 3320 KB Output isn't correct - L* = 0
25 Incorrect 56 ms 3288 KB Output isn't correct - L* = 0
26 Incorrect 60 ms 3312 KB Output isn't correct - L* = 0
27 Incorrect 44 ms 3328 KB Output isn't correct - L* = 0
28 Incorrect 47 ms 3328 KB Output isn't correct - L* = 0
29 Incorrect 56 ms 3080 KB Output isn't correct - L* = 0
30 Incorrect 43 ms 3072 KB Output isn't correct - L* = 0
31 Incorrect 63 ms 3312 KB Output isn't correct - L* = 0
32 Incorrect 53 ms 3056 KB Output isn't correct - L* = 0
33 Incorrect 45 ms 3072 KB Output isn't correct - L* = 0
34 Incorrect 41 ms 3256 KB Output isn't correct - L* = 0
35 Incorrect 45 ms 3312 KB Output isn't correct - L* = 0
36 Incorrect 48 ms 3312 KB Output isn't correct - L* = 0
37 Incorrect 45 ms 3304 KB Output isn't correct - L* = 0
38 Incorrect 66 ms 3256 KB Output isn't correct - L* = 0
39 Incorrect 46 ms 3072 KB Output isn't correct - L* = 0
40 Incorrect 51 ms 3056 KB Output isn't correct - L* = 0