oj.uz

Submission #21574

# Submission time Handle Problem Language Result Execution time Memory
21574 2017-04-14T09:41:18 Z Ushio Broken Device (JOI17_broken_device) C++14
0 / 100
 76 ms 4644 KB 
#include "Annalib.h"
#include <algorithm>
#include <iostream>
#include <cstdlib>
#include <vector>
using namespace std;

namespace {
    const int FCT[] = {2, 3};

    int bitCount(int64_t x) {
        int ret = 0;
        while (x) {
            ++ret;
            x &= x - 1;
        }
        return ret;
    }
};

void Anna( int N, long long X, int K, int P[] ){
    vector<int> per(N + FCT[1]);
    srand(100);
    for (int i = 0; i < N + FCT[1]; ++i) {
        per[i] = i;
    }
    for (int i = 0; i < N; ++i) {
        int pos = i + rand() % (N - i);
        swap(per[i], per[pos]);
    }
    int bit = 0;
    int validity = 0;
    vector<bool> bad(N + FCT[1], false);
    for (int i = 0; i < FCT[1]; ++i) {
        bad[per[N + i]] = true;
    }
    for (int i = 0; i < K; ++i) {
        bad[P[i]] = true;
    }
    int op = bitCount(X) > 30;
    bool modeSet = false;
    int step = 0;
    for (int i = 0; i < N; ++i) {
        if (validity == 0) {
            if (modeSet) {
                bool ok = bad[per[i]];
                for (int j = 1; j <= FCT[step & 1]; ++j) {
                    ok |= bad[per[i + j]] && bit + j - 1 <= 59 && 
                        ((X & (1LL << (bit + j - 1))) > 0) != op;
                }
                if (ok) {
                    Set(per[i], 0);
                    validity = 0;
                } else {
                    Set(per[i], 1);
                    validity = FCT[step++ % 2];
                }
            } else {
                if (bad[per[i]] || (bad[per[i + 1]] && op == 1)) {
                    Set(per[i], 0);
                    validity = 0;
                } else {
                    Set(per[i], 1);
                    validity = 1;
                }
            }
        } else {
            if (modeSet) {
                if (bit <= 59) {
                    if (X & (1LL << bit)) {
                        Set(per[i], 1 ^ op);
                    } else {
                        Set(per[i], op);
                    }
                    bit++;
                } else {
                    Set(per[i], op);
                }
                validity--;
            } else {
                Set(per[i], op);
                modeSet = true;
                validity = 0;
            }
        }
    }
    cerr << "In:  " << X << endl;
}

#include "Brunolib.h"
#include <algorithm>
#include <iostream>
#include <cstdlib>
#include <vector>
using namespace std;

namespace {
    const int FCT[] = {2, 3};
};

long long Bruno( int N, int A[] ){
    vector<int> per(N + 1);
    srand(100);
    for (int i = 0; i < N + 1; ++i) {
        per[i] = i;
    }
    for (int i = 0; i < N; ++i) {
        int pos = i + rand() % (N - i);
        swap(per[i], per[pos]);
    }
    int validity = 0;
    int bit = 0;
    int64_t ans = 0;
    bool modeSet = false;
    int op;
    int step = 0;
    for (int i = 0; i < N; ++i) {
        if (validity == 0) {
            if (modeSet) {
                validity = A[per[i]] * FCT[step++ % 2];
            } else {
                validity = A[per[i]];
            }
        } else {
            if (modeSet) {
                if (bit <= 59) {
                    ans |= ((int64_t) A[per[i]] ^ op) << bit;
                    ++bit;
                }
                validity--;
            } else {
                op = A[per[i]];
                modeSet = true;
                validity = 0;
            }
        }
    }
    cerr << "Out: " << ans << endl;
    return ans;
}

Subtask #1
0.0 / 100.0

# Verdict Execution time Memory Grader output
1 Incorrect 49 ms 4644 KB Output isn't correct - L* = 0
2 Incorrect 68 ms 4644 KB Output isn't correct - L* = 0
3 Incorrect 52 ms 4644 KB Output isn't correct - L* = 0
4 Incorrect 54 ms 4644 KB Output isn't correct - L* = 0
5 Incorrect 59 ms 4644 KB Output isn't correct - L* = 0
6 Incorrect 45 ms 4644 KB Output isn't correct - L* = 0
7 Incorrect 52 ms 4644 KB Output isn't correct - L* = 0
8 Incorrect 62 ms 4644 KB Output isn't correct - L* = 0
9 Incorrect 41 ms 4644 KB Output isn't correct - L* = 0
10 Incorrect 52 ms 4644 KB Output isn't correct - L* = 0
11 Incorrect 38 ms 4644 KB Output isn't correct - L* = 0
12 Incorrect 75 ms 4644 KB Output isn't correct - L* = 0
13 Incorrect 41 ms 4644 KB Output isn't correct - L* = 0
14 Incorrect 69 ms 4644 KB Output isn't correct - L* = 0
15 Incorrect 49 ms 4644 KB Output isn't correct - L* = 0
16 Incorrect 55 ms 4644 KB Output isn't correct - L* = 0
17 Incorrect 52 ms 4644 KB Output isn't correct - L* = 0
18 Incorrect 39 ms 4644 KB Output isn't correct - L* = 0
19 Incorrect 59 ms 4644 KB Output isn't correct - L* = 0
20 Incorrect 41 ms 4644 KB Output isn't correct - L* = 0
21 Incorrect 76 ms 4644 KB Output isn't correct - L* = 0
22 Incorrect 45 ms 4644 KB Output isn't correct - L* = 0
23 Incorrect 72 ms 4644 KB Output isn't correct - L* = 0
24 Incorrect 49 ms 4644 KB Output isn't correct - L* = 0
25 Incorrect 41 ms 4644 KB Output isn't correct - L* = 0
26 Incorrect 52 ms 4644 KB Output isn't correct - L* = 0
27 Incorrect 41 ms 4644 KB Output isn't correct - L* = 0
28 Incorrect 52 ms 4644 KB Output isn't correct - L* = 0
29 Incorrect 39 ms 4644 KB Output isn't correct - L* = 0
30 Incorrect 49 ms 4644 KB Output isn't correct - L* = 0
31 Incorrect 55 ms 4644 KB Output isn't correct - L* = 0
32 Incorrect 62 ms 4644 KB Output isn't correct - L* = 0
33 Incorrect 56 ms 4644 KB Output isn't correct - L* = 0
34 Incorrect 45 ms 4644 KB Output isn't correct - L* = 0
35 Incorrect 52 ms 4644 KB Output isn't correct - L* = 0
36 Incorrect 59 ms 4644 KB Output isn't correct - L* = 0
37 Incorrect 48 ms 4644 KB Output isn't correct - L* = 0
38 Incorrect 39 ms 4644 KB Output isn't correct - L* = 0
39 Incorrect 54 ms 4644 KB Output isn't correct - L* = 0
40 Incorrect 52 ms 4644 KB Output isn't correct - L* = 0