Universal Cup Judging System

Universal Cup

时间限制: 3.0 s 内存限制: 1024 MB 总分: 100
统计

有一張包含 $n$ 個頂點同 $m$ 條邊嘅無向圖。呢張圖唔包含自環或者重邊,而且唔一定連通。頂點由 $1$ 到 $n$ 編號。

總共有 $q$ 次詢問。每次詢問係一對頂點 $(x, y)$。你需要判斷 $x$ 同 $y$ 之間嘅距離係咪嚴格大過 $20\,000$。

兩個頂點之間嘅距離係連接佢哋嘅最短路徑上面嘅邊數。如果唔存在最短路徑,距離就視為 $+\infty > 20\,000$。

輸入格式

第一行包含三個整數 $n$、$m$ 同 $q$($1 \le n \le 10^5$,$0 \le m \le 3 \cdot 10^5$,$1 \le q \le 3 \cdot 10^5$)。

接住落嚟有 $m$ 行,每行包含兩個整數 $u_i$ 同 $v_i$,代表圖入面嘅邊($1 \le u_i < v_i \le n$,冇兩條邊重合)。

之後有 $q$ 行,每行包含兩個整數 $x_i$ 同 $y_i$($1 \le x_i, y_i \le n$,$x_i$ 同 $y_i$ 可能會相同)。

輸出格式

輸出 $q$ 行,每行輸出「YES」或者「NO」:代表各次詢問嘅答案。

樣例

樣例輸入 1

10 5 10
1 2
1 7
3 10
4 10
5 6
3 3
5 6
5 2
10 6
9 4
6 6
1 7
10 1
10 5
8 7

樣例輸出 1

NO
NO
YES
YES
YES
NO
NO
YES
YES
YES

說明

喺樣例入面,圖中只有 $10$ 個頂點,所以我哋其實係喺度檢查呢兩個頂點係咪屬於唔同嘅連通分量。

Discussions

About Discussions

The discussion section is only for posting: General Discussions (problem-solving strategies, alternative approaches), and Off-topic conversations.

This is NOT for reporting issues! If you want to report bugs or errors, please use the Issues section below.

Open Discussions 0
No discussions in this category.

Issues

About Issues

If you find any issues with the problem (statement, scoring, time/memory limits, test cases, etc.), you may submit an issue here. A problem moderator will review your issue.

Guidelines:

  1. This is not a place to publish discussions, editorials, or requests to debug your code. Issues are only visible to you and problem moderators.
  2. Do not submit duplicated issues.
  3. Issues must be filed in English or Chinese only.
Active Issues 0
No issues in this category.
Closed/Resolved Issues 0
No issues in this category.