Hypyt

warning: unused import: `HashSet`
 --> input/code.rs:2:33
  |
2 | use std::collections::{HashMap, HashSet, VecDeque};
  |                                 ^^^^^^^
  |
  = note: `#[warn(unused_imports)]` on by default

warning: unused variable: `start`
  --> input/code.rs:43:13
   |
43 |         let start = SystemTime::now().duration_since(UNIX_EPOCH).unwrap().as_nanos();
   |             ^^^^^ help: if this is intentional, prefix it with an underscore: `_start`
   |
   = note: `#[warn(unused_variables)]` on by default

warning: 2 warnings emitted

use std::io;
use std::collections::{HashMap, HashSet, VecDeque};
//use rand::{random, random_bool, random_range};
use std::time::{SystemTime, UNIX_EPOCH};
 
type NodeID = (usize, usize);
 
fn main() {
    let mut input = String::new();
    io::stdin().read_line(&mut input).expect("Failed to read input");
 
    let startdata: Vec<usize> = input.split_whitespace().map(|e| e.parse::<usize>().unwrap()).collect();
 
    let mut rowgrid: Vec<Vec<NodeID>> = vec!();
    let mut colgrid: Vec<Vec<NodeID>> = vec!();
    let mut boolgrid: Vec<Vec<bool>> = vec!();
 
    for row in 0..startdata[0] {
        rowgrid.push(Vec::new());
        boolgrid.push(Vec::new());
        let mut rowinput = String::new();
        io::stdin().read_line(&mut rowinput).expect("Failed to read input");
        let bytes = rowinput.into_bytes();

        for c in 0..bytes.len() {
            if row == 0 {
                colgrid.push(Vec::new());
            }
            if bytes[c] == 46 {
                rowgrid[row].push((row, c));
                boolgrid[row].push(true);
                colgrid[c].push((row, c));
            } else {
                boolgrid[row].push(false);
            }
        }
    }
 
    let mut distancehash: HashMap<(NodeID, NodeID), usize> = HashMap::new();
    'question: for _q in 0..startdata[2] {
        let mut questioninput = String::new();
        io::stdin().read_line(&mut questioninput).expect("Failed to read input");
        let start = SystemTime::now().duration_since(UNIX_EPOCH).unwrap().as_nanos();
        let questiondata: Vec<usize> = questioninput.split_whitespace().map(|e| e.parse::<usize>().unwrap()-1).collect();
        let source: NodeID = (questiondata[0], questiondata[1]);
        let dest: NodeID = (questiondata[2], questiondata[3]);

        let mut queue: VecDeque<NodeID> = VecDeque::new();
        queue.push_front(source);
        distancehash.insert((source, source), 0);
        distancehash.insert((dest, dest), 0);

        match distancehash.get(&(source, dest)) {
            Some(dist) => {
                println!("{}", dist);
                continue;
            }
            None => {}
        }

        let mut statehash: HashMap<NodeID, [bool; 2]> = HashMap::new();
        statehash.insert(source, [true, true]);
        
        while queue.len() != 0 {
            let node = queue.pop_back().unwrap();
            let dist = distancehash[&(source, node)];

            if node.0 == dest.0 || node.1 == dest.1 {
                println!("{}", dist+1);
                continue 'question;
            }

            if boolgrid[node.0][dest.1] || boolgrid[dest.0][node.1] {
                println!("{}", dist+2);
                continue 'question;
            }

            let tosearch = statehash[&node];

            if tosearch[0] {
                for neighbor in rowgrid[node.0].iter() {
                    if *neighbor != node {
                        match distancehash.get(&(source, *neighbor)) {
                            Some(_) => {}
                            None => {
                                distancehash.insert((source, *neighbor), dist+1);
                                distancehash.insert((*neighbor, source), dist+1);
                                statehash.entry(*neighbor).and_modify(|v| v[1] = true).or_insert([false, true]);
                                queue.push_front(*neighbor);
                            }
                        }
                    }
                }
            }
            if tosearch[1] {
                for neighbor in colgrid[node.0].iter() {
                    if *neighbor != node {
                        match distancehash.get(&(source, *neighbor)) {
                            Some(_) => {}
                            None => {
                                distancehash.insert((source, *neighbor), dist+1);
                                distancehash.insert((*neighbor, source), dist+1);
                                statehash.entry(*neighbor).and_modify(|v| v[0] = true).or_insert([true, false]);
                                queue.push_front(*neighbor);
                            }
                        }
                    }
                }
            }
        }
    }
}

Test 1 (public)

Group: 1, 2, 3, 4, 5

Verdict: WRONG ANSWER

Test 2

Group: 1, 2, 3, 4, 5

Verdict: ACCEPTED

Test 3

Group: 1, 2, 3, 4, 5

Verdict: ACCEPTED

Test 4

Group: 1, 2, 3, 4, 5

Verdict: WRONG ANSWER

Test 5

Group: 1, 2, 3, 4, 5

Verdict: WRONG ANSWER

Test 6

Group: 2, 5

Verdict: ACCEPTED

Test 7

Group: 2, 5

Verdict: ACCEPTED

Test 8

Group: 2, 5

Verdict: WRONG ANSWER

Test 9

Group: 3, 4, 5

Verdict: WRONG ANSWER

Test 10

Group: 3, 4, 5

Verdict: WRONG ANSWER

Test 11

Group: 3, 4, 5

Verdict: WRONG ANSWER

Test 12

Group: 4, 5

Verdict: WRONG ANSWER

Test 13

Group: 4, 5

Verdict: TIME LIMIT EXCEEDED

Test 14

Group: 4, 5

Verdict: WRONG ANSWER

Test 15

Group: 5

Verdict: TIME LIMIT EXCEEDED

Test 16

Group: 5

Verdict: TIME LIMIT EXCEEDED

Test 17

Group: 5

Verdict: TIME LIMIT EXCEEDED

Test 18

Group: 5

Verdict: TIME LIMIT EXCEEDED

Test 19

Group: 5

Verdict: WRONG ANSWER

Test 20

Group: 5

Verdict: WRONG ANSWER

Test 21

Group: 5

Verdict: WRONG ANSWER

Test 22

Group: 1, 2, 3, 4, 5

Verdict: ACCEPTED

Test 23

Group: 1, 2, 3, 4, 5

Verdict: ACCEPTED

Test 24

Group: 5

Verdict: ACCEPTED

Test 25

Group: 5

Verdict: ACCEPTED

Test 26

Group: 5

Verdict: ACCEPTED

Test 27

Group: 5

Verdict: ACCEPTED