oj.uz

Submission #867781

# Submission time Handle Problem Language Result Execution time Memory
867781 2023-10-29T12:56:51 Z BoopyTheNoob Tracks in the Snow (BOI13_tracks) C++14
100 / 100
 426 ms 126560 KB 
/*
BoopyTheNoob, 29.10.2023, 20:55 +8

Somehow there's an error if the variables aren't declared globally.
*/

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

int main (void) {
    int dx[4]{1, -1, 0, 0}, dy[4]{0, 0, 1, -1};
    int N, M, dist[4000][4000], ans = 1;
    string grid[4000];
    iostream::sync_with_stdio(false);
	cin.tie(0);
    cin >> N >> M;
    //vector<string> grid(N);
    for (int i = 0; i < N; i++)
        cin >> grid[i];
    //vector<vector<int>> dist(N, vector<int>(M, 0));
    deque<pair<int, int>> bfs;
    bfs.push_back({0, 0});
    for (int i = 0; i < N; i++)
        for (int j = 0; j < M; j++)
            dist[i][j] = 0;
    dist[0][0] = 1;

    while (!bfs.empty()) {
        int x = bfs.front().first, y = bfs.front().second;
        bfs.pop_front();
        ans = max(ans, dist[x][y]);
        for (int i = 0; i < 4; i++) {
            int nx = x + dx[i], ny = y + dy[i];
            /*if (nx < 0 || nx >= N || ny < 0 || ny >= M)
                continue;
            if (dist[nx][ny] != 0 || grid[nx][ny] == '.')
                continue;
            pair<int, int> next = {nx, ny};
            if (grid[x][y] != grid[nx][ny]) {
                dist[nx][ny] = dist[x][y] + 1;
                bfs.push_back({nx, ny});
            } else {
                dist[nx][ny] = dist[x][y];
                bfs.push_front({nx, ny});
            }*/
            if (nx >= 0 && nx < N && ny >= 0 && ny < M && grid[nx][ny] != '.' && dist[nx][ny] == 0) {
                if (grid[nx][ny] != grid[x][y]) {
                    dist[nx][ny] = dist[x][y] + 1;
                    bfs.push_back({nx, ny});
                } else {
                    dist[nx][ny] = dist[x][y];
                    bfs.push_front({nx, ny});
                }
            }
        }
    }
    /*for (auto x: dist) {
        for (auto y: x) {
            cout << y << " ";
        }
        cout << endl;
    }*/
    cout << ans;
    return 0;
}

Subtask #1
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 36 ms 63312 KB Output is correct
2 Correct 29 ms 63164 KB Output is correct
3 Correct 29 ms 63064 KB Output is correct
4 Correct 33 ms 63316 KB Output is correct
5 Correct 33 ms 63056 KB Output is correct
6 Correct 31 ms 63072 KB Output is correct
7 Correct 31 ms 63028 KB Output is correct
8 Correct 30 ms 63068 KB Output is correct
9 Correct 31 ms 62984 KB Output is correct
10 Correct 29 ms 63320 KB Output is correct
11 Correct 34 ms 63056 KB Output is correct
12 Correct 32 ms 63320 KB Output is correct
13 Correct 30 ms 63212 KB Output is correct
14 Correct 31 ms 63236 KB Output is correct
15 Correct 35 ms 63372 KB Output is correct
16 Correct 36 ms 63420 KB Output is correct
17 Correct 40 ms 63256 KB Output is correct
18 Correct 32 ms 63392 KB Output is correct

Subtask #2
70.0 / 70.0

# Verdict Execution time Memory Grader output
1 Correct 29 ms 63068 KB Output is correct
2 Correct 51 ms 64604 KB Output is correct
3 Correct 157 ms 80948 KB Output is correct
4 Correct 65 ms 67136 KB Output is correct
5 Correct 133 ms 72912 KB Output is correct
6 Correct 426 ms 94276 KB Output is correct
7 Correct 30 ms 63068 KB Output is correct
8 Correct 32 ms 63056 KB Output is correct
9 Correct 33 ms 63068 KB Output is correct
10 Correct 33 ms 63156 KB Output is correct
11 Correct 31 ms 63068 KB Output is correct
12 Correct 31 ms 63056 KB Output is correct
13 Correct 52 ms 64592 KB Output is correct
14 Correct 45 ms 64080 KB Output is correct
15 Correct 38 ms 64108 KB Output is correct
16 Correct 40 ms 63828 KB Output is correct
17 Correct 91 ms 67488 KB Output is correct
18 Correct 70 ms 67156 KB Output is correct
19 Correct 63 ms 66896 KB Output is correct
20 Correct 59 ms 66644 KB Output is correct
21 Correct 104 ms 73228 KB Output is correct
22 Correct 127 ms 72784 KB Output is correct
23 Correct 148 ms 71504 KB Output is correct
24 Correct 105 ms 72788 KB Output is correct
25 Correct 303 ms 80980 KB Output is correct
26 Correct 216 ms 126560 KB Output is correct
27 Correct 325 ms 107520 KB Output is correct
28 Correct 414 ms 94376 KB Output is correct
29 Correct 415 ms 92996 KB Output is correct
30 Correct 362 ms 98124 KB Output is correct
31 Correct 332 ms 74668 KB Output is correct
32 Correct 257 ms 96116 KB Output is correct