gym 102346 2019-2020 ACM-ICPC Brazil Subregional Programming Contest 部分题解

https://codeforces.com/gym/102346

A

将相交的圆并入同一个集合， 在暴力判断在同一个集合的圆，是否可以将盗贼封闭。

#include<bits/stdc++.h>
#include<queue>
using namespace std;
typedef long long ll;
const int N=1100;
 
int n, m, k;
struct cir{
	int x,y,r;
}c[N];
int f[N];
 
int find(int x){
	return f[x] == -1 ? x : f[x] = find(f[x]);
}
 
void unity(int x, int y){
	x = find(x), y = find(y);
	if(x != y){
		f[x] = y;
	}
}
 
int pow2(int x){
	return x * x;
}
 
bool pika(int x, int y){
	return pow2(c[x].x - c[y].x) + pow2(c[x].y - c[y].y) <= pow2(c[x].r + c[y].r);
}
int main(){
	scanf("%d%d%d", &n, &m, &k);
	memset(f, -1, sizeof f);
	for(int i = 1; i <= k; i++){
		scanf("%d%d%d", &c[i].x, &c[i].y, &c[i].r);
	}
	for(int i = 1; i <= k; i++){
		for(int j = i+1; j <= k; j++){
			if(i == j) continue;
			if(pika(i, j)){
				unity(i, j);
				//cout << i << " " << j << "\n";
			}
		}
	}
	int flag = 0;
	for(int i = 1; i <= k; i++){
		for(int j = 1; j <= k; j++){
			int x = find(i), y = find(j);
			if(x == y){
				if(c[i].x - c[i].r <= 0 && c[j].y - c[j].r <= 0){
					flag = 1;
				}
				else if(c[i].x + c[i].r >= n && c[j].y + c[j].r >= m){
					flag = 1;
				}
				else if(c[i].x - c[i].r <= 0 && c[j].x + c[j].r >= n){
					flag = 1;
				}
				else if(c[i].y + c[i].r >= m && c[j].y - c[j].r <= 0){
					flag = 1;
				}
			}
		}
	}
	if(flag) puts("N");
	else puts("S");
	return 0;
}

 

D

树形dp， 每次将最长链分离出来

#include<bits/stdc++.h>
using namespace std;
const int N = 1e5+10;

int n, k;
vector<int> g[N];
priority_queue<int> q;
int d[N];
void dfs(int u, int fa){
	d[u] = 1;
	int mxson = 0;
	for(auto v:g[u]){
		if(v == fa) continue;
		dfs(v, u);
		if(d[v] > d[mxson]){
			mxson = v;
		}
	}
	for(auto v:g[u]){
		if(v == mxson) continue;
		q.push(d[v]);
	}
	d[u] = d[mxson]+1;
}

int main(){
	scanf("%d%d", &n, &k);
	int x;
	for(int i = 2; i <= n; i++){
		scanf("%d", &x);
		g[i].push_back(x);
		g[x].push_back(i);
	}
	dfs(1, 0);
	q.push(d[1]);
	int ans = 0;
	while(k-- && !q.empty()){
		ans += q.top();
		q.pop();
	}
	printf("%d\n", ans);
	return 0;
}