結果

問題 No.2319 Friends+
ユーザー dyktr_06dyktr_06
提出日時 2023-05-27 01:08:52
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 1,617 ms / 3,000 ms
コード長 5,608 bytes
コンパイル時間 5,207 ms
コンパイル使用メモリ 277,860 KB
実行使用メモリ 176,896 KB
最終ジャッジ日時 2024-06-07 10:18:21
合計ジャッジ時間 30,469 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge4
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
6,812 KB
testcase_01 AC 2 ms
6,940 KB
testcase_02 AC 183 ms
22,016 KB
testcase_03 AC 188 ms
21,760 KB
testcase_04 AC 174 ms
21,760 KB
testcase_05 AC 172 ms
21,888 KB
testcase_06 AC 172 ms
22,016 KB
testcase_07 AC 754 ms
41,728 KB
testcase_08 AC 755 ms
41,852 KB
testcase_09 AC 754 ms
41,724 KB
testcase_10 AC 757 ms
41,728 KB
testcase_11 AC 747 ms
41,728 KB
testcase_12 AC 3 ms
6,940 KB
testcase_13 AC 3 ms
6,940 KB
testcase_14 AC 3 ms
6,940 KB
testcase_15 AC 3 ms
6,940 KB
testcase_16 AC 3 ms
6,940 KB
testcase_17 AC 2 ms
6,944 KB
testcase_18 AC 149 ms
18,560 KB
testcase_19 AC 434 ms
32,512 KB
testcase_20 AC 932 ms
29,696 KB
testcase_21 AC 583 ms
27,132 KB
testcase_22 AC 1,617 ms
31,360 KB
testcase_23 AC 442 ms
32,512 KB
testcase_24 AC 440 ms
32,640 KB
testcase_25 AC 460 ms
32,512 KB
testcase_26 AC 444 ms
32,640 KB
testcase_27 AC 455 ms
32,512 KB
testcase_28 AC 435 ms
32,128 KB
testcase_29 AC 440 ms
31,616 KB
testcase_30 AC 1,436 ms
31,104 KB
testcase_31 AC 851 ms
29,312 KB
testcase_32 AC 529 ms
26,364 KB
testcase_33 AC 354 ms
22,784 KB
testcase_34 AC 253 ms
20,352 KB
testcase_35 AC 203 ms
19,200 KB
testcase_36 AC 1,464 ms
176,896 KB
testcase_37 AC 104 ms
18,048 KB
testcase_38 AC 492 ms
32,512 KB
testcase_39 AC 487 ms
32,636 KB
testcase_40 AC 534 ms
32,640 KB
testcase_41 AC 633 ms
32,508 KB
testcase_42 AC 827 ms
32,764 KB
testcase_43 AC 1,162 ms
32,640 KB
testcase_44 AC 406 ms
31,488 KB
testcase_45 AC 252 ms
27,392 KB
testcase_46 AC 118 ms
17,280 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <bits/stdc++.h>
#include <atcoder/all>

using namespace std;
using namespace atcoder;

#define overload4(_1, _2, _3, _4, name, ...) name
#define rep1(n) for(int i = 0; i < (int)(n); ++i)
#define rep2(i, n) for(int i = 0; i < (int)(n); ++i)
#define rep3(i, a, b) for(int i = (a); i < (int)(b); ++i)
#define rep4(i, a, b, c) for(int i = (a); i < (int)(b); i += (c))
#define rep(...) overload4(__VA_ARGS__, rep4, rep3, rep2, rep1)(__VA_ARGS__)

#define rrep(i,n) for(int i = (int)(n) - 1; i >= 0; --i)
#define ALL(a) a.begin(), a.end()
#define Sort(a) sort(a.begin(), a.end())
#define RSort(a) sort(a.rbegin(), a.rend())

typedef long long int ll;
typedef unsigned long long ul;
typedef long double ld;
typedef vector<int> vi;
typedef vector<long long> vll;
typedef vector<char> vc;
typedef vector<string> vst;
typedef vector<double> vd;
typedef vector<long double> vld;
typedef pair<long long, long long> P;

template<class T> long long sum(const T& a){ return accumulate(a.begin(), a.end(), 0LL); }
template<class T> auto min(const T& a){ return *min_element(a.begin(), a.end()); }
template<class T> auto max(const T& a){ return *max_element(a.begin(), a.end()); }

const long long MINF = 0x7fffffffffff;
const long long INF = 0x1fffffffffffffff;
const long long MOD = 998244353;
const long double EPS = 1e-9;
const long double PI = acos(-1);
 
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }

template<typename T1, typename T2> istream &operator>>(istream &is, pair<T1, T2> &p){ is >> p.first >> p.second; return is; }
template<typename T1, typename T2> ostream &operator<<(ostream &os, const pair<T1, T2> &p){ os << "(" << p.first << ", " << p.second << ")"; return os; }
template<typename T> istream &operator>>(istream &is, vector<T> &v){ for(T &in : v) is >> in; return is; }
template<typename T> ostream &operator<<(ostream &os, const vector<T> &v){ for(int i = 0; i < (int) v.size(); ++i){ os << v[i] << (i + 1 != (int) v.size() ? " " : ""); } return os; }
template <typename T, typename S> ostream &operator<<(ostream &os, const map<T, S> &mp){ for(auto &[key, val] : mp){ os << key << ":" << val << " "; } return os; }
template <typename T> ostream &operator<<(ostream &os, const set<T> &st){ auto itr = st.begin(); for(int i = 0; i < (int)st.size(); ++i){ os << *itr << (i + 1 != (int)st.size() ? " " : ""); itr++; } return os; }
template <typename T> ostream &operator<<(ostream &os, const multiset<T> &st){ auto itr = st.begin(); for(int i = 0; i < (int)st.size(); ++i){ os << *itr << (i + 1 != (int)st.size() ? " " : ""); itr++; } return os; }
template <typename T> ostream &operator<<(ostream &os, queue<T> q){ while(q.size()){ os << q.front() << " "; q.pop(); } return os; }
template <typename T> ostream &operator<<(ostream &os, deque<T> q){ while(q.size()){ os << q.front() << " "; q.pop_front(); } return os; }
template <typename T> ostream &operator<<(ostream &os, stack<T> st){ while(st.size()){ os << st.top() << " "; st.pop(); } return os; }
template <class T, class Container, class Compare> ostream &operator<<(ostream &os, priority_queue<T, Container, Compare> pq){ while(pq.size()){ os << pq.top() << " "; pq.pop(); } return os; }

template<class T, class U> inline T vin(T& vec, U n) { vec.resize(n); for(int i = 0; i < (int) n; ++i) cin >> vec[i]; return vec; }
template<class T> inline void vout(T vec, string s = "\n"){ for(auto x : vec) cout << x << s; }
template<class... T> void in(T&... a){ (cin >> ... >> a); }
void out(){ cout << '\n'; }
template<class T, class... Ts> void out(const T& a, const Ts&... b){ cout << a; (cout << ... << (cout << ' ', b)); cout << '\n'; }
template<class T, class U> void inGraph(vector<vector<T>>& G, U n, U m, bool directed = false){ G.resize(n); for(int i = 0; i < m; ++i){ int a, b; cin >> a >> b; a--, b--; G[a].push_back(b); if(!directed) G[b].push_back(a); } }

ll n, m;
vll p;

void input(){
    in(n, m);
    vin(p, n);
}

ll BLOCK = 100;

void solve(){
    rep(i, n) p[i]--;

    vector<vll> G(n), G2(n);
    unordered_map<int, unordered_map<int, int>> F;
    vector<unordered_set<int>> s(n);

    vll a(m), b(m);
    rep(i, m){
        in(a[i], b[i]); a[i]--, b[i]--;
        G[a[i]].push_back(b[i]);
        G[b[i]].push_back(a[i]);
    }

    rep(i, m){
        if((int) G[b[i]].size() > BLOCK){
            G2[a[i]].push_back(b[i]);
        }
        if((int) G[a[i]].size() > BLOCK){
            G2[b[i]].push_back(a[i]);
        }
    }
    ll q; in(q);

    rep(i, n){
        if((int) G[i].size() <= BLOCK){
            for(auto k : G[i]){
                F[k][p[i]]++;
            }
        }
    }
    auto ok = [&](ll x, ll y){
        if((int) G[x].size() <= BLOCK){
            for(auto k : G[x]){
                F[k][p[x]]--;
                F[k][p[y]]++;
            }
        }
        p[x] = p[y];
    };
    while(q--){
        ll x, y; in(x, y); x--; y--;
        if(p[x] == p[y]){
            out("No");
            continue;
        }

        if(F[x][p[y]] >= 1){
            out("Yes");
            ok(x, y);
            continue;
        }

        ll check = 0;
        for(auto z : G2[x]){
            if(p[z] == p[y]){
                check = 1;
                break;
            }
        }

        if(check == 1){
            out("Yes");
            ok(x, y);
        }else{
            out("No");
        }
    }
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cout << fixed << setprecision(20);
    
    input();
    solve();
}
0