루미 알고리즘

#1399다이아Cities

PO 2016 훈련 캠프코딩출제 Antti Laaksonen영어 원문이 문제가 어렵다면 — 배우는 순서 보기

영어 원문입니다. 원문의 수식·표를 글자로 옮겨 모양이 다를 수 있습니다. 정확한 내용은 원문 페이지에서 확인하세요. 원문 페이지 열기 (새 창)

Problem

In a far away kingdom, there are N cities numbered between 0 and N - 1. The cities are connected by N - 1 two-way roads. Each road has the same length, and connects exactly two cities, such that there is a unique path between any pair of cities.

For any two cities A and B, denote by L(A, B) the number of roads of this unique path between cities A and B. Given an integer K, for how many pairs of cities A, B is L(A, B) = K?

Input

The first line contains the integers N and K (1 ≤ K ≤ N ≤ 100000), described in the statement.

The two lines contains the N - 1 integers f_1, …, f_{N-1} (0 ≤ f_i < N) and the N - 1 integers t_1, …, t_{N-1} (0 ≤ t_i < N) respectively. These describe the roads of the city: there is a road between city f_i and t_i for each i.

Output

Output the number of pairs of cities that have exactly K roads between them.

Scoring

Your solution will be tested on a set of test groups, each worth a number of points. To get the points for a test group you need to solve all test cases in the test group.

GroupPointsConstraints
19N ≤ 100
219N ≤ 1000
334K ≤ 10
438No additional constrsaints.

Explanation of sample 1

Let the kingdom have N = 5 cities, connected by roads as in the figure below:

(그림은 원문 저장소에서 볼 수 있습니다)

Figure 1: Illustration of the example

The following 4 pairs have a single road between them: (0, 1), (0, 2), (0, 4), (3, 4).

The following 4 pairs have two roads between them: (0, 3), (1, 2), (1, 4), (2, 4).

The following 2 pairs have three roads between them: (1, 3), (2, 3).

This means that if for K = 1, 2, 3, the answers would be 4, 4, 2 respectively.

예제

예제 1

입력
5 2
0 0 0 3
1 2 4 4
출력
4

출처 표기

출처: Programmeringsolympiaden 2016년 훈련 캠프 · 원문 페이지 · 이용 조건 CC BY-SA · LaTeX 원문을 화면용 글로 옮겼습니다(수식·표의 모양이 다를 수 있습니다). 내용은 고치지 않았습니다.

크리에이티브 커먼즈 저작자표시-동일조건변경허락.

문제 출처: 한국정보올림피아드(KOI) (CC BY-NC-SA 4.0) · International Olympiad in Informatics (IOI) (CC BY) · Centre for Education in Mathematics and Computing (CEMC), University of Waterloo (CC BY-NC 4.0) · Programmeringsolympiaden (CC BY-SA) · CSES Problem Set (Antti Laaksonen) (CC BY-NC-SA 4.0). 루미 알고리즘은 위 단체들과 관계없는 별도의 서비스이며, 자료는 원문 그대로 싣습니다. 문제마다 출처와 이용 조건을 따로 표기합니다.