— 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:Lytsky
Submission time:2025-11-05 11:12:31 +0200
Language:C++ (C++11)
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
#60.61 s2, 5details
#70.62 s2, 5details
#80.62 s2, 5details
#9ACCEPTED0.50 s3, 4, 5details
#10ACCEPTED0.48 s3, 4, 5details
#110.47 s3, 4, 5details
#12ACCEPTED0.70 s4, 5details
#13ACCEPTED0.60 s4, 5details
#14ACCEPTED0.54 s4, 5details
#150.62 s5details
#160.61 s5details
#170.61 s5details
#180.62 s5details
#190.61 s5details
#200.61 s5details
#210.61 s5details
#22ACCEPTED0.00 s1, 2, 3, 4, 5details
#23ACCEPTED0.00 s1, 2, 3, 4, 5details
#24ACCEPTED0.54 s5details
#25ACCEPTED0.45 s5details
#260.62 s5details
#270.61 s5details

Code

#include <bits/stdc++.h>

using namespace std;

bool contains(unordered_set<int> v, int num) {
    for (auto i : v) {
        if (i == num) {
            return true;
        }
    }
    return false;
}

int main() {
    int n, m, q, ekay, ekax, tokay, tokax;
    string row;
    cin >> n >> m >> q;
    vector<string> grid;
    vector<int> nodesInColumns[m];
    vector<vector<pair<int, pair<unordered_set<int>, unordered_set<int>>>>> row_kaaret(n);
    vector<vector<vector<unordered_set<int>>>> paths(n);
    vector<vector<int>> d(n);
    vector<vector<pair<int, vector<int>>>> back(n);
    for (int index = 0; index < n; index++) { 
        vector<pair<int,vector<int>>> v(n);
        back[index] = v;
        for (int i = 0; i < n; i++) { 
            vector<int> t(m,0);
            pair<int,vector<int>> p = {0,t};
            back[index][i] = p;
        }
    }
    for (int index = 0; index < n; index++) {
        vector<pair<int,pair<unordered_set<int>,unordered_set<int>>>> v(n, {0, {}});
        row_kaaret[index] = v;
        vector<int> j(n);
        d[index] = j;
        vector<vector<unordered_set<int>>> s;
        for (int i = 0; i < n; i++) {
            vector<unordered_set<int>> M(m);
            s.push_back(M);
        }
        paths[index] = s;
    }

    for (int index = 0; index < n; index++) {
        cin >> row;
        grid.push_back(row);
        for (int col = 0; col < m; col++) {
            if (grid[index][col] == '.') {
                nodesInColumns[col].push_back(index);
            }
        }
    }
    for (int index = 0; index < m; index++) {
        for (auto node : nodesInColumns[index]) {
            for (auto node2 : nodesInColumns[index]) {
                if (node < node2) {
                    row_kaaret[node][node2].first = 1;
                    row_kaaret[node][node2].second.first.insert(index);
                    row_kaaret[node][node2].second.second.insert(index);
                    paths[node][node2][index].insert(index);
                    back[node][node2].first = 1;
                    back[node][node2].second[index] = 1;
                }
            }
        }
    }
    //floyd
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < n; j++) {
            if (i == j) d[i][j] = 0;
            else if (i < j && row_kaaret[i][j].first != 0) {
                d[i][j] = row_kaaret[i][j].first;
            }
            else d[i][j] = 1e9;
        }
    }
    vector<unordered_set<int>> clearing(m);
    for (int k = 0; k < n; k++) {
        for (int i = 0; i < n; i++) {
            for (int j = 0; j < n; j++) {
                if (i < j && d[i][j] > d[min(i,k)][max(i,k)] + d[min(k,j)][max(k,j)]) {
                    d[i][j] = d[min(i,k)][max(i,k)] + d[min(k,j)][max(k,j)];
                    if (i < k) row_kaaret[i][j].second.first = row_kaaret[i][k].second.first;
                    else row_kaaret[i][j].second.first = row_kaaret[k][j].second.second;
                    if (k < j) row_kaaret[i][j].second.second = row_kaaret[k][j].second.second;
                    else row_kaaret[i][j].second.second = row_kaaret[j][k].second.first;
                    paths[i][j] = clearing;
                    back[i][j].first += 1;
                    if (k < j && i < k) {
                        for (auto x : row_kaaret[i][k].second.first) {
                            paths[i][j][x].insert(row_kaaret[k][j].second.second.begin(), row_kaaret[k][j].second.second.end());
                        }
                        for (auto x : row_kaaret[k][j].second.second) { 
                            back[i][j].second[x] = back[i][j].first;
                        }
                    } else if (k > j && i < k) {
                        for (auto x : row_kaaret[i][k].second.first) {
                            paths[i][j][x].insert(row_kaaret[j][k].second.first.begin(), row_kaaret[j][k].second.first.end());
                        }
                        for (auto x : row_kaaret[j][k].second.first) { 
                            back[i][j].second[x] = back[i][j].first;
                        }
                    } else if (k < j && i > k) {
                        for (auto x : row_kaaret[k][j].second.second) {
                            paths[i][j][x].insert(row_kaaret[k][j].second.second.begin(), row_kaaret[k][j].second.second.end());
                        }
                        for (auto x : row_kaaret[k][j].second.second) { 
                            (back[i][j].second)[x] = back[i][j].first;
                        }
                    }
                } else if (i < j && d[i][j] == d[min(i,k)][max(i,k)] + d[min(k,j)][max(k,j)]) {
                    if (i < k) {
                        row_kaaret[i][j].second.first.insert(row_kaaret[i][k].second.first.begin(), row_kaaret[i][k].second.first.end());
                    } else {
                        row_kaaret[i][j].second.first.insert(row_kaaret[k][i].second.second.begin(), row_kaaret[k][i].second.second.end());
                    }
                    if (k < j) {
                        row_kaaret[i][j].second.second.insert(row_kaaret[k][j].second.second.begin(), row_kaaret[k][j].second.second.end());
                    } else {
                        row_kaaret[i][j].second.second.insert(row_kaaret[j][k].second.first.begin(), row_kaaret[j][k].second.first.end());
                    }
                    if (i < k && k < j) {
                        for (auto x : row_kaaret[i][k].second.first) {
                            paths[i][j][x].insert(row_kaaret[k][j].second.second.begin(),row_kaaret[k][j].second.second.end());
                        }
                        for (auto x : row_kaaret[k][j].second.second) {
                            back[i][j].second[x] = back[i][j].first;
                        }
                    }
                    if (i > k && k < j) {
                        for (auto x : row_kaaret[k][i].second.second) {
                            paths[i][j][x].insert(row_kaaret[k][j].second.second.begin(),row_kaaret[k][j].second.second.end());
                        }
                        for (auto x : row_kaaret[k][j].second.second) { 
                            back[i][j].second[x] = back[i][j].first;
                        }
                    }
                    if (i < k && k > j) {
                        for (auto x : row_kaaret[i][k].second.first) {
                            paths[i][j][x].insert(row_kaaret[j][k].second.first.begin(),row_kaaret[j][k].second.first.end());
                        }
                        for (auto x : row_kaaret[j][k].second.first) { 
                            back[i][j].second[x] = back[i][j].first;
                        }
                    }
                }
            }
        }
    }
    //kyselyt
    for (int index = 0; index < q; index++) {
        cin >> ekay >> ekax >> tokay >> tokax;
        int y1 = tokay;
        int y2 = ekay;
        int x1 = tokax;
        int x2 = ekax;
        if (ekay < tokay) {
            y1 = ekay;
            y2 = tokay;
            x1 = ekax;
            x2 = tokax;
        }

        if (y1 == y2 && x1 == x2) cout << 0 << endl;
        else if (y1 == y2 || x1 == x2) cout << 1 << endl;
        else {
            int dist = d[y1-1][y2-1];
            if (dist >= 1e9) cout << -1 << endl;
            else {
                int a = 2;
                if (!paths[y1-1][y2-1][x1-1].empty()) {
                    if (contains(paths[y1-1][y2-1][x1-1], x2-1)) {
                        a--;
                    }
                    a--;
                    /*} else if (!paths[y2-1][y1-1][x2-1].empty()) {
                      if (contains(paths[y2-1][y1-1][x2-1], x1-1)) a--;
                      a--;*/
            } else if (back[y1-1][y2-1].first != 0 && back[y1-1][y2-1].second[x2-1] == back[y1-1][y2-1].first) {
                a--;
            }
            cout << dist + dist-1 + a << endl;
            }
        }
    }
}

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

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 5534 col 1: expected "3", got "4"

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:

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:

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

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