题意:给你两个长度分别为 n,m的正整数序列 a,b。以矩阵形式给出所有ai 和 bj(1≤i≤n,1≤j≤m) 的大小关系(>,<,=)。构造符合条件的 a 和 b序列,且 a,b 中最大元素尽量小。无解,输出No。
思路:如果相等则放入一个并查集的集合,然后对于每个集合使用拓扑排序。
ac代码:
#include<bits/stdc++.h>
using namespace std;
const int maxn = 2e3 + 5;
vector<int> G[maxn];
int in[maxn], seq[maxn], ans[maxn];
int n, cnt = 0; int f[maxn];
bool vis[maxn];
int _find(int k)
{
if(k != f[k])
f[k] = _find(f[k]);
return f[k];
}
bool topology()
{
for(int i = 1; i <= n; i++)
{
if(in[_find(i)] == 0 && !vis[_find(i)])
{
seq[++cnt] = _find(i);
vis[_find(i)] = true;
ans[_find(i)] = 1;
}
}
int head = 1;
while(head <= cnt)
{
int u = seq[head];
for(int i = 0; i < G[u].size(); i++)
{
int v = G[u][i];
in[_find(v)]--;
if(in[_find(v)] == 0 && !vis[_find(v)])
{
seq[++cnt] = _find(v);
ans[_find(v)] = ans[u] + 1;
vis[_find(v)] = true;
}
}
head++;
}
for(int i = 1; i <= n; i++)
if(in[_find(i)] || !vis[_find(i)])
return false;
return true;
}
char ma[maxn][maxn];
int main()
{
// freopen("in.txt", "r", stdin);
int a, b; scanf("%d %d", &a, &b);
n = a + b;
for(int i = 1; i <= n; i++)
f[i] = i;
for(int i = 1; i <= a; i++)
{
scanf("%s", ma[i] + 1);
for(int j = 1; j <= b; j++)
{
if(ma[i][j] == '=')
{
int x = _find(i);
int y = _find(a + j);
if(x != y)
f[y] = x;
}
}
}
for(int i = 1; i <= a; i++)
{
for(int j = 1; j <= b; j++)
{
char c = ma[i][j];
if(c == '>')
{
in[_find(i)]++;
G[_find(j + a)].push_back(_find(i));
}
else if(c == '<')
{
in[_find(j + a)]++;
G[_find(i)].push_back(_find(j + a));
}
}
}
if(topology())
{
printf("Yes\n");
int i = 1;
for(; i <= a; i++)
printf("%d ", ans[_find(i)]);
printf("\n");
for(; i <= n; i++)
printf("%d ", ans[_find(i)]);
}
else
printf("No\n");
}
此处附上拓扑排序的模板;
#include<bits/stdc++.h>
using namespace std;
const int maxn = 1e4 + 5;
vector<int> G[maxn];
int in[maxn],seq[maxn];
int n,m,cnt = 0;
void topology(){
for(int i = 1;i <= n;i++){
if(in[i] == 0) seq[++cnt] = i;
}
int head = 1;
while(head <= cnt){
int u = seq[head];
int ans = cnt;
for(int i = 0;i < G[u].size();i++){
int v = G[u][i];
in[v]--;
if(in[v] == 0) seq[++cnt] = v;
}
head++;
}
//当cnt不等于n时,说明这图有环
}
int main(){
scanf("%d %d",&n,&m);
for(int i = 1;i <= m;i++){
int x,y;
scanf("%d %d",&x,&y);
G[x].push_back(y);
in[y]++;;
}
topology();
for(int i = 1;i <= cnt;i++) printf("%d\n",seq[i]);
}