[USACO16OPEN]关闭农场Closing the Farm_Silver

题目描述

Farmer John and his cows are planning to leave town for a long vacation, and so FJ wants to temporarily close down his farm to save money in the meantime.

The farm consists of NNN barns connected with MMM bidirectional paths between some pairs of barns (1≤N,M≤30001 \leq N, M \leq 30001≤N,M≤3000). To shut the farm down, FJ plans to close one barn at a time. When a barn closes, all paths adjacent to that barn also close, and can no longer be used.

FJ is interested in knowing at each point in time (initially, and after each closing) whether his farm is "fully connected" -- meaning that it is possible to travel from any open barn to any other open barn along an appropriate series of paths. Since FJ‘s farm is initially in somewhat in a state of disrepair, it may not even start out fully connected.

FJ和他的奶牛们正在计划离开小镇做一次长的旅行,同时FJ想临时地关掉他的农场以节省一些金钱。

这个农场一共有被用M条双向道路连接的N个谷仓(1<=N,M<=3000)。为了关闭整个农场,FJ 计划每一次关闭掉一个谷仓。当一个谷仓被关闭了,所有的连接到这个谷仓的道路都会被关闭,而且再也不能够被使用。

FJ现在正感兴趣于知道在每一个时间(这里的“时间”指在每一次关闭谷仓之后的时间)时他的农场是否是“全连通的”——也就是说从任意的一个开着的谷仓开始,能够到达另外的一个谷仓。注意自从某一个时间之后,可能整个农场都开始不会是“全连通的”。

输入输出格式

输入格式:

The first line of input contains NNN and MMM. The next MMM lines each describe a

path in terms of the pair of barns it connects (barns are conveniently numbered

1…N1 \ldots N1…N). The final NNN lines give a permutation of 1…N1 \ldots N1…N

describing the order in which the barns will be closed.

输出格式:

The output consists of NNN lines, each containing "YES" or "NO". The first line

indicates whether the initial farm is fully connected, and line i+1i+1i+1 indicates

whether the farm is fully connected after the iiith closing.

输入输出样例

输入样例#1:
复制

4 3
1 2
2 3
3 4
3
4
1
2

输出样例#1: 复制

YES
NO
YES
YES

思路

倒序并查集;

代码

 1 #include<cstdio>
 2 const int maxn=6e3+10;
 3 int n,m,now;
 4 int s[maxn],f[maxn];
 5 bool v[maxn],u[maxn];
 6 int h[maxn],hs;
 7 int et[maxn],en[maxn];
 8 void add(){
 9     int u,v;
10     scanf("%d%d",&u,&v);
11     hs++,et[hs]=v,en[hs]=h[u],h[u]=hs;
12     hs++,et[hs]=u,en[hs]=h[v],h[v]=hs;
13 }
14 int ff(int k){return f[k]==k?k:f[k]=ff(f[k]);}
15 int main(){
16     scanf("%d%d",&n,&m);
17     for(int i=1;i<=m;i++) add();
18     for(int i=1;i<=n;i++) scanf("%d",&s[i]),f[i]=i;
19     int a,b;
20     for(int i=n;i>0;i--){
21         u[s[i]]=1,a=ff(s[i]);
22         for(int e=h[a];e;e=en[e])
23         if(u[et[e]]){
24             b=ff(et[e]);
25             if(a!=b) now++,f[b]=a;
26         }
27         if(now==n-i) v[i]=1;
28     }
29     for(int i=1;i<=n;i++){
30         if(v[i]) puts("YES");
31         else puts("NO");
32     }
33     return 0;
34 }
时间: 2024-10-31 02:45:05

[USACO16OPEN]关闭农场Closing the Farm_Silver的相关文章

洛谷P3144 [USACO16OPEN]关闭农场Closing the Farm_Silver

题目描述 Farmer John and his cows are planning to leave town for a long vacation, and so FJ wants to temporarily close down his farm to save money in the meantime. The farm consists of NN barns connected with MM bidirectional paths between some pairs of

luogu P3144 [USACO16OPEN]关闭农场Closing the Farm_Silver解题报告

题目描述 Farmer John and his cows are planning to leave town for a long vacation, and so FJ wants to temporarily close down his farm to save money in the meantime. The farm consists of NN barns connected with MM bidirectional paths between some pairs of

P3144 [USACO16OPEN]关闭农场Closing the Farm_Silver(并查集反向)

题目描述 Farmer John and his cows are planning to leave town for a long vacation, and so FJ wants to temporarily close down his farm to save money in the meantime. The farm consists of NNN barns connected with MMM bidirectional paths between some pairs o

洛谷 P3144 [USACO16OPEN]关闭农场Closing the Farm_Silver

传送门 题目大意: n个谷仓 ,每次关闭一个谷仓,问剩下没被关闭的谷仓是 否联通. 题解:并查集+倒序处理 代码: #include<iostream> #include<cstdio> #include<cstring> #define N 3030 using namespace std; int n,m,sumedge,cnt; int head[N],fa[N],q[N],ans[N],exit[N]; struct Edge{ int x,y,nxt; Edg

[USACO16OPEN]关闭农场Closing the Farm(洛谷 3144)

题目描述 Farmer John and his cows are planning to leave town for a long vacation, and so FJ wants to temporarily close down his farm to save money in the meantime. The farm consists of  barns connected with  bidirectional paths between some pairs of barn

洛谷P3144 [USACO16OPEN]关闭农场Closing the Farm

题目描述 Farmer John and his cows are planning to leave town for a long vacation, and so FJ wants to temporarily close down his farm to save money in the meantime. The farm consists of  barns connected with  bidirectional paths between some pairs of barn

P3144 关闭农场 并查集 反向

FJ和他的奶牛们正在计划离开小镇做一次长的旅行,同时FJ想临时地关掉他的农场以节省一些金钱. 这个农场一共有被用M条双向道路连接的N个谷仓(1<=N,M<=3000).为了关闭整个农场,FJ 计划每一次关闭掉一个谷仓.当一个谷仓被关闭了,所有的连接到这个谷仓的道路都会被关闭,而且再也不能够被使用. FJ现在正感兴趣于知道在每一个时间(这里的“时间”指在每一次关闭谷仓之前的时间)时他的农场是否是“全连通的”——也就是说从任意的一个开着的谷仓开始,能够到达另外的一个谷仓.注意自从某一个时间之后,可

[无向图判连通]4.17平平凡凡才是真

因为下雨外加睡不醒所以这几天状态萎靡不振 决定开始刷题了,保持每天一道或者三天两道的进度吧 知识点随着刷题慢慢补吧 放弃爆炸oj了,蒟蒻的自我救赎 今天的题是[USACO16OPEN]关闭农场Closing the Farm 本蒟蒻的第一反应:强行spfa判连通 事实证明如果不是不知道哪里写错的玄学错误应该是能拿50分的 看了一下题解 思路大概是不考虑删点 从最后一个点开始加点判断连通与否 然后再倒着输出就好 要求:离线操作 具体实施:并查集 我和你连通,爸爸就一样 一旦出现两个或两个以上爸爸,

PMBOK 项目管理 九大知识领域和五大流程

PMI Project Management Institute.PMI 是世界上最大的非盈利机构,是项目管理领域的领导者.PMI制定项目管理行业标准,带领项目管理的研究并提供项目管理的培训,证书,还有一些加强提搞项目管理专业技能的机会. PMBOK Project Management Body of Knowledge.PMBOK描述了项目管理专业技能总体知识,包括证实了被广泛应用的传统的,革新的,高级的实践的不足之处.另外,它也包括了被普遍接受的最佳实践.PMBOK被广泛用于各种行业. P