发现个很神奇的暴力（？

洛谷测了100pts

#include<iostream>
#include<algorithm>
#include<map>
using namespace std;

int n,m;
string s[3010];
int noe;
map<string,string> alg;

int main()
{
    scanf("%d %d",&n,&m);
    if(n==1) {
        cout<<1;
        return 0;
    }
    for(int i=1; i<=n; i++) cin>>s[i];
    for(int i=1; i<=n; i++) {
        //testing  s[i]
        bool f=0;
        string now = s[i];
        sort(now.begin(),now.end());
        for(int j=1;j<=n;j++) {
            if(i==j) continue;
            if(now>s[j]) {
            	string test = s[j],np = s[j],comp;
            	if(alg[test].size()>0) comp=alg[test];
            	else {
            		sort(test.begin(),test.end());
            		reverse(test.begin(),test.end());
            		alg[np] = comp = test;
				}
				if(now>comp) {
            		cout<<0;
                    f=1;
                    break;
		     	}
                //cout<<0;
                //f=1;
                //break;
            }
        }
        if(!f) cout<<1;
    }
    return 0;
}