Educational Codeforces Round 78 (Rated for Div. 2) D. Segment Tree
链接:
https://codeforces.com/contest/1278/problem/D
题意:
As the name of the task implies, you are asked to do some work with segments and trees.
Recall that a tree is a connected undirected graph such that there is exactly one simple path between every pair of its vertices.
You are given n segments [l1,r1],[l2,r2],…,[ln,rn], li<ri for every i. It is guaranteed that all segments' endpoints are integers, and all endpoints are unique — there is no pair of segments such that they start in the same point, end in the same point or one starts in the same point the other one ends.
Let's generate a graph with n vertices from these segments. Vertices v and u are connected by an edge if and only if segments [lv,rv] and [lu,ru] intersect and neither of it lies fully inside the other one.
For example, pairs ([1,3],[2,4]) and ([5,10],[3,7]) will induce the edges but pairs ([1,2],[3,4]) and ([5,7],[3,10]) will not.
Determine if the resulting graph is a tree or not.
思路:
并差集维护关系,set查找所有能加入的点,因为最多就n个,所以不满足的条件中途就退出了,不会导致超时。
代码:
#include<bits/stdc++.h>
using namespace std;
const int MAXN = 1e6+10;
map<int, int> Mp;
int F[MAXN];
pair<int, int> Pa[MAXN];
int n;
int GetF(int x)
{
return (x == F[x]) ? x : F[x] = GetF(F[x]);
}
int main()
{
scanf("%d", &n);
for (int i = 1;i <= n;i++)
F[i] = i;
for (int i = 1;i <= n;i++)
cin >> Pa[i].first >> Pa[i].second;
sort(Pa+1, Pa+1+n);
int cnt = 0;
for (int i = 1;i <= n;i++)
{
auto it = Mp.lower_bound(Pa[i].first);
while(it != Mp.end() && it->first < Pa[i].second)
{
int tl = GetF(i);
int tr = GetF(it->second);
if (tl == tr || cnt >= n)
{
cout << "NO\n";
return 0;
}
else
{
cnt++;
F[tl] = tr;
}
++it;
}
Mp[Pa[i].second] = i;
}
if (cnt != n-1)
cout << "NO\n";
else
cout << "YES\n";
return 0;
}
最新文章
- 页面加载完成后,触发事件——trigger()
- Android开发常用属性
- Tesseract-OCR text2image.exe [ x86 支持 XP ]
- OC 实例变量(instance var)与属性(@property)的关系 isa指针
- Swift利用闭包(closure)来实现传值--&;gt;前后两个控制器的反向传值
- mh
- 折扣&;折让-看清实质的思考
- linux下安装openmpi
- Linux学习总结(十三)—— CentOS用户组管理:创建用户组、修改用户组、删除用户组
- 32位汇编第二讲,编写窗口程序,加载资源,响应消息,以及调用C库函数
- @property括号内属性讲解
- 《网络攻防》实验五:MSF基础应用
- Sequelize-nodejs-4-Model usage
- SQLServer cast()函数
- 【BZOJ 4449】[Neerc2015]Distance on Triangulation 多边形分治结构
- vue使用插件 使用库
- Dev DateEdit控件格式设置
- 《Thinking in Java》 10~
- MyTest——边界检测
- 洛谷 P4538 收集邮票