結果

問題 No.2319 Friends+
ユーザー dyktr_06dyktr_06
提出日時 2023-05-26 22:47:02
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
TLE  
実行時間 -
コード長 6,049 bytes
コンパイル時間 4,643 ms
コンパイル使用メモリ 280,608 KB
実行使用メモリ 195,584 KB
最終ジャッジ日時 2023-08-26 13:01:37
合計ジャッジ時間 40,274 ms
ジャッジサーバーID
（参考情報） 		judge12 / judge14
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 1 ms
4,380 KB
testcase_01 AC 1 ms
4,380 KB
testcase_02 AC 242 ms
40,068 KB
testcase_03 AC 231 ms
39,804 KB
testcase_04 AC 221 ms
39,896 KB
testcase_05 AC 226 ms
40,348 KB
testcase_06 AC 229 ms
40,224 KB
testcase_07 AC 672 ms
61,332 KB
testcase_08 AC 628 ms
61,268 KB
testcase_09 AC 752 ms
61,184 KB
testcase_10 AC 742 ms
61,272 KB
testcase_11 AC 576 ms
61,272 KB
testcase_12 AC 2 ms
4,376 KB
testcase_13 AC 2 ms
4,376 KB
testcase_14 AC 3 ms
4,376 KB
testcase_15 AC 3 ms
4,376 KB
testcase_16 AC 3 ms
4,380 KB
testcase_17 AC 1 ms
4,384 KB
testcase_18 AC 318 ms
37,912 KB
testcase_19 AC 510 ms
54,076 KB
testcase_20 AC 927 ms
49,040 KB
testcase_21 AC 653 ms
46,480 KB
testcase_22 AC 1,521 ms
50,648 KB
testcase_23 AC 519 ms
53,140 KB
testcase_24 AC 568 ms
52,528 KB
testcase_25 AC 561 ms
52,356 KB
testcase_26 AC 490 ms
52,096 KB
testcase_27 AC 476 ms
51,632 KB
testcase_28 AC 443 ms
51,516 KB
testcase_29 AC 2,690 ms
51,968 KB
testcase_30 AC 1,309 ms
50,656 KB
testcase_31 AC 885 ms
48,776 KB
testcase_32 AC 650 ms
45,572 KB
testcase_33 AC 468 ms
42,144 KB
testcase_34 AC 412 ms
40,028 KB
testcase_35 AC 379 ms
38,492 KB
testcase_36 AC 1,472 ms
195,584 KB
testcase_37 AC 2,482 ms
43,360 KB
testcase_38 AC 468 ms
51,912 KB
testcase_39 AC 477 ms
52,124 KB
testcase_40 AC 601 ms
52,032 KB
testcase_41 AC 604 ms
51,940 KB
testcase_42 AC 840 ms
51,956 KB
testcase_43 AC 1,228 ms
52,240 KB
testcase_44 AC 1,836 ms
53,040 KB
testcase_45 TLE -
testcase_46 AC 213 ms
38,624 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 = 300;

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

    vector<vll> G(n), G2(n);
    unordered_map<int, unordered_map<int, int>> fri, 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]);
        fri[a[i]][b[i]] = 1;
        fri[b[i]][a[i]] = 1;
    }

    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){
            s[p[i]].insert(i);
        }else{
            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]]++;
            }
        }else{
            s[p[x]].erase(x);
            s[p[y]].insert(x);
        }
        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;
        if((int) G2[x].size() <= BLOCK){
            for(auto z : G2[x]){
                if(p[z] == p[y]){
                    check = 1;
                    break;
                }
            }
        }else{
            for(auto z : s[p[y]]){
                if(fri[x].count(z) == 1){
                    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