영어 원문입니다. 원문의 수식·표를 글자로 옮겨 모양이 다를 수 있습니다. 정확한 내용은 원문 페이지에서 확인하세요. 원문 페이지 열기 (새 창)
시간 제한 1초 · 메모리 제한 512 MB
Problem
You are given an undirected graph with n nodes and m edges. The graph is simple and connected.
You start at a specific node, and on each turn you must move through an edge to another node.
Your task is to answer q queries of the form: "is it possible to start at node a and end up on node b after exactly x turns?"
Input
The first line contains three integers n, m and q: the number of nodes, edges and queries. The nodes are numbered 1,2,…,n.
After this, there are m lines which describe the edges. Each line contains two integers a and b: there is an edge between nodes a and b.
Finally, there are q lines, each describing a query. Each line contains three integers a, b and x.
Output
For each query, print the answer (YES or NO) on its own line.
Constraints
- 2 ≤ n ≤ 2500
- 1 ≤ m ≤ 5000
- 1 ≤ q ≤ 10^5
- 0 ≤ x ≤ 10^9
Example
Explanation:
- In query 1, a possible route is 1 → 3 → 2.
- In query 3, a possible route is 1 → 3 → 2 → 1 → 3 → 4.
- In query 6, a possible route is 3 → 4 → 2 → 3 → 4 → 2 → 1 → 3 → 4.
예제
예제 1
4 5 6 1 2 2 3 1 3 2 4 3 4 1 2 2 1 4 1 1 4 5 2 2 1 2 2 2 3 4 8
YES NO YES NO YES YES