Codeforces Round #835 (Div. 4) G. SlavicG‘s Favorite Problem

最新推荐文章于 2025-12-05 14:37:41 发布

原创最新推荐文章于 2025-12-05 14:37:41 发布 · 607 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#算法 #图论 #深度优先

CodeForces 专栏收录该内容

59 篇文章

订阅专栏

本文介绍了解决Codeforces Round #835 (Div.4) G题的方法。主要讨论了如何在考虑边权异或的情况下找到两个节点之间的路径，并通过广度优先搜索来确定是否存在有效的传送点，使得从起点到终点的路径边权异或为0。

Codeforces Round #835 (Div. 4) G. SlavicG’s Favorite Problem

Let’s ignore the teleporting, and decide how to find the answer. Note that we don’t need to ever go over an edge more than once, since going over an edge twice cancels out (since $a$ XOR $a = 0$ for all a). In other words, the only possible value of $x$ equals the XOR of the edges on the unique path from $a$ to $b$ . We can find it through $a$ BFS from $a$ , continuing to keep track of XOR s as we move to each adjacent node, and XOR ing it by the weight of the corresponding edge as we travel across it.

Now let’s include the teleport. It means that we travel from $a \to c$ , then teleport to $d$ , and go from $d \to b$ , for some nodes $c$ and $d$ . Also, we cannot pass $b$ on the path from $a \to c$ .

Again, note that the value of $x$ is fixed on each of the paths from $a \to c$ and $d \to b$ , since there is $a$ unique path between them. Let $x_1$ be the XOR of the first path and $x_2$ be the XOR of the second. Then we need $x_1$ XOR $x 2 = 0$ $⟹$ $x_1=x_2$ . So we need to find if there are two nodes $c$ , $d$ such that the XORs from a and b to those nodes are the same. To do this, we can do our BFS from before, but instead run one BFS from a and another from $b$ , and check if any two values are the same.

Make sure not to include nodes past $b$ while we look for $c$ on our BFS from $a$ .

The time complexity is $O (n l o g n)$ .

#include<bits/stdc++.h>
using namespace std;

typedef pair<int,int> PII;

int main()
{
    int T=1;cin>>T;
    while(T--)
    {
        int n,a,b;cin>>n>>a>>b;
        vector<vector<PII>> g(n+1);
        for(int i=1;i<=n-1;i++)
        {
            int u,v,w;cin>>u>>v>>w;
            g[u].push_back({v,w});
            g[v].push_back({u,w});
        }

        vector<vector<int>> f(2,vector<int>(n+1));
        function<void(int,int,int,int)> dfs=[&](int u,int val,int id,int fa)
        {
            f[id][u]=val;
            for(auto &[v,p]:g[u])
            {
                if(v==fa || v==b) continue;
                dfs(v,val^p,id,u);
            }
        };
        dfs(a,0,0,-1);
        dfs(b,0,1,-1);

        set<int> st;
        for(int i=1;i<=n;i++)
            st.insert(f[0][i]);

        bool ok=false;
        for(int i=1;i<=n;i++)
            if(i!=b && st.count(f[1][i]))
                ok=true;

        if(ok) cout<<"YES"<<endl;
        else cout<<"NO"<<endl;
    }
    return 0;
}