CSES - Datatähti 2026 alku

Submission details
Task:	Hypyt
Sender:	xheater
Submission time:	2025-11-08 11:57:25 +0200
Language:	C++ (C++20)
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	ACCEPTED	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	ACCEPTED	0.00 s	1, 2, 3, 4, 5	details
#5	ACCEPTED	0.00 s	1, 2, 3, 4, 5	details
#6	TIME LIMIT EXCEEDED	--	2, 5	details
#7	TIME LIMIT EXCEEDED	--	2, 5	details
#8	WRONG ANSWER	0.83 s	2, 5	details
#9	WRONG ANSWER	0.23 s	3, 4, 5	details
#10	WRONG ANSWER	0.21 s	3, 4, 5	details
#11	WRONG ANSWER	0.21 s	3, 4, 5	details
#12	WRONG ANSWER	0.32 s	4, 5	details
#13	WRONG ANSWER	0.26 s	4, 5	details
#14	WRONG ANSWER	0.22 s	4, 5	details
#15	TIME LIMIT EXCEEDED	--	5	details
#16	TIME LIMIT EXCEEDED	--	5	details
#17	TIME LIMIT EXCEEDED	--	5	details
#18	WRONG ANSWER	0.44 s	5	details
#19	ACCEPTED	0.24 s	5	details
#20	WRONG ANSWER	0.26 s	5	details
#21	ACCEPTED	0.21 s	5	details
#22	RUNTIME ERROR	0.00 s	1, 2, 3, 4, 5	details
#23	ACCEPTED	0.00 s	1, 2, 3, 4, 5	details
#24	RUNTIME ERROR	0.00 s	5	details
#25	ACCEPTED	0.31 s	5	details
#26	TIME LIMIT EXCEEDED	--	5	details
#27	ACCEPTED	0.21 s	5	details

Code

#include <bits/stdc++.h>
#include <iostream>
#include <string>
#include <array>
#include <vector>
#include <queue>
#include <unordered_map>

using namespace std;

struct item{
    pair<int, int> pos;
    int dist;
    int start_X;
};
struct pack{
    int dist;
    int startX;
    vector<int> endX;
};
vector<pack> evil_BFS(int start_row, const vector<int> rows[], bool visited[],
    int m, const vector<int> columns[], int n){
    //memset(visited, false, n*m);
    queue<item> nodes;
    vector<int> start = rows[start_row];
    vector<pack> distances(n, {-1, -1, {}});
    for(int& pos : start){
        nodes.push({{pos, start_row}, 0, pos});
        visited[start_row * m + pos] = true;
        //cout << "start "<< pos << " "<<start_row << char(10);
    }
    while (!nodes.empty()){
        item next = nodes.front();
        nodes.pop();
        int X = next.pos.first;
        int Y = next.pos.second;

        //cout << "next " << X << " " << Y << " " << next.dist <<char(10);

        if(distances[Y].dist == -1){
            distances[Y].dist = next.dist;
            distances[Y].startX = next.start_X;
            distances[Y].endX.emplace_back(X); 
        }else if(distances[Y].dist == next.dist){
            distances[Y].endX.emplace_back(X);
        }

        for(int a : rows[Y]){
            //cout << "row "<<a << Y<<char(10);
            if(!visited[Y * m + a]){
                visited[Y * m + a] = true;
                nodes.push({{a, Y}, next.dist + 1, next.start_X});
            }
        }
        for(int a : columns[X]){
            if(!visited[a * m + X]){
                visited[a * m + X] = true;
                nodes.push({{X, a}, next.dist + 1, next.start_X});
            }
        }
    }
    /*for(int i = 0; i < n; i++){
        if(distances[i] == 0 && i != start_row){
            //distances[i] = -1;
        }
    }*/
    return distances;
}

int main(){
    // n height, m width
    int n, m, q;
    cin >> n >> m >> q;
    char grid[m][n];
    //bool visited[n*m] = {0};
    int ans[q] = {};

    vector<int> rows[n] = {};
    vector<int> columns[m] = {};

    vector<vector<pack>> dist(n);

    for (int i = 0; i < n ; i++){
        string line;
        cin >> line;
        for(int j = 0; j < m ; j++){
            grid[i][j] = line[j];
            if(grid[i][j] == '.'){
                rows[i].emplace_back(j);
                columns[j].emplace_back(i);
            }
        }
    }
    for(int i = 0; i < n; i++){
        bool visited[m*n] = {0};
        dist[i] = evil_BFS(i, rows, visited, m, columns, n);
    }
    for(int i = 0; i < q; i++){
        int y1, x1, y2, x2;
        cin >> y1 >> x1 >> y2 >> x2;

        y1 --;
        x1 --;
        y2 --;
        x2 --;

        if(!(y1==y2 && x1 == x2)){
            pack current = dist[y1][y2];
            if(current.dist == -1){
                ans[i] = -1;
            }else{
                int minimum = 100000;
                for(int a : current.endX){
                    //cout << a << char(10);
                    if(current.startX == x1 && a == x2 && current.dist != 0){
                        //cout << "case 1" << char(10);
                        minimum = min(current.dist, minimum);
                    }else if(current.startX == a && current.dist == 0){
                        //cout << "case 2" << char(10);
                        minimum = min(1, minimum);
                    }
                    else if(current.startX == x1 && a != x2){
                        //cout << "case 3" << char(10);
                        minimum = min(current.dist + 1, minimum);
                    }else if(current.startX != x1 && a == x2){
                        //cout << "case 4" << char(10);
                        minimum = min(current.dist + 1, minimum);
                    }else{
                        //cout << "case 5" << char(10);
                        minimum = min(current.dist + 2, minimum);
                    }
                }
                pack current = dist[y2][y1];
                for(int a : current.endX){
                    //cout << a << char(10);
                    if(current.startX == x2 && a == x1 && current.dist != 0){
                        //cout << "case 1" << char(10);
                        minimum = min(current.dist, minimum);
                    }else if(current.startX == a && current.dist == 0){
                        //cout << "case 2" << char(10);
                        minimum = min(1, minimum);
                    }
                    else if(current.startX == x2 && a != x1){
                        //cout << "case 3" << char(10);
                        minimum = min(current.dist + 1, minimum);
                    }else if(current.startX != x2 && a == x1){
                        //cout << "case 4" << char(10);
                        minimum = min(current.dist + 1, minimum);
                    }else{
                        //cout << "case 5" << char(10);
                        minimum = min(current.dist + 2, minimum);
                    }
                }
                ans[i] = minimum;
            }
        }else{
            ans[i] = 0;
        }
    }
    for(int i = 0; i < q; i++){
        cout << ans[i] << char(10);
    }
    return 0;
}

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: WRONG ANSWER

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

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

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

Feedback: Incorrect character on line 1 col 1: expected "1", got "2"

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

Feedback: Incorrect character on line 6 col 1: expected "2", got "1"

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: TIME LIMIT EXCEEDED

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

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

user output
(empty)

Test 7

Group: 2, 5

Verdict: TIME LIMIT EXCEEDED

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

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

user output
(empty)

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 3 3 3 3 ...` view save

Feedback: Incorrect character on line 248 col 1: expected "1", got "2"

Test 9

Group: 3, 4, 5

Verdict: WRONG ANSWER

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

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

user output
`2 2 2 2 2 ...` view save

Feedback: Incorrect character on line 18 col 1: expected "2", got "1"

Test 10

Group: 3, 4, 5

Verdict: WRONG ANSWER

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

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

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

Feedback: Incorrect character on line 6 col 1: expected "2", got "1"

Test 11

Group: 3, 4, 5

Verdict: WRONG ANSWER

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

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

user output
`3 3 3 3 3 ...` view save

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

Test 12

Group: 4, 5

Verdict: WRONG ANSWER

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

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

user output
`2 2 2 2 2 ...` view save

Feedback: Incorrect character on line 10 col 1: expected "2", got "1"

Test 13

Group: 4, 5

Verdict: WRONG ANSWER

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

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

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

Feedback: Incorrect character on line 27 col 1: expected "2", got "1"

Test 14

Group: 4, 5

Verdict: WRONG ANSWER

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

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

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

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

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: WRONG ANSWER

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

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

user output
`3 3 3 3 3 ...` view save

Feedback: Incorrect character on line 35 col 1: expected "2", got "1"

Test 19

Group: 5

Verdict: ACCEPTED

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

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

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

Test 20

Group: 5

Verdict: WRONG ANSWER

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

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

user output
`57 155 38 66 98 ...` view save

Feedback: Incorrect character on line 4 col 2: expected "65", got "66"

Test 21

Group: 5

Verdict: ACCEPTED

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

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

user output
`498 498 498 498 498 ...` view save

Test 22

Group: 1, 2, 3, 4, 5

Verdict: RUNTIME ERROR

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

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

user output
(empty)

Error:

terminate called after throwing an instance of 'std::bad_alloc'
  what():  std::bad_alloc

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: RUNTIME ERROR

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

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

user output
(empty)

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

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 (xheater)