939D. Love Rescue - Codeforces Solution C++

➤  Problem Link : 939D. Love Rescue 

✅ C++ Solution :

 
#include<bits/stdc++.h>
using namespace std;

char parent[256];

char find(char c)
{
	if(parent[c]==c)
		return c;

	return parent[c]=find(parent[c]);
}


int main()
{
	int n;
	cin>>n;
	string s,t;
	cin>>s>>t;
    for(char c='a';c<='z';c++)
        parent[c]=c;
	vector<pair<char,char> > ans;
	char a,b;
	for(int i=0;i<n;i++)
	{
		a=find(s[i]);
		b=find(t[i]);

		if(a!=b)
		{
			parent[a]=b;
			ans.push_back(make_pair(s[i],t[i]));
		}
	}
	cout<<ans.size()<<"\n";

	for(int i=0;i<ans.size();i++)
	{
		cout<<ans[i].first<<" "<<ans[i].second<<"\n";
	}
}

 

Thank you for your patience reading. If you enjoyed this post, I’d be very grateful if you’d help it spread by emailing it to a friend, or sharing it on Whatsapp or Facebook. 

😇Happy Learning!!

• Tweet
• Share
• Share
• Share
• Share

About Utkarsh Gupta

I am a Member Technical at D.E. Shaw India Pvt. Ltd. CodingWithArt is a blog where you find tricks and solutions to challenging coding and development problems. I aim to build a universal tech platform for every enthusiast out there.