并查集
invoKer-
这个作者很懒,什么都没留下…
展开
-
CodeForces - 28B pSort【并查集】
题目链接:https://codeforces.com/contest/28/problem/B#include <iostream>using namespace std;static const int MAXN=100+10;int p[MAXN];int seq[MAXN],d[MAXN];int n;void init() { for(int i=1;i<=n;i++) p[i]=i; }int find(int x){ if(p[x]!=x) p[x]原创 2021-01-23 00:44:50 · 208 阅读 · 0 评论 -
CodeForces - 25D Roads not only in Berland【并查集】
题目链接:https://codeforces.com/contest/25/problem/D#include <iostream>#include <vector>using namespace std;static const int MAXN=1000+10;int p[MAXN];struct Edge{ int u,v;}same[MAXN];int n,idx;vector<int> root;void init() { for(原创 2020-11-06 18:00:16 · 87 阅读 · 0 评论 -
BZOJ - 4195 程序自动分析【离散化】【并查集】
【题目描述】在实现程序自动分析的过程中,常常需要判定一些约束条件是否能被同时满足。考虑一个约束满足问题的简化版本:假设x1,x2,x3,…代表程序中出现的变量,给定n个形如xi=xj或xi≠xj的变量相等/不等的约束条件,请判定是否可以分别为每一个变量赋予恰当的值,使得上述所有约束条件同时被满足。例如,一个问题中的约束条件为:x1=x2,x2=x3,x3=x4,x1≠x4,这些约束条件显然是不...原创 2020-02-03 17:07:30 · 134 阅读 · 0 评论 -
CodeForces - 9E Interesting Graph and Apples【并查集】
【题目描述】Hexadecimal likes drawing. She has drawn many graphs already, both directed and not. Recently she has started to work on a still-life «interesting graph and apples». An undirected graph is call...原创 2019-10-25 05:20:41 · 294 阅读 · 0 评论 -
[kuangbin]专题五 并查集 Wireless Network POJ - 2236【并查集】
【题目描述】An earthquake takes place in Southeast Asia. The ACM (Asia Cooperated Medical team) have set up a wireless network with the lap computers, but an unexpected aftershock attacked, all computers i...原创 2019-09-10 10:38:19 · 142 阅读 · 0 评论 -
[kuangbin]专题五 并查集 The Suspects POJ - 1611【并查集】
【题目描述】Severe acute respiratory syndrome (SARS), an atypical pneumonia of unknown aetiology, was recognized as a global threat in mid-March 2003. To minimize transmission to others, the best strategy ...原创 2019-09-10 11:53:58 · 102 阅读 · 0 评论 -
[kuangbin]专题五 并查集 How Many Tables HDU - 1213【并查集】
【题目描述】Today is Ignatius’ birthday. He invites a lot of friends. Now it’s dinner time. Ignatius wants to know how many tables he needs at least. You have to notice that not all the friends know each o...原创 2019-09-10 12:12:53 · 190 阅读 · 0 评论