- 洛谷P2420 让我们异或吧
- 思路
-
这道题的思路和上道题类似都是需要一个树上前缀和 + lca,只不过这个是异或前缀和.
- 代码:
#include <bits/stdc++.h>
#define fi first
#define se second
#define endl '\n'
#define all(x) x.begin(),x.end()
#define pb push_back
#define int long long
#define PII pair<int,int>
#define ios ios::sync_with_stdio(false); cin.tie(0); cout.tie(0)
using namespace std;
const int N = 1e5 + 100,M = 2e5 + 100,mod = 1e9 + 7,INF = 0x3f3f3f3f;
int d[N],a[N],fa[N][20];
int h[N],ne[M],e[M],w[M],idx,y[N];
void add(int a,int b,int c)
{
e[idx] = b; w[idx] = c;ne[idx] = h[a],h[a] = idx++;
}
void bfs()
{
queue<int> q; q.push(1); d[1] = 1;
while(q.size())
{
int t = q.front();q.pop();
for(int i = h[t];i != -1;i = ne[i])
{
int j = e[i];
if(!d[j])
{
d[j] = d[t] + 1;
q.push(j);
fa[j][0] = t;
y[j] = y[t] ^ w[i];
for(int k = 1;k <= 19;k ++ ) fa[j][k] = fa[fa[j][k - 1]][k - 1];
}
}
}
}
int lca(int u,int v)
{
if(d[u] < d[v]) swap(u,v);
for(int i = 19;i >= 0;i -- )
{
if(d[fa[u][i]] >= d[v])
u = fa[u][i];
}
if(u == v) return u;
for(int i = 19;i >= 0;i -- )
{
if(fa[u][i] != fa[v][i])
{
u = fa[u][i];v = fa[v][i];
}
}
return fa[u][0];
}
void solve()
{
int n,m;cin >> n; memset(h,-1,sizeof h);
for(int i = 1;i <= n - 1;i ++ )
{
int u,v,c; cin >> u >> v >> c;
add(u,v,c);add(v,u,c);
}
cin >> m;
bfs();
while(m -- )
{
int u,v; cin >> u >> v;
int anc = lca(u,v);
int ans = y[u] ^ y[anc] ^ y[v] ^ y[anc]; // 我们可以发现y[anc] ^ y[anc] = 0,所以其实这道题不用求anc省略lca就行 直接算就好了
cout << ans << endl;
}
}
signed main()
{
ios;int T = 1;
while(T -- ) solve();
return 0;
}``
- P3938 斐波那契
- 思路
-
范围为1e12,所以建图是不可能的,就只能靠硬方法做,二分 + lca,先求出他们在图上面的层数然后让他们处于一层,然后再同时向上走,直到两个点相等,难点在于求u 的父节点v,我们用 f 数组来表示原斐波那契数列,那 u 的父亲就是 u - f[k - 1] ,k 就是u 对应 f 数组里面的下标
- 代码
#include <bits/stdc++.h>
#define fi first
#define se second
#define endl '\n'
#define all(x) x.begin(),x.end()
#define pb push_back
#define int long long
#define PII pair<int,int>
#define ios ios::sync_with_stdio(false); cin.tie(0); cout.tie(0)
using namespace std;
const int N = 3e5 + 100,M = 2e5 + 100,mod = 1e9 + 7,INF = 0x3f3f3f3f;
int f[100];
int lca(int u,int v)
{
if(u == v) return u;
int k1 = lower_bound(f + 1,f + 1 + 60,u) - f;
int k2 = lower_bound(f + 1,f + 1 + 60,v) - f;
return lca(u - f[k1 - 1],v - f[k2 - 1]);
}
int level(int x)
{
int d = 1;
while(x != 1)
{
int k1 = lower_bound(f + 1,f + 1 + 60,x) - f;
x = x - f[k1 - 1];
d++;
}
return d;
}
void solve()
{
int n;cin >> n;
f[1] = 1,f[0] = 1;
for(int i = 2;i <= 60;i ++ ) f[i] = f[i - 1] + f[i - 2];
for(int i = 1;i <= n;i ++ )
{
int u,v; cin >> u >> v; // 先判断第几层
int d1 = level(u), d2 = level(v);
if(d1 > d2) // 不断的让d1往上面走
{
while(d1 > d2)
{
int k = lower_bound(f + 1,f + 1 + 60,u) - f;
u = u - f[k - 1];
d1 --;
}
}
if(d1 < d2) // 不断的让d2让上面走
{
while(d2 > d1)
{
int k = lower_bound(f + 1,f + 1 + 60,v) - f;
v = v - f[k - 1];
d2 --;
}
}
cout << lca(u,v) << endl;
}
}
signed main()
{
ios;int T = 1;
while(T -- ) solve();
return 0;
}
- 洛谷P1351 [NOIP2014 提高组] 联合权值
- 思路
-
这道题也没有用到 lca 啊,(是我太菜???),这道题每一个节点都只有两种状态,第一种是爷孙节点,第二种是兄弟节点.关于爷孙节点就好求一点直接一个数组记录一下,关于兄弟节点的话,对于最大值的求值,只用记录最大权值和次大的权值,然后相乘与ans取一个最大值,求和的话有公式就是 所有兄弟节点的权值和的平方 - 每一个兄弟节点的权值平方 这个我没有想到,想到的是用前缀和求了一下比如求 a b c d 就是 d(a + b + c) + c(a + b) + ab 就用前缀和记录一下
- 前缀和代码
#include <bits/stdc++.h>
#define fi first
#define se second
#define endl '\n'
#define all(x) x.begin(),x.end()
#define pb push_back
#define int long long
#define PII pair<int,int>
#define ios ios::sync_with_stdio(false); cin.tie(0); cout.tie(0)
using namespace std;
const int N = 2e5 + 100,M = 4e5 + 100,mod = 10007,INF = 0x3f3f3f3f;
int fa[N][2];
int d[N],w[N];
vector<int> res[N];
int sum,ans = -INF;
void bfs()
{
queue<int> q; q.push(1);
d[1] = 1;
while(q.size())
{
int t = q.front();q.pop();
int mx1 = 0,mx2 = 0,cnt = 0;
vector<int> s(res[t].size() + 1);
s[0] = 0;
for(int i = 0; i < res[t].size(); i ++ )
{
int j = res[t][i];
if(!d[j])
{
d[j] = d[t] + 1;
q.push(j);
fa[j][0] = t;
fa[j][1] = fa[fa[j][0]][0];
sum = (sum + w[fa[j][1]] * w[j]) % mod;
ans = max(ans,w[fa[j][1]] * w[j]);
if(res[t].size() >= 3)
{
if(w[j] >= mx1)
{
mx2 = mx1;
mx1 = w[j];
}
else if(w[j] > mx2)
{
mx2 = w[j];
}
++cnt;
s[cnt] = s[cnt - 1] + w[j];
}
}
}
if(res[t].size() >= 3)
{
ans = max(ans,mx2 * mx1);
}
for(int i = 1;i <= cnt - 1;i ++ )
sum = (sum + (s[i + 1] - s[i]) * s[i]) % mod;
}
}
void solve()
{
int n; cin >> n;
for(int i = 1;i <= n - 1;i ++ )
{
int u,v; cin >> u >> v;
res[u].pb(v);res[v].pb(u);
}
for(int i = 1;i <= n;i ++ ) cin >> w[i];
bfs();
cout << ans << ' ' << sum * 2 % mod << endl;
}
signed main()
{
ios;int T = 1;
while(T -- ) solve();
return 0;
}
- 公式代码
#include <bits/stdc++.h>
#define fi first
#define se second
#define endl '\n'
#define all(x) x.begin(),x.end()
#define pb push_back
#define int long long
#define PII pair<int,int>
#define ios ios::sync_with_stdio(false); cin.tie(0); cout.tie(0)
using namespace std;
const int N = 2e5 + 100,M = 4e5 + 100,mod = 10007,INF = 0x3f3f3f3f;
int fa[N][2];
int d[N],w[N];
vector<int> res[N];
int sum,ans = -INF;
void bfs()
{
queue<int> q; q.push(1);
d[1] = 1;
while(q.size())
{
int t = q.front();q.pop();
int mx1 = 0,mx2 = 0,cnt = 0;
int sc = 0,sc2 = 0;
for(int i = 0; i < res[t].size(); i ++ )
{
int j = res[t][i];
if(!d[j])
{
d[j] = d[t] + 1;
q.push(j);
fa[j][0] = t;
fa[j][1] = fa[fa[j][0]][0];
sum = (sum + w[fa[j][1]] * w[j] * 2) % mod;
ans = max(ans,w[fa[j][1]] * w[j]);
if(res[t].size() >= 3)
{
if(w[j] >= mx1)
{
mx2 = mx1;
mx1 = w[j];
}
else if(w[j] > mx2)
{
mx2 = w[j];
}
sc = (sc + w[j]) % mod;
sc2 = (sc2 + w[j] * w[j]) % mod;
}
}
}
if(res[t].size() >= 3)
{
sum = (sum + ((sc * sc) - sc2)) % mod;
ans = max(ans,mx1 * mx2);
}
}
}
void solve()
{
int n; cin >> n;
for(int i = 1;i <= n - 1;i ++ )
{
int u,v; cin >> u >> v;
res[u].pb(v);res[v].pb(u);
}
for(int i = 1;i <= n;i ++ ) cin >> w[i];
bfs();
cout << ans << ' ' << sum << endl;
}
signed main()
{
ios;int T = 1;
while(T -- ) solve();
return 0;
}
- P4281 [AHOI2008]紧急集合 / 聚会
- 思路
-
因为是3个点,所以一共有3个lca,可以发现有两个lca是一定相等的,那就把点放在不是相等的那个点上面,要想走的最短那一定需要尽量不要走重复,如果把点放在lca相等的那个点上面就一定会有重复,所以也是要把点放在尽可能深的lca的那个点上面,这样可以减少重复,这道题自己写的时候考虑到了这一点,但是自己直接用了深度计算,忘记了人家可能也是弯曲的,少计算了一部分(菜鸡)
- 代码
#include <bits/stdc++.h>
#define fi first
#define se second
#define endl '\n'
#define all(x) x.begin(),x.end()
#define pb push_back
#define int long long
#define PII pair<int,int>
#define ios ios::sync_with_stdio(false); cin.tie(0); cout.tie(0)
using namespace std;
const int N = 5e5 + 100,M = 4e5 + 100,mod = 10007,INF = 0x3f3f3f3f;
int fa[N][20];
int d[N],w[N];
vector<int> res[N];
void bfs()
{
queue<int> q; q.push(1);
d[1] = 1;
while(q.size())
{
int t = q.front();q.pop();
for(int i = 0;i < res[t].size();i ++ )
{
int j = res[t][i];
if(!d[j])
{
d[j] = d[t] + 1;
q.push(j);
fa[j][0] = t;
for(int k = 1;k <= 19;k ++ )
fa[j][k] = fa[fa[j][k - 1]][k - 1];
}
}
}
}
int lca(int u,int v)
{
if(d[u] < d[v]) swap(u,v);
for(int i = 19;i >= 0;i -- )
{
if(d[fa[u][i]] >= d[v])
{
u = fa[u][i];
}
}
if(u == v) return u;
for(int i = 19;i >= 0;i -- )
{
if(fa[u][i] != fa[v][i])
u = fa[u][i],v = fa[v][i];
}
return fa[u][0];
}
void solve()
{
int n,m; cin >> n >> m;
for(int i = 1;i <= n - 1;i ++ )
{
int u,v; cin >> u >> v;
res[u].pb(v);res[v].pb(u);
}
bfs();
while(m -- )
{
int a,b,c; cin >> a >> b >> c;
int anc1 = lca(a,b),anc2 = lca(a,c),anc3 = lca(b,c);
int ans,sum = 0;
// cout << anc3 << endl;
if(d[anc1] >= d[anc2] && d[anc1] >= d[anc3])
{
if(d[anc2] >= d[anc3])
{
sum = d[a] + d[b] + d[c] - d[anc1] - d[anc3] * 2;
ans = anc1;
}
else
{
sum = d[a] + d[b] + d[c] - d[anc1] - d[anc2] * 2;
ans = anc1;
}
}
else if(d[anc2] >= d[anc1] && d[anc2] >= d[anc3])
{
if(d[anc1] >= d[anc3])
{
sum = d[a] + d[b] + d[c] - d[anc2] - d[anc3] * 2;
ans = anc2;
}
else
{
sum = d[a] + d[b] + d[c] - d[anc2] - d[anc1] * 2;
ans = anc2;
}
}
else if(d[anc3] >= d[anc2] && d[anc3] >= d[anc1])
{
if(d[anc2] >= d[anc1])
{
sum = d[a] + d[b] + d[c] - d[anc3] - d[anc1] * 2;
ans = anc3;
}
else
{
sum = d[a] + d[b] + d[c] - d[anc3] - d[anc2] * 2;
ans = anc3;
}
}
cout << ans << ' ' << sum << endl;
}
}
signed main()
{
ios;int T = 1;
while(T -- ) solve();
return 0;
}