CSES - Datatähti 2026 alku

Submission details
Task:	Hypyt
Sender:	Karjalanp11rakka
Submission time:	2025-11-03 13:12:48 +0200
Language:	C++ (C++20)
Status:	READY
Result:	60

Feedback
group	verdict	score
#1	ACCEPTED	10
#2	ACCEPTED	20
#3	ACCEPTED	15
#4	ACCEPTED	15
#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.40 s	2, 5	details
#7	ACCEPTED	0.19 s	2, 5	details
#8	ACCEPTED	0.11 s	2, 5	details
#9	ACCEPTED	0.14 s	3, 4, 5	details
#10	ACCEPTED	0.14 s	3, 4, 5	details
#11	ACCEPTED	0.14 s	3, 4, 5	details
#12	ACCEPTED	0.69 s	4, 5	details
#13	ACCEPTED	0.59 s	4, 5	details
#14	ACCEPTED	0.31 s	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	ACCEPTED	0.25 s	5	details
#20	ACCEPTED	0.35 s	5	details
#21	ACCEPTED	0.14 s	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.07 s	5	details
#25	ACCEPTED	0.07 s	5	details
#26	ACCEPTED	0.68 s	5	details
#27	ACCEPTED	0.08 s	5	details

Code

#include <bits/stdc++.h>
using namespace std;
vector<vector<int>> g;
vector<unordered_set<size_t>> r;
vector<unordered_set<size_t>> c;
void dfs(size_t i, size_t j, int gi)
{
  if(g[i][j]) return;
  g[i][j] = gi;
  for(auto l : r[i]) dfs(i, l, gi);
  for(auto l : c[j]) dfs(l, j, gi);
}
int main()
{
  cin.tie(nullptr);
  ios_base::sync_with_stdio(false);
  size_t n, m, q;
  cin >> n >> m >> q;
  g = vector<vector<int>>(n, vector<int>(m));
  r = vector<unordered_set<size_t>>(n);
  c = vector<unordered_set<size_t>>(m);
  for(size_t i {}; i < n; ++i)
  {
    r[i].reserve(250);
    for(size_t j {}; j < m; ++j)
    {
      c[j].reserve(250);
      char t;
      cin >> t;
      if(t == '.')
      {
        r[i].insert(j);
        c[j].insert(i);
      }
      else g[i][j] = -1;
    }
  }
  int gi = 1;
  for(size_t i {}; i < n; ++i)
    for(size_t j {}; j < m; ++j)
      dfs(i, j, gi++);
  vector<tuple<size_t, size_t, size_t, size_t, size_t>> ql;
  unordered_map<size_t, unordered_map<size_t, int>> fr;
  vector<int> s(q, 0);
  for(size_t i {}; i < q; ++i)
  {
    size_t y1, x1, y2, x2;
    cin >> y1 >> x1 >> y2 >> x2;
    --y1;
    --x1;
    --y2;
    --x2;
    if(y1 == y2 && x1 == x2)
      continue;
    else if(y1 == y2 || x1 == x2)
      s[i] = 1;
    else if(g[y1][x1] != g[y2][x2])
      s[i] = -1;
    else if(r[y1].count(x2) || r[y2].count(x1))
      s[i] = 2;
    else
    {
      ql.push_back(make_tuple(y1, x1, y2, x2, i));
      ++fr[y1][x1];
      ++fr[y2][x2];
    }
  }
  vector<vector<unordered_set<size_t>>> e(n, vector<unordered_set<size_t>>(m));
  unordered_map<size_t, unordered_map<size_t, vector<tuple<size_t, size_t, size_t>>>> qs;
  for(auto qv : ql)
  {
    if(fr[get<0>(qv)][get<1>(qv)] > fr[get<2>(qv)][get<3>(qv)]) 
    {
      qs[get<0>(qv)][get<1>(qv)].push_back(make_tuple(get<2>(qv), get<3>(qv), get<4>(qv)));
      e[get<0>(qv)][get<1>(qv)].insert(get<2>(qv) * m + get<3>(qv));
    }
    else 
    {
      qs[get<2>(qv)][get<3>(qv)].push_back(make_tuple(get<0>(qv), get<1>(qv), get<4>(qv)));
      e[get<2>(qv)][get<3>(qv)].insert(get<0>(qv) * m + get<1>(qv));
    }
  }
  for(auto& y1 : qs)
    for(auto& x1 : y1.second)
    {
      size_t f {};
      vector<vector<int>> d(n, vector<int>(m, -1));
      vector<int> vr(n), vc(m);
      d[y1.first][x1.first] = 0;
      queue<tuple<size_t, size_t, int>> w;
      w.push(make_tuple(y1.first, x1.first, 0));
      while(!w.empty())
      {
        if(!vr[get<0>(w.front())])
        {
          for(auto l : r[get<0>(w.front())])
            if(d[get<0>(w.front())][l] == -1)
            {
              d[get<0>(w.front())][l] = get<2>(w.front()) + 1;
              if(e[y1.first][x1.first].count(get<0>(w.front()) * m + l))
              {
                ++f;
                if(f == e[y1.first][x1.first].size()) break;
              }
              w.push(make_tuple(get<0>(w.front()), l, get<2>(w.front()) + 1));
          }
          if(f == e[y1.first][x1.first].size()) break;
        }
        if(!vc[get<1>(w.front())])
        {
          for(auto l : c[get<1>(w.front())])
          if(d[l][get<1>(w.front())] == -1)
          {
            d[l][get<1>(w.front())] = get<2>(w.front()) + 1;
            if(e[y1.first][x1.first].count(l * m + get<1>(w.front())))
            {
              ++f;
              if(f == e[y1.first][x1.first].size()) break;
            }
            w.push(make_tuple(l, get<1>(w.front()), get<2>(w.front()) + 1));
          }
          if(f == e[y1.first][x1.first].size()) break;
        }
        vr[get<0>(w.front())] = 1;
        vc[get<1>(w.front())] = 1;
        w.pop();
      }
      for(auto t : x1.second) s[get<2>(t)] = d[get<0>(t)][get<1>(t)];
    }
  for(int a : s) cout << a << '\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: ACCEPTED

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

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

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

Test 10

Group: 3, 4, 5

Verdict: ACCEPTED

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

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

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

Test 11

Group: 3, 4, 5

Verdict: ACCEPTED

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

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

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

Test 12

Group: 4, 5

Verdict: ACCEPTED

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

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

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

Test 13

Group: 4, 5

Verdict: ACCEPTED

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

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

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

Test 14

Group: 4, 5

Verdict: ACCEPTED

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

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

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

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

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

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

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

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

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

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

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

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