oj.uz

답안 #867775

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
867775 2023-10-29T12:51:31 Z BoopyTheNoob Tracks in the Snow (BOI13_tracks) C++14
97.8125 / 100
 411 ms 126644 KB 
#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});
    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

# 결과 실행 시간 메모리 Grader output
1 Correct 39 ms 63316 KB Output is correct
2 Correct 32 ms 63176 KB Output is correct
3 Correct 33 ms 63168 KB Output is correct
4 Correct 35 ms 63316 KB Output is correct
5 Correct 33 ms 63068 KB Output is correct
6 Correct 33 ms 63056 KB Output is correct
7 Correct 32 ms 63064 KB Output is correct
8 Correct 38 ms 63072 KB Output is correct
9 Correct 33 ms 63060 KB Output is correct
10 Correct 34 ms 63060 KB Output is correct
11 Correct 33 ms 63056 KB Output is correct
12 Correct 35 ms 63068 KB Output is correct
13 Correct 34 ms 63068 KB Output is correct
14 Correct 34 ms 63064 KB Output is correct
15 Correct 38 ms 63324 KB Output is correct
16 Correct 42 ms 63784 KB Output is correct
17 Correct 37 ms 63320 KB Output is correct
18 Correct 35 ms 63312 KB Output is correct

Subtask #2
67.8125 / 70.0

# 결과 실행 시간 메모리 Grader output
1 Correct 33 ms 63064 KB Output is correct
2 Correct 54 ms 64836 KB Output is correct
3 Correct 152 ms 80720 KB Output is correct
4 Correct 66 ms 66908 KB Output is correct
5 Correct 126 ms 72788 KB Output is correct
6 Correct 409 ms 94428 KB Output is correct
7 Correct 36 ms 63032 KB Output is correct
8 Correct 33 ms 63056 KB Output is correct
9 Correct 34 ms 63132 KB Output is correct
10 Correct 33 ms 63060 KB Output is correct
11 Correct 35 ms 63056 KB Output is correct
12 Correct 33 ms 63068 KB Output is correct
13 Correct 54 ms 64608 KB Output is correct
14 Correct 49 ms 64336 KB Output is correct
15 Correct 44 ms 64080 KB Output is correct
16 Correct 44 ms 63824 KB Output is correct
17 Correct 92 ms 67460 KB Output is correct
18 Correct 73 ms 67400 KB Output is correct
19 Correct 71 ms 66936 KB Output is correct
20 Correct 60 ms 66644 KB Output is correct
21 Correct 104 ms 73232 KB Output is correct
22 Correct 126 ms 72896 KB Output is correct
23 Correct 152 ms 71580 KB Output is correct
24 Correct 107 ms 72940 KB Output is correct
25 Incorrect 68 ms 80720 KB Output isn't correct
26 Correct 219 ms 126644 KB Output is correct
27 Correct 301 ms 107592 KB Output is correct
28 Correct 405 ms 94332 KB Output is correct
29 Correct 411 ms 92868 KB Output is correct
30 Correct 362 ms 98312 KB Output is correct
31 Correct 332 ms 74916 KB Output is correct
32 Correct 250 ms 96008 KB Output is correct