tou (BOI contest)
Time limit: 2 seconds | Memory limit: 1024 MB | Task type: batch
Algorithms: graph modeling, graph cycles, graph traversal, dfs

# Task: TOU
## Tour

![](_page_0_Picture_1.jpeg)

**BOI 2025, Day 1. Available memory: 1024 MB.**

There are many tourist attractions in Toruń. Our tour guides prepared a list of *m* one-way walks connecting *n* meeting points in the city center. The walks are numbered from 1 to *m* and similarly the meeting points are numbered from 1 to *n*. Each walk leads from one meeting point to another and allows the participants to see a single attraction on the way. It might be possible to see the same attraction on different walks and there might be multiple walks between the same pair of meeting points. We would like to organise an *interesting tour* on our day off.

A *tour* is a sequence of walks, such that every walk starts at the meeting point where the previous one ends. Furthermore, the last walk ends at the meeting point where the very first walk begins.

We call such a tour *interesting* if it doesn't contain the same attraction twice in a row. In other words, every two consecutive walks from the tour allow us to see different attractions, and additionally the very first and very last walks from the tour allow us to see different attractions as well. Note that we do not mind if some non-consecutive walks allow us to see the same attraction. In particular, the same walk might be used multiple times on the tour (but not twice in a row).

Your task is to check if it is possible to form an interesting tour, and if so to find one. You can output any interesting tour that consists of at most *m* walks. It can be proven that if there exists an interesting tour, then there exists one consisting of at most *m* walks.

## Input

The first line contains a positive integer *t* (1 ≤ *t* ≤ 5 ⋅ 10<sup>5</sup>) denoting the number of test cases.

The first line of each test case contains positive integers *n* and *m* (2 ≤ *n*, 1 ≤ *m*) denoting the number of meeting points and walks, respectively.

Each of the subsequent *m* lines describes one of the *m* walks. The *i*-th line contains three positive integers *x<sub>i</sub>*, *y<sub>i</sub>* and *c<sub>i</sub>* (1 ≤ *x<sub>i</sub>*, *y<sub>i</sub>* ≤ *n*, *x<sub>i</sub>* != *y<sub>i</sub>*, 1 ≤ *c<sub>i</sub>* ≤ *m*), which indicate that the *i*-th walk starts at the meeting point *x<sub>i</sub>*, ends at the meeting point *y<sub>i</sub>*, and allows us to see the attraction *c<sub>i</sub>*.

Let *N* and *M* denote the sum of *n* and *m*, respectively, over all test cases. You can assume that *N*, *M* ≤ 10<sup>6</sup>.

## Output

For each test case, in the first line you should output YES if it is possible to organise an interesting tour and NO otherwise. In the former case, the second line should first contain a positive integer *k* (2 ≤ *k* ≤ *m*) denoting the number of walks forming the interesting tour. This should be followed by *k* integers *p<sub>1</sub>*, *p<sub>2</sub>*, ..., *p<sub>k</sub>* separated by single spaces. These numbers should describe an interesting tour, where we first follow walk *p<sub>1</sub>*, then *p<sub>2</sub>*, and so on, and finally we follow walk *p<sub>k</sub>* returning to the original meeting point.

![](_page_0_Figure_15.jpeg)

Illustration of the 4th test case from the example. The arrows represent the walks between meeting points.

## Example

| Input | Output |
|---|---|
| 5 |  |
| 3 3 |  |
| 1 2 1 | YES |
| 2 3 2 | 2 2 3 |
| 3 1 1 |  |
| 3 3 |  |
| 2 1 1 | NO |
| 1 3 3 |  |
| 3 1 2 |  |
| 2 2 |  |
| 1 2 2 | YES |
| 1 2 1 | 6 3 4 5 6 1 2 |
| 5 6 |  |
| 1 2 1 |  |
| 2 3 2 | YES |
| 3 1 1 | 4 2 4 2 3 |
| 1 4 3 |  |
| 4 5 4 |  |
| 5 1 3 |  |
| 4 4 |  |
| 1 3 4 |  |
| 3 2 1 |  |
| 2 3 2 |  |
| 2 3 2 |  |

## Scoring

| Subtask | Constraints | Points |
|---|---|---|
| 1 | m ≤ 10 and t ≤ 100 | 9 |
| 2 | M ≤ 5000 | 23 |
| 3 | M ≤ 5 ⋅ 10<sup>4</sup> | 19 |
| 4 | M ≤ 2 ⋅ 10<sup>5</sup> | 25 |
| 5 | No additional constraints. | 24 |

Starter code:

Grader code:

Setup script:

Evaluation script: