結果
問題 | No.2346 Replace!! |
ユーザー | torisasami4 |
提出日時 | 2023-06-09 23:52:44 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
WA
|
実行時間 | - |
コード長 | 7,179 bytes |
コンパイル時間 | 2,962 ms |
コンパイル使用メモリ | 235,128 KB |
実行使用メモリ | 6,948 KB |
最終ジャッジ日時 | 2024-06-10 14:56:16 |
合計ジャッジ時間 | 5,773 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge5 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
5,248 KB |
testcase_01 | AC | 4 ms
5,376 KB |
testcase_02 | WA | - |
testcase_03 | WA | - |
testcase_04 | WA | - |
testcase_05 | WA | - |
testcase_06 | WA | - |
testcase_07 | WA | - |
testcase_08 | WA | - |
testcase_09 | WA | - |
testcase_10 | WA | - |
testcase_11 | WA | - |
testcase_12 | WA | - |
testcase_13 | WA | - |
testcase_14 | WA | - |
testcase_15 | WA | - |
testcase_16 | WA | - |
testcase_17 | WA | - |
testcase_18 | WA | - |
testcase_19 | WA | - |
testcase_20 | WA | - |
testcase_21 | WA | - |
testcase_22 | WA | - |
testcase_23 | WA | - |
testcase_24 | WA | - |
testcase_25 | WA | - |
testcase_26 | WA | - |
testcase_27 | WA | - |
testcase_28 | AC | 2 ms
5,376 KB |
testcase_29 | AC | 2 ms
5,376 KB |
testcase_30 | AC | 2 ms
5,376 KB |
testcase_31 | AC | 4 ms
5,376 KB |
testcase_32 | AC | 4 ms
5,376 KB |
testcase_33 | AC | 4 ms
5,376 KB |
testcase_34 | WA | - |
testcase_35 | AC | 5 ms
5,376 KB |
testcase_36 | WA | - |
testcase_37 | AC | 4 ms
5,376 KB |
testcase_38 | WA | - |
testcase_39 | WA | - |
testcase_40 | AC | 4 ms
5,376 KB |
testcase_41 | AC | 4 ms
5,376 KB |
testcase_42 | AC | 4 ms
5,376 KB |
testcase_43 | AC | 4 ms
5,376 KB |
testcase_44 | AC | 6 ms
5,376 KB |
testcase_45 | AC | 4 ms
5,376 KB |
testcase_46 | AC | 4 ms
5,376 KB |
testcase_47 | AC | 4 ms
5,376 KB |
testcase_48 | AC | 4 ms
5,376 KB |
testcase_49 | AC | 5 ms
5,376 KB |
testcase_50 | AC | 5 ms
5,376 KB |
testcase_51 | AC | 36 ms
5,376 KB |
testcase_52 | AC | 23 ms
5,376 KB |
testcase_53 | AC | 16 ms
5,376 KB |
testcase_54 | WA | - |
testcase_55 | WA | - |
testcase_56 | WA | - |
testcase_57 | AC | 69 ms
5,376 KB |
testcase_58 | AC | 66 ms
5,376 KB |
testcase_59 | WA | - |
testcase_60 | AC | 66 ms
5,376 KB |
testcase_61 | AC | 66 ms
5,376 KB |
testcase_62 | AC | 67 ms
5,376 KB |
testcase_63 | WA | - |
testcase_64 | AC | 66 ms
5,376 KB |
testcase_65 | WA | - |
testcase_66 | AC | 69 ms
5,376 KB |
testcase_67 | AC | 68 ms
5,376 KB |
testcase_68 | AC | 67 ms
5,376 KB |
testcase_69 | AC | 66 ms
5,376 KB |
testcase_70 | AC | 65 ms
5,376 KB |
testcase_71 | AC | 65 ms
5,376 KB |
testcase_72 | AC | 65 ms
5,376 KB |
testcase_73 | AC | 66 ms
5,376 KB |
ソースコード
// #define _GLIBCXX_DEBUG#pragma GCC optimize("O2,no-stack-protector,unroll-loops,fast-math")#include <bits/stdc++.h>using namespace std;#define rep(i, n) for (int i = 0; i < int(n); i++)#define per(i, n) for (int i = (n)-1; 0 <= i; i--)#define rep2(i, l, r) for (int i = (l); i < int(r); i++)#define per2(i, l, r) for (int i = (r)-1; int(l) <= i; i--)#define each(e, v) for (auto& e : v)#define MM << " " <<#define pb push_back#define eb emplace_back#define all(x) begin(x), end(x)#define rall(x) rbegin(x), rend(x)#define sz(x) (int)x.size()template <typename T> void print(const vector<T>& v, T x = 0) {int n = v.size();for (int i = 0; i < n; i++) cout << v[i] + x << (i == n - 1 ? '\n' : ' ');if (v.empty()) cout << '\n';}using ll = long long;using pii = pair<int, int>;using pll = pair<ll, ll>;template <typename T> bool chmax(T& x, const T& y) {return (x < y) ? (x = y, true) : false;}template <typename T> bool chmin(T& x, const T& y) {return (x > y) ? (x = y, true) : false;}template <class T>using minheap = std::priority_queue<T, std::vector<T>, std::greater<T>>;template <class T> using maxheap = std::priority_queue<T>;template <typename T> int lb(const vector<T>& v, T x) {return lower_bound(begin(v), end(v), x) - begin(v);}template <typename T> int ub(const vector<T>& v, T x) {return upper_bound(begin(v), end(v), x) - begin(v);}template <typename T> void rearrange(vector<T>& v) {sort(begin(v), end(v));v.erase(unique(begin(v), end(v)), end(v));}// __int128_t gcd(__int128_t a, __int128_t b) {// if (a == 0)// return b;// if (b == 0)// return a;// __int128_t cnt = a % b;// while (cnt != 0) {// a = b;// b = cnt;// cnt = a % b;// }// return b;// }long long extGCD(long long a, long long b, long long& x, long long& y) {if (b == 0) {x = 1;y = 0;return a;}long long d = extGCD(b, a % b, y, x);y -= a / b * x;return d;}struct Union_Find_Tree {vector<int> data;const int n;int cnt;Union_Find_Tree(int n) : data(n, -1), n(n), cnt(n) {}int root(int x) {if (data[x] < 0) return x;return data[x] = root(data[x]);}int operator[](int i) { return root(i); }bool unite(int x, int y) {x = root(x), y = root(y);if (x == y) return false;if (data[x] > data[y]) swap(x, y);data[x] += data[y], data[y] = x;cnt--;return true;}int size(int x) { return -data[root(x)]; }int count() { return cnt; };bool same(int x, int y) { return root(x) == root(y); }void clear() {cnt = n;fill(begin(data), end(data), -1);}};template <int mod> struct Mod_Int {int x;Mod_Int() : x(0) {}Mod_Int(long long y) : x(y >= 0 ? y % mod : (mod - (-y) % mod) % mod) {}static int get_mod() { return mod; }Mod_Int& operator+=(const Mod_Int& p) {if ((x += p.x) >= mod) x -= mod;return *this;}Mod_Int& operator-=(const Mod_Int& p) {if ((x += mod - p.x) >= mod) x -= mod;return *this;}Mod_Int& operator*=(const Mod_Int& p) {x = (int)(1LL * x * p.x % mod);return *this;}Mod_Int& operator/=(const Mod_Int& p) {*this *= p.inverse();return *this;}Mod_Int& operator++() { return *this += Mod_Int(1); }Mod_Int operator++(int) {Mod_Int tmp = *this;++*this;return tmp;}Mod_Int& operator--() { return *this -= Mod_Int(1); }Mod_Int operator--(int) {Mod_Int tmp = *this;--*this;return tmp;}Mod_Int operator-() const { return Mod_Int(-x); }Mod_Int operator+(const Mod_Int& p) const { return Mod_Int(*this) += p; }Mod_Int operator-(const Mod_Int& p) const { return Mod_Int(*this) -= p; }Mod_Int operator*(const Mod_Int& p) const { return Mod_Int(*this) *= p; }Mod_Int operator/(const Mod_Int& p) const { return Mod_Int(*this) /= p; }bool operator==(const Mod_Int& p) const { return x == p.x; }bool operator!=(const Mod_Int& p) const { return x != p.x; }Mod_Int inverse() const {assert(*this != Mod_Int(0));return pow(mod - 2);}Mod_Int pow(long long k) const {Mod_Int now = *this, ret = 1;for (; k > 0; k >>= 1, now *= now) {if (k & 1) ret *= now;}return ret;}friend ostream& operator<<(ostream& os, const Mod_Int& p) {return os << p.x;}friend istream& operator>>(istream& is, Mod_Int& p) {long long a;is >> a;p = Mod_Int<mod>(a);return is;}};ll mpow2(ll x, ll n, ll mod) {ll ans = 1;x %= mod;while (n != 0) {if (n & 1) ans = ans * x % mod;x = x * x % mod;n = n >> 1;}ans %= mod;return ans;}template <typename T> T modinv(T a, const T& m) {T b = m, u = 1, v = 0;while (b > 0) {T t = a / b;swap(a -= t * b, b);swap(u -= t * v, v);}return u >= 0 ? u % m : (m - (-u) % m) % m;}ll divide_int(ll a, ll b) {if (b < 0) a = -a, b = -b;return (a >= 0 ? a / b : (a - b + 1) / b);}// const int MOD = 1000000007;const int MOD = 998244353;using mint = Mod_Int<MOD>;mint mpow(mint x, ll n) {bool rev = n < 0;n = abs(n);mint ans = 1;while (n != 0) {if (n & 1) ans *= x;x *= x;n = n >> 1;}return (rev ? ans.inverse() : ans);}// ----- library -------// ----- library -------int main() {ios::sync_with_stdio(false);std::cin.tie(nullptr);cout << fixed << setprecision(15);int T;cin >> T;while (T--) {int n;cin >> n;vector<int> a(n), b(n);rep(i, n) cin >> a[i], a[i]--;rep(i, n) cin >> b[i], b[i]--;vector<int> f(n, 1);rep(i, n) {vector<int> fl(n, 0);int now = i;while (1) {now = a[now], fl[now] = 1;if (fl[a[now]])break;}if (now != i)a[i] = (fl[b[i]] ? b[i] : a[i]), f[i] = 0;}vector<int> ra(n, -1), d(n, 0);rep(i, n) {if (!f[i])continue;ra[a[i]] = i;if (a[i] != b[i])d[b[i]]++;}queue<int> que;rep(i, n) if (f[i] && !d[i]) que.push(i);while (sz(que)) {int now = que.front();que.pop();int x = ra[now], y = a[now];a[x] = y, ra[y] = x;if (b[x] == y) {if (!(--d[y]))que.push(y);}if (a[now] == b[now]) {if (!(--d[b[now]]))que.push(b[now]);}a[now] = b[now];}bool ok = true;rep(i, n) ok &= (a[i] == b[i]);cout << (ok ? "Yes" : "No") << '\n';}}