INTRPATH - EDITORIAL

[knakul853]

see his explanation

Unofficial INTRPTH Editorial/Explanation

Problem : INTRPATH (JUNE 19) Problem Link : https://www.codechef.com/problems/INTRPATH Prerequisite : DFS , LeastCommonAncestor. Before starting I would like to give an overview of problem. Given 2 nodes (Src and Des) , we have to find the total number of paths which will contain only 1 node common with the path from Src to Des. Here we will assume that the tree is always rooted at node 1. Also for every node across the tree we will find Lvl[N], Size[N], Par[N] which will store the Level, Si…