結果

問題 No.2346 Replace!!
コンテスト
ユーザー fastmath
提出日時 2023-06-09 22:45:22
言語 C++17
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 425 ms / 2,000 ms
コード長 6,054 bytes
コンパイル時間 1,465 ms
コンパイル使用メモリ 144,940 KB
最終ジャッジ日時 2025-02-14 00:13:29
ジャッジサーバーID
（参考情報） 		judge3 / judge3
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 1
other AC * 73
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <algorithm>
#include <cmath>
#include <vector>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <queue>
#include <ctime>
#include <cassert>
#include <complex>
#include <string>
#include <cstring>
#include <chrono>
#include <random>
#include <bitset>
#include <fstream>
#include <array>
#include <functional>
#include <stack>
#include <memory>
using namespace std;
#define int long long
#define ii pair <int, int>
#define app push_back
#define all(a) a.begin(), a.end()
#define bp __builtin_popcountll
#define ll long long
#define mp make_pair
#define x first
#define y second
#define Time (double)clock()/CLOCKS_PER_SEC
#define munq(a) sort(all(a)); a.resize(unique(all(a))-a.begin())

#ifdef LOCAL
#define debug(x) std::cerr << #x << ": " << x << '\n';
#define debug2(x, y) std::cerr << #x << ", " << #y << ": " << x << ", " << y << '\n';
#define debug3(x, y, z) std::cerr << #x << ", " << #y << ", " << #z << ": " << x << ", " << y << ", " << z << '\n';
#else
#define debug(x)
#define debug2(x, y) 
#define debug3(x, y, z) 
#endif

#define FORI(i,a,b) for (int i = (a); i < (b); ++i)
#define FOR(i,a) FORI(i,0,a)
#define ROFI(i,a,b) for (int i = (b)-1; i >= (a); --i)
#define ROF(i,a) ROFI(i,0,a)
#define rep(a) FOR(_,a)
#define each(a,x) for (auto& a: x)
#define FORN(i, n) FORI(i, 1, n + 1)

using vi = vector<int>;
template <typename T>
std::istream& operator >>(std::istream& input, std::pair <T, T> & data)
{
    input >> data.x >> data.y;
    return input;
}
template <typename T>
std::istream& operator >>(std::istream& input, std::vector<T>& data)
{
    for (T& x : data)
        input >> x;
    return input;
}
template <typename T>
std::ostream& operator <<(std::ostream& output, const pair <T, T> & data)
{
    output << "(" << data.x << "," << data.y << ")";
    return output;
}
template <typename T>
std::ostream& operator <<(std::ostream& output, const std::vector<T>& data)
{
    for (const T& x : data)
        output << x << " ";
    return output;
}
ll div_up(ll a, ll b) { return a/b+((a^b)>0&&a%b); } // divide a by b rounded up
ll div_down(ll a, ll b) { return a/b-((a^b)<0&&a%b); } // divide a by b rounded down 
ll math_mod(ll a, ll b) { return a - b * div_down(a, b); }
#define tcT template<class T
#define tcTU tcT, class U
tcT> using V = vector<T>; 
tcT> bool ckmin(T& a, const T& b) {
    return b < a ? a = b, 1 : 0; 
} // set a = min(a,b)
tcT> bool ckmax(T& a, const T& b) {
    return a < b ? a = b, 1 : 0; 
}
tcT> vector <T> presum(vector <T> &a) {
    vector <T> p(a.size() + 1);
    FOR (i, a.size()) {
        p[i + 1] = p[i] + a[i];
    }   
    return p;
}
tcT> vector <T> sufsum(vector <T> &a) {
    vector <T> p(a.size() + 1);
    for (int i = (int)a.size() - 1; i >= 0; --i) {
        p[i] = p[i + 1] + a[i];
    }
    return p;
}
ll gcd(ll a, ll b) {
    while (b) {
        tie(a, b) = mp(b, a % b);
    }
    return a;
}
int Bit(int mask, int bit) { return (mask >> bit) & 1; }
signed main() {
    #ifdef LOCAL
    #else
    #define endl '\n'
    ios_base::sync_with_stdio(0); cin.tie(0);
    #endif
    auto solve = [&] () {
        int n;
        cin >> n;
        vi a(n), b(n);
        cin >> a >> b;
        FOR (i, n) {
            a[i]--;
            b[i]--;
        }

        auto calc = [&] (vi &a, vi &cyc, vi &f) {
            vi onc(n, 1);
            vi in(n);
            FOR (i, n) {
                in[a[i]]++;
            }
            queue <int> q;
            FOR (i, n) {
                if (in[i]==0) {
                    q.push(i);
                }
            }

            vi ord;
            while (q.size()) {
                int u = q.front(); q.pop();
                ord.app(u);
                onc[u]=0;
                in[a[u]]--;
                if (in[a[u]]==0) {
                    q.push(a[u]);
                }
            }

            debug(onc);

            int p = 0;
            FOR (i, n) {
                if (onc[i] && cyc[i]==-1) {
                    int u=i;
                    do {
                        debug(u);
                        cyc[u] = p;
                        u = a[u];
                    } while (u != i);
                    p++;
                }
            }

            reverse(all(ord));

            f = cyc;

            each (u, ord) {
                f[u] = f[a[u]];
            }

            debug(cyc);            
        };

        vi ca(n, -1), cb(n, -1), fa(n, -1), fb(n, -1);
        calc(a, ca, fa);
        calc(b, cb, fb);

        auto go = [&] (int start, vi &a) {
            int u = start;
            vi ans;
            do {
                ans.app(u);
                u = a[u];
            } while (u != start);
            return ans;
        };

        string ans = "Yes";

        FOR (i, n) {
            bool have = 0;
            int u = i;
            rep (n) {
                have |= u == b[i];
                u = a[u];
            }
            if (!have) {
                ans = "No";
            }   
        }
        FOR (i, n) {
            debug2(i, cb[i]);
            if (cb[i]!=-1) {
                if (ca[i]==-1) {
                    debug(i);
                    ans = "No";
                }
                else {
                    vi x = go(i, b);
                    vi y = go(i, a);
                    FOR (j, n) {
                        if ((fa[j]==ca[i]) ^ (fb[j]==cb[i])) {
                            ans = "No";
                        }
                    }
                    int ptr = 0;
                    each (e, x) {
                        while (ptr < y.size() && y[ptr]!=e) {
                            ptr++;
                        }
                        if (ptr == y.size()) {
                            ans = "No";
                        }
                        ptr++;
                    }
                }
            }
        }

        cout << ans << endl;
    };
    int t;
    cin >> t;
    rep (t) {
        solve();
    }
}
0