結果

問題 No.1209 XOR Into You
コンテスト
ユーザー stoq
提出日時 2020-10-04 09:19:25
言語 C++17
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 354 ms / 2,000 ms
コード長 4,241 bytes
コンパイル時間 2,526 ms
コンパイル使用メモリ 223,660 KB
最終ジャッジ日時 2025-01-15 02:22:15
ジャッジサーバーID
（参考情報） 		judge3 / judge2
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 4
other AC * 37
権限があれば一括ダウンロードができます

ソースコード

diff # 

#define MOD_TYPE 2

#pragma region Macros

#include <bits/stdc++.h>
using namespace std;

#if 0
#include <boost/multiprecision/cpp_int.hpp>
#include <boost/multiprecision/cpp_dec_float.hpp>
using Int = boost::multiprecision::cpp_int;
using lld = boost::multiprecision::cpp_dec_float_100;
#endif

#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")

using ll = long long int;
using ld = long double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using pld = pair<ld, ld>;
template <typename Q_type>
using smaller_queue = priority_queue<Q_type, vector<Q_type>, greater<Q_type>>;

constexpr ll MOD = (MOD_TYPE == 1 ? (ll)(1e9 + 7) : 998244353);
//constexpr ll MOD = 1;
constexpr int INF = (int)1e9 + 10;
constexpr ll LINF = (ll)4e18;
constexpr double PI = acos(-1.0);
constexpr double EPS = 1e-11;
constexpr int Dx[] = {0, 0, -1, 1, -1, 1, -1, 1, 0};
constexpr int Dy[] = {1, -1, 0, 0, -1, -1, 1, 1, 0};

#define REP(i, m, n) for (ll i = m; i < (ll)(n); ++i)
#define rep(i, n) REP(i, 0, n)
#define REPI(i, m, n) for (int i = m; i < (int)(n); ++i)
#define repi(i, n) REPI(i, 0, n)
#define MP make_pair
#define MT make_tuple
#define YES(n) cout << ((n) ? "YES" : "NO") << "\n"
#define Yes(n) cout << ((n) ? "Yes" : "No") << "\n"
#define possible(n) cout << ((n) ? "possible" : "impossible") << "\n"
#define Possible(n) cout << ((n) ? "Possible" : "Impossible") << "\n"
#define Yay(n) cout << ((n) ? "Yay!" : ":(") << "\n"
#define all(v) v.begin(), v.end()
#define NP(v) next_permutation(all(v))
#define dbg(x) cerr << #x << ":" << x << "\n";

struct io_init
{
  io_init()
  {
    cin.tie(0);
    ios::sync_with_stdio(false);
    cout << setprecision(30) << setiosflags(ios::fixed);
  };
} io_init;
template <typename T>
inline bool chmin(T &a, T b)
{
  if (a > b)
  {
    a = b;
    return true;
  }
  return false;
}
template <typename T>
inline bool chmax(T &a, T b)
{
  if (a < b)
  {
    a = b;
    return true;
  }
  return false;
}
inline ll CEIL(ll a, ll b)
{
  return (a + b - 1) / b;
}
template <typename A, size_t N, typename T>
inline void Fill(A (&array)[N], const T &val)
{
  fill((T *)array, (T *)(array + N), val);
}
template <typename T, typename U>
constexpr istream &operator>>(istream &is, pair<T, U> &p) noexcept
{
  is >> p.first >> p.second;
  return is;
}
template <typename T, typename U>
constexpr ostream &operator<<(ostream &os, pair<T, U> &p) noexcept
{
  os << p.first << " " << p.second;
  return os;
}
#pragma endregion

template <typename T>
struct BIT
{
  int n;
  vector<T> dat;

  BIT() {}
  BIT(int n_) : n(n_), dat(n_, 0) {}

  // 0-indexed
  void add(int i, T x)
  {
    i++;
    while (i <= n)
    {
      dat[i - 1] += x;
      i += i & -i;
    }
  }

  // [0, i)
  T sum(int i)
  {
    T res = 0;
    while (i > 0)
    {
      res += dat[i - 1];
      i -= i & -i;
    }
    return res;
  }

  // 0-indexed
  T get(int i) { return sum(i + 1) - sum(i); }

  // [l, r)
  T sum(int l, int r) { return sum(r) - sum(l); }

  void display()
  {
    for (int i = 0; i < n; i++)
      cerr << get(i) << " ";
    cerr << "\n";
  }
};

template <typename T>
ll inversion(vector<T> a, bool zaatsu = false)
{
  int z;
  if (zaatsu)
  {
    map<T, int> mp;
    z = 0;
    for (auto &&ai : a)
      mp[ai] = 0;
    for (auto &&[k, v] : mp)
      v = z++;
    for (auto &&ai : a)
      ai = mp[ai];
  }
  else
  {
    z = a.size();
  }
  BIT<ll> bit(z);
  ll res = 0;
  for (int i = 0; i < a.size(); i++)
  {
    res += bit.sum(a[i] + 1, z);
    bit.add(a[i], 1);
  }
  return res;
}

void solve()
{
  int n;
  cin >> n;
  vector<int> a(n), b(n);
  rep(i, n) cin >> a[i];
  rep(i, n) cin >> b[i];
  if (a[0] != b[0] or a[n - 1] != b[n - 1])
  {
    cout << -1 << "\n";
    return;
  }
  vector<int> v1(n - 1), v2(n - 1);
  rep(i, n)
  {
    v1[i] = a[i] ^ a[i + 1];
    v2[i] = b[i] ^ b[i + 1];
  }
  a = v1, b = v2;
  auto s1 = v1, s2 = v2;
  sort(all(s1));
  sort(all(s2));
  if (s1 != s2)
  {
    cout << -1 << "\n";
    return;
  }
  map<int, queue<int>> mp;
  int z = 0;
  rep(i, n - 1)
  {
    mp[b[i]].push(z++);
  }
  rep(i, n - 1)
  {
    int t = mp[a[i]].front();
    mp[a[i]].pop();
    a[i] = t;
  }
  cout << inversion(a) << "\n";
}

int main()
{
  solve();
}
0