时间复杂度 $O(\text{n}^2\log{\text{n}})$，没爆啊

#include <iostream>
#include <algorithm>
#include <vector>
using namespace std;
string w[3001],r[3001];
vector<string> v;
int n,m;
int main() {
	cin.tie(nullptr)->sync_with_stdio(false),
	cout.tie(nullptr);
	cin>>n>>m;
	if(n==1) {cout<<'1';return 0;}
	else for(int i=1;i<=n;i++) {
		cin>>r[i];
		sort(r[i].begin(),r[i].end());
		w[i]=r[i];
		reverse(r[i].begin(),r[i].end());
	}
	for(int i=1;i<=n;i++) {
		v.clear();
		for(int j=1;j<=n;j++)
			v.push_back(i!=j?r[j]:w[j]);
		sort(v.begin(),v.end());
		cout<<((v[0]==w[i]&&v[1]!=w[i])?'1':'0');
	}
	return 0;
}