oj.uz

Submission #867774

# Submission time Handle Problem Language Result Execution time Memory
867774 2023-10-29T12:51:04 Z BoopyTheNoob Tracks in the Snow (BOI13_tracks) C++14
97.8125 / 100
 424 ms 126564 KB 
#include <bits/stdc++.h>
using namespace std;

int main (void) {
    iostream::sync_with_stdio(false);
	cin.tie(0);
	int dx[4]{1, -1, 0, 0}, dy[4]{0, 0, 1, -1};
    int N, M, dist[4000][4000], ans = 1;
    string grid[4000];
    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});
    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 39 ms 63312 KB Output is correct
2 Correct 32 ms 62996 KB Output is correct
3 Correct 35 ms 63120 KB Output is correct
4 Correct 36 ms 63324 KB Output is correct
5 Correct 33 ms 63056 KB Output is correct
6 Correct 35 ms 63056 KB Output is correct
7 Correct 34 ms 63024 KB Output is correct
8 Correct 33 ms 63160 KB Output is correct
9 Correct 32 ms 62940 KB Output is correct
10 Correct 34 ms 63068 KB Output is correct
11 Correct 34 ms 63056 KB Output is correct
12 Correct 34 ms 63324 KB Output is correct
13 Correct 34 ms 63068 KB Output is correct
14 Correct 33 ms 63204 KB Output is correct
15 Correct 38 ms 63320 KB Output is correct
16 Correct 38 ms 63320 KB Output is correct
17 Correct 36 ms 63324 KB Output is correct
18 Correct 36 ms 63324 KB Output is correct

Subtask #2
67.8125 / 70.0

# Verdict Execution time Memory Grader output
1 Correct 33 ms 63060 KB Output is correct
2 Correct 53 ms 64592 KB Output is correct
3 Correct 157 ms 80736 KB Output is correct
4 Correct 68 ms 67120 KB Output is correct
5 Correct 129 ms 72820 KB Output is correct
6 Correct 416 ms 94700 KB Output is correct
7 Correct 34 ms 63060 KB Output is correct
8 Correct 33 ms 63064 KB Output is correct
9 Correct 33 ms 63068 KB Output is correct
10 Correct 33 ms 63056 KB Output is correct
11 Correct 38 ms 63172 KB Output is correct
12 Correct 34 ms 63336 KB Output is correct
13 Correct 56 ms 64592 KB Output is correct
14 Correct 45 ms 64064 KB Output is correct
15 Correct 41 ms 64084 KB Output is correct
16 Correct 44 ms 63824 KB Output is correct
17 Correct 92 ms 67408 KB Output is correct
18 Correct 74 ms 67408 KB Output is correct
19 Correct 69 ms 66896 KB Output is correct
20 Correct 60 ms 66640 KB Output is correct
21 Correct 105 ms 73296 KB Output is correct
22 Correct 127 ms 72760 KB Output is correct
23 Correct 151 ms 71508 KB Output is correct
24 Correct 121 ms 72876 KB Output is correct
25 Incorrect 73 ms 80964 KB Output isn't correct
26 Correct 219 ms 126564 KB Output is correct
27 Correct 294 ms 107264 KB Output is correct
28 Correct 415 ms 94524 KB Output is correct
29 Correct 424 ms 92952 KB Output is correct
30 Correct 374 ms 98408 KB Output is correct
31 Correct 329 ms 74684 KB Output is correct
32 Correct 255 ms 96008 KB Output is correct