— 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:OorigamiK
Submission time:2025-10-29 11:14:18 +0200
Language:C++ (C++20)
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
#6--2, 5details
#7--2, 5details
#8--2, 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
#24--5details
#25--5details
#26--5details
#27--5details

Code

#include <iostream>
#include <vector>
#include <string>
#include <stack>
#include <unordered_map>

using namespace std;

int hash2(int x, int y){
    return ((x<<16) | y);
}

int minDist(vector<vector<bool>> grid, int n, int m, int x1, int y1, int x2, int y2){
    int count=0;
    unordered_map<int, bool> gridVisit;
    gridVisit[hash2(x1,y1)]=true;
    stack<int> currentGridPoints;
    stack<int> nextGridPoints;
    vector<vector<vector<bool>>> gridStatus(n, vector<vector<bool>>(m, vector<bool>(2, false)));
    currentGridPoints.push(hash2(x1,y1));
    while(gridVisit.find(hash2(x2,y2)) ==gridVisit.end()){
        if (currentGridPoints.empty()){
            return -1;
        }
        while (!currentGridPoints.empty()){
            int hashed = currentGridPoints.top();
            int y = hashed&(0b1111111111111111);
            int x = hashed>>16;
            if (!gridStatus[y][x][0]){
                for (int i=0;i<x;i++){
                    if (grid[y][i]){
                        gridStatus[y][i][0]=true;
                        if (gridVisit.find(hash2(i, y))==gridVisit.end()){
                            gridVisit[hash2(i,y)]=true;
                            nextGridPoints.push(hash2(i,y));
                        }
                    }
                }
                for (int i=x+1;i<m;i++){
                    if (grid[y][i]){
                        gridStatus[y][i][0]=true;
                        if (gridVisit.find(hash2(i, y))==gridVisit.end()){
                            gridVisit[hash2(i,y)]=true;
                            nextGridPoints.push(hash2(i,y));
                        }
                    }
                }
            }
            if (!gridStatus[y][x][1]){
                for (int i=0;i<y;i++){
                    if (grid[i][x]){
                        gridStatus[i][x][1]=true;
                        if (gridVisit.find(hash2(x, i))==gridVisit.end()){
                            gridVisit[hash2(x, i)]=true;
                            nextGridPoints.push(hash2(x,i));
                        }
                    }
                }
                for (int i=y+1;i<n;i++){
                    if (grid[i][x]){
                        gridStatus[i][x][1]=true;
                        if (gridVisit.find(hash2(x, i))==gridVisit.end()){
                            gridVisit[hash2(x, i)]=true;
                            nextGridPoints.push(hash2(x,i));
                        }
                    }
                }
            }
            currentGridPoints.pop();
        }
        currentGridPoints=nextGridPoints;
        nextGridPoints={};
        count++;
    }
    return count;
}

int main(){
    int n,m,q;
    cin>>n>>m>>q;

    vector<vector<bool>> grid(n, vector<bool>(m,0));

    for (int i=0;i<n;i++){
        string s;
        cin>>s;
        for (int j=0;j<m;j++){
            grid[i][j]=(s[j]=='.');
        }
    }
    std::vector<int> input(4*q, 0);
    for (int i=0;i<q;i++){
        int x1,x2,y1,y2;
        cin>>y1>>x1>>y2>>x2;
        input[4*i+0]=x1;
        input[4*i+1]=y1;
        input[4*i+2]=x2;
        input[4*i+3]=y2;
    }    
    for (int i=0;i<q;i++){
        cout<<minDist(grid, n, m, input[4*i+0]-1, input[4*i+1]-1, input[4*i+2]-1, input[4*i+3]-1)<<"\n";
    }
}

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:

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

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

user output
(empty)

Test 7

Group: 2, 5

Verdict:

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

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

user output
(empty)

Test 8

Group: 2, 5

Verdict:

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

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

user output
(empty)

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:

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

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

user output
(empty)

Test 25

Group: 5

Verdict:

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

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

user output
(empty)

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:

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

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

user output
(empty)

Tasks

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

Submissions (OorigamiK)

2025-11-01 02:43:14 1002025-11-01 02:42:41 02025-11-01 02:41:51 02025-11-01 02:28:25 02025-11-01 02:26:49 602025-11-01 02:25:06 602025-11-01 02:23:17 02025-11-01 02:22:42 02025-11-01 02:14:44 602025-11-01 02:12:29 602025-11-01 02:11:24 602025-11-01 02:10:17 602025-11-01 02:01:50 602025-11-01 01:53:41 02025-11-01 01:45:37 602025-11-01 01:41:25 602025-11-01 01:40:12 602025-11-01 01:39:39 2025-11-01 01:37:55 602025-11-01 01:37:34 602025-11-01 01:37:14 02025-11-01 01:36:02 02025-11-01 01:28:44 02025-11-01 01:27:24 02025-11-01 01:00:01 602025-11-01 00:58:00 602025-11-01 00:34:02 02025-10-31 23:28:26 452025-10-31 23:18:48 02025-10-31 23:12:56 02025-10-31 22:57:40 302025-10-31 20:48:26 302025-10-31 20:45:12 02025-10-31 20:43:26 02025-10-31 20:28:47 02025-10-31 20:19:10 02025-10-31 20:08:26 02025-10-31 20:06:19 02025-10-29 11:14:18 102025-10-29 09:25:44 102025-10-29 09:19:21 102025-10-28 20:56:57 10