[JAG 2025 Summer Camp #1] Colored Tree and Path - 题目

内存限制：1024 MiB 时间限制：4000 ms 标准输入输出

题目类型：VJudge（洛谷）评测方式：VJudge

上传者：匿名

提交提交记录统计讨论题解

You are given a tree with vertices, numbered through . Edge connects vertices and . Each vertex is assigned a color .

You are asked to process queries. In each query, four integers are given.

For each query, determine the maximum integer () such that the following condition holds:

For every , the number of vertices of color on the path from to is equal to the number of vertices of color on the path from to .

The input is given in the following format:

Each Query is given in the following format:

Output lines. On the -th line (), output the answer for the -th query.

6
2 3
4 3
6 2
3 5
2 1
1 2 2 3 1 1
4
1 6 5 4
6 5 1 5
1 1 6 6
1 5 4 2

编辑器加载中 …

或者，上传代码文件

Powered by SYZOJ. Modified by Zemu (UnratedCheater).

当前版本：V1.7.2-premium

#215818. [JAG 2025 Summer Camp #1] Colored Tree and Path