Connected Components
Write a program which reads relations in a SNS (Social Network Service), and judges that given pairs of users are reachable each other through the network.
| Time Limit | 1 秒/Second(s) | Memory Limit | 512 兆字节/Megabyte(s) |
| 提交总数 | 2 | 正确数量 | 2 |
| 裁判形式 | 标准裁判/Standard Judge | 我的状态 | 尚未尝试 |
| 难度 | 分类标签 | STL |
Connected Components
Write a program which reads relations in a SNS (Social Network Service), and judges that given pairs of users are reachable each other through the network.
In the first line, two integer n and m are given. n is the number of users in the SNS and m is the number of relations in the SNS. The users in the SNS are identified by IDs 0,1,...,n−1
In the following m lines, the relations are given. Each relation is given by two integers s and t that represents s and t are friends (and reachable each other).
In the next line, the number of queries q is given. In the following q lines, q queries are given respectively. Each query consists of two integers s and t separated by a space character.
10 9
0 1
0 2
3 4
5 7
5 6
6 7
6 8
7 8
8 9
3
0 1
5 9
1 3
yes
yes
no
2≤ n≤ 100,000
0≤ m≤ 100,000
1≤ q≤ 10,000
| 本题记录 | 用 户（点击查看用户） | 运行号（点击购买题解） | 时 间 |
|---|---|---|---|
| 算法最快[3 ms] | AOJ大管家 | 1163847 | 2025-01-14 19:40:04 |
| 内存最少[2012 KB] | AOJ大管家 | 1163847 | 2025-01-14 19:40:04 |
| 第一AC | 海燕 | 938452 | 2022-12-31 14:35:30 |
| 第一挑战 | hevttccao | 659987 | 2020-11-17 18:11:39 |
| 竞赛编号 | 竞赛名称 | 竞赛时间 | 访问比赛 |
|---|