結果
問題 | No.2319 Friends+ |
ユーザー |
![]() |
提出日時 | 2023-05-27 02:07:11 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
TLE
|
実行時間 | - |
コード長 | 4,653 bytes |
コンパイル時間 | 2,224 ms |
コンパイル使用メモリ | 202,740 KB |
最終ジャッジ日時 | 2025-02-13 08:55:46 |
ジャッジサーバーID (参考情報) |
judge2 / judge1 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 2 |
other | AC * 43 TLE * 2 |
ソースコード
#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) {if (size(g[i]) < t) {continue;}nei[i] = vec<int>(0, n);for (auto v : g[i]) {h[i].push_back(v); ++nei[i][p[v]];// t <= size(g[i]) な頂点 i から出ている辺はすべて双方向にしたい// ここで無条件に v -> i な辺を追加すると t <= size(g[v]) であったとき二重辺になる// あとで unique してもいいが、こっちのほうが楽なのでif (size(g[v]) < t) {h[v].push_back(i);}}}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';// t <= size(g[v]) な頂点たち向けの更新for (auto v : h[x]) {if (t <= size(g[v])) {--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';// t <= size(g[v]) な頂点たち向けの更新for (auto v : h[x]) {if (t <= size(g[v])) {--nei[v][p[x]];++nei[v][p[y]];}}p[x] = p[y];}cout << flush;}