oj.uz

Submission #811976

# Submission time Handle Problem Language Result Execution time Memory
811976 2023-08-07T06:40:01 Z devariaota Tracks in the Snow (BOI13_tracks) C++17
50.5208 / 100
 907 ms 51912 KB 
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define ull unsigned long long
#define pii pair<int, int>
#define pll pair<ll, ll>
#define fi first
#define se second

const int N = 4e3 + 5;
const int dx[] = {1, 0, -1, 0};
const int dy[] = {0, 1, 0, -1};

queue<pair<int, int>> q1, q2;
char a[N][N];
bool vis[N][N];

int main() { 
    ios_base::sync_with_stdio(false); cin.tie(NULL);
    int h, w, cnt = 0, ans = 0;
    cin >> h >> w;
    for (int i = 1; i <= h; i++) {
        for (int j = 1; j <= w; j++) {
            cin >> a[i][j];
            if (a[i][j] != '.') cnt++;
        }
    }
    q1.push({1, 1});
    vis[1][1] = 1, cnt--;
    while (cnt > 0) {
        ans++;
        while (!q1.empty()) {
            int x = q1.front().fi, y = q1.front().se;
            q1.pop();
            cnt--;
            for (int i = 0; i < 4; i++) {
                int tx = x + dx[i], ty = y + dy[i];
                if (tx < 1 or ty < 1 or tx > h or ty > w or vis[tx][ty] or a[tx][ty] == '.') continue;
                else if (a[x][y] == a[tx][ty]) vis[tx][ty] = 1, q1.push({tx, ty});
                else vis[tx][ty] = 1, q2.push({tx, ty});
            }
        }
        q1 = q2;
        while (!q2.empty()) q2.pop();
    }
    cout << ans << "\n";
}

Subtask #1
13.3333333333 / 30.0

# Verdict Execution time Memory Grader output
1 Incorrect 11 ms 4288 KB Output isn't correct
2 Incorrect 0 ms 468 KB Output isn't correct
3 Correct 1 ms 724 KB Output is correct
4 Correct 8 ms 4376 KB Output is correct
5 Incorrect 4 ms 2608 KB Output isn't correct
6 Incorrect 0 ms 468 KB Output isn't correct
7 Correct 1 ms 724 KB Output is correct
8 Correct 1 ms 724 KB Output is correct
9 Incorrect 1 ms 1108 KB Output isn't correct
10 Correct 4 ms 2260 KB Output is correct
11 Correct 3 ms 1876 KB Output is correct
12 Correct 7 ms 2644 KB Output is correct
13 Incorrect 3 ms 2516 KB Output isn't correct
14 Incorrect 3 ms 2516 KB Output isn't correct
15 Incorrect 12 ms 4292 KB Output isn't correct
16 Incorrect 12 ms 4292 KB Output isn't correct
17 Incorrect 10 ms 4112 KB Output isn't correct
18 Correct 7 ms 4436 KB Output is correct

Subtask #2
37.1875 / 70.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 30224 KB Output is correct
2 Correct 52 ms 10144 KB Output is correct
3 Correct 371 ms 31680 KB Output is correct
4 Correct 105 ms 15108 KB Output is correct
5 Incorrect 226 ms 23808 KB Output isn't correct
6 Incorrect 907 ms 51872 KB Output isn't correct
7 Incorrect 22 ms 31680 KB Output isn't correct
8 Correct 16 ms 30148 KB Output is correct
9 Incorrect 2 ms 468 KB Output isn't correct
10 Incorrect 1 ms 340 KB Output isn't correct
11 Correct 18 ms 31068 KB Output is correct
12 Incorrect 2 ms 1516 KB Output isn't correct
13 Correct 56 ms 10148 KB Output is correct
14 Incorrect 32 ms 7480 KB Output isn't correct
15 Correct 24 ms 8168 KB Output is correct
16 Correct 29 ms 3412 KB Output is correct
17 Correct 140 ms 16164 KB Output is correct
18 Correct 106 ms 15996 KB Output is correct
19 Correct 83 ms 15036 KB Output is correct
20 Incorrect 75 ms 14080 KB Output isn't correct
21 Incorrect 166 ms 24636 KB Output isn't correct
22 Incorrect 235 ms 23836 KB Output isn't correct
23 Incorrect 231 ms 19992 KB Output isn't correct
24 Incorrect 192 ms 24744 KB Output isn't correct
25 Incorrect 411 ms 31672 KB Output isn't correct
26 Correct 329 ms 27860 KB Output is correct
27 Correct 539 ms 34916 KB Output is correct
28 Incorrect 784 ms 51912 KB Output isn't correct
29 Correct 745 ms 48628 KB Output is correct
30 Correct 645 ms 46204 KB Output is correct
31 Correct 642 ms 26264 KB Output is correct
32 Incorrect 563 ms 33064 KB Output isn't correct