oj.uz

Submission #289035

# Submission time Handle Problem Language Result Execution time Memory
289035 2020-09-02T09:49:38 Z fishy15 Broken Device (JOI17_broken_device) C++14
0 / 100
 46 ms 3568 KB 
#include "Annalib.h"
#include <vector>
using namespace std;

void Anna(int N, long long X, int K, int P[]) {
    vector<bool> works(N, true);
    vector<bool> toset(N, false);
    
    for (int i = 0; i < K; i++) {
        works[P[i]] = false;
    }

    for (int i = 0; i < N; i += 3) {
        int cnt = works[i] + works[i + 1] + works[i + 2];
        if (cnt == 3) {
            int v = X % 4;
            if (v == 0) {
                toset[i] = 1;
            } else if (v == 1) {
                toset[i + 1] = 1;
                toset[i + 2] = 1;
            } else if (v == 2) {
                toset[i] = 1;
                toset[i + 2] = 1;
            } else {
                toset[i] = 1;
                toset[i + 1] = 1;
                toset[i + 2] = 1;
            }
            X >>= 2;
        } else if (cnt == 2) {
            if (!works[i]) {
                if (X & 1) {
                    toset[i + 2] = 1;
                } else {
                    toset[i + 1] = 1;
                }
                X >>= 1;
            } else if (!works[i + 1]) {
                if (X & 1) {
                    toset[i + 2] = 1;
                    X >>= 1;
                } else {
                    if (X % 4 == 0) {
                        toset[i] = 1;
                    } else {
                        toset[i] = 1;
                        toset[i + 1] = 1;
                    }
                    X >>= 2;
                }
            } else {
                if (X & 1) {
                    toset[i] = 1;
                    toset[i + 1] = 1;
                } else {
                    toset[i + 1] = 1;
                }
                X >>= 1;
            }
        }
    }

    for (int i = 0; i < N; i++) {
        Set(i, toset[i]);
    }
}

#include "Brunolib.h"
#define ll long long

long long Bruno(int N, int A[]){
    int d = 0;
    ll ans = 0;

    for (int i = 0; i < N; i += 3) {
        if (d > 60) break;
        int v = 4 * A[i] + 2 * A[i + 1] + A[i + 2];
        if (v == 1) {
            ans += 1LL << d;
            d++;
        } else if (v == 2) {
            d++;
        } else if (v == 3) {
            ans += 1LL << d;
            d += 2;
        } else if (v == 4) {
            d += 2;
        } else if (v == 5) {
            ans += 2LL << d;
            d += 2;
        } else if (v == 6) {
            ans += 1LL << d;
            d++;
        } else if (v == 7) {
            ans += 3LL << d;
            d += 2;
        }
    }

    return ans;
}

Subtask #1
0.0 / 100.0

# Verdict Execution time Memory Grader output
1 Partially correct 42 ms 3312 KB Output isn't correct - L* = 0
2 Partially correct 43 ms 3312 KB Output isn't correct - L* = 0
3 Partially correct 41 ms 3312 KB Output isn't correct - L* = 0
4 Partially correct 41 ms 3312 KB Output isn't correct - L* = 0
5 Partially correct 43 ms 3072 KB Output isn't correct - L* = 0
6 Partially correct 43 ms 3328 KB Output isn't correct - L* = 0
7 Partially correct 41 ms 3312 KB Output isn't correct - L* = 0
8 Partially correct 43 ms 3328 KB Output isn't correct - L* = 0
9 Partially correct 41 ms 3312 KB Output isn't correct - L* = 0
10 Partially correct 43 ms 3312 KB Output isn't correct - L* = 0
11 Partially correct 42 ms 3312 KB Output isn't correct - L* = 0
12 Partially correct 42 ms 3312 KB Output isn't correct - L* = 0
13 Partially correct 42 ms 3328 KB Output isn't correct - L* = 0
14 Partially correct 43 ms 3312 KB Output isn't correct - L* = 0
15 Partially correct 45 ms 3312 KB Output isn't correct - L* = 0
16 Partially correct 42 ms 3312 KB Output isn't correct - L* = 0
17 Partially correct 43 ms 3328 KB Output isn't correct - L* = 0
18 Partially correct 42 ms 3312 KB Output isn't correct - L* = 0
19 Partially correct 45 ms 3312 KB Output isn't correct - L* = 0
20 Partially correct 42 ms 3328 KB Output isn't correct - L* = 0
21 Partially correct 44 ms 3328 KB Output isn't correct - L* = 0
22 Partially correct 43 ms 3312 KB Output isn't correct - L* = 0
23 Partially correct 43 ms 3312 KB Output isn't correct - L* = 0
24 Partially correct 44 ms 3312 KB Output isn't correct - L* = 0
25 Partially correct 43 ms 3312 KB Output isn't correct - L* = 0
26 Partially correct 44 ms 3312 KB Output isn't correct - L* = 0
27 Partially correct 43 ms 3312 KB Output isn't correct - L* = 0
28 Partially correct 45 ms 3312 KB Output isn't correct - L* = 0
29 Partially correct 41 ms 3312 KB Output isn't correct - L* = 0
30 Partially correct 43 ms 3328 KB Output isn't correct - L* = 0
31 Partially correct 44 ms 3312 KB Output isn't correct - L* = 0
32 Partially correct 46 ms 3568 KB Output isn't correct - L* = 0
33 Partially correct 42 ms 3328 KB Output isn't correct - L* = 0
34 Partially correct 42 ms 3328 KB Output isn't correct - L* = 0
35 Partially correct 42 ms 3328 KB Output isn't correct - L* = 0
36 Partially correct 41 ms 3312 KB Output isn't correct - L* = 0
37 Partially correct 41 ms 3312 KB Output isn't correct - L* = 0
38 Partially correct 45 ms 3136 KB Output isn't correct - L* = 0
39 Partially correct 42 ms 3072 KB Output isn't correct - L* = 0
40 Partially correct 42 ms 3312 KB Output isn't correct - L* = 0