-
Notifications
You must be signed in to change notification settings - Fork 0
/
Satisfiability of Equality Equations.cpp
69 lines (66 loc) · 1.39 KB
/
Satisfiability of Equality Equations.cpp
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
class Solution {
public:
vector<int> adj[100001];
int vis[100001];
int comp[100001];
int con;
vector<pair<int,int>> edg;
void dfs(int src)
{
vis[src]=1;
comp[src]=con;
for(int nbr: adj[src])
{
if(vis[nbr]!=1)
{
dfs(nbr);
}
}
}
bool equationsPossible(vector<string>& equations) {
for(int i=0; i<equations.size();i++)
{
string str = equations[i];
if(str[1] == '=' && str[2] == '=')
{
adj[str[0]].push_back(str[3]);
adj[str[3]].push_back(str[0]);
}
else{
edg.push_back(make_pair(str[0],str[3]));
}
}
con=0;
for(int i=0;i<equations.size();i++)
{
//string str2 = equations[i];
if(vis[i]!=1)
{
con++;
dfs(i);
}
}
bool flag=true;
for(int i=0;i<edg.size();i++)
{
int a = edg[i].first;
int b = edg[i].second;
if(comp[a] == comp[b] && a!=b)
{
flag=false;
break;
}
else
{
flag=true;
break;
}
}
if(flag){
return true;
}
else{
return false;
}
}
};