oj.uz

답안 #867760

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
867760 2023-10-29T12:36:00 Z BoopyTheNoob Tracks in the Snow (BOI13_tracks) C++14
97.8125 / 100
 457 ms 133416 KB 
#include <bits/stdc++.h>
using namespace std;

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

Subtask #1
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 38 ms 63572 KB Output is correct
2 Correct 32 ms 63056 KB Output is correct
3 Correct 32 ms 63060 KB Output is correct
4 Correct 38 ms 63712 KB Output is correct
5 Correct 34 ms 63164 KB Output is correct
6 Correct 33 ms 63308 KB Output is correct
7 Correct 33 ms 63068 KB Output is correct
8 Correct 32 ms 63080 KB Output is correct
9 Correct 33 ms 63060 KB Output is correct
10 Correct 33 ms 63272 KB Output is correct
11 Correct 34 ms 63116 KB Output is correct
12 Correct 35 ms 63316 KB Output is correct
13 Correct 42 ms 63268 KB Output is correct
14 Correct 36 ms 63312 KB Output is correct
15 Correct 37 ms 63568 KB Output is correct
16 Correct 39 ms 63716 KB Output is correct
17 Correct 39 ms 63580 KB Output is correct
18 Correct 34 ms 63572 KB Output is correct

Subtask #2
67.8125 / 70.0

# 결과 실행 시간 메모리 Grader output
1 Correct 33 ms 63060 KB Output is correct
2 Correct 59 ms 66096 KB Output is correct
3 Correct 157 ms 89652 KB Output is correct
4 Correct 69 ms 69460 KB Output is correct
5 Correct 124 ms 77904 KB Output is correct
6 Correct 457 ms 102700 KB Output is correct
7 Correct 33 ms 63056 KB Output is correct
8 Correct 33 ms 63196 KB Output is correct
9 Correct 34 ms 63312 KB Output is correct
10 Correct 32 ms 63056 KB Output is correct
11 Correct 33 ms 63056 KB Output is correct
12 Correct 32 ms 63068 KB Output is correct
13 Correct 55 ms 65884 KB Output is correct
14 Correct 45 ms 64672 KB Output is correct
15 Correct 49 ms 64840 KB Output is correct
16 Correct 44 ms 64468 KB Output is correct
17 Correct 97 ms 70168 KB Output is correct
18 Correct 74 ms 69972 KB Output is correct
19 Correct 69 ms 69764 KB Output is correct
20 Correct 67 ms 68944 KB Output is correct
21 Correct 107 ms 78580 KB Output is correct
22 Correct 130 ms 78028 KB Output is correct
23 Correct 159 ms 76076 KB Output is correct
24 Correct 101 ms 78056 KB Output is correct
25 Incorrect 72 ms 89548 KB Output isn't correct
26 Correct 437 ms 133416 KB Output is correct
27 Correct 387 ms 107536 KB Output is correct
28 Correct 423 ms 102576 KB Output is correct
29 Correct 431 ms 100304 KB Output is correct
30 Correct 421 ms 105936 KB Output is correct
31 Correct 337 ms 80376 KB Output is correct
32 Correct 425 ms 105972 KB Output is correct