CS204/postmid_lab4B at master · Krish03na/CS204 · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
#include<bits/stdc++.h>
using namespace std;


typedef long long ll;
int bipartite=1;

int color_graph(int k,int color[],vector<int> v[],int visited[])
{
	visited[k]=1;
	for(auto i:v[k]){
		if(color[i]==-1){
		    color[i]=1-(color[k]);
		}
	    else if(color[i]==color[k]){

    		bipartite=0;
    		return 0;
    	}
	}
	for(auto i:v[k]){

		if(visited[i]==0)
		   color_graph(i,color,v,visited);
	}
}

int main()
{
	int n, m, e=0;
	cin>>n>>m;
	vector<int> v[n+m];
	for(int i=0;i<=m-1;i++){
		int x,y,w;
		cin>>x>>y>>w;
		if(w%2==1)
		{
			v[x].push_back(y);
			v[y].push_back(x);
		}
		else
		{
			v[x].push_back(n+e);
			v[n+e].push_back(x);

			v[y].push_back(n+e);
			v[n+e].push_back(y);

			e++;
		}

	}
	n=n+e;
	int visited[n];
	for(int i=0;i<=n-1;i++)
	{
		visited[i]=0;
	}

	int color[n];
	for(int i=0;i<=n-1;i++)
	{
		color[i]=-1;
	}
    for(int i=0;i<=n-1;i++){

    	if(color[i]==-1)
    		{   color[i]=0;
    			color_graph(i,color,v,visited);
    		}

    }

    if(bipartite==0)
    	cout<<"YES\n";
    else
    	cout<<"NO\n";

}