Peli

warning: unused variable: `m`
 --> input/code.rs:4:45
  |
4 | fn check(graph: &Vec<Vec<usize>>, n: usize, m: usize, a: usize, b: usize, x: usize) -> bool {
  |                                             ^ help: if this is intentional, prefix it with an underscore: `_m`
  |
  = note: `#[warn(unused_variables)]` on by default

warning: 1 warning emitted

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 q = VecDeque::new();
    q.push_back(a);
    dist[a] = 0;
    visited[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 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);
    let mut neighbor = vec![false; n + 1];
    let mut tri = false;

    while planet != a {
        eprintln!("> {}", planet);
        planet = p[planet];
        if !tri {
            for n in graph[planet].iter() {
                if neighbor[*n] {
                    tri = true;
                    break;
                }
                neighbor[*n] = true;
            }
        }
        if visited2[planet] {
            return false;
        }
        visited2[planet] = true;
        d += 1;
    }

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

    d <= x && (d % 2 == x % 2 || tri)
}

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);
    }

    println!("{:?}", 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: WRONG ANSWER

a: 1 b: 1 x: 0
p: [0, 0, 1]
d: [18446744073709551615, 0, 1]
a: 1 b: 2 x: 0
p: [0, 0, 1]
d:...

Test 2

Group: 1, 2

Verdict: WRONG ANSWER

a: 14 b: 29 x: 16
p: [0, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 0, 14, 15, 16, 17, 18...

Test 3

Group: 2

Verdict: TIME LIMIT EXCEEDED

Test 4

Group: 1, 2

Verdict: WRONG ANSWER

a: 4 b: 7 x: 16
p: [0, 2, 3, 4, 0, 4, 5, 6, 7, 8, 11, 12, 1]
d: [18446744073709551615, 3,...

Test 5

Group: 1, 2

Verdict: WRONG ANSWER

a: 3 b: 7 x: 16
p: [0, 2, 3, 0, 3, 4, 5, 6, 7, 10, 11, 1]
d: [18446744073709551615, 2, 1,...

Test 6

Group: 2

Verdict: TIME LIMIT EXCEEDED

Test 7

Group: 2

Verdict: TIME LIMIT EXCEEDED

Test 8

Group: 1, 2

Verdict: WRONG ANSWER

a: 37 b: 24 x: 46
p: [0, 2, 3, 37, 1, 17, 2, 25, 9, 44, 3, 3, 6, 34, 50, 5, 43, 37, 13, 6,...

Test 9

Group: 2

Verdict: TIME LIMIT EXCEEDED

Test 10

Group: 2

Verdict: TIME LIMIT EXCEEDED