— Dark mode

Datatähti 2026 alku

Hypyt

  • Start: 2025-10-27 00:00:00
  • End: 2025-11-10 00:00:00
Submission details
Task:Hypyt
Sender:Jaksu
Submission time:2025-11-04 13:02:37 +0200
Language:Rust (2021)
Status:READY
Result:10
Feedback
groupverdictscore
#1ACCEPTED10
#20
#30
#40
#50
Test results
testverdicttimegroup
#1ACCEPTED0.00 s1, 2, 3, 4, 5details
#2ACCEPTED0.00 s1, 2, 3, 4, 5details
#3ACCEPTED0.00 s1, 2, 3, 4, 5details
#4ACCEPTED0.00 s1, 2, 3, 4, 5details
#5ACCEPTED0.00 s1, 2, 3, 4, 5details
#6ACCEPTED0.04 s2, 5details
#7ACCEPTED0.03 s2, 5details
#80.04 s2, 5details
#9--3, 4, 5details
#10--3, 4, 5details
#11--3, 4, 5details
#12--4, 5details
#13--4, 5details
#14--4, 5details
#15--5details
#16--5details
#17--5details
#18--5details
#19--5details
#20--5details
#21--5details
#22ACCEPTED0.00 s1, 2, 3, 4, 5details
#23ACCEPTED0.00 s1, 2, 3, 4, 5details
#24ACCEPTED0.32 s5details
#25ACCEPTED0.33 s5details
#26--5details
#27ACCEPTED0.32 s5details

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: unused variable: `start`
  --> input/code.rs:29:13
   |
29 |         let start = SystemTime::now().duration_since(UNIX_EPOCH).unwrap().as_nanos();
   |             ^^^^^ help: if this is intentional, prefix it with an underscore: `_start`

warning: unused variable: `end`
   --> input/code.rs:193:13
    |
193 |         let end = SystemTime::now().duration_since(UNIX_EPOCH).unwrap().as_nanos();
    |             ^^^ help: if this is intentional, prefix it with an underscore: `_end`

warning: 3 warnings 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 rowinput = String::new();
        io::stdin().read_line(&mut rowinput).expect("Failed to read input");
 
        let newrow = rowinput.into_bytes().into_iter().map(|c| if c == 46 {true} else {false}).collect();
        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;
        } 
        if source.0 == destination.0 || source.1 == destination.1 {
            println!("1");
            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: ACCEPTED

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

correct output
1
0
3
3
-1
view save

user output
1
0
3
3
-1
view save

Test 2

Group: 1, 2, 3, 4, 5

Verdict: ACCEPTED

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

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

user output
1
2
1
2
2
...
view save

Test 3

Group: 1, 2, 3, 4, 5

Verdict: ACCEPTED

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

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

user output
1
2
2
1
2
...
view save

Test 4

Group: 1, 2, 3, 4, 5

Verdict: ACCEPTED

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

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

user output
3
4
2
3
4
...
view save

Test 5

Group: 1, 2, 3, 4, 5

Verdict: ACCEPTED

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

correct output
7
view save

user output
7
view save

Test 6

Group: 2, 5

Verdict: ACCEPTED

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

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

user output
2
3
3
2
2
...
view save

Test 7

Group: 2, 5

Verdict: ACCEPTED

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

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

user output
2
2
2
2
3
...
view save

Test 8

Group: 2, 5

Verdict:

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

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

user output
2
3
3
3
3
...
view save

Feedback: Incorrect character on line 13 col 1: expected "3", got "4"

Test 9

Group: 3, 4, 5

Verdict:

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:

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:

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

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

user output
(empty)

Test 12

Group: 4, 5

Verdict:

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

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

user output
(empty)

Test 13

Group: 4, 5

Verdict:

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

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

user output
(empty)

Test 14

Group: 4, 5

Verdict:

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

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

user output
(empty)

Test 15

Group: 5

Verdict:

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

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

user output
(empty)

Test 16

Group: 5

Verdict:

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

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

user output
(empty)

Test 17

Group: 5

Verdict:

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

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

user output
(empty)

Test 18

Group: 5

Verdict:

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

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

user output
(empty)

Test 19

Group: 5

Verdict:

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

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

user output
(empty)

Test 20

Group: 5

Verdict:

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

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

user output
(empty)

Test 21

Group: 5

Verdict:

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: ACCEPTED

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

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

user output
0
1
1
0
0
...
view save

Test 23

Group: 1, 2, 3, 4, 5

Verdict: ACCEPTED

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
1
1
1
1
...
view save

Test 24

Group: 5

Verdict: ACCEPTED

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

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

user output
1
1
1
1
1
...
view save

Test 25

Group: 5

Verdict: ACCEPTED

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

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

user output
1
1
1
1
1
...
view save

Test 26

Group: 5

Verdict:

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

Tasks

A Palindromi-B Monikulmio-C Tulkki-D Maalaus-E Hypyt-F Lukujono-

Submissions (Jaksu)

2025-11-09 09:51:05 302025-11-09 09:50:53 2025-11-09 02:25:35 02025-11-09 02:24:52 02025-11-09 02:22:59 02025-11-09 02:19:33 302025-11-09 02:19:19 2025-11-09 02:07:57 02025-11-09 02:07:44 2025-11-09 02:06:41 2025-11-09 01:48:30 302025-11-09 01:48:21 2025-11-09 00:44:26 2025-11-09 00:40:09 2025-11-09 00:23:22 302025-11-09 00:23:10 2025-11-09 00:04:46 302025-11-09 00:04:35 2025-11-09 00:03:34 2025-11-08 23:11:04 02025-11-08 22:59:10 02025-11-08 22:58:54 2025-11-08 22:50:19 02025-11-08 21:59:23 452025-11-08 21:58:15 02025-11-08 21:57:35 2025-11-08 21:57:17 2025-11-08 20:35:08 452025-11-08 18:30:51 452025-11-08 18:13:24 452025-11-08 15:52:21 302025-11-08 15:51:16 102025-11-08 15:50:49 102025-11-08 15:50:33 2025-11-08 15:23:46 302025-11-08 15:23:24 2025-11-08 14:23:21 02025-11-08 13:43:57 02025-11-08 13:43:20 02025-11-06 16:59:21 02025-11-06 16:59:02 2025-11-06 13:42:11 02025-11-06 13:40:02 02025-11-06 13:24:17 02025-11-05 23:12:16 02025-11-05 21:15:06 302025-11-05 21:00:21 02025-11-05 20:53:32 102025-11-05 18:11:37 02025-11-05 17:47:22 102025-11-05 13:59:39 02025-11-05 09:23:27 302025-11-04 17:33:06 102025-11-04 16:50:55 102025-11-04 16:44:10 102025-11-04 15:53:33 02025-11-04 15:52:57 2025-11-04 13:33:10 02025-11-04 13:32:02 02025-11-04 13:02:37 102025-11-04 12:50:16 102025-11-04 00:38:55 102025-11-03 20:16:12 102025-11-03 20:15:18 02025-11-03 20:14:02 02025-11-03 19:07:37 102025-11-03 19:07:07 02025-11-03 19:06:49 2025-11-03 18:24:17 102025-11-03 18:01:54 102025-11-03 17:48:15 02025-11-03 16:57:37 02025-11-03 14:25:28 102025-11-03 14:05:42 102025-11-03 01:57:41 102025-11-02 17:35:47 02025-11-02 17:35:05 02025-11-02 17:20:09 02025-11-02 17:19:07 02025-11-01 21:54:10 102025-11-01 21:53:39 02025-11-01 21:13:32 102025-11-01 20:54:30 102025-11-01 20:24:41 102025-10-31 22:30:34 102025-10-30 14:00:21 0