NOIP T1 爆零求助

#include <iostream>
#include <cstdio>
#include <string>
#include <cstring>
#include <algorithm>
using namespace std;
const int N = 3010;
int n,m;
char w[N][N];
string w1[N];
string w2[N];
int cnt['z'];
struct node
{
	int id;
	string s;
};
node q[N];
int read()
{
	int s = 0,t = 1;
	char ch = getchar();
	while(ch<'0'||ch>'9')
	{
		if(ch == '-') t = -1;
		ch = getchar();
	}
	while(ch>='0'&&ch<='9')
	{
		s = s*10+ch-'0';
		ch = getchar();
	}
	return s*t;
}
char read_c()
{
	char ch = getchar();
	while(ch<'a'||ch>'z') ch = getchar();
	return ch;
}
bool cmp(node x,node y)
{
	return x.s < y.s;
}
int main()
{
	freopen("dict.in","r",stdin);
	freopen("dict.out","w",stdout);
	n = read(),m = read();
//	for(int i = 1;i<=n;i++)
//	{
//		cin>>w[i];	
//		string t1 = "",t2 = "";
//		string t = "a";
//		for(int j = 0;j<(int)w[i].size();j++)
//		{
//			cnt[w[i][j]]++;
//		}
//		for(int j = 'a';j<='z';j++)
//		{
//			while(cnt[j]) t[0]=j,t1+=t,t2 = t+t2,cnt[j]--;
//		}
//		w1[i] = t1;
//		w2[i] = t2;
//		q[i] = {i,w2[i]};
//	}
	for(int i = 1;i<=n;i++)
	{
		for(int j = 1;j<=m;j++)
		{
			w[i][j] = read_c();
			cnt[w[i][j]]++;
		}
		string t1 = "",t2 = "";
		string t = "a";
		for(int j = 'a';j<='z';j++)
		{
			while(cnt[j]) t[0]=j,t1+=t,t2 = t+t2,cnt[j]--;
		}
		w1[i] = t1;
		w2[i] = t2;
		q[i] = {i,w2[i]};
	}
	sort(q+1,q+1+n,cmp);
	for(int i = 1;i<=n;i++)
	{
		bool flag = 1;
		for(int j = 1;j<=n;j++)
		{
			if(i==q[j].id) continue;
			flag = (w1[i] < q[j].s);
			break;
		}
		if(flag) printf("1");
		else printf("0");
	}
	return 0;
}