結果

問題 No.2319 Friends+
ユーザー sten_sansten_san
提出日時 2023-05-27 02:16:15
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 376 ms / 3,000 ms
コード長 4,126 bytes
コンパイル時間 2,284 ms
コンパイル使用メモリ 209,164 KB
実行使用メモリ 59,392 KB
最終ジャッジ日時 2024-06-07 11:02:09
合計ジャッジ時間 13,759 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge4
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
6,816 KB
testcase_01 AC 2 ms
6,944 KB
testcase_02 AC 376 ms
59,392 KB
testcase_03 AC 354 ms
59,392 KB
testcase_04 AC 332 ms
59,264 KB
testcase_05 AC 338 ms
59,392 KB
testcase_06 AC 356 ms
59,392 KB
testcase_07 AC 118 ms
7,680 KB
testcase_08 AC 118 ms
7,680 KB
testcase_09 AC 121 ms
7,552 KB
testcase_10 AC 114 ms
7,680 KB
testcase_11 AC 116 ms
7,680 KB
testcase_12 AC 2 ms
6,940 KB
testcase_13 AC 2 ms
6,944 KB
testcase_14 AC 2 ms
6,944 KB
testcase_15 AC 2 ms
6,940 KB
testcase_16 AC 2 ms
6,940 KB
testcase_17 AC 2 ms
6,944 KB
testcase_18 AC 97 ms
8,192 KB
testcase_19 AC 94 ms
8,064 KB
testcase_20 AC 100 ms
7,680 KB
testcase_21 AC 98 ms
7,680 KB
testcase_22 AC 108 ms
7,680 KB
testcase_23 AC 93 ms
7,808 KB
testcase_24 AC 94 ms
7,680 KB
testcase_25 AC 95 ms
7,680 KB
testcase_26 AC 94 ms
7,680 KB
testcase_27 AC 96 ms
7,680 KB
testcase_28 AC 160 ms
7,680 KB
testcase_29 AC 130 ms
7,680 KB
testcase_30 AC 113 ms
7,680 KB
testcase_31 AC 104 ms
7,808 KB
testcase_32 AC 100 ms
7,680 KB
testcase_33 AC 97 ms
7,680 KB
testcase_34 AC 96 ms
7,680 KB
testcase_35 AC 94 ms
7,808 KB
testcase_36 AC 93 ms
7,424 KB
testcase_37 AC 242 ms
29,440 KB
testcase_38 AC 98 ms
7,552 KB
testcase_39 AC 97 ms
7,680 KB
testcase_40 AC 97 ms
7,680 KB
testcase_41 AC 100 ms
7,680 KB
testcase_42 AC 103 ms
7,680 KB
testcase_43 AC 106 ms
7,680 KB
testcase_44 AC 117 ms
7,808 KB
testcase_45 AC 280 ms
28,288 KB
testcase_46 AC 195 ms
25,472 KB
権限があれば一括ダウンロードができます

ソースコード

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); }

template <typename F>
constexpr auto fix(F &&f) noexcept {
    return [f = std::tuple<F>(std::forward<F>(f))](auto &&...args) mutable {
        return std::get<0>(f)(fix(std::get<0>(f)), std::forward<decltype(args)>(args)...);
    };
}

int main() {
    int n, m; cin >> n >> m;

    auto p = vec<int>(uns, n);
    for (auto &e : p) {
        cin >> e; --e;
    }

    auto g = vec<int>(uns, n, 0);
    for (int i = 0; i < m; ++i) {
        int a, b; cin >> a >> b; --a; --b;
        g[a].push_back(b);
        g[b].push_back(a);
    }

    const int t = round(ceil(sqrt(m)));

    auto h = vec<int>(uns, n, 0);
    auto nei = vec<int>(uns, n, 0);
    for (int i = 0; i < n; ++i) {
        for (auto v : g[i]) {
            if (t <= size(g[v])) {
                h[i].push_back(v);
            }
        }

        if (size(g[i]) < t) {
            continue;
        }
        nei[i] = vec<int>(0, n);

        for (auto v : g[i]) {
            ++nei[i][p[v]];
        }
    }

    int q; cin >> q;
    while (q--) {
        int x, y; cin >> x >> y; --x; --y;

        if (p[x] == p[y]) {
            cout << "No" << '\n';
            continue;
        }

        if (size(g[x]) < t) {
            bool f = false;
            for (auto v : g[x]) {
                f |= (p[v] == p[y]);
            }

            if (!f) {
                cout << "No" << '\n';
                continue;
            }
            cout << "Yes" << '\n';

            for (auto v : h[x]) {
                --nei[v][p[x]];
                ++nei[v][p[y]];
            }

            p[x] = p[y];
            continue;
        }

        if (nei[x][p[y]] == 0) {
            cout << "No" << '\n';
            continue;
        }
        cout << "Yes" << '\n';

        for (auto v : h[x]) {
            --nei[v][p[x]];
            ++nei[v][p[y]];
        }

        p[x] = p[y];
    }

    cout << flush;
}
0