题目:C. Link Cut Centroids
分析:
先恶补一波树的重心的基础知识:
定义:
树上一节点最大子树的节点数最小;
性质:
- 删除重心后所得的所有子树,节点数不超过原树的1/2,一棵树最多有两个重心,且相邻。
- 树中所有节点到重心的距离之和最小,如果有两个重心,那么他们距离之和相等;
- 两个树通过一条边合并,新的重心在原树两个重心的路径上;
- 树删除或添加一个叶子节点,重心最多只移动一条边;
这个题的特殊点其实就是重心,那么我们可以先找出重心,看是否唯一,如果唯一则随便输出同一条边。不唯一的话,找出两个重心(一个树最多两个重心),然后将与重心相连的非重心点连接到另一个重心上。
代码:
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
//typedef __int128 lll;
#define print(i) cout << "debug: " << i << endl
#define close() ios::sync_with_stdio(0), cin.tie(0), cout.tie(0)
#define mem(a, b) memset(a, b, sizeof(a))
const ll mod = 1e9 + 7;
const int maxn = 2e5 + 10;
const int inf = 0x3f3f3f3f;
struct edge
{
int ep, nex;
edge(int ep = 0, int nex = 0) : ep(ep), nex(nex){}
}e[maxn << 1];
int head[maxn], tot;
int siz[maxn], maxw[maxn];
int n;
void init()
{
mem(head, -1), tot = 0;
}
void addedge(int x, int y)
{
e[tot] = edge(y, head[x]);
head[x] = tot++;
}
void dfs(int u, int fa)
{
siz[u] = 1, maxw[u] = 0;
for(int i = head[u]; ~i; i = e[i].nex)
{
int ep = e[i].ep;
if(ep == fa) continue;
dfs(ep, u);
siz[u] += siz[ep];
if(siz[ep] > maxw[u])
maxw[u] = siz[ep];
}
if(maxw[u] < n - siz[u])
maxw[u] = n - siz[u];
}
int main()
{
int t; cin >> t;
while(t--)
{
cin >> n;
init();
for(int i = 1; i < n; i++)
{
int x, y; cin >> x >> y;
addedge(x, y), addedge(y, x);
}
dfs(1, -1);
map<int, int> num;
int minn = inf, x = -1;
for(int i = 1; i <= n; i++)
{
num[maxw[i]]++;
if (minn > maxw[i])
minn = maxw[i], x = i;
}
if(num[minn] == 1)
{
cout << 1 << " " << e[head[1]].ep << endl;
cout << 1 << " " << e[head[1]].ep << endl;
}
else
{
vector<int> center;
for(int i = 1; i <= n; i++)
if(maxw[i] == minn)
center.push_back(i);
for(int i = head[center[0]]; ~i; i = e[i].nex)
{
int ep = e[i].ep;
if(ep == center[1]) continue;
cout << center[0] << " " << ep << endl;
cout << ep << " " << center[1] << endl;
break;
}
}
}
}
题目:D. Three Sequences
分析:
偏数学推导题,参考博客
代码:
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
//typedef __int128 lll;
#define print(i) cout << "debug: " << i << endl
#define close() ios::sync_with_stdio(0), cin.tie(0), cout.tie(0)
#define mem(a, b) memset(a, b, sizeof(a))
const ll mod = 1e9 + 7;
const int maxn = 2e6;
const int inf = 0x3f3f3f3f;
ll a[maxn], dif[maxn];
ll calc(ll x)
{
if(x % 2 == 0) return x / 2;
if(x > 0) return x / 2 + 1;
return x / 2;
}
int main()
{
int n; cin >> n;
for (int i = 1; i <= n; i++) cin >> a[i];
ll posdif = 0;
for(int i = 1; i < n; i++) dif[i] = a[i + 1] - a[i], posdif += (dif[i] > 0 ? dif[i] : 0);
cout << calc(a[1] + posdif) << endl;
int m; cin >> m;
while(m--)
{
ll l, r, x; cin >> l >> r >> x;
if(l == 1) a[1] += x;
if(l - 1 >= 1 && l - 1 <= n - 1 && dif[l - 1] > 0) posdif -= dif[l - 1];
if(dif[r] > 0 && r >= 1 && r <= n - 1) posdif -= dif[r];
dif[l - 1] += x, dif[r] -= x;
if(dif[l - 1] > 0 && l - 1 >= 1 && l - 1 <= n - 1) posdif += dif[l - 1];
if(dif[r] > 0 && r >= 1 && r <= n - 1) posdif += dif[r];
cout << calc(a[1] + posdif) << endl;
}
}