提出 #38218695

---

ソースコード 拡げる

#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using ld = long double;
using pll = pair<ll, ll>;
// and so on
int par[200001];
int fnd(int x){
    return par[x]? par[x] = fnd(par[x]) : x;
}
bool uni(int a, int b){
    a = fnd(a);
    b = fnd(b);
    if(a != b){
        par[b] = a;
        return true;
    }
    return false;
}
pii edges[200001];
bool chk[200001];
int cnt[200001];
bool vis2[200001];
bool vis[200001];
vector<vector<int> > mp;
void dfs(int x){
    vis[x] = true;
    for(int nx : mp[x]){
        if(!vis[nx]) dfs(nx);
    }
}
int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    int N, M;
    cin>>N>>M;
    mp.resize(N+1);
    for(int i=1;i<=M;i++){
        int a, b;
        cin>>a>>b;
        edges[i] = {a, b};
    }
    int K;
    cin>>K;
    for(int i=0;i<K;i++){
        int x;
        cin>>x;
        chk[x] = true;
    }
    for(int i=1;i<=M;i++){
        if(!chk[i]){
            auto [a, b] = edges[i];
            uni(a, b);
        }
    }
    for(int i=1;i<=M;i++){
        if(chk[i]){
            auto [a, b] = edges[i];
            a = fnd(a);
            b = fnd(b);
            vis2[a] = true;
            vis2[b] = true;
            if(a != b){
                cnt[a]++;
                cnt[b]++;
                mp[a].push_back(b);
                mp[b].push_back(a);
            }
        }
    }
    dfs(fnd(1));
    bool isok = true;
    int left = 0;
    for(int i=1;i<=N;i++){
        if(vis2[i]){
            isok &= vis[i];
            left += cnt[i]%2;
        }
    }
    isok &= left == 0 || left == 2;
    cout<<(isok?"Yes":"No"); 
}

提出情報

ジャッジ結果