— 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:Sukarth
Submission time:2025-11-04 21:29:25 +0200
Language:C++ (C++20)
Status:READY
Result:100
Feedback
groupverdictscore
#1ACCEPTED10
#2ACCEPTED20
#3ACCEPTED15
#4ACCEPTED15
#5ACCEPTED40
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
#6ACCEPTED0.06 s2, 5details
#7ACCEPTED0.04 s2, 5details
#8ACCEPTED0.03 s2, 5details
#9ACCEPTED0.07 s3, 4, 5details
#10ACCEPTED0.07 s3, 4, 5details
#11ACCEPTED0.07 s3, 4, 5details
#12ACCEPTED0.08 s4, 5details
#13ACCEPTED0.08 s4, 5details
#14ACCEPTED0.07 s4, 5details
#15ACCEPTED0.14 s5details
#16ACCEPTED0.13 s5details
#17ACCEPTED0.11 s5details
#18ACCEPTED0.10 s5details
#19ACCEPTED0.10 s5details
#20ACCEPTED0.09 s5details
#21ACCEPTED0.08 s5details
#22ACCEPTED0.00 s1, 2, 3, 4, 5details
#23ACCEPTED0.00 s1, 2, 3, 4, 5details
#24ACCEPTED0.07 s5details
#25ACCEPTED0.07 s5details
#26ACCEPTED0.15 s5details
#27ACCEPTED0.08 s5details

Code

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;

int main() {
    ios::sync_with_stdio(0);
    cin.tie(0);
    
    ll n, m, q;
    
    cin >> n >> m >> q;
    vector<vector<char>> grid(n+1, vector<char>(m+1, 'O'));
    

    for (ll i = 1; i <= n; i++) {
        for (ll j = 1; j <= m; j++) {
            cin >> grid[i][j];
        }
    }
    
    vector<vector<ll>> adj(n + m + 1);

    for (ll i = 1; i <= n; i++) {
        for (ll j = 1; j <= m; j++) {
            if (grid[i][j] == '.') {
                adj[i].push_back(n + j);
                adj[n + j].push_back(i);
            }
        }
    }
    
    vector<vector<ll>> dist_row(n + 1, vector<ll>(n + m + 1, -1));
    vector<vector<ll>> dist_col(m + 1, vector<ll>(n + m + 1, -1));
    
    for (ll i = 1; i <= n; i++) {
        queue<ll> q;
        vector<ll>& currdists = dist_row[i];
        q.push(i);
        currdists[i]=0;
        
        while (!q.empty()) {
            ll node = q.front();
            q.pop();
            
            for (auto neighbor : adj[node]) {
                if (currdists[neighbor] == -1) {
                    currdists[neighbor] = currdists[node]+1;
                    q.push(neighbor);
                }
            }
        }
        
    }
    
    for (ll i = 1; i <= m; i++) {
        queue<ll> q;
        vector<ll>& currdists = dist_col[i];
        q.push(n+i);
        currdists[n+i]=0;
        
        while (!q.empty()) {
            ll node = q.front();
            q.pop();
            
            for (auto neighbor : adj[node]) {
                if (currdists[neighbor] == -1) {
                    currdists[neighbor] = currdists[node]+1;
                    q.push(neighbor);
                }
            }
        }
        
    }
        
    for (ll i = 0; i < q; i++) {
        ll r1, c1, r2, c2;
        cin >> r1 >> c1 >> r2 >> c2;
        
        if (r1 == r2 && c1 == c2) {
            cout << 0 << "\n";
            continue;
        }
        
        ll p1 = dist_row[r1][r2];
        ll p2 = dist_row[r1][n + c2];
        
        ll p3 = dist_col[c1][r2];
        ll p4 = dist_col[c1][n + c2];
        
        
        
        ll min_dist = -1;
        
        if (p1 != -1) {
            if (min_dist == -1 || p1 < min_dist) {
                min_dist = p1;
            }
        }
        
        if (p2 != -1) {
            if (min_dist == -1 || p2 < min_dist) {
                min_dist = p2;
            }
        }
        
        if (p3 != -1) {
            if (min_dist == -1 || p3 < min_dist) {
                min_dist = p3;
            }
        }
        
        if (p4 != -1) {
            if (min_dist == -1 || p4 < min_dist) {
                min_dist = p4;
            }
        }
        
        if (min_dist == -1) {
            cout << -1 << "\n";
        } else {
            cout << min_dist + 1 << "\n";
        }
        
        
    }

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

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

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

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

Test 16

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 17

Group: 5

Verdict: ACCEPTED

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

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

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

Test 18

Group: 5

Verdict: ACCEPTED

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

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

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

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

Tasks

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

Submissions (Sukarth)

2025-11-04 21:29:25 1002025-11-04 20:13:09 45