CodeForces1131 D. Gourmet choice 并查集+拓扑排序

题目连接：点击查看

Mr. Apple, a gourmet, works as editor-in-chief of a gastronomic periodical. He travels around the world, tasting new delights of famous chefs from the most fashionable restaurants. Mr. Apple has his own signature method of review  — in each restaurant Mr. Apple orders two sets of dishes on two different days. All the dishes are different, because Mr. Apple doesn't like to eat the same food. For each pair of dishes from different days he remembers exactly which was better, or that they were of the same quality. After this the gourmet evaluates each dish with a positive integer.

Once, during a revision of a restaurant of Celtic medieval cuisine named «Poisson», that serves chestnut soup with fir, warm soda bread, spicy lemon pie and other folk food, Mr. Apple was very pleasantly surprised the gourmet with its variety of menu, and hence ordered too much. Now he's confused about evaluating dishes.

The gourmet tasted a set of n

dishes on the first day and a set of m dishes on the second day. He made a table a of size n×m, in which he described his impressions. If, according to the expert, dish i from the first set was better than dish j from the second set, then aij is equal to ">", in the opposite case aij is equal to "<". Dishes also may be equally good, in this case aij

is "=".

Now Mr. Apple wants you to help him to evaluate every dish. Since Mr. Apple is very strict, he will evaluate the dishes so that the maximal number used is as small as possible. But Mr. Apple also is very fair, so he never evaluates the dishes so that it goes against his feelings. In other words, if aij

is "<", then the number assigned to dish i from the first set should be less than the number of dish j from the second set, if aij is ">", then it should be greater, and finally if aij

is "=", then the numbers should be the same.

Help Mr. Apple to evaluate each dish from both sets so that it is consistent with his feelings, or determine that this is impossible.

Input

The first line contains integers n

and m (1≤n,m≤1000

) — the number of dishes in both days.

Each of the next n

lines contains a string of m symbols. The j-th symbol on i-th line is aij

. All strings consist only of "<", ">" and "=".

Output

The first line of output should contain "Yes", if it's possible to do a correct evaluation for all the dishes, or "No" otherwise.

If case an answer exist, on the second line print n

integers — evaluations of dishes from the first set, and on the third line print m

integers — evaluations of dishes from the second set.

Examples

Input

Copy

3 4
>>>>
>>>>
>>>>

Output

Copy

Yes
2 2 2 
1 1 1 1 

Input

Copy

3 3
>>>
<<<
>>>

Output

Copy

Yes
3 1 3 
2 2 2 

Input

Copy

3 2
==
=<
==

Output

Copy

No

题意：问有没有符合条件的n个数和m个数满足矩阵的条件

题解：一看有比较大小，很明显我们可以通过拓扑排序来完成，小的指向大的，每一个数取符合条件的最小的（即指向他的最大的数+1）即可，至于相等的呢，我们就把他们先连接到一块，傻逼了，写错了个地方，并查集连接到一块的只有祖先有值，写成了取父亲的，也是操蛋，。。。。

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N=150010;
int a[2100];
int pre[2100];
int n,m;
char s[1100][1100];
vector<int> v[2100];
int in[2100];
int f(int x)
{
	return x==pre[x]?x:pre[x]=f(pre[x]);
}
int main()
{
	int ans=0;
	scanf("%d%d",&n,&m);
	for(int i=1;i<=2000;i++) pre[i]=i; 
	for(int i=1;i<=n;i++)
	{
		scanf("%s",s[i]+1);
		for(int j=1;j<=m;j++)
		{
			if(s[i][j]=='=')
			{
				int xx=f(i);
				int yy=f(j+1000);
				if(xx==yy) continue;
				pre[yy]=xx;
				ans++;
			}
		}
	}

	for(int i=1;i<=n;i++)
	{
		for(int j=1;j<=m;j++)
		{
			if(s[i][j]=='=') continue;
			int xx=f(i);
			int yy=f(j+1000);
			
			if(s[i][j]=='<')
			{
				v[xx].push_back(yy);
				in[yy]++;
			}
			else
			{
				v[yy].push_back(xx);
				in[xx]++;
			}
		}
	}
	queue<int> q;
	for(int i=1;i<=n;i++)
	{
		if(pre[i]==i&&in[i]==0)
		{
			q.push(i);
			a[i]=1;
			ans++;
		}
	}
	for(int i=1001;i<=m+1000;i++)
	{
		if(pre[i]==i&&in[i]==0)
		{
			q.push(i);
			a[i]=1;
			ans++;
		}
	}
	if(q.empty()) printf("No\n");
	else
	{
		while(!q.empty())
		{
			int u=q.front();q.pop();
			for(int i=0;i<v[u].size();i++)
			{
				int to=v[u][i];
				in[to]--;
				if(a[to]==0) a[to]=a[u]+1;
				else a[to]=max(a[to],a[u]+1);
				if(in[to]==0) 
				{
					ans++;q.push(to);
				}
			}
		}
		if(ans!=n+m)
		{
			printf("No\n");
			return 0;
		}
		printf("Yes\n");
		for(int i=1;i<=n;i++)
		{
		//	cout<<pre[i]<<endl;
			if(pre[i]!=i) a[i]=a[f(i)];
			
			printf("%d%c",a[i]," \n"[i==n]);
		}
		for(int i=1001;i<=m+1000;i++)
		{
			if(pre[i]!=i) a[i]=a[f(i)];
			
			printf("%d%c",a[i]," \n"[i==m+1000]);
		}
	}
	return 0;
}