{"trustable":false,"sections":[{"title":"","value":{"format":"HTML","content":"\n \u003cdiv class\u003d\"ptx\" lang\u003d\"en-US\"\u003e\n \u003cdiv\u003e\n \u003cp\u003eIn an edge-weighted tree, the xor-length of a path \u003ci\u003ep\u003c/i\u003e is defined as the xor sum of the weights of edges on \u003ci\u003ep\u003c/i\u003e:\u003c/p\u003e\n \u003ccenter\u003e\n\u003cp data-anchor-id\u003d\"soum\"\u003e\u003cspan class\u003d\"MathJax_Preview\"\u003e\u003c/span\u003e\u003cdiv class\u003d\"MathJax_SVG_Display\" role\u003d\"textbox\" aria-readonly\u003d\"true\" style\u003d\"text-align: center;\"\u003e\u003cspan class\u003d\"MathJax_SVG\" id\u003d\"MathJax-Element-3-Frame\" style\u003d\"font-size: 100%; display: inline-block;\"\u003e\u003csvg xmlns:xlink\u003d\"http://www.w3.org/1999/xlink\" viewBox\u003d\"0 -771.0903951652987 10566.32059594962 1079.0666126619742\" style\u003d\"width: 24.509ex; height: 2.543ex; vertical-align: -0.809ex; margin: 1px 0px;\"\u003e\u003cg stroke\u003d\"black\" fill\u003d\"black\" stroke-width\u003d\"0\" transform\u003d\"matrix(1 0 0 -1 0 0)\"\u003e\u003cg transform\u003d\"translate(0,-150)\"\u003e\u003cuse transform\u003d\"scale(0.7071067811865476)\" xmlns:xlink\u003d\"http://www.w3.org/1999/xlink\" xlink:href\u003d\"#MJMATHI-78\"\u003e\u003c/use\u003e\u003cuse transform\u003d\"scale(0.7071067811865476)\" xmlns:xlink\u003d\"http://www.w3.org/1999/xlink\" xlink:href\u003d\"#MJMATHI-6F\" x\u003d\"572\" y\u003d\"0\"\u003e\u003c/use\u003e\u003cuse transform\u003d\"scale(0.7071067811865476)\" xmlns:xlink\u003d\"http://www.w3.org/1999/xlink\" xlink:href\u003d\"#MJMATHI-72\" x\u003d\"1058\" y\u003d\"0\"\u003e\u003c/use\u003e\u003c/g\u003e\u003cuse xmlns:xlink\u003d\"http://www.w3.org/1999/xlink\" xlink:href\u003d\"#MJMATHI-6C\" x\u003d\"1167\" y\u003d\"0\"\u003e\u003c/use\u003e\u003cuse xmlns:xlink\u003d\"http://www.w3.org/1999/xlink\" xlink:href\u003d\"#MJMATHI-65\" x\u003d\"1465\" y\u003d\"0\"\u003e\u003c/use\u003e\u003cuse xmlns:xlink\u003d\"http://www.w3.org/1999/xlink\" xlink:href\u003d\"#MJMATHI-6E\" x\u003d\"1932\" y\u003d\"0\"\u003e\u003c/use\u003e\u003cuse xmlns:xlink\u003d\"http://www.w3.org/1999/xlink\" xlink:href\u003d\"#MJMATHI-67\" x\u003d\"2532\" y\u003d\"0\"\u003e\u003c/use\u003e\u003cuse xmlns:xlink\u003d\"http://www.w3.org/1999/xlink\" xlink:href\u003d\"#MJMATHI-74\" x\u003d\"3013\" y\u003d\"0\"\u003e\u003c/use\u003e\u003cuse xmlns:xlink\u003d\"http://www.w3.org/1999/xlink\" xlink:href\u003d\"#MJMATHI-68\" x\u003d\"3374\" y\u003d\"0\"\u003e\u003c/use\u003e\u003cuse xmlns:xlink\u003d\"http://www.w3.org/1999/xlink\" xlink:href\u003d\"#MJMAIN-28\" x\u003d\"3951\" y\u003d\"0\"\u003e\u003c/use\u003e\u003cuse xmlns:xlink\u003d\"http://www.w3.org/1999/xlink\" xlink:href\u003d\"#MJMATHI-70\" x\u003d\"4340\" y\u003d\"0\"\u003e\u003c/use\u003e\u003cuse xmlns:xlink\u003d\"http://www.w3.org/1999/xlink\" xlink:href\u003d\"#MJMAIN-29\" x\u003d\"4844\" y\u003d\"0\"\u003e\u003c/use\u003e\u003cuse xmlns:xlink\u003d\"http://www.w3.org/1999/xlink\" xlink:href\u003d\"#MJMAIN-3D\" x\u003d\"5511\" y\u003d\"0\"\u003e\u003c/use\u003e\u003cg transform\u003d\"translate(6567,0)\"\u003e\u003cuse xmlns:xlink\u003d\"http://www.w3.org/1999/xlink\" xlink:href\u003d\"#MJMAIN-2295\"\u003e\u003c/use\u003e\u003cg transform\u003d\"translate(778,-150)\"\u003e\u003cuse transform\u003d\"scale(0.7071067811865476)\" xmlns:xlink\u003d\"http://www.w3.org/1999/xlink\" xlink:href\u003d\"#MJMATHI-65\"\u003e\u003c/use\u003e\u003cuse transform\u003d\"scale(0.7071067811865476)\" xmlns:xlink\u003d\"http://www.w3.org/1999/xlink\" xlink:href\u003d\"#MJMAIN-2208\" x\u003d\"466\" y\u003d\"0\"\u003e\u003c/use\u003e\u003cuse transform\u003d\"scale(0.7071067811865476)\" xmlns:xlink\u003d\"http://www.w3.org/1999/xlink\" xlink:href\u003d\"#MJMATHI-70\" x\u003d\"1134\" y\u003d\"0\"\u003e\u003c/use\u003e\u003c/g\u003e\u003c/g\u003e\u003cuse xmlns:xlink\u003d\"http://www.w3.org/1999/xlink\" xlink:href\u003d\"#MJMATHI-77\" x\u003d\"8604\" y\u003d\"0\"\u003e\u003c/use\u003e\u003cuse xmlns:xlink\u003d\"http://www.w3.org/1999/xlink\" xlink:href\u003d\"#MJMAIN-28\" x\u003d\"9320\" y\u003d\"0\"\u003e\u003c/use\u003e\u003cuse xmlns:xlink\u003d\"http://www.w3.org/1999/xlink\" xlink:href\u003d\"#MJMATHI-65\" x\u003d\"9710\" y\u003d\"0\"\u003e\u003c/use\u003e\u003cuse xmlns:xlink\u003d\"http://www.w3.org/1999/xlink\" xlink:href\u003d\"#MJMAIN-29\" x\u003d\"10176\" y\u003d\"0\"\u003e\u003c/use\u003e\u003c/g\u003e\u003c/svg\u003e\u003c/span\u003e\u003c/div\u003e\u003cscript type\u003d\"math/tex; mode\u003ddisplay\" id\u003d\"MathJax-Element-3\"\u003e_{xor}length(p) \u003d \\oplus_{e\\in p} w(e)\u003c/script\u003e\u003c/p\u003e\n \u003c/center\u003e\n \u003cp\u003eā is the xor operator.\u003c/p\u003e\n \u003cp\u003eWe say a path the xor-longest path if it has the largest xor-length. Given an edge-weighted tree with n nodes, can you find the xor-longest path? ć\u003c/p\u003e\n \u003c/div\u003e\n \u003c/div\u003e"}},{"title":"Input","value":{"format":"HTML","content":"\n \u003cdiv class\u003d\"ptx\" lang\u003d\"en-US\"\u003e\n \u003cdiv\u003e\n \u003cp\u003eThe input contains several test cases. The first line of each test case contains an integer \u003ci\u003en\u003c/i\u003e(1\u0026lt;\u003d\u003ci\u003en\u003c/i\u003e\u0026lt;\u003d100000), The following \u003ci\u003en\u003c/i\u003e-1 lines each contains three integers \u003ci\u003eu\u003c/i\u003e(0 \u0026lt;\u003d \u003ci\u003eu\u003c/i\u003e \u0026lt; \u003ci\u003en\u003c/i\u003e),\u003ci\u003ev\u003c/i\u003e(0 \u0026lt;\u003d \u003ci\u003ev\u003c/i\u003e \u0026lt; \u003ci\u003en\u003c/i\u003e),\u003ci\u003ew\u003c/i\u003e(0 \u0026lt;\u003d \u003ci\u003ew\u003c/i\u003e \u0026lt; 2^31), which means there is an edge between node \u003ci\u003eu\u003c/i\u003e and \u003ci\u003ev\u003c/i\u003e of length \u003ci\u003ew\u003c/i\u003e. \u003c/p\u003e\n \u003c/div\u003e\n \u003c/div\u003e"}},{"title":"Output","value":{"format":"HTML","content":"\n \u003cdiv class\u003d\"ptx\" lang\u003d\"en-US\"\u003e\n For each test case output the xor-length of the xor-longest path.\n \u003c/div\u003e"}},{"title":"Sample Input","value":{"format":"HTML","content":"\u003cpre class\u003d\"sio\"\u003e4\n0 1 3\n1 2 4\n1 3 6\n\u003c/pre\u003e"}},{"title":"Sample Output","value":{"format":"HTML","content":"\u003cpre class\u003d\"sio\"\u003e7\u003c/pre\u003e"}},{"title":"Hint","value":{"format":"HTML","content":"\n \u003cdiv class\u003d\"ptx\" lang\u003d\"en-US\"\u003e\n \u003cdiv\u003e\n \u003cp\u003eThe xor-longest path is 0-\u0026gt;1-\u0026gt;2, which has length 7 (\u003d3 ā 4) \u003c/p\u003e\n \u003c/div\u003e\n \u003c/div\u003e"}}]}