提出 #29744675

---

ソースコード 拡げる

#include <bits/stdc++.h>
using namespace std;
#define SET(a) memset(a, -1, sizeof a) 
#define R(i, a, b) for (int i = (a); i < (b); ++i)
#define L(i, a, b) for (int i = (b) - 1; i >= (a); --i)
using i64 = long long;

constexpr int xn = 5001;
int n, a[xn], b[xn];

void push(int p) { int x = a[p - 2], y = a[p - 1], z = a[p]; a[p - 2] = z; a[p - 1] = x; a[p] = y; }

int main() {
  ios::sync_with_stdio(false); cin.tie(0);
  cin >> n;
  R(i, 0, n) cin >> a[i]; R(i, 0, n) cin >> b[i];
  vector<int> _a(a, a + n), _b(b, b + n);
  sort(_a.begin(), _a.end()); sort(_b.begin(), _b.end());
  if (_a != _b) { cout << "No\n"; return 0; }
  R(i, 0, n - 1) if (a[i] == a[i + 1]) { cout << "Yes\n"; return 0; }
  R(i, 0, n - 2) {
    int p = -1; R(j, i, n) if (a[j] == b[i]) p = j;
    for (; p > i; --p) if (p < n - 1) { push(p + 1); push(p + 1); } else { push(p); push(p); }
    assert(a[i] == b[i]);
    // cerr << "a = "; R(j, 0, n) cerr << a[j] << ' '; cerr << '\n'; // @
  }
  if (a[n - 2] == b[n - 2] and a[n - 1] == b[n - 1]) cout << "Yes\n";
  else cout << "No\n";
  return 0;
}

提出情報

ジャッジ結果