Submission #43423612

Source Code Expand

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define pk pop_back
#define fr first
#define sc second
#define endl '\n'
#define upb upper_bound
#define lob lower_bound
const ll mod[]={1000000007,998244353};
const ll INF[]={INT_MAX,LLONG_MAX-1};
const ll N = 200005;
ll n, m;
vector<int> adj[N];
bool col[N];
bool ans;
bool visited[N];
int timer;
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define pk pop_back
#define fr first
#define sc second
#define endl '\n'
#define upb upper_bound
#define lob lower_bound

const ll mod[]={1000000007,998244353};
const ll INF[]={INT_MAX,LLONG_MAX-1};

const ll N = 200005;
ll n, m;
vector<int> adj[N];
bool col[N];
bool ans;
bool visited[N];
int timer;

void dfs(int i){
    timer++;
    visited[i] = true;
    for (auto x : adj[i]){
        if(timer > 1 && visited[x] && (col[x] == col[i])) ans = true;
        if(visited[x]) continue;
        if(col[i] ^ col[x]) dfs(x);
    }
}

void solve(){
    cin>>n>>m;
    int x,y;
    ans = 0;
    for(int i=0; i<m; i++){
        cin >> x >> y;
        adj[x].pb(y);
        adj[y].pb(x);
    }
    for (ll i = 1; i < n+1; ++i){
        visited[i] = false;
        cin >> col[i];  
    }
    for (ll i = 1; i <= n; ++i){
        if(visited[i]) continue;
        timer = 0;
        dfs(i);
    }
    if(ans) cout<<"Yes";
    else cout<<"No";
}

int main(){
    ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    int tt; tt = 1;
    while(tt--){
        solve(); 
        cout<<endl;
    }
    return 0;
}

Submission Info

Judge Result