oj.uz

Submission #70547

# Submission time Handle Problem Language Result Execution time Memory
70547 2018-08-23T05:53:13 Z Inovak Broken Device (JOI17_broken_device) C++14
0 / 100
 86 ms 13248 KB 
#include "Annalib.h"
#include <bits/stdc++.h>

#define fr first
#define sc second
#define pb push_back
#define mk make_pair
#define ll long long
#define OK puts("OK");
#define sz(s) (int)s.size()
#define all(s) s.begin(), s.end()

using namespace std;

bool u[200];

void Anna( int N, long long X, int K, int P[] ) {
    int cnt = 0, cn = 0;
    for(int i = 0; i < K; i++)
        u[P[i]] = 1;
    for( int i = 0; i < N - 1; i++) {
        if(u[i] || u[i + 1] || cnt >= 60) {
            Set(i, 0);
            cn++;
        }
        else {
            Set(i, 1);
            Set(i + 1, ((X & (1ll << cnt)) ? 1 : 0));
            cn += 2;
            cnt++;
            i++;
        }
    }
    if(cn < N) Set(N - 1, 0);
}

#include "Brunolib.h"

long long Bruno( int N, int A[] ) {
    int cnt = 0;
    long long X = 0;

    for(int i = 0; i < N - 1; i++) {
        if(A[i] == 1 && A[i + 1] == 1) {
            X |= (1ll << cnt);
            cnt++;
            i++;
        }
    }
    return X;
}

Subtask #1
0.0 / 100.0

# Verdict Execution time Memory Grader output
1 Incorrect 55 ms 3312 KB Output isn't correct - L* = 0
2 Incorrect 58 ms 3720 KB Output isn't correct - L* = 0
3 Incorrect 53 ms 4088 KB Output isn't correct - L* = 0
4 Incorrect 61 ms 4104 KB Output isn't correct - L* = 0
5 Incorrect 50 ms 4616 KB Output isn't correct - L* = 0
6 Incorrect 69 ms 4784 KB Output isn't correct - L* = 0
7 Incorrect 75 ms 5104 KB Output isn't correct - L* = 0
8 Incorrect 55 ms 5144 KB Output isn't correct - L* = 0
9 Incorrect 49 ms 5432 KB Output isn't correct - L* = 0
10 Incorrect 56 ms 5720 KB Output isn't correct - L* = 0
11 Incorrect 48 ms 6008 KB Output isn't correct - L* = 0
12 Incorrect 46 ms 6144 KB Output isn't correct - L* = 0
13 Incorrect 53 ms 6376 KB Output isn't correct - L* = 0
14 Incorrect 47 ms 6880 KB Output isn't correct - L* = 0
15 Incorrect 66 ms 6880 KB Output isn't correct - L* = 0
16 Incorrect 66 ms 7120 KB Output isn't correct - L* = 0
17 Incorrect 57 ms 7400 KB Output isn't correct - L* = 0
18 Incorrect 55 ms 7640 KB Output isn't correct - L* = 0
19 Incorrect 46 ms 7880 KB Output isn't correct - L* = 0
20 Incorrect 53 ms 8128 KB Output isn't correct - L* = 0
21 Incorrect 50 ms 8352 KB Output isn't correct - L* = 0
22 Incorrect 44 ms 8624 KB Output isn't correct - L* = 0
23 Incorrect 54 ms 8864 KB Output isn't correct - L* = 0
24 Incorrect 47 ms 9072 KB Output isn't correct - L* = 0
25 Incorrect 51 ms 9320 KB Output isn't correct - L* = 0
26 Incorrect 70 ms 9576 KB Output isn't correct - L* = 0
27 Incorrect 48 ms 9880 KB Output isn't correct - L* = 0
28 Incorrect 51 ms 10064 KB Output isn't correct - L* = 0
29 Incorrect 71 ms 10560 KB Output isn't correct - L* = 0
30 Incorrect 49 ms 10568 KB Output isn't correct - L* = 0
31 Incorrect 59 ms 10792 KB Output isn't correct - L* = 0
32 Incorrect 86 ms 11288 KB Output isn't correct - L* = 0
33 Incorrect 44 ms 11288 KB Output isn't correct - L* = 0
34 Incorrect 44 ms 11520 KB Output isn't correct - L* = 0
35 Incorrect 43 ms 11760 KB Output isn't correct - L* = 0
36 Incorrect 50 ms 12008 KB Output isn't correct - L* = 0
37 Incorrect 47 ms 12256 KB Output isn't correct - L* = 0
38 Incorrect 43 ms 12504 KB Output isn't correct - L* = 0
39 Incorrect 45 ms 12744 KB Output isn't correct - L* = 0
40 Incorrect 48 ms 13248 KB Output isn't correct - L* = 0