Submission #47231239

---

Source Code Expand

#include <iostream>
#include <vector>
#include <string>
#include <math.h>
#include <cmath>
#include <iomanip>
#include <cstdio>
#include <algorithm>
#include <numeric>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <deque>
#include <bitset>
#include <cstring>
#include <unordered_map>

using namespace std;
typedef long long ll;


vector<ll> d[200007];

int main(){
    ll n, m;
    cin >> n >> m;
    
    vector<ll> a(m);
    for(auto &i: a)
        cin >> i;
    
    vector<ll> b(m);
    for(auto &i: b)
        cin >> i;
    
    for(int i = 0; i < m; i++){
        d[a[i]].push_back(b[i]);
        d[b[i]].push_back(a[i]);
    }
    
    vector<ll> col(n + 1, -1);
    
    bool ok = false;
    
    for(int i = 1; i <= n; i++){
        if(col[i] == -1){
            queue<ll> q;
            
            q.push(i);
            col[i] = 0;
            
            while(!q.empty()){
                ll v = q.front();
                q.pop();
                
                for(auto i: d[v]){
                    if(col[i] == -1){
                        col[i] = 1 - col[v];
                        
                        q.push(i);
                    }
                    else{
                        if(col[i] == col[v]){
                            ok = true;
                            break;
                        }
                    }
                }
            }
        }
    }
    
    if(ok)
        cout << "No" << endl;
    else
        cout << "Yes" << endl;
     
    return 0;
}

Submission Info

Judge Result