POJ 1635 Subway tree systems G++ dfs 背

#include <iostream>
#include <cstdio>
#include <string>
#include <vector>
#include <algorithm>
using namespace std;
//英语   抄博友程序    dfs    背 
string s;
string dfs(int l,int r)
{
	vector<string> ve;
	int js=0;
	int wz=l;
	for(int i=l;i<=r;i++)
	{
		if(s[i]=='0')
		{
			js++;
		}else
		{
			js--;
		}
		if(js==0)
		{
			ve.push_back(dfs(wz+1,i-1));
			wz=i+1;//抄博友程序 
		}		
	}
	sort(ve.begin(),ve.end());
	string jg="0";
	for(int i=0;i<ve.size();i++)
	{
		jg=jg+ve[i];
	} 
	return jg+"1";
}
int main()
{
	int T;
	cin>>T;
	for(int o=0;o<T;o++)
	{
		cin>>s;
		//cout<<s<<endl;
		string a=dfs(0,s.size()-1);
		cin>>s;
		//cout<<s<<endl;
		string b=dfs(0,s.size()-1);
		//cout<<a<<endl<<b<<endl;
		if(a==b)
		{
			cout<<"same"<<endl;
		}else
		{
			cout<<"different"<<endl;
		}
	} 
	return 0;
}