結果

問題 No.2319 Friends+
ユーザー woodywoodywoodywoody
提出日時 2023-05-29 00:33:01
言語 C++14
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 850 ms / 3,000 ms
コード長 5,227 bytes
コンパイル時間 4,180 ms
コンパイル使用メモリ 235,048 KB
実行使用メモリ 89,984 KB
最終ジャッジ日時 2024-06-08 13:50:29
合計ジャッジ時間 26,261 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge2
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 1 ms
5,248 KB
testcase_01 AC 3 ms
5,376 KB
testcase_02 AC 770 ms
59,264 KB
testcase_03 AC 711 ms
59,264 KB
testcase_04 AC 689 ms
59,264 KB
testcase_05 AC 669 ms
59,264 KB
testcase_06 AC 749 ms
59,136 KB
testcase_07 AC 340 ms
7,424 KB
testcase_08 AC 352 ms
7,424 KB
testcase_09 AC 334 ms
7,424 KB
testcase_10 AC 335 ms
7,552 KB
testcase_11 AC 328 ms
7,424 KB
testcase_12 AC 2 ms
5,376 KB
testcase_13 AC 2 ms
5,376 KB
testcase_14 AC 2 ms
5,376 KB
testcase_15 AC 3 ms
5,376 KB
testcase_16 AC 3 ms
5,376 KB
testcase_17 AC 2 ms
5,376 KB
testcase_18 AC 322 ms
7,936 KB
testcase_19 AC 320 ms
7,808 KB
testcase_20 AC 321 ms
7,424 KB
testcase_21 AC 325 ms
7,296 KB
testcase_22 AC 332 ms
7,424 KB
testcase_23 AC 320 ms
7,552 KB
testcase_24 AC 318 ms
7,552 KB
testcase_25 AC 318 ms
7,424 KB
testcase_26 AC 330 ms
7,424 KB
testcase_27 AC 315 ms
7,552 KB
testcase_28 AC 318 ms
7,552 KB
testcase_29 AC 315 ms
7,552 KB
testcase_30 AC 332 ms
7,424 KB
testcase_31 AC 320 ms
7,424 KB
testcase_32 AC 315 ms
7,424 KB
testcase_33 AC 313 ms
7,424 KB
testcase_34 AC 316 ms
7,424 KB
testcase_35 AC 316 ms
7,424 KB
testcase_36 AC 316 ms
7,296 KB
testcase_37 AC 512 ms
79,232 KB
testcase_38 AC 320 ms
7,296 KB
testcase_39 AC 320 ms
7,552 KB
testcase_40 AC 330 ms
7,552 KB
testcase_41 AC 328 ms
7,424 KB
testcase_42 AC 331 ms
7,296 KB
testcase_43 AC 326 ms
7,680 KB
testcase_44 AC 431 ms
25,600 KB
testcase_45 AC 528 ms
49,152 KB
testcase_46 AC 850 ms
89,984 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include<bits/stdc++.h>
#include<atcoder/all>
#define rep(i,b) for(int i=0;i<b;i++)
#define rrep(i,b) for(int i=b-1;i>=0;i--)
#define rep1(i,b) for(int i=1;i<b;i++)
#define repx(i,x,b) for(int i=x;i<b;i++)
#define rrepx(i,x,b) for(int i=b-1;i>=x;i--)
#define fore(i,a) for(auto& i:a)
#define rng(x) (x).begin(), (x).end()
#define rrng(x) (x).rbegin(), (x).rend()
#define sz(x) ((int)(x).size())
#define pb push_back
#define fi first
#define se second
#define pcnt __builtin_popcountll

using namespace std;
using namespace atcoder;

using ll = long long;
using ld = long double;
template<typename T> using mpq = priority_queue<T, vector<T>, greater<T>>;
template<typename T> bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<typename T> bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
template<typename T> ll sumv(const vector<T>&a){ll res(0);for(auto&&x:a)res+=x;return res;}
bool yn(bool a) { if(a) {cout << "Yes" << endl; return true;} else {cout << "No" << endl; return false;}}
#define dame { cout << "No" << endl; return;}
#define dame1 { cout << -1 << endl; return;}
#define cout2(x,y) cout << x << " " << y << endl;
#define coutp(p) cout << p.fi << " " << p.se << endl;
#define out cout << ans << endl;
#define outd cout << fixed << setprecision(20) << ans << endl;
#define outm cout << ans.val() << endl;
#define outv fore(yans , ans) cout << yans << "\n";
#define outdv fore(yans , ans) cout << yans.val() << "\n";
#define coutv(v) {fore(vy , v) {cout << vy << " ";} cout << endl;}
#define coutv2(v) fore(vy , v) cout << vy << "\n";
#define coutvm(v) {fore(vy , v) {cout << vy.val() << " ";} cout << endl;}
#define coutvm2(v) fore(vy , v) cout << vy.val() << "\n";
using pll = pair<ll,ll>;using pil = pair<int,ll>;using pli = pair<ll,int>;using pii = pair<int,int>;using pdd = pair<ld,ld>;
using tp = tuple<int ,int ,int>;
using vi = vector<int>;using vd = vector<ld>;using vl = vector<ll>;using vs = vector<string>;using vb = vector<bool>;
using vpii = vector<pii>;using vpli = vector<pli>;using vpll = vector<pll>;using vpil = vector<pil>;
using vvi = vector<vector<int>>;using vvl = vector<vector<ll>>;using vvs = vector<vector<string>>;using vvb = vector<vector<bool>>;
using vvpii = vector<vector<pii>>;using vvpli = vector<vector<pli>>;using vvpll = vector<vpll>;using vvpil = vector<vpil>;
using mint = modint998244353;
//using mint = modint1000000007;
//using mint = dynamic_modint<0>;
using vm = vector<mint>;
using vvm = vector<vector<mint>>;
vector<int> dx={1,0,-1,0,1,1,-1,-1},dy={0,1,0,-1,1,-1,1,-1};
ll gcd(ll a, ll b) { return a?gcd(b%a,a):b;}
ll lcm(ll a, ll b) { return a/gcd(a,b)*b;}
#define yes {cout <<"Yes"<<endl;}
#define yesr { cout <<"Yes"<<endl; return;}
#define no {cout <<"No"<<endl;}
#define nor { cout <<"No"<<endl; return;}
const double eps = 1e-10;
const ll LINF = 1001002003004005006ll;
const int INF = 1001001001;
#ifdef MY_LOCAL_DEBUG
#define show(x) cerr<<#x<<" = "<<x<<endl
#define showp(p) cerr<<#p<<" = "<<p.fi<<" : "<<p.se<<endl
#define show2(x,y) cerr<<#x<<" = "<<x<<" : "<<#y<<" = "<<y<<endl
#define show3(x,y,z) cerr<<#x<<" = "<<x<<" : "<<#y<<" = "<<y<<" : "<<#z<<" = "<<z<<endl
#define show4(x,y,z,x2) cerr<<#x<<" = "<<x<<" : "<<#y<<" = "<<y<<" : "<<#z<<" = "<<z<<" : "<<#x2<<" = "<<x2<<endl
#define test(x) cout << "test" << x << endl
#define showv(v) {fore(vy , v) {cout << vy << " ";} cout << endl;}
#define showv2(v) fore(vy , v) cout << vy << "\n";
#define showvm(v) {fore(vy , v) {cout << vy.val() << " ";} cout << endl;}
#define showvm2(v) fore(vy , v) cout << vy.val() << "\n";
#else
#define show(x)
#define showp(p)
#define show2(x,y)
#define show3(x,y,z)
#define show4(x,y,z,x2)
#define test(x)
#define showv(v)
#define showv2(v)
#define showvm(v)
#define showvm2(v)
#endif

void solve(){
    int n,m; cin>>n>>m;
    vi p(n);
    rep(i,n) cin>>p[i],p[i]--;
    vvi e(n);
    vvi e2(n);
    vi d(n);
    rep(i,m){
        int a,b; cin>>a>>b;
        a--; b--;
        d[a]++; d[b]++;
        e2[a].pb(b);
        e2[b].pb(a);
    }
    int th = (int)sqrt(n) + 1;
    if (th>n) th = n;
    vi idx;
    vi idxr(n);
    rep(i,n){
        if (d[i]>th){
            idxr[i] = sz(idx);
            idx.pb(i);
            fore(y , e2[i]) e[y].pb(i);
        }
    }
    int k = sz(idx);
    vvi cnt(k,vi(n));
    rep(i,k) fore(y , e2[idx[i]]) cnt[i][p[y]]++;
    int q; cin>>q;
    vb ans(q);
    rep(i,q){
        int x,y; cin>>x>>y;
        x--; y--;
        if (p[x]==p[y]) continue;

        auto move = [&](int a,int w)->void{
            fore(y , e[a]) cnt[idxr[y]][p[a]]--;
            p[a] = w;
            fore(y , e[a]) cnt[idxr[y]][p[a]]++;
        };
        if (d[x]>th){
            int l = idxr[x];
            if (cnt[l][p[y]]){
                ans[i] = true;
                move(x,p[y]);
            }
        }else{
            bool ok = false;
            fore(yy , e2[x]) if (p[yy]==p[y]) ok = true;
            if (ok){
                ans[i] = true;
                move(x,p[y]);
            }
        }
    }
    rep(i,q) yn(ans[i]);

    return;
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);

    int t = 1;
    //cin>>t;

    rep(i,t){
        solve();
    }

    return 0;
}
0