2019-2020 ACM-ICPC Brazil Subregional Programming Contest 题解

题目链接:http://codeforces.com/gym/102346

 

A. Artwork

将相交的圆用并查集合并，最后查询一下是否有一个或者两个在一个并查集里面的圆形成这样的一个封闭

#include <bits/stdc++.h>
#define x first
#define y second
#define mid (l+r>>1)
#define lson l,mid,rt<<1
#define rson mid+1,r,rt<<1|1
using namespace std;
typedef long long int ll;
typedef pair<int,int> pa; 
const int mx = 1e5 + 10;
struct circle{
	ll x,y,r;
}c[mx];
	int n,m,k;
int p[mx];
int find(int x){
	return p[x]==x?x:p[x] = find(p[x]);
}
ll power(ll x){
	return x*x;
}
bool judge(circle a,circle b){
	return power(a.x-b.x)+power(a.y-b.y) <= a.r*a.r+b.r*b.r+2*a.r*b.r;	
}
bool check(circle a,circle b){
	if(a.x-a.r>0&&a.y+a.r<m)
		return false;
	if(b.x+b.r<n&&b.y-b.r>0)
		return false;
	return true;
}
int main()
{	
	scanf("%d%d%d",&n,&m,&k);
	for(int i = 1; i <= k; i++)
		scanf("%lld%lld%lld",&c[i].x,&c[i].y,&c[i].r),p[i] = i;
	for(int i = 1; i <= k; i++)
		for(int j = i+1; j <= k; j++)
			if(judge(c[i],c[j])){
				int x = find(i);
				int y = find(j);
				if(x!=y)
					p[x] = y;
			}
			
	for(int i = 1; i <= k; i++)
		find(i);
	bool ok = true;
	for(int i = 1; i <= k; i++)
		for(int j = 1; j <= k; j++){
			if(check(c[i],c[j])&&p[i]==p[j])
				ok = false;
		}
	ok?puts("S"):puts("N");
	return 0;
} 

B. Buffoon

水题

C.Crossings With Danger

未做

D.Denouncing Mafia

实际上是一个树形DP,还有就是链的个数最多就是叶子节点个数，所以只要确定每个点是属于哪个叶子形成的链就好了，然后最后排个序输出前k大

#include <bits/stdc++.h>
#define lson l,mid,rt<<1
#define rson mid+1,r,rt<<1|1
using namespace std;
typedef long long ll;
const int mx = 1e5 + 10;
int n,m,w[mx];
vector <int> g[mx]; 
priority_queue <int> q;
void dfs_val (int u) {
	int son = 0;
	w[u] = 1;
	for (int v:g[u]) {
		dfs_val(v);
		if (w[v] > w[son])
			son = v;
	}
	for (int v:g[u]) {
		if (v != son)
			q.push(w[v]);
	}
	w[u] += w[son];
}