#543821 (C++17) No.1209 XOR Into You

• 問題: No.1209 XOR Into You
• ユーザー: yosupot
• 提出日時: 2020-08-30 13:47:42
• 言語: C++17 (gcc 12.3.0 + boost 1.83.0)
• 結果: AC
• 実行時間: 348 ms / 2,000 ms
• コード長: 7,376 bytes
• コンパイル時間: 1,535 ms
• コンパイル使用メモリ: 134,040 KB
• 実行使用メモリ: 79,360 KB
• 最終ジャッジ日時: 2024-11-15 06:58:42
• 合計ジャッジ時間: 10,775 ms
• ジャッジサーバーID （参考情報）: judge1 / judge5

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	2 ms; 5,248 KB
testcase_01	AC	2 ms; 5,248 KB
testcase_02	AC	2 ms; 5,248 KB
testcase_03	AC	2 ms; 5,248 KB
testcase_04	AC	133 ms; 78,464 KB
testcase_05	AC	130 ms; 78,464 KB
testcase_06	AC	131 ms; 79,360 KB
testcase_07	AC	279 ms; 66,432 KB
testcase_08	AC	244 ms; 60,160 KB
testcase_09	AC	245 ms; 60,160 KB
testcase_10	AC	190 ms; 49,920 KB
testcase_11	AC	246 ms; 59,392 KB
testcase_12	AC	219 ms; 55,424 KB
testcase_13	AC	257 ms; 62,848 KB
testcase_14	AC	209 ms; 53,888 KB
testcase_15	AC	228 ms; 56,832 KB
testcase_16	AC	221 ms; 55,808 KB
testcase_17	AC	213 ms; 53,504 KB
testcase_18	AC	326 ms; 75,392 KB
testcase_19	AC	226 ms; 55,808 KB
testcase_20	AC	257 ms; 62,976 KB
testcase_21	AC	184 ms; 48,640 KB
testcase_22	AC	167 ms; 78,848 KB
testcase_23	AC	170 ms; 78,848 KB
testcase_24	AC	167 ms; 78,848 KB
testcase_25	AC	329 ms; 78,848 KB
testcase_26	AC	324 ms; 78,848 KB
testcase_27	AC	332 ms; 78,720 KB
testcase_28	AC	338 ms; 78,976 KB
testcase_29	AC	348 ms; 78,848 KB
testcase_30	AC	341 ms; 78,848 KB
testcase_31	AC	54 ms; 7,808 KB
testcase_32	AC	54 ms; 7,808 KB
testcase_33	AC	53 ms; 7,808 KB
testcase_34	AC	54 ms; 7,808 KB
testcase_35	AC	54 ms; 7,808 KB
testcase_36	AC	53 ms; 7,808 KB
testcase_37	AC	14 ms; 7,424 KB
testcase_38	AC	276 ms; 65,792 KB
testcase_39	AC	230 ms; 58,880 KB
testcase_40	AC	168 ms; 78,848 KB

ソースコード

//#pragma GCC optimize("Ofast")
//#pragma GCC target("avx")
//#undef LOCAL




#include <algorithm>

#include <array>

#include <bitset>

#include <cassert>

#include <complex>

#include <cstdio>

#include <cstring>

#include <iostream>

#include <map>

#include <numeric>

#include <queue>

#include <set>

#include <string>

#include <unordered_map>

#include <unordered_set>

#include <vector>

using namespace std;

using uint = unsigned int;
using ll = long long;
using ull = unsigned long long;
constexpr ll TEN(int n) { return (n == 0) ? 1 : 10 * TEN(n - 1); }
template <class T> using V = vector<T>;
template <class T> using VV = V<V<T>>;



#include <unistd.h>

struct Scanner {
    int fd = -1;
    char line[(1 << 15) + 1];
    size_t st = 0, ed = 0;
    void reread() {
        memmove(line, line + st, ed - st);
        ed -= st;
        st = 0;
        ed += ::read(fd, line + ed, (1 << 15) - ed);
        line[ed] = '\0';
    }
    bool succ() {
        while (true) {
            if (st == ed) {
                reread();
                if (st == ed) return false;
            }
            while (st != ed && isspace(line[st])) st++;
            if (st != ed) break;
        }
        if (ed - st <= 50) {
            bool sep = false;
            for (size_t i = st; i < ed; i++) {
                if (isspace(line[i])) {
                    sep = true;
                    break;
                }
            }
            if (!sep) reread();
        }
        return true;
    }
    template <class T, enable_if_t<is_same<T, string>::value, int> = 0>
    bool read_single(T& ref) {
        if (!succ()) return false;
        while (true) {
            size_t sz = 0;
            while (st + sz < ed && !isspace(line[st + sz])) sz++;
            ref.append(line + st, sz);
            st += sz;
            if (!sz || st != ed) break;
            reread();
        }
        return true;
    }
    template <class T, enable_if_t<is_integral<T>::value>* = nullptr>
    bool read_single(T& ref) {
        if (!succ()) return false;
        bool neg = false;
        if (line[st] == '-') {
            neg = true;
            st++;
        }
        ref = T(0);
        while (isdigit(line[st])) {
            ref = 10 * ref + (line[st++] & 0xf);
        }
        if (neg) ref = -ref;
        return true;
    }
    template <class T> bool read_single(V<T>& ref) {
        for (auto& d : ref) {
            if (!read_single(d)) return false;
        }
        return true;
    }
    void read() {}
    template <class H, class... T> void read(H& h, T&... t) {
        bool f = read_single(h);
        assert(f);
        read(t...);
    }
    int read_unsafe() { return 0; }
    template <class H, class... T> int read_unsafe(H& h, T&... t) {
        bool f = read_single(h);
        if (!f) return 0;
        return 1 + read_unsafe(t...);
    }
    Scanner(FILE* fp) : fd(fileno(fp)) {}
};

struct Printer {
  public:
    template <bool F = false> void write() {}
    template <bool F = false, class H, class... T>
    void write(const H& h, const T&... t) {
        if (F) write_single(' ');
        write_single(h);
        write<true>(t...);
    }
    template <class... T> void writeln(const T&... t) {
        write(t...);
        write_single('\n');
    }

    Printer(FILE* _fp) : fp(_fp) {}
    ~Printer() { flush(); }

  private:
    static constexpr size_t SIZE = 1 << 15;
    FILE* fp;
    char line[SIZE], small[50];
    size_t pos = 0;
    void flush() {
        fwrite(line, 1, pos, fp);
        pos = 0;
    }
    void write_single(const char& val) {
        if (pos == SIZE) flush();
        line[pos++] = val;
    }
    template <class T, enable_if_t<is_integral<T>::value>* = nullptr>
    void write_single(T val) {
        if (pos > (1 << 15) - 50) flush();
        if (val == 0) {
            write_single('0');
            return;
        }
        if (val < 0) {
            write_single('-');
            val = -val; // todo min
        }
        size_t len = 0;
        while (val) {
            small[len++] = char(0x30 | (val % 10));
            val /= 10;
        }
        for (size_t i = 0; i < len; i++) {
            line[pos + i] = small[len - 1 - i];
        }
        pos += len;
    }
    void write_single(__int128 val) {
        if (pos > (1 << 15) - 50) flush();
        if (val == 0) {
            write_single('0');
            return;
        }
        if (val < 0) {
            write_single('-');
            val = -val; // todo min
        }
        size_t len = 0;
        while (val) {
            small[len++] = char(0x30 | (val % 10));
            val /= 10;
        }
        for (size_t i = 0; i < len; i++) {
            line[pos + i] = small[len - 1 - i];
        }
        pos += len;
    }

    void write_single(const string& s) {
        for (char c : s) write_single(c);
    }
    void write_single(const char* s) {
        size_t len = strlen(s);
        for (size_t i = 0; i < len; i++) write_single(s[i]);
    }
    template <class T> void write_single(const V<T>& val) {
        auto n = val.size();
        for (size_t i = 0; i < n; i++) {
            if (i) write_single(' ');
            write_single(val[i]);
        }
    }
};




template <class T> struct Fenwick {
    int n;
    V<T> seg;
    Fenwick(int _n = 0) : n(_n), seg(n) {}
    /// i番目の要素にxを追加する
    void add(int i, T x) {
        i++;
        while (i <= n) {
            seg[i - 1] += x;
            i += i & -i;
        }
    }
    /// [0, i)のsum
    T sum(int i) {
        assert(0 <= i && i <= n);
        T s = 0;
        while (i > 0) {
            s += seg[i - 1];
            i -= i & -i;
        }
        return s;
    }
    /// [a, b)のsum
    T sum(int a, int b) {
        assert(0 <= a && a <= b && b <= n);
        return sum(b) - sum(a);
    }
    /// sum[0, idx) >= xなる最小のidx(sum[0, n) < x なら n+1)
    int sum_lower_bound(T x) {
        if (x <= 0) return 0;
        int res = 0, len = 1;
        while (2 * len <= n) len *= 2;
        for (; len >= 1; len /= 2) {
            if (res + len <= n && seg[res + len - 1] < x) {
                res += len;
                x -= seg[res - 1];
            }
        }
        return res + 1;
    }
};

Scanner sc = Scanner(stdin);
Printer pr = Printer(stdout);

void no() {
    pr.writeln(-1);
    exit(0);
}

int main() {
    int n;
    sc.read(n);
    V<ll> a(n), b(n);
    for (int i = 0; i < n; i++) {
        sc.read(a[i]);
    }
    for (int i = 0; i < n; i++) {
        sc.read(b[i]);
    }
    V<ll> a2(n - 1), b2(n - 1);
    for (int i = 0; i < n - 1; i++) {
        a2[i] = a[i] ^ a[i + 1];
        b2[i] = b[i] ^ b[i + 1];
    }
    map<ll, deque<int>> bmp;
    for (int i = 0; i < n - 1; i++) {
        bmp[b2[i]].push_back(i);
    }

    if (a[0] != b[0]) no();

    ll ans = 0;
    Fenwick<ll> fw(n - 1);
    for (int i = 0; i < n - 1; i++) {
        if (!bmp.count(a2[i])) {
            no();
        }
        if (bmp[a2[i]].empty()) {
            no();
        }
        int idx = bmp[a2[i]].front();
        bmp[a2[i]].pop_front();
                ;
        ans += fw.sum(idx, n - 1);
        fw.add(idx, 1);
    }
    pr.writeln(ans);

/*    sort(a2.begin(), a2.end());
    sort(b2.begin(), b2.end());

    if (a2 != b2) {
        pr.writeln(-1);
        return 0;
    }
    pr.writeln("OK");*/
    return 0;
}