CSES - Datatähti 2026 alku

Submission details
Task:	Hypyt
Sender:	nikke5
Submission time:	2025-11-09 11:25:56 +0200
Language:	C++ (C++11)
Status:	READY
Result:	30

Feedback
group	verdict	score
#1	ACCEPTED	10
#2	ACCEPTED	20
#3	TIME LIMIT EXCEEDED	0
#4	TIME LIMIT EXCEEDED	0
#5	TIME LIMIT EXCEEDED	0

Test results
test	verdict	time	group
#1	ACCEPTED	0.00 s	1, 2, 3, 4, 5	details
#2	ACCEPTED	0.00 s	1, 2, 3, 4, 5	details
#3	ACCEPTED	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	ACCEPTED	0.30 s	2, 5	details
#7	ACCEPTED	0.21 s	2, 5	details
#8	ACCEPTED	0.10 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	ACCEPTED	0.00 s	1, 2, 3, 4, 5	details
#23	ACCEPTED	0.00 s	1, 2, 3, 4, 5	details
#24	ACCEPTED	0.46 s	5	details
#25	ACCEPTED	0.52 s	5	details
#26	TIME LIMIT EXCEEDED	--	5	details
#27	ACCEPTED	0.08 s	5	details

Compiler report

input/code.cpp: In lambda function:
input/code.cpp:123:35: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  123 |                 for (int i = 0; i < rowPoints[v[a].row].size(); i++)
      |                                 ~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
input/code.cpp:143:35: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  143 |                 for (int i = 0; i < columnPoints[v[a].column].size(); i++)
      |                                 ~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Code

#include <iostream>
#include <cmath>
#include <vector>
#include <algorithm>
#include <string>
#include <sstream>
#include <chrono>
#include <iomanip>
#include <queue>

typedef long long ll;
using namespace std;

int grid[250][250];

struct route
{
    int x1 = -1;
    int y1 = -1;
    int x2 = -1;
    int y2 = -1;
};

struct piste
{
    bool unSafe = false;
    int row;
    int column;
};

piste v[62500];

vector<int> rowPoints[250];
vector<int> columnPoints[250];

int main()
{

    ios_base::sync_with_stdio(0);
    cin.tie(0);

    int height, width, operationAmount;

    cin >> height >> width >> operationAmount;

    // setupataan algoritmiin tarvittava tietorakenne:
    // joka turvakohta merkkaa oman x ja y koordinaattinsa

    int count = 0;

    for (int y = 0; y < height; y++)
    {
        for (int x = 0; x < width; x++)
        {
            char c;
            cin >> c;
            if (c == '.')
            {
                rowPoints[y].push_back(count);
                columnPoints[x].push_back(count);

                v[count].column = x;
                v[count].row = y;
            }
            if (c == '*')
            {
                v[count].unSafe = true;
            }
            count++;
        }
    }

    /*     cout << "\n \n";
        count = 0;
        for (int y = 0; y < height; y++)
        {
            for (int x = 0; x < width; x++)
            {
                cout << v[count].row << v[count].column << " ";
                count++;
            }
            cout << "\n";
        } */

    // Tehdään algoritmista funktio:



    auto algorithm = [&](int startR, int startC, int endR, int endC)
    {
        if (startR == endR && startC == endC)
        {
            return 0;
        }

        int ruutuCount = height * width;
        vector<int> distances(ruutuCount, -1);

        vector<bool> visitedRows(height, false);
        vector<bool> visitedColumns(width, false);

        queue<int> q;
        int start = startR * width + startC;
        int target = endR * width + endC;

        distances[start] = 0;
        q.push(start);
        //cout << "START: " << start << " " << startR << " " << startC << "\n";

        while (!q.empty())
        {
            int a = q.front();
            //cout << "A: " << a << " " << "\n";
            q.pop();

            if (!visitedRows[v[a].row])
            {

                //cout << "ROW: " << a << " " << v[a].row << "\n";

                visitedRows[v[a].row] = true;

                for (int i = 0; i < rowPoints[v[a].row].size(); i++)
                {
                    int kohta = rowPoints[v[a].row][i];
                    //cout << "KOHTA: " << kohta << "\n";

                    if (distances[kohta] == -1)
                    {
                        distances[kohta] = distances[a] + 1;
                        q.push(kohta);
                    }
                }
            }

            if (!visitedColumns[v[a].column])
            {

                //cout << "COLUMN: " << a << " " << v[a].column << "\n";

                visitedColumns[v[a].column] = true;

                for (int i = 0; i < columnPoints[v[a].column].size(); i++)
                {
                    int kohta = columnPoints[v[a].column][i];

                    if (distances[kohta] == -1)
                    {
                        distances[kohta] = distances[a] + 1;
                        q.push(kohta);
                    }
                }
            }
        }

/*         cout << "\n \n";
        count = 0;
        for (int y = 0; y < height; y++)
        {
            for (int x = 0; x < width; x++)
            {
                if (distances[count] == -1)
                    cout << "X";
                else
                    cout << distances[count];
                count++;
            }
            cout << "\n";
        } */

        if (distances[target] == -1)
        {
            return -1;
        }
        else
        {
            return distances[target];
        }
    };

    // vector<int> distances[62500];
    // int n = height * width;

    /*  for (int c = 0; c < n; c++)
     { // tehdään algoritmi joka solmulle

         if (v[c].unSafe)
         {
             continue;
         }

         vector<bool> visitedRows(250, false);
         vector<bool> visitedColumns(250, false);

         for (int i = 1; i <= n; i++)
             distances[c].push_back(1e9);

         distances[c][c] = 0;

         queue<int> q;
         q.push(c);
         while (!q.empty())
         {
             int a = q.front();
             q.pop();

             if (!visitedRows[v[a].row])
             {

                 // cout << "ROW: " << c << " " << v[a].row << "\n";

                 visitedRows[v[a].row] = true;

                 for (int i = 0; i < rowPoints[v[a].row].size(); i++)
                 {
                     int kohta = rowPoints[v[a].row][i];

                     if (kohta == a)
                         continue;

                     if (distances[c][kohta] > distances[c][a] + 1)
                     {
                         distances[c][kohta] = distances[c][a] + 1;
                         q.push(kohta);
                     }
                 }
             }

             if (!visitedColumns[v[a].column])
             {

                 // cout << "COLUMN: " << c << " " << v[a].column << "\n";

                 visitedColumns[v[a].column] = true;

                 for (int i = 0; i < columnPoints[v[a].column].size(); i++)
                 {
                     int kohta = columnPoints[v[a].column][i];

                     if (kohta == a)
                         continue;

                     if (distances[c][kohta] > distances[c][a] + 1)
                     {
                         distances[c][kohta] = distances[c][a] + 1;
                         q.push(kohta);
                     }
                 }
             }
         }
     } */

    for (int i = 0; i < operationAmount; i++)
    {

        int y1, x1, y2, x2;

        cin >> y1 >> x1 >> y2 >> x2;

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

        cout << algorithm(y1, x1, y2, x2) << "\n";
    }

    /*     for (int i = 0; i < operationAmount; i++)
        {
            int alkukohta = reitit[i].x1 + reitit[i].y1 * width;
            int loppukohta = reitit[i].x2 + reitit[i].y2 * width;
            int askelCount = distances[alkukohta][loppukohta];
            if (askelCount == INFINITY)
                cout << "-1" << "\n";
            else
                cout << askelCount << "\n";
        } */

    cout << "\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: 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: ACCEPTED

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

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

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

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: 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: 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 (nikke5)