Submission #43428871

---

Source Code Expand

#include <bits/stdc++.h>
#define mp make_pair
#define pb push_back
#define pf push_front
#define popb pop_back
#define popf pop_front
#define xx first
#define yy second
#define ff(i,s,f) for(int i=s;i<f;i++)
#define fb(i,s,f) for(int i=(s)-1;i>=f;i--)
#define ffi(i,s,f) for(int i=s;i<=f;i++)
#define fbi(i,s,f) for(int i=s;i>=f;i--)
#define srt(a) sort(a.begin(),a.end());
#define srtg(a,int) sort(a.begin(),a.end(),greater<int>())
#define lb(a,x) lower_bound(a.begin(),a.end(),x)
#define ub(a,x) upper_bound(a.begin(),a.end(),x)
#define fnd(a,x) find(a.begin(),a.end(),x)
#define ios ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0)

using namespace std;

typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef string str;

const int maxn=2e5+10;

pair<int,int> g[maxn];
int c[maxn];
int dsu[maxn];
bool moze=false;

int cale(int a){
    return dsu[a]==a ? a:dsu[a]=cale(dsu[a]);
}

void join(int a,int b){
    a=cale(a); b=cale(b);
    dsu[a]=b;
}

void init(int n){
    for(int i=1;i<=n;i++) dsu[i]=i;
}


void solve(){
    int n,m;
    cin>>n>>m;
    for(int i=1;i<=m;i++){
        int a,b; cin>>a>>b;
        g[i]={a,b};
    }
    init(n);
    for(int i=1;i<=n;i++) cin>>c[i];
    for(int i=1;i<=m;i++){
        if(c[g[i].first]!=c[g[i].second]){
            join(g[i].first,g[i].second);
        }
    }
    for(int i=1;i<=m;i++){
        if(c[g[i].first]==c[g[i].second] && cale(g[i].first)==cale(g[i].second)) moze=true;
    }
    if(moze) cout<<"Yes\n";
    else cout<<"No\n";
}

int main(){
    ios;
    int t=1;
    //cin>>t;
    while(t--) solve();
    return 0;
}

Submission Info

Judge Result