CSES - Datatähti 2026 alku

Submission details
Task:	Hypyt
Sender:	Jaksu
Submission time:	2025-11-03 19:07:07 +0200
Language:	Rust (2021)
Status:	READY
Result:	0

Feedback
group	verdict	score
#1	WRONG ANSWER	0
#2	WRONG ANSWER	0
#3	WRONG ANSWER	0
#4	WRONG ANSWER	0
#5	WRONG ANSWER	0

Test results
test	verdict	time	group
#1	WRONG ANSWER	0.00 s	1, 2, 3, 4, 5	details
#2	WRONG ANSWER	0.00 s	1, 2, 3, 4, 5	details
#3	WRONG ANSWER	0.00 s	1, 2, 3, 4, 5	details
#4	WRONG ANSWER	0.00 s	1, 2, 3, 4, 5	details
#5	WRONG ANSWER	0.00 s	1, 2, 3, 4, 5	details
#6	WRONG ANSWER	0.04 s	2, 5	details
#7	WRONG ANSWER	0.04 s	2, 5	details
#8	WRONG ANSWER	0.04 s	2, 5	details
#9	TIME LIMIT EXCEEDED	--	3, 4, 5	details
#10	TIME LIMIT EXCEEDED	--	3, 4, 5	details
#11	TIME LIMIT EXCEEDED	--	3, 4, 5	details
#12	TIME LIMIT EXCEEDED	--	4, 5	details
#13	TIME LIMIT EXCEEDED	--	4, 5	details
#14	TIME LIMIT EXCEEDED	--	4, 5	details
#15	TIME LIMIT EXCEEDED	--	5	details
#16	TIME LIMIT EXCEEDED	--	5	details
#17	TIME LIMIT EXCEEDED	--	5	details
#18	TIME LIMIT EXCEEDED	--	5	details
#19	TIME LIMIT EXCEEDED	--	5	details
#20	TIME LIMIT EXCEEDED	--	5	details
#21	TIME LIMIT EXCEEDED	--	5	details
#22	WRONG ANSWER	0.00 s	1, 2, 3, 4, 5	details
#23	WRONG ANSWER	0.00 s	1, 2, 3, 4, 5	details
#24	TIME LIMIT EXCEEDED	--	5	details
#25	TIME LIMIT EXCEEDED	--	5	details
#26	TIME LIMIT EXCEEDED	--	5	details
#27	ACCEPTED	0.32 s	5	details

Compiler report

warning: unused variable: `row`
  --> input/code.rs:16:9
   |
16 |     for row in 0..startdata[0] {
   |         ^^^ help: if this is intentional, prefix it with an underscore: `_row`
   |
   = note: `#[warn(unused_variables)]` on by default

warning: 1 warning emitted

Code

use std::io;
use std::collections::{HashMap, HashSet, VecDeque};
//use rand::{random, 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 grid: Vec<Vec<bool>> = vec!();
 
    for row in 0..startdata[0] {
        let mut newrow: Vec<bool> = vec!();
        let mut rowinput = String::new();
        io::stdin().read_line(&mut rowinput).expect("Failed to read input");

        for c in rowinput.into_bytes().into_iter() {
            if c == 46 {
                newrow.push(true);
            } else {
                newrow.push(false);
            }
        } 
        grid.push(newrow);
    }

    //dbg!(&grid);
 
    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 destination: NodeID = (questiondata[2], questiondata[3]);

        /*let y1 = random_range(0..startdata[0]);
        let y2 = random_range(0..startdata[0]);
        let x1 = random_range(0..startdata[1]);
        let x2 = random_range(0..startdata[1]);
        let source = (y1, x1);
        let destination = (y2, x2);*/
        
        if source == destination {
            println!("0");
            continue;
        }

        let mut distancehash: HashMap<(NodeID, NodeID), usize> = HashMap::new();
        let mut checkedset: HashSet<NodeID> = HashSet::new();
        distancehash.insert((source, source), 0);
        distancehash.insert((destination, destination), 0);

        let mut sourcequeue: VecDeque<NodeID> = VecDeque::new();
        sourcequeue.push_front(source);
        let mut destqueue: VecDeque<NodeID> = VecDeque::new();
        destqueue.push_front(destination);
        checkedset.insert(source);
        checkedset.insert(destination);
        
        'outer: while sourcequeue.len() != 0 && destqueue.len() != 0 {
            let node = sourcequeue.pop_back().unwrap();
            let dist = *distancehash.get(&(source, node)).unwrap();
            let destnode = destqueue.pop_back().unwrap();
            let destdist = *distancehash.get(&(destination, destnode)).unwrap();

            dbg!(&node);

            for row in 0..grid.len() {
                if row == node.0 {
                    for cell in 0..node.1 {
                        if grid[row][cell] {
                            let neighbor = (row, cell);
                            match distancehash.get(&(source, neighbor)) {
                                Some(_) => {}
                                None =>{
                                    distancehash.entry((source, neighbor)).or_insert(dist+1);
                                    sourcequeue.push_front(neighbor);
                                    if !checkedset.insert(neighbor) {
                                        let desttoneighbor = distancehash[&(destination, neighbor)];
                                        distancehash.insert((source, destination), dist+1+desttoneighbor);
                                        break 'outer;
                                    }
                                }
                            }
                            if neighbor == destination {
                                break 'outer;
                            }
                        }
                    }
                    for cell in (node.1+1)..grid[row].len() {
                        if grid[row][cell] {
                            let neighbor = (row, cell);
                            match distancehash.get(&(source, neighbor)) {
                                Some(_) => {}
                                None =>{
                                    distancehash.entry((source, neighbor)).or_insert(dist+1);
                                    sourcequeue.push_front(neighbor);
                                    if !checkedset.insert(neighbor) {
                                        let desttoneighbor = distancehash[&(destination, neighbor)];
                                        distancehash.insert((source, destination), dist+1+desttoneighbor);
                                        break 'outer;
                                    }
                                }
                            }
                            if neighbor == destination {
                                break 'outer;
                            }
                        }
                    }
                } else {
                    if grid[row][node.1] {
                        let neighbor = (row, node.1);
                        match distancehash.get(&(source, neighbor)) {
                            Some(_) => {}
                            None => {
                                distancehash.entry((source, neighbor)).or_insert(dist+1);
                                sourcequeue.push_front(neighbor);
                                if !checkedset.insert(neighbor) {
                                    let desttoneighbor = distancehash[&(destination, neighbor)];
                                    distancehash.insert((source, destination), dist+1+desttoneighbor);
                                    break 'outer;
                                }
                            }
                        }
                        if neighbor == destination {
                            break 'outer;
                        }
                    }
                }
            }

            for row in 0..grid.len() {
                if row == destnode.0 {
                    for cell in 0..destnode.1 {
                        if grid[row][cell] {
                            let neighbor = (row, cell);
                            match distancehash.get(&(destination, neighbor)) {
                                Some(_) => {}
                                None =>{
                                    distancehash.entry((destination, neighbor)).or_insert(destdist+1);
                                    destqueue.push_front(neighbor);
                                    if !checkedset.insert(neighbor) {
                                        let sourcetoneighbor = distancehash[&(source, neighbor)];
                                        distancehash.insert((source, destination), destdist+sourcetoneighbor+1);
                                        break 'outer;
                                    }
                                }
                            }
                        }
                    }
                    for cell in (destnode.1+1)..grid[row].len() {
                        if grid[row][cell] {
                            let neighbor = (row, cell);
                            match distancehash.get(&(destination, neighbor)) {
                                Some(_) => {}
                                None =>{
                                    distancehash.entry((destination, neighbor)).or_insert(destdist+1);
                                    destqueue.push_front(neighbor);
                                    if !checkedset.insert(neighbor) {
                                        let sourcetoneighbor = distancehash[&(source, neighbor)];
                                        distancehash.insert((source, destination), destdist+sourcetoneighbor+1);
                                        break 'outer;
                                    }
                                }
                            }
                        }
                    }
                } else {
                    if grid[row][destnode.1] {
                        let neighbor = (row, destnode.1);
                        match distancehash.get(&(destination, neighbor)) {
                            Some(_) => {}
                            None => {
                                distancehash.entry((destination, neighbor)).or_insert(destdist+1);
                                destqueue.push_front(neighbor);
                                if !checkedset.insert(neighbor) {
                                    let sourcetoneighbor = distancehash[&(source, neighbor)];
                                    distancehash.insert((source, destination), destdist+sourcetoneighbor+1);
                                    break 'outer;
                                }
                            }
                        }
                    }
                }
            }
        }
        match distancehash.get(&(source, destination)) {
            Some(s) => {println!("{}", s);},
            None => {println!("-1");}
        }
        let end = SystemTime::now().duration_since(UNIX_EPOCH).unwrap().as_nanos();
        println!("{}", end-start);
    }
}

Test details

Test 1 (public)

Group: 1, 2, 3, 4, 5

Verdict: WRONG ANSWER

input
`4 6 5 ..** ...* ****. ... ...` view save

correct output
`1 0 3 3 -1` view save

user output
`1 33945 0 3 33784 ...` view save

Feedback: Output is longer than expected
Error:

[input/code.rs:71] &node = (
    0,
    0,
)
[input/code.rs:71] &node = (
    0,
    0,
)
[input/code.rs:71] &node = (
    0,
    2,
)
[input/code.rs:71] &node = (
    3,
    4,
)
[input/code.rs:71] &node = (
    3,
    1,
)
[input/code.rs:71] &node = (
    2,
    5,
)

Test 2

Group: 1, 2, 3, 4, 5

Verdict: WRONG ANSWER

input
`10 10 10 .......... ......... ......... .....*.. ...` view save

correct output
`1 2 1 2 2 ...` view save

user output
`1 37219 2 23061 1 ...` view save

Feedback: Output is longer than expected
Error:

[input/code.rs:71] &node = (
    5,
    3,
)
[input/code.rs:71] &node = (
    4,
    0,
)
[input/code.rs:71] &node = (
    9,
    9,
)
[input/code.rs:71] &node = (
    0,
    8,
)
[input/code.rs:71] &node = (
    1,
    7,
)
[input/code.rs:71] &node = (
    1,
    3,
)
[input/code.rs:71] &node = (
    6,
    0,
)
[input/code.rs:71] &node = (
    2,
    1,
)
[input/code.rs:71] &node = (
    4,
    2,
)
[input/code.rs:71] &node = (
    2,
    0,
)

Test 3

Group: 1, 2, 3, 4, 5

Verdict: WRONG ANSWER

input
`10 10 10 .... ****.... .... ...*.. ...` view save

correct output
`1 2 2 1 2 ...` view save

user output
`1 36603 2 21452 2 ...` view save

Feedback: Output is longer than expected
Error:

[input/code.rs:71] &node = (
    0,
    1,
)
[input/code.rs:71] &node = (
    6,
    3,
)
[input/code.rs:71] &node = (
    2,
    3,
)
[input/code.rs:71] &node = (
    3,
    0,
)
[input/code.rs:71] &node = (
    4,
    8,
)
[input/code.rs:71] &node = (
    0,
    3,
)
[input/code.rs:71] &node = (
    5,
    1,
)
[input/code.rs:71] &node = (
    1,
    8,
)
[input/code.rs:71] &node = (
    1,
    5,
)
[input/code.rs:71] &node = (
    5,
    3,
)
[input/code.rs:71] &node = (
    6,
    4,
)

Test 4

Group: 1, 2, 3, 4, 5

Verdict: WRONG ANSWER

input
`10 10 10 **..** ******** .******* .... ...` view save

correct output
`3 4 2 3 4 ...` view save

user output
`3 82936 4 48351 2 ...` view save

Feedback: Output is longer than expected
Error:

[input/code.rs:71] &node = (
    7,
    3,
)
[input/code.rs:71] &node = (
    0,
    3,
)
[input/code.rs:71] &node = (
    7,
    2,
)
[input/code.rs:71] &node = (
    7,
    9,
)
[input/code.rs:71] &node = (
    0,
    5,
)
[input/code.rs:71] &node = (
    0,
    3,
)
[input/code.rs:71] &node = (
    5,
    5,
)
[input/code.rs:71] &node = (
    3,
    9,
)
[input/code.rs:71] &node = (
    9,
    4,
)
[input/code.rs:71] &node = (
    8,
    4,
)
[input/code.rs:71] &node = (
    9,
    1,
)
[input/code.rs:71] &node = (
    9,
    8,
)
[input/code.rs:71] &node = (
    5,
    5,
)
[input/code.rs:71] &node = (
    0,
    5,
)
[input/code.rs:71] &node = (
    8,
    5,
)
[input/code.rs:71] &node = (
    0,
    3,
)
[input/code.rs:71] &node = (
    3,
    2,
)
[input/code.rs:71] &node = (
    0,
    5,
)
[input/code.rs:71] &node = (
    0,
    3,
)
[input/code.rs:71] &node = (
    9,
    9,
)
[input/code.rs:71] &node = (
    9,
    9,
)

Test 5

Group: 1, 2, 3, 4, 5

Verdict: WRONG ANSWER

input
`10 10 1 .**. ...* ******** ****.. ...` view save

correct output
`7` view save

user output
`7 97175` view save

Feedback: Output is longer than expected
Error:

[input/code.rs:71] &node = (
    1,
    2,
)
[input/code.rs:71] &node = (
    1,
    5,
)
[input/code.rs:71] &node = (
    1,
    6,
)
[input/code.rs:71] &node = (
    0,
    5,
)
[input/code.rs:71] &node = (
    8,
    5,
)

Test 6

Group: 2, 5

Verdict: WRONG ANSWER

input
`250 250 250 .........*****.....*.......` view save

correct output
`2 3 3 2 2 ...` view save

user output
`2 173549 3 248187 3 ...` view save

Feedback: Output is longer than expected
Error:

[input/code.rs:71] &node = (
    60,
    168,
)
[input/code.rs:71] &node = (
    183,
    92,
)
[input/code.rs:71] &node = (
    0,
    92,
)
[input/code.rs:71] &node = (
    72,
    5,
)
[input/code.rs:71] &node = (
    1,
    5,
)
[input/code.rs:71] &node = (
    184,
    108,
)
[input/code.rs:71] &node = (
    55,
    52,
)
[input/code.rs:71] &node = (
    113,
    86,
)
[input/code.rs:71] &node = (
    60,
    53,
)
[input/code.rs:71] &node = (
    192,
    52,
)
[input/code.rs:71] &node = (
    162,
    143,
)
[input/code.rs:71] &node = (
    123,
    115,
)
[input/code.rs:71] &node = (
    23,
    60,
)
[input/code.rs:71] &node = (
    129,
    64,
)
[input/code.rs:71] &node = (
    137,
    110,
)
[input/code.rs:71] &node = (
    150,
    50,
)
[input/code.rs:71] &node = (
    242,
    12,
)
[input/code.rs:71] &node = (
    75,
    27,
)
[input/code.rs:71] &node = (
    145,
    121,
)
[input/code.rs:71] &node = (
    187,
    189,
)
[input/code.rs:71] &node = (
    8,
    104,...

Test 7

Group: 2, 5

Verdict: WRONG ANSWER

input
`250 250 250 ..................**...` view save

correct output
`2 2 2 2 3 ...` view save

user output
`2 237274 2 104783 2 ...` view save

Feedback: Output is longer than expected
Error:

[input/code.rs:71] &node = (
    156,
    86,
)
[input/code.rs:71] &node = (
    116,
    191,
)
[input/code.rs:71] &node = (
    101,
    94,
)
[input/code.rs:71] &node = (
    194,
    227,
)
[input/code.rs:71] &node = (
    245,
    192,
)
[input/code.rs:71] &node = (
    1,
    192,
)
[input/code.rs:71] &node = (
    207,
    173,
)
[input/code.rs:71] &node = (
    0,
    173,
)
[input/code.rs:71] &node = (
    2,
    173,
)
[input/code.rs:71] &node = (
    57,
    241,
)
[input/code.rs:71] &node = (
    0,
    241,
)
[input/code.rs:71] &node = (
    15,
    206,
)
[input/code.rs:71] &node = (
    207,
    109,
)
[input/code.rs:71] &node = (
    15,
    159,
)
[input/code.rs:71] &node = (
    2,
    159,
)
[input/code.rs:71] &node = (
    4,
    159,
)
[input/code.rs:71] &node = (
    6,
    159,
)
[input/code.rs:71] &node = (
    18,
    134,
)
[input/code.rs:71] &node = (
    109,
    127,
)
[input/code.rs:71] &node = (
    0,
    127,
)
[input/code.rs:71] &node = (
    2,
    12...

Test 8

Group: 2, 5

Verdict: WRONG ANSWER

input
`250 250 250 ....**.*..*......` view save

correct output
`2 3 3 3 3 ...` view save

user output
`2 162566 3 167277 3 ...` view save

Feedback: Output is longer than expected
Error:

[input/code.rs:71] &node = (
    66,
    215,
)
[input/code.rs:71] &node = (
    26,
    1,
)
[input/code.rs:71] &node = (
    2,
    1,
)
[input/code.rs:71] &node = (
    8,
    1,
)
[input/code.rs:71] &node = (
    125,
    116,
)
[input/code.rs:71] &node = (
    0,
    116,
)
[input/code.rs:71] &node = (
    88,
    19,
)
[input/code.rs:71] &node = (
    0,
    19,
)
[input/code.rs:71] &node = (
    1,
    19,
)
[input/code.rs:71] &node = (
    4,
    19,
)
[input/code.rs:71] &node = (
    30,
    132,
)
[input/code.rs:71] &node = (
    9,
    132,
)
[input/code.rs:71] &node = (
    235,
    231,
)
[input/code.rs:71] &node = (
    8,
    150,
)
[input/code.rs:71] &node = (
    2,
    150,
)
[input/code.rs:71] &node = (
    8,
    1,
)
[input/code.rs:71] &node = (
    183,
    209,
)
[input/code.rs:71] &node = (
    4,
    209,
)
[input/code.rs:71] &node = (
    43,
    161,
)
[input/code.rs:71] &node = (
    1,
    161,
)
[input/code.rs:71] &node = (
    74,
    39,
)
[input/code.rs...

Test 9

Group: 3, 4, 5

Verdict: TIME LIMIT EXCEEDED

input
`40 40 200000 .....................*.....` view save

correct output
`2 2 2 2 2 ...` view save

user output
(empty)

Test 10

Group: 3, 4, 5

Verdict: TIME LIMIT EXCEEDED

input
`40 40 200000 ......***....*.....` view save

correct output
`2 1 3 2 2 ...` view save

user output
(empty)

Test 11

Group: 3, 4, 5

Verdict: TIME LIMIT EXCEEDED

input
`40 40 200000 ....*...**..**...` view save

correct output
`3 3 3 3 3 ...` view save

user output
(empty)

Test 12

Group: 4, 5

Verdict: TIME LIMIT EXCEEDED

input
`80 80 200000 .......*........*......` view save

correct output
`2 2 2 2 2 ...` view save

user output
(empty)

Test 13

Group: 4, 5

Verdict: TIME LIMIT EXCEEDED

input
`80 80 200000 .**......*.......*...` view save

correct output
`3 2 2 3 2 ...` view save

user output
(empty)

Test 14

Group: 4, 5

Verdict: TIME LIMIT EXCEEDED

input
`80 80 200000 *****.**.....*...*...` view save

correct output
`2 3 1 2 2 ...` view save

user output
(empty)

Test 15

Group: 5

Verdict: TIME LIMIT EXCEEDED

input
`250 250 200000 ..........*...........**...` view save

correct output
`3 2 2 2 2 ...` view save

user output
(empty)

Test 16

Group: 5

Verdict: TIME LIMIT EXCEEDED

input
`250 250 200000 ...............*....**...` view save

correct output
`2 2 2 2 2 ...` view save

user output
(empty)

Test 17

Group: 5

Verdict: TIME LIMIT EXCEEDED

input
`250 250 200000 ...***.*****..**...` view save

correct output
`3 3 2 2 2 ...` view save

user output
(empty)

Test 18

Group: 5

Verdict: TIME LIMIT EXCEEDED

input
`250 250 200000 *******.******.**....` view save

correct output
`3 3 3 3 3 ...` view save

user output
(empty)

Test 19

Group: 5

Verdict: TIME LIMIT EXCEEDED

input
`250 250 200000 .*****************************...` view save

correct output
`104 422 145 93 65 ...` view save

user output
(empty)

Test 20

Group: 5

Verdict: TIME LIMIT EXCEEDED

input
`250 250 200000 ..****************************...` view save

correct output
`57 155 38 65 98 ...` view save

user output
(empty)

Test 21

Group: 5

Verdict: TIME LIMIT EXCEEDED

input
`250 250 200000 .*****************************...` view save

correct output
`498 498 498 498 498 ...` view save

user output
(empty)

Test 22

Group: 1, 2, 3, 4, 5

Verdict: WRONG ANSWER

input
`10 1 10 * * . * ...` view save

correct output
`0 1 1 0 0 ...` view save

user output
`0 1 30008 1 16066 ...` view save

Feedback: Output is longer than expected
Error:

[input/code.rs:71] &node = (
    9,
    0,
)
[input/code.rs:71] &node = (
    9,
    0,
)
[input/code.rs:71] &node = (
    2,
    0,
)
[input/code.rs:71] &node = (
    5,
    0,
)
[input/code.rs:71] &node = (
    2,
    0,
)

Test 23

Group: 1, 2, 3, 4, 5

Verdict: WRONG ANSWER

input
`1 10 10 ........*. 1 7 1 10 1 4 1 7 1 5 1 1 ...` view save

correct output
`1 1 1 1 1 ...` view save

user output
`1 38810 1 18080 1 ...` view save

Feedback: Output is longer than expected
Error:

[input/code.rs:71] &node = (
    0,
    6,
)
[input/code.rs:71] &node = (
    0,
    3,
)
[input/code.rs:71] &node = (
    0,
    4,
)
[input/code.rs:71] &node = (
    0,
    5,
)
[input/code.rs:71] &node = (
    0,
    1,
)
[input/code.rs:71] &node = (
    0,
    2,
)
[input/code.rs:71] &node = (
    0,
    7,
)
[input/code.rs:71] &node = (
    0,
    6,
)

Test 24

Group: 5

Verdict: TIME LIMIT EXCEEDED

input
`250 1 200000 * . * . ...` view save

correct output
`1 1 1 1 1 ...` view save

user output
(empty)

Test 25

Group: 5

Verdict: TIME LIMIT EXCEEDED

input
`1 250 200000 ..............**...` view save

correct output
`1 1 1 1 1 ...` view save

user output
(empty)

Test 26

Group: 5

Verdict: TIME LIMIT EXCEEDED

input
`250 250 200000 .................................` view save

correct output
`2 2 2 2 2 ...` view save

user output
(empty)

Test 27

Group: 5

Verdict: ACCEPTED

input
`250 250 200000 ******************************...` view save

correct output
`0 0 0 0 0 ...` view save

user output
`0 0 0 0 0 ...` view save

Datatähti 2026 alku

Hypyt

Compiler report

Code

Test details

Test 1 (public)

Test 2

Test 3

Test 4

Test 5

Test 6

Test 7

Test 8

Test 9

Test 10

Test 11

Test 12

Test 13

Test 14

Test 15

Test 16

Test 17

Test 18

Test 19

Test 20

Test 21

Test 22

Test 23

Test 24

Test 25

Test 26

Test 27

Tasks

Submissions (Jaksu)