Logo
(追記) (追記ここまで)

15395번 - Christmas Tree 다국어

시간 제한메모리 제한제출정답맞힌 사람정답 비율
0.7 초 512 MB72000.000%

문제

Santa has a Christmas Tree. In computer science terms, a Christmas Tree is a tree with N nodes where each node has a colour. Initially, all nodes have colour 0. One night, an elf comes (we call him Elf) to paint the tree because he found it very boring. M consecutive updates were performed on the given tree the following way: on update number X, Elf opens gift number X before Christmas (of course, it’s someone else’s gift) and finds a triplet (C, A, B) in it. After that, he paints with colour C all the nodes which can be found on the chain formed by vertices A and B. All colours are different from gift to gift, so we can assume that the M colours are M distinct values from 1 to M. While performing update X, some nodes may already be painted, in which case they will just be repainted with the new colour (the old one is lost forever :( )

Unfortunately, we do not know the M operations (the triplets found in the gifts), but we do know how the tree looks like in the end (you are given the colour of each node after performing all updates). Your task is to find a possible solution for the generated final form of the tree. More precisely, you have to find M triplets (in the correct order), such that if Elf would have found them in the gifts, he would obtain the Christmas Tree described in the input. Since there can be multiple solutions, you can display any of them.

입력

  • First line: N, M
  • Second Line: N integers between 1 and M. The X-th value denotes the colour of the vertex number X
  • The next N - 1 lines describe the edges of the tree. Each such line contains a pair of numbers (A, B), meaning that there is an edge between node A and node B

Constraints

  • 1 ≤ N, M ≤ 100.000
  • The Christmas Tree will contain colours with indexes between 1 and M
  • It is guaranteed that there always exists at least one solution
  • After all M operations all nodes will have been painted at least once

출력

  • M lines. Line number X should contain a triplet (C, A, B), denoting the X-th gift found by Elf. Warning: Elf performs the drawings in the order of your output, so order DOES matter.

제한

예제 입력 1

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

예제 출력 1

2 6 3
1 5 1
3 2 2

예제 입력 2

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

예제 출력 2

1 3 5
2 2 4
3 1 1

힌트

출처

ICPC > Regionals > Europe > Southeastern European Regional Contest > SEERC 2017 C번

(追記) (追記ここまで)

출처

대학교 대회

  • 사업자 등록 번호: 541-88-00682
  • 대표자명: 최백준
  • 주소: 서울시 서초구 서초대로74길 29 서초파라곤 412호
  • 전화번호: 02-521-0487 (이메일로 연락 주세요)
  • 이메일: contacts@startlink.io
  • 통신판매신고번호: 제 2017-서울서초-2193 호

AltStyle によって変換されたページ (->オリジナル) /