Peli

use std::{*, collections::VecDeque};

fn check(graph: &Vec<Vec<usize>>, n: usize, _m: usize, a: usize, b: usize, x: usize) -> bool {
    let mut dist = vec![usize::MAX; n + 1];
    let mut p = vec![0; n + 1];

    let mut visited = vec![false; n + 1];
    let mut odd = vec![false; n + 1];
    let mut even = vec![false; n + 1];

    let mut q = VecDeque::new();
    q.push_back(a);
    dist[a] = 0;
    visited[a] = true;
    even[a] = true;

    while !q.is_empty() {
        if let Some(planet) = q.pop_front() {
            visited[planet] = true;
            for c in graph[planet].iter() {
                /*if *c == b && (dist[planet] % 2 == 0) == (x % 2 == 0) {
                    continue;
                }*/
                if even[planet] {
                    odd[*c] = true;
                }
                if odd[planet] {
                    even[*c] = true;
                }
                if dist[planet] + 1 < dist[*c] {
                    dist[*c] = dist[planet] + 1;
                    p[*c] = planet;
                }
                if !visited[*c] {
                    q.push_back(*c);
                } 
            }
        } else {
            break;
        }
    }

    let mut d = 0;

    let mut visited2 = vec![false; n + 1];
    let mut planet = b;

    //eprintln!("a: {a} b: {b} x: {x}");
    //eprintln!("p: {:?}", p);
    //eprintln!("d: {:?}", dist);

    while planet != a {
        //eprintln!("> {}", planet);
        planet = p[planet];
        if visited2[planet] {
            return false;
        }
        visited2[planet] = true;
        d += 1;
    }

    if a == b {
        return x % 2 == 0;
    }
    //eprintln!("d: {}", d);

    d <= x && if x % 2 == 0 { even[b] } else { odd[b] }
}

fn main() {
    let stdin = io::stdin();
    let mut str = String::new();
    stdin.read_line(&mut str).unwrap();
    let mut s = str.split(" ");
    let n: usize = s.next().unwrap().trim().parse().unwrap();
    let m: usize = s.next().unwrap().trim().parse().unwrap();
    let q: usize = s.next().unwrap().trim().parse().unwrap();

    let mut graph = vec![vec![]; n + 1];


    for _ in 0..m {
        let mut str = String::new();
        stdin.read_line(&mut str).unwrap();
    
        let mut s = str.split(" ");
        let a: usize = s.next().unwrap().trim().parse().unwrap();
        let b: usize = s.next().unwrap().trim().parse().unwrap();

        graph[a].push(b);
        graph[b].push(a);
    }

    //eprintln!("{:?}", graph);


    let mut res: Vec<bool> = vec![];
    for _ in 0..q {
        let mut str = String::new();
        stdin.read_line(&mut str).unwrap();    
        let mut s = str.split(" ");
        let a: usize = s.next().unwrap().trim().parse().unwrap();
        let b: usize = s.next().unwrap().trim().parse().unwrap();
        let x: usize = s.next().unwrap().trim().parse().unwrap();

        res.push(check(&graph, n, m, a, b, x));
    }

    println!("{}", res.into_iter()
    .map(|b| if b {String::from("YES")} else {String::from("NO")})
        .collect::<Vec<String>>().join("\n"));
}

Test 1

Group: 1, 2

Verdict: ACCEPTED

Test 2

Group: 1, 2

Verdict: ACCEPTED

Test 3

Group: 2

Verdict: TIME LIMIT EXCEEDED

Test 4

Group: 1, 2

Verdict: ACCEPTED

Test 5

Group: 1, 2

Verdict: WRONG ANSWER

Test 6

Group: 2

Verdict: TIME LIMIT EXCEEDED

Test 7

Group: 2

Verdict: TIME LIMIT EXCEEDED

Test 8

Group: 1, 2

Verdict: WRONG ANSWER

Test 9

Group: 2

Verdict: TIME LIMIT EXCEEDED

Test 10

Group: 2

Verdict: TIME LIMIT EXCEEDED