题目:A.Ancient Distance
分析:
参考博客
注意的几个点:
- 枚举关键点数不太方便,改为枚举最大距离len
- dfs序建立线段树,每次找到最深的还未被拆除的点,找到他的len级父节点u,通过线段树区间更新,拆除u这棵树,直到找不到深度>len的结点
代码:
#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;
vector<int> g[maxn];
int dep[maxn], st[maxn], ed[maxn], anc[maxn][20], nodeof[maxn];
int ans[maxn];
int n, tim;
struct node
{
int l, r, maxdep, u;
int flag;
}t[maxn << 2];
void init()
{
tim = 0;
for(int i = 0; i <= n; i++) g[i].clear();
}
void dfs(int u, int fa)
{
dep[u] = dep[fa] + 1, st[u] = ++tim, nodeof[tim] = u;
anc[u][0] = fa;
for(int i = 1; i < 20; i++) anc[u][i] = anc[anc[u][i - 1]][i - 1];
for(auto it : g[u])
if(it != fa)
dfs(it, u);
ed[u] = tim;
}
int findfa(int u, int len)
{
int res = u;
for(int i = 0; i < 20; i++)
if(len & (1 << i))
res = anc[res][i];
return res;
}
void pushup(int tar) //更新本子树的最深的点
{
t[tar].maxdep = 0;
if(!t[tar << 1].flag && t[tar << 1].maxdep > t[tar].maxdep)
t[tar].maxdep = t[tar << 1].maxdep, t[tar].u = t[tar << 1].u;
if(!t[tar << 1 | 1].flag && t[tar << 1 | 1].maxdep > t[tar].maxdep)
t[tar].maxdep = t[tar << 1 | 1].maxdep, t[tar].u = t[tar << 1 | 1].u;
}
void build(int l, int r, int tar)
{
t[tar].l = l, t[tar].r = r, t[tar].flag = 0;
if(l == r)
{
t[tar].maxdep = dep[nodeof[l]], t[tar].u = nodeof[l];
return;
}
int mid = l + r >> 1;
build(l, mid, tar << 1), build(mid + 1, r, tar << 1 | 1);
pushup(tar);
}
void update(int l, int r, int tar, int val)
{
if(l <= t[tar].l && t[tar].r <= r)
{
t[tar].flag = val;
return;
}
int mid = t[tar].l + t[tar].r >> 1;
if(l <= mid) update(l, r, tar << 1, val);
if(r > mid) update(l, r, tar << 1 | 1, val);
pushup(tar);
}
int main()
{
while(cin >> n)
{
init();
for(int i = 2; i <= n; i++)
{
int x; cin >> x;
g[x].push_back(i), g[i].push_back(x);
}
dep[0] = -1;
dfs(1, 0);
build(1, tim, 1);
mem(ans, inf);
update(st[1], ed[1], 1, 1);
for(int i = n - 1; i >= 0; i--)
{
int cost = 1;
vector<int> buf;
while(t[1].maxdep > i)
{
// print(t[1].maxdep);
int u = t[1].u;
u = findfa(u, i);
buf.push_back(u);
update(st[u], ed[u], 1, 1);
cost++;
}
ans[cost] = i;
for(int it : buf)
update(st[it], ed[it], 1, 0);
}
for(int i = 2; i <= n; i++)
ans[i] = min(ans[i], ans[i - 1]);
ll sum = 0;
for(int i = 1; i <= n; i++)
sum += ans[i];
cout << sum << endl;
}
}
题目:H.Harder Gcd Problem
分析:
先找出每个数的最大质因数,将最大质因数相同的放在一个集合中,从后往前遍历每一个集合,如果该集合大小>=2并且大小为偶数,则可以两两配对,若为奇数,设该质因数为p,将2p放入质因数为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;
int maxp[maxn], vis[maxn], p[maxn];
int cnt;
vector<int> v[maxn];
vector<pair<int, int> > res;
void init()
{
for(int i = 2; i < maxn; i++)
if(!vis[i])
{
p[++cnt] = i;
for(int j = i; j < maxn; j += i)
maxp[j] = i, vis[j] = 1;
}
}
int main()
{
init();
int t; cin >> t;
while(t--)
{
int n; cin >> n;
for(int i = 1; i <= cnt; i++)
v[p[i]].clear();
res.clear();
for(int i = 2; i <= n; i++)
v[maxp[i]].push_back(i);
for(int i = cnt; i >= 2; i--)
if(v[p[i]].size() > 1)
{
if(v[p[i]].size() & 1)
{
v[2].push_back(v[p[i]][1]);
v[p[i]].erase(v[p[i]].begin() + 1);
}
for(int j = 1; j < v[p[i]].size(); j += 2)
res.push_back(make_pair(v[p[i]][j - 1], v[p[i]][j]));
}
for(int j = 1; j < v[2].size(); j += 2)
res.push_back(make_pair(v[2][j - 1], v[2][j]));
cout << res.size() << endl;
for(int i = 0; i < res.size(); i++)
printf("%d %d\n", res[i].first, res[i].second);
}
}