oj.uz

Submission #486470

# Submission time Handle Problem Language Result Execution time Memory
486470 2021-11-11T18:06:39 Z bill_lin Tracks in the Snow (BOI13_tracks) C++14
100 / 100
 763 ms 110960 KB 
#include <bits/stdc++.h>
#define ll long long
#define ld long double
#define pii pair<int, int>
#define pll pair<ll, ll>
using namespace std;

const int INF = 10000000;

int n, m;
bool is_safe(int row, int col) {
    return row >= 0 && row < n && col >= 0 && col < m;
}
 
int32_t main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    
    cin >> n >> m;
    
    vector<vector<char>> grid(n, vector<char>(m));
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < m; j++) {
            cin >> grid[i][j];
        }
    }
    vector<vector<int>> dist(n, vector<int>(m, INF));
    dist[0][0] = 1;
    deque<pii> q;
    q.push_front({0, 0});
    int dx[] = {0, 0, -1, 1}, dy[] = {1, -1, 0, 0};
    while (!q.empty()) {
        int row = q.front().first, col = q.front().second;
        q.pop_front();
        
        for (int i = 0; i < 4; i++) {
            int dest_x = row + dx[i], dest_y = col + dy[i];
            if (is_safe(dest_x, dest_y) && dist[dest_x][dest_y] == INF && grid[dest_x][dest_y] != '.') {
                if (grid[dest_x][dest_y] != grid[row][col]) {
                    dist[dest_x][dest_y] = dist[row][col] + 1;
                    q.push_back({dest_x, dest_y});
                } else {
                    dist[dest_x][dest_y] = dist[row][col];
                    q.push_front({dest_x, dest_y});
                }
            }
        }
    }
    int ans = 1;
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < m; j++) {
            if (dist[i][j] != INF) ans = max(ans, dist[i][j]);
        }
    }
    cout << ans << '\n';
}

Subtask #1
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 1740 KB Output is correct
2 Correct 1 ms 320 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 8 ms 1468 KB Output is correct
5 Correct 3 ms 716 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 312 KB Output is correct
9 Correct 1 ms 316 KB Output is correct
10 Correct 2 ms 716 KB Output is correct
11 Correct 2 ms 532 KB Output is correct
12 Correct 5 ms 844 KB Output is correct
13 Correct 3 ms 716 KB Output is correct
14 Correct 2 ms 716 KB Output is correct
15 Correct 11 ms 1848 KB Output is correct
16 Correct 11 ms 1740 KB Output is correct
17 Correct 9 ms 1740 KB Output is correct
18 Correct 7 ms 1356 KB Output is correct

Subtask #2
70.0 / 70.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 844 KB Output is correct
2 Correct 49 ms 8364 KB Output is correct
3 Correct 345 ms 79212 KB Output is correct
4 Correct 101 ms 19112 KB Output is correct
5 Correct 190 ms 44868 KB Output is correct
6 Correct 744 ms 92872 KB Output is correct
7 Correct 2 ms 844 KB Output is correct
8 Correct 2 ms 844 KB Output is correct
9 Correct 3 ms 576 KB Output is correct
10 Correct 1 ms 452 KB Output is correct
11 Correct 2 ms 844 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 56 ms 8400 KB Output is correct
14 Correct 29 ms 5068 KB Output is correct
15 Correct 25 ms 5564 KB Output is correct
16 Correct 29 ms 3788 KB Output is correct
17 Correct 130 ms 20700 KB Output is correct
18 Correct 99 ms 20328 KB Output is correct
19 Correct 89 ms 19132 KB Output is correct
20 Correct 96 ms 17668 KB Output is correct
21 Correct 236 ms 46532 KB Output is correct
22 Correct 186 ms 44868 KB Output is correct
23 Correct 251 ms 38868 KB Output is correct
24 Correct 195 ms 45252 KB Output is correct
25 Correct 478 ms 79284 KB Output is correct
26 Correct 673 ms 110960 KB Output is correct
27 Correct 763 ms 100788 KB Output is correct
28 Correct 763 ms 92904 KB Output is correct
29 Correct 747 ms 89980 KB Output is correct
30 Correct 742 ms 93444 KB Output is correct
31 Correct 500 ms 51164 KB Output is correct
32 Correct 747 ms 95472 KB Output is correct