結果

問題 No.1779 Magical Swap
ユーザー sten_san
提出日時 2022-01-19 03:19:39
言語 C++17
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 193 ms / 2,000 ms
コード長 3,183 bytes
コンパイル時間 2,586 ms
コンパイル使用メモリ 207,544 KB
最終ジャッジ日時 2025-01-27 13:03:23
ジャッジサーバーID
（参考情報） 		judge4 / judge1
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 1
other AC * 18
権限があれば一括ダウンロードができます

ソースコード

diff # 

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

struct iofast_t {
    iofast_t() {
        ios::sync_with_stdio(false);
        cin.tie(nullptr);
    }
} iofast;

struct uns_t {} uns;
template <typename Element, typename Head, typename ...Args>
auto vec(Element init, Head arg, Args ...args) {
    if constexpr (sizeof...(Args) == 0) return vector(arg, init);
    else return vector(arg, vec(init, args...));
}
template <typename Element, typename Head, typename ...Args>
auto vec(uns_t, Head arg, Args ...args) {
    return vec(Element(), arg, args...);
}

template <typename Container>
auto distance(const Container &c, decltype(begin(c)) iter) {
    return distance(begin(c), iter);
}

template <typename RIter, typename Compare = less<typename iterator_traits<RIter>::value_type>>
auto isort(RIter first, RIter last, Compare comp = Compare()) {
    vector<int> i(distance(first, last));
    iota(begin(i), end(i), 0);
    sort(begin(i), end(i), [&](auto x, auto y) {
        return comp(*(first + x), *(first + y));
    });
    return i;
}

template <typename, template <typename> typename, typename = void_t<>>
struct detect : false_type {};
template <typename T, template <typename> typename Check>
struct detect<T, Check, void_t<Check<T>>> : true_type {};
template <typename T, template <typename> typename Check>
constexpr inline bool detect_v = detect<T, Check>::value;

template <typename T>
using has_member_sort = decltype(declval<T>().sort());

template <typename Container, typename Compare = less<typename Container::value_type>>
auto sorted(Container c, Compare comp = Compare()) {
    if constexpr (detect_v<Container, has_member_sort>) {
        c.sort(comp);
        return c;
    }
    else {
        sort(begin(c), end(c), comp);
        return c;
    }
}

template <typename Container, typename Compare = equal_to<typename Container::value_type>>
auto uniqued(Container c, Compare comp = Compare()) {
    c.erase(unique(begin(c), end(c), comp), end(c));
    return c;
}

template <typename T, typename Compare = less<T>>
T &chmin(T &l, T r, Compare &&f = less<T>()) { return l = min(l, r, f); }
template <typename T, typename Compare = less<T>>
T &chmax(T &l, T r, Compare &&f = less<T>()) { return l = max(l, r, f); }

#include <atcoder/dsu>

int main() {
    int t; cin >> t;

    while (t--) {
        int n; cin >> n;
        auto a = vec<int>(uns, n);
        auto b = vec<int>(uns, n);
        for (auto &e : a) cin >> e;
        for (auto &e : b) cin >> e;

        atcoder::dsu dsu(n);
        for (int i = 2; i <= n; ++i) {
            for (int j = 2; i * j <= n; ++j) {
                dsu.merge(i * (j - 1) - 1, i * j - 1);
            }
        }

        bool found = false;
        for (auto g : dsu.groups()) {
            auto x = vec<int>(uns, 0);
            auto y = vec<int>(uns, 0);
            for (auto v : g) {
                x.push_back(a[v]);
                y.push_back(b[v]);
            }

            sort(begin(x), end(x));
            sort(begin(y), end(y));
            found |= (x != y);
        }

        if (found) {
            cout << "No" << endl;
            continue;
        }

        cout << "Yes" << endl;
    }
}
0