D. Gourmet choice并查集,拓扑结构
2 seconds
256 megabytes
standard input
standard output
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 nn dishes on the first day and a set of mm dishes on the second day. He made a table aa of size n×mn×m, in which he described his impressions. If, according to the expert, dish ii from the first set was better than dish jj from the second set, then aijaij is equal to ">", in the opposite case aijaij is equal to "<". Dishes also may be equally good, in this case aijaij 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 aijaij is "<", then the number assigned to dish ii from the first set should be less than the number of dish jj from the second set, if aijaij is ">", then it should be greater, and finally if aijaij 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.
The first line contains integers nn and mm (1≤n,m≤10001≤n,m≤1000) — the number of dishes in both days.
Each of the next nn lines contains a string of mm symbols. The jj-th symbol on ii-th line is aijaij. All strings consist only of "<", ">" and "=".
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 nn integers — evaluations of dishes from the first set, and on the third line print mmintegers — evaluations of dishes from the second set.
3 4
>>>>
>>>>
>>>>
Yes
2 2 2
1 1 1 1
3 3
>>>
<<<
>>>
Yes
3 1 3
2 2 2
3 2
==
=<
==
No
In the first sample, all dishes of the first day are better than dishes of the second day. So, the highest score will be 22, for all dishes of the first day.
In the third sample, the table is contradictory — there is no possible evaluation of the dishes that satisfies it
.题意:问有没有符合条件的n个数和m个数满足矩阵的条件
以下是大神的解答,我还不太会
题解:一看有比较大小,很明显我们可以通过拓扑排序来完成,小的指向大的,每一个数取符合条件的最小的(即指向他的最大的数+1)即可,至于相等的呢,我们就把他们先连接到一块,傻逼了,写错了个地方,并查集连接到一块的只有祖先有值,写成了取父亲的,也是操蛋,。。。。
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N=;
int a[];
int pre[];
int n,m;
char s[][];
vector<int> v[];
int in[];
int f(int x)
{
return x==pre[x]?x:pre[x]=f(pre[x]);
}
int main()
{
int ans=;
scanf("%d%d",&n,&m);
for(int i=;i<=;i++) pre[i]=i;
for(int i=;i<=n;i++)
{
scanf("%s",s[i]+);
for(int j=;j<=m;j++)
{
if(s[i][j]=='=')
{
int xx=f(i);
int yy=f(j+);
if(xx==yy) continue;
pre[yy]=xx;
ans++;
}
}
} for(int i=;i<=n;i++)
{
for(int j=;j<=m;j++)
{
if(s[i][j]=='=') continue;
int xx=f(i);
int yy=f(j+); 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=;i<=n;i++)
{
if(pre[i]==i&&in[i]==)
{
q.push(i);
a[i]=;
ans++;
}
}
for(int i=;i<=m+;i++)
{
if(pre[i]==i&&in[i]==)
{
q.push(i);
a[i]=;
ans++;
}
}
if(q.empty()) printf("No\n");
else
{
while(!q.empty())
{
int u=q.front();q.pop();
for(int i=;i<v[u].size();i++)
{
int to=v[u][i];
in[to]--;
if(a[to]==) a[to]=a[u]+;
else a[to]=max(a[to],a[u]+);
if(in[to]==)
{
ans++;q.push(to);
}
}
}
if(ans!=n+m)
{
printf("No\n");
return ;
}
printf("Yes\n");
for(int i=;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=;i<=m+;i++)
{
if(pre[i]!=i) a[i]=a[f(i)]; printf("%d%c",a[i]," \n"[i==m+]);
}
}
return ;
}
以下是cf其他的解答
#include<iostream>
#include<cstdio>
#include<cstring>
#include<vector>
#include<queue> using namespace std;
const int N=; vector<int> v[N];
queue<int> Q;
int n,m,col[N],stk[N],top,cnt,val[N][N],zz[N];
int dfn[N],low[N],ans[N],col_num,f[N],num,d[N];
bool vis[N];
struct Edge{
int u,v,w;
}edge[N*N]; inline void add(int x,int y,int z){
v[x].push_back(y); val[x][y]=z;
} void tarjan(int x){
dfn[x]=low[x]=++num;
stk[++top]=x; vis[x]=; int u;
for(int i=;i<v[x].size();i++){
u=v[x][i];
if(!dfn[u]) tarjan(u),low[x]=min(low[x],low[u]);
else if(vis[u]) low[x]=min(low[x],dfn[u]);
}
if(dfn[x]!=low[x]) return;
col[x]=++col_num; vis[x]=; int lst=x;
while(stk[top]!=x){
col[stk[top]]=col_num;
vis[stk[top]]=;
zz[col_num]+=val[stk[top]][lst];
lst=stk[top]; top--;
} zz[col_num]+=val[lst][x]; top--;
} int main(){
scanf("%d%d",&n,&m);
for(int i=;i<=n;i++)
for(int j=;j<=m;j++){
char ch=getchar();
while(ch!='=' && ch!='<' && ch!='>') ch=getchar();
if(ch=='<'){
add(i,j+n,);
edge[++cnt].u=i,edge[cnt].v=j+n,edge[cnt].w=;
}
else if(ch=='>'){
add(j+n,i,);
edge[++cnt].u=j+n,edge[cnt].v=i,edge[cnt].w=;
}
else {
edge[++cnt].u=i; edge[cnt].v=j+n; edge[cnt].w=;
edge[++cnt].u=j+n; edge[cnt].v=i; edge[cnt].w=;
add(i,j+n,); add(j+n,i,);
}
}
for(int i=;i<=n+m;i++) if(!dfn[i]) tarjan(i);
for(int i=;i<=col_num;i++)
if(zz[i]>) {puts("No"); return ;}
for(int i=;i<=col_num;i++)
v[i].clear();
memset(val,,sizeof(val));
for(int i=;i<=cnt;i++){
int u=edge[i].u,v=edge[i].v,w=edge[i].w;
if(col[u]==col[v]) continue;
add(col[u],col[v],w); d[col[v]]++;
}
for(int i=;i<=col_num;i++)
if(!d[i]) f[i]=,Q.push(i);
while(Q.size()){
int x=Q.front(); Q.pop();
for(int i=;i<v[x].size();i++){
int u=v[x][i];
f[u]=max(f[u],f[x]+val[x][u]);
d[u]--; if(!d[u]) Q.push(u);
}
}
puts("Yes");
for(int i=;i<=n;i++) printf("%d ",f[col[i]]);
puts("");
for(int i=n+;i<=n+m;i++) printf("%d ",f[col[i]]);
return ;
}
D. Gourmet choice并查集,拓扑结构的更多相关文章
- Codeforces #541 (Div2) - D. Gourmet choice(拓扑排序+并查集)
Problem Codeforces #541 (Div2) - D. Gourmet choice Time Limit: 2000 mSec Problem Description Input ...
- codeforces #541 D. Gourmet choice(拓扑+并查集)
Mr. Apple, a gourmet, works as editor-in-chief of a gastronomic periodical. He travels around the wo ...
- CF1131D Gourmet choice(并查集,拓扑排序)
这题CF给的难度是2000,但我感觉没这么高啊…… 题目链接:CF原网 题目大意:有两个正整数序列 $a,b$,长度分别为 $n,m$.给出所有 $a_i$ 和 $b_j(1\le i\le n,1\ ...
- Codeforces Round #541 (Div. 2) D(并查集+拓扑排序) F (并查集)
D. Gourmet choice 链接:http://codeforces.com/contest/1131/problem/D 思路: = 的情况我们用并查集把他们扔到一个集合,然后根据 > ...
- Redundant Paths-POJ3177(并查集+双连通分量)
Redundant Paths Description In order to get from one of the F (1 <= F <= 5,000) grazing fields ...
- UVA1623-Enter The Dragon(并查集)
Problem UVA1623-Enter The Dragon Accept: 108 Submit: 689Time Limit: 3000 mSec Problem Description T ...
- BZOJ 4199: [Noi2015]品酒大会 [后缀数组 带权并查集]
4199: [Noi2015]品酒大会 UOJ:http://uoj.ac/problem/131 一年一度的“幻影阁夏日品酒大会”隆重开幕了.大会包含品尝和趣味挑战两个环节,分别向优胜者颁发“首席品 ...
- 关押罪犯 and 食物链(并查集)
题目描述 S 城现有两座监狱,一共关押着N 名罪犯,编号分别为1~N.他们之间的关系自然也极不和谐.很多罪犯之间甚至积怨已久,如果客观条件具备则随时可能爆发冲突.我们用"怨气值"( ...
- 图的生成树(森林)(克鲁斯卡尔Kruskal算法和普里姆Prim算法)、以及并查集的使用
图的连通性问题:无向图的连通分量和生成树,所有顶点均由边连接在一起,但不存在回路的图. 设图 G=(V, E) 是个连通图,当从图任一顶点出发遍历图G 时,将边集 E(G) 分成两个集合 T(G) 和 ...
随机推荐
- Ruby: Call the system and get system information.
1. Kill the task cmd2="taskkill /F /IM typeperf.exe"stdout2=%x{#{cmd2}} 2. Start counters: ...
- 洛谷P4141 消失之物——背包
题目:https://www.luogu.org/problemnew/show/P4141 竟然是容斥:不选 i 物品只需减去选了 i 物品的方案: 范围原来是2*10^3而不是2*103啊... ...
- linq to EF分组查询 group by 的使用
第一种:查询表达式语法: IQueryable<EnrollmentDateGroup> data = from student in db.Students group student ...
- BZOJ 1001 [BeiJing2006]狼抓兔子 (UVA 1376 Animal Run)
1001: [BeiJing2006]狼抓兔子 Time Limit: 15 Sec Memory Limit: 162 MBSubmit: 24727 Solved: 6276[Submit][ ...
- nmcli 学习小结
nmcli 是Redhat提供的网络配置编辑工具, 它可直接编辑/etc/sysconfig/network-scripts/ifcfg-xxx , 它是NetworkManager服务的客户端工具, ...
- LoadRunner_11破解教程完整版
2017.12.17更正 qtm的LR11,如果是win10版本的电脑而且ie浏览器是11以上的请到loadrunner官网下载社区免费版,支持google,firefox,edge,ie11四大浏览 ...
- 数论+DP HDOJ 4345 Permutation
题目传送门 题意:一个置换群,经过最少k次置换后还原.问给一个N个元素,在所有的置换群里,有多少个不同的k. 分析:这道题可以转化成:N = Σ ai ,求LCM ( ai )有多少个不同的值.比如N ...
- 472 Concatenated Words 连接的单词
详见:https://leetcode.com/problems/concatenated-words/description/ C++: class Solution { public: vecto ...
- hbase rpc这点事
年前的时候系统梳理了一下hbase rpc的实现,并且对组里的小伙伴做了一次分享.趁着热乎劲还没完全消失殆尽,准备赶紧记录下来. hbase中rpc概况 作为一个分布式系统,hbase的设计是典型的m ...
- 阿里maven仓库地址
在国内访问Maven仓库,连接速度太慢.下面是将中央仓库替换成阿里云的中央仓库的方法. 第一种,统一修改仓库地址 可以直接修改Mavenconf文件夹中的setting.xml文件,或者在.m2文件夹 ...