308767: CF1572A. Book

Memory Limit:256 MB Time Limit:1 S
Judge Style:Text Compare Creator:
Submit:0 Solved:0

Description

Book

题意翻译

### 题目描述 给你一本有 $n$ 章的书。 每一章都有一个为理解本章而需要理解的其他章节的特定列表。要理解一个章节,你必须在理解了所需列表中的每一章后再阅读。 目前你还不了解任何章节。你要从头到尾反复阅读这本书,直到你理解整本书。请注意,如果您在阅读某一章节时不理解某些必要章节,则表示您暂时不能理解本章。 输出你要读多少次书才能理解每一章。如果你永远不会理解整本书,那么输出 $-1$。 ### 输入格式 第一行一个整数 $T$($1≤t≤2⋅10^ 4$),表示数据组数。 对于每组数据,第一行输入一个整数 $n$($1≤n≤2⋅10^5$),表示书的章节数。接下来 $n$ 行,第 $i$ 第一个整数 $k_i$($0≤k_i≤n-1$),表示要理解第 $i$ 章所必须要理解的章节数。之后 $k_i$ 个整数,表示要理解第 $i$ 章所必须要理解的章节的编号。 ### 输出格式 输出共 $T$ 行。对于每组数据,输出至少要看几遍书才能理解整本书。若该书无法理解,则输出 $-1$。 **translated by @xieyikai2333**

题目描述

You are given a book with $ n $ chapters. Each chapter has a specified list of other chapters that need to be understood in order to understand this chapter. To understand a chapter, you must read it after you understand every chapter on its required list. Currently you don't understand any of the chapters. You are going to read the book from the beginning till the end repeatedly until you understand the whole book. Note that if you read a chapter at a moment when you don't understand some of the required chapters, you don't understand this chapter. Determine how many times you will read the book to understand every chapter, or determine that you will never understand every chapter no matter how many times you read the book.

输入输出格式

输入格式


Each test contains multiple test cases. The first line contains the number of test cases $ t $ ( $ 1 \le t \le 2\cdot10^4 $ ). The first line of each test case contains a single integer $ n $ ( $ 1 \le n \le 2\cdot10^5 $ ) — number of chapters. Then $ n $ lines follow. The $ i $ -th line begins with an integer $ k_i $ ( $ 0 \le k_i \le n-1 $ ) — number of chapters required to understand the $ i $ -th chapter. Then $ k_i $ integers $ a_{i,1}, a_{i,2}, \dots, a_{i, k_i} $ ( $ 1 \le a_{i, j} \le n, a_{i, j} \ne i, a_{i, j} \ne a_{i, l} $ for $ j \ne l $ ) follow — the chapters required to understand the $ i $ -th chapter. It is guaranteed that the sum of $ n $ and sum of $ k_i $ over all testcases do not exceed $ 2\cdot10^5 $ .

输出格式


For each test case, if the entire book can be understood, print how many times you will read it, otherwise print $ -1 $ .

输入输出样例

输入样例 #1

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

输出样例 #1

2
-1
1
2
5

说明

In the first example, we will understand chapters $ \{2, 4\} $ in the first reading and chapters $ \{1, 3\} $ in the second reading of the book. In the second example, every chapter requires the understanding of some other chapter, so it is impossible to understand the book. In the third example, every chapter requires only chapters that appear earlier in the book, so we can understand everything in one go. In the fourth example, we will understand chapters $ \{2, 3, 4\} $ in the first reading and chapter $ 1 $ in the second reading of the book. In the fifth example, we will understand one chapter in every reading from $ 5 $ to $ 1 $ .

Input

题意翻译

### 题目描述 给你一本有 $n$ 章的书。 每一章都有一个为理解本章而需要理解的其他章节的特定列表。要理解一个章节,你必须在理解了所需列表中的每一章后再阅读。 目前你还不了解任何章节。你要从头到尾反复阅读这本书,直到你理解整本书。请注意,如果您在阅读某一章节时不理解某些必要章节,则表示您暂时不能理解本章。 输出你要读多少次书才能理解每一章。如果你永远不会理解整本书,那么输出 $-1$。 ### 输入格式 第一行一个整数 $T$($1≤t≤2⋅10^ 4$),表示数据组数。 对于每组数据,第一行输入一个整数 $n$($1≤n≤2⋅10^5$),表示书的章节数。接下来 $n$ 行,第 $i$ 第一个整数 $k_i$($0≤k_i≤n-1$),表示要理解第 $i$ 章所必须要理解的章节数。之后 $k_i$ 个整数,表示要理解第 $i$ 章所必须要理解的章节的编号。 ### 输出格式 输出共 $T$ 行。对于每组数据,输出至少要看几遍书才能理解整本书。若该书无法理解,则输出 $-1$。 **translated by @xieyikai2333**

加入题单

上一题 下一题 算法标签: