oj.uz

Submission #838645

# Submission time Handle Problem Language Result Execution time Memory
838645 2023-08-27T14:02:03 Z makrav Maze (JOI23_ho_t3) C++14
8 / 100
 394 ms 208664 KB 
#define _USE_MATH_DEFINES
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef long double ld;
typedef vector<int> vei;
typedef vector<vei> vevei;

#define all(a) (a).begin(), (a).end()
#define sz(a) (int) a.size()
#define con cout << "NO\n"
#define coe cout << "YES\n";
#define str string
#define pb push_back
#define ff first
#define sc second
#define pii pair<int, int>
#define mxe max_element
#define mne min_element
#define stf shrink_to_fit
#define f(i, l, r) for (int i = (l); i < (r); i++)
#define double ld

vector<str> a;
vector<vector<pii>> comps;
vector<vector<int>> used;
int n, m;

void dfs(int i, int j) {
    used[i][j] = 1;
    comps.back().pb({ i, j });
    if (i - 1 >= 0 && a[i - 1][j] == '.' && !used[i - 1][j]) dfs(i - 1, j);
    if (i + 1 < n && a[i + 1][j] == '.' && !used[i + 1][j]) dfs(i + 1, j);
    if (j - 1 >= 0 && a[i][j - 1] == '.' && !used[i][j - 1]) dfs(i, j - 1);
    if (j + 1 < m && a[i][j + 1] == '.' && !used[i][j + 1]) dfs(i, j + 1);
}

struct node {
    int sm;
    node() = default;
    node(int a) {
        sm = a;
    }
};

struct segtree {
    int n;
    vector<int> a;
    vector<node> t;

    segtree() = default;
    segtree(int n_, vector<int> a_) {
        n = n_;
        a = a_;
        t.resize(4 * n);
        build(1, 0, n);
    }

    void build(int v, int tl, int tr) {
        if (tl + 1 == tr) {
            t[v] = node(a[tl]);
            return;
        }
        int tm = (tl + tr) / 2;
        build(v * 2, tl, tm);
        build(v * 2 + 1, tm, tr);
        t[v].sm = t[v * 2].sm + t[v * 2 + 1].sm;
    }

    void upd(int v, int tl, int tr, int pos, int val) {
        if (tl + 1 == tr) {
            t[v] = node(val);return;
        }
        int tm = (tl + tr) / 2;
        if (pos < tm) {
            upd(v * 2, tl, tm, pos, val);
        }
        else {
            upd(v * 2 + 1, tm, tr, pos, val);
        }
        t[v].sm = t[v * 2].sm + t[v * 2 + 1].sm;
    }

    int getkth(int v, int tl, int tr, int l, int r, int k) {
        if (tr <= l || tl >= r) return -1;
        if (l <= tl && tr <= r) {
            if (t[v].sm < k) return -1;
            if (tl + 1 == tr) return tl;
            int tm = (tl + tr) / 2;
            if (t[v * 2].sm >= k) return getkth(v * 2, tl, tm, l, r, k);
            else return getkth(v * 2 + 1, tm, tr, l, r, k - t[v * 2].sm);
        }

        int tm = (tl + tr) / 2;
        int lft = getkth(v * 2, tl, tm, l, r, k);
        if (lft != -1) return lft;
        else return getkth(v * 2 + 1, tm, tr, l, r, k);
    }
};

bool check(pii a, pii b, int k) {
    return (max(abs(a.ff - b.ff), abs(a.sc - b.sc)) <= k && min(abs(a.ff - b.ff), abs(a.sc - b.sc)) <= k - 1);
}

signed main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.tie(nullptr);

    int k; cin >> n >> m >> k;
    pii s, g;
    cin >> s.ff >> s.sc >> g.ff >> g.sc;
    s.ff--; s.sc--; g.ff--; g.sc--;
    a.resize(n);
    used.assign(n, vector<int>(m, 0));
    f(i, 0, n) cin >> a[i];

    vector<vector<int>> comp(n, vector<int>(m, 0));
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < m; j++) {
            if (a[i][j] == '.' && used[i][j] == 0) {
                comps.pb({});
                dfs(i, j);
                for (auto& u : comps.back()) {
                    comp[u.ff][u.sc] = sz(comps) - 1;
                }
            }
        }
    }
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < m; j++) {
            if (a[i][j] == '#') {
                comps.pb({ {i, j} });
                comp[i][j] = sz(comps) - 1;
            }
        }
    }

    vector<vector<int>> dist(n, vector<int>(m, -1));
    vector<segtree> sg(n);
    vector<int> B(m, 1);
    f(i, 0, n) {
        sg[i] = segtree(m, B);
    }
    queue<pair<int, int>> q;
    for (auto& u : comps[comp[s.ff][s.sc]]) {
        q.push(u);
        dist[u.ff][u.sc] = 0;
        sg[u.ff].upd(1, 0, m, u.sc, 0);
    }

    while (!q.empty()) {
        auto [i, j] = q.front();
        q.pop();
        int curd = dist[i][j];
        for (int i1 = i - 2; i1 <= i + 2; i1++) {
            for (int j1 = j - (2 - abs(i - i1)); j1 <= j + abs(2 - abs(i - i1)); j1++) {
                if (0 <= i1 && i1 < n && 0 <= j1 && j1 < m) {
                    if ((!check({ i, j }, { i1, j1 }, k) && a[i1][j1] == '#') || dist[i1][j1] != -1) continue;
                    for (auto& u : comps[comp[i1][j1]]) {
                        dist[u.ff][u.sc] = curd + 1;
                        q.push(u);
                    }
                }
            }
        }
        // for (int row = max(0, i - k - 1); row <= min(n - 1, i + k + 1); row++) {
        //     int l = max(0, j - k - 1), r = min(m - 1, j + k + 1) + 1;
        //     if (row == i - k - 1 || row == i + k + 1) {
        //         l = max(0, j - k + 1);
        //         r = min(m - 1, j + k - 1) + 1;
        //     }
        //     if (row == i - k || row == i + k) {
        //         l = max(0, j - k);
        //         r = min(m - 1, j + k) + 1;
        //     }
        //     int K = 1;
        //     int nw = sg[row].getkth(1, 0, m, l, r, K);
        //     while (nw != -1) {
        //         if (!check({ i, j }, { row, nw }, k) && a[row][nw] == '#') {
        //             K++;
        //             nw = sg[row].getkth(1, 0, m, l, r, K);
        //             continue;
        //         }
        //         for (auto& u : comps[comp[row][nw]]) {
        //             dist[u.ff][u.sc] = curd + 1;
        //             q.push(u);
        //             sg[u.ff].upd(1, 0, m, u.sc, 0);
        //         }
        //         nw = sg[row].getkth(1, 0, m, l, r, K);
        //     }
        // }
    }
    cout << dist[g.ff][g.sc] << '\n';

    return 0;
}

Compilation message

Main.cpp: In function 'int main()':
Main.cpp:155:14: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
  155 |         auto [i, j] = q.front();
      |              ^

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 468 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 324 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 9 ms 5512 KB Output is correct
20 Correct 6 ms 4688 KB Output is correct
21 Correct 9 ms 8400 KB Output is correct
22 Correct 12 ms 4780 KB Output is correct
23 Correct 11 ms 5640 KB Output is correct
24 Correct 5 ms 3432 KB Output is correct
25 Correct 7 ms 5984 KB Output is correct
26 Correct 12 ms 4604 KB Output is correct
27 Correct 13 ms 4996 KB Output is correct
28 Correct 9 ms 5640 KB Output is correct
29 Correct 23 ms 13312 KB Output is correct
30 Correct 9 ms 5380 KB Output is correct
31 Correct 24 ms 21572 KB Output is correct
32 Correct 31 ms 11668 KB Output is correct
33 Correct 22 ms 13568 KB Output is correct
34 Correct 11 ms 8328 KB Output is correct
35 Correct 18 ms 14712 KB Output is correct
36 Correct 29 ms 10884 KB Output is correct
37 Correct 31 ms 11780 KB Output is correct
38 Correct 25 ms 13696 KB Output is correct
39 Correct 341 ms 130120 KB Output is correct
40 Correct 33 ms 12292 KB Output is correct
41 Correct 18 ms 12096 KB Output is correct
42 Correct 41 ms 18688 KB Output is correct
43 Correct 42 ms 21732 KB Output is correct
44 Correct 130 ms 46420 KB Output is correct
45 Correct 130 ms 71460 KB Output is correct
46 Correct 286 ms 208664 KB Output is correct
47 Correct 366 ms 112828 KB Output is correct
48 Correct 394 ms 132620 KB Output is correct
49 Correct 120 ms 79964 KB Output is correct
50 Correct 185 ms 144132 KB Output is correct
51 Correct 363 ms 104980 KB Output is correct
52 Correct 356 ms 113296 KB Output is correct
53 Correct 322 ms 133004 KB Output is correct

Subtask #2
0 / 19.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 16.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 19.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #6
0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 468 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 324 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 9 ms 5512 KB Output is correct
20 Correct 6 ms 4688 KB Output is correct
21 Correct 9 ms 8400 KB Output is correct
22 Correct 12 ms 4780 KB Output is correct
23 Correct 11 ms 5640 KB Output is correct
24 Correct 5 ms 3432 KB Output is correct
25 Correct 7 ms 5984 KB Output is correct
26 Correct 12 ms 4604 KB Output is correct
27 Correct 13 ms 4996 KB Output is correct
28 Correct 9 ms 5640 KB Output is correct
29 Correct 23 ms 13312 KB Output is correct
30 Correct 9 ms 5380 KB Output is correct
31 Correct 24 ms 21572 KB Output is correct
32 Correct 31 ms 11668 KB Output is correct
33 Correct 22 ms 13568 KB Output is correct
34 Correct 11 ms 8328 KB Output is correct
35 Correct 18 ms 14712 KB Output is correct
36 Correct 29 ms 10884 KB Output is correct
37 Correct 31 ms 11780 KB Output is correct
38 Correct 25 ms 13696 KB Output is correct
39 Correct 341 ms 130120 KB Output is correct
40 Correct 33 ms 12292 KB Output is correct
41 Correct 18 ms 12096 KB Output is correct
42 Correct 41 ms 18688 KB Output is correct
43 Correct 42 ms 21732 KB Output is correct
44 Correct 130 ms 46420 KB Output is correct
45 Correct 130 ms 71460 KB Output is correct
46 Correct 286 ms 208664 KB Output is correct
47 Correct 366 ms 112828 KB Output is correct
48 Correct 394 ms 132620 KB Output is correct
49 Correct 120 ms 79964 KB Output is correct
50 Correct 185 ms 144132 KB Output is correct
51 Correct 363 ms 104980 KB Output is correct
52 Correct 356 ms 113296 KB Output is correct
53 Correct 322 ms 133004 KB Output is correct
54 Incorrect 1 ms 212 KB Output isn't correct
55 Halted 0 ms 0 KB -

Subtask #7
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 468 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 324 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 9 ms 5512 KB Output is correct
20 Correct 6 ms 4688 KB Output is correct
21 Correct 9 ms 8400 KB Output is correct
22 Correct 12 ms 4780 KB Output is correct
23 Correct 11 ms 5640 KB Output is correct
24 Correct 5 ms 3432 KB Output is correct
25 Correct 7 ms 5984 KB Output is correct
26 Correct 12 ms 4604 KB Output is correct
27 Correct 13 ms 4996 KB Output is correct
28 Correct 9 ms 5640 KB Output is correct
29 Correct 23 ms 13312 KB Output is correct
30 Correct 9 ms 5380 KB Output is correct
31 Correct 24 ms 21572 KB Output is correct
32 Correct 31 ms 11668 KB Output is correct
33 Correct 22 ms 13568 KB Output is correct
34 Correct 11 ms 8328 KB Output is correct
35 Correct 18 ms 14712 KB Output is correct
36 Correct 29 ms 10884 KB Output is correct
37 Correct 31 ms 11780 KB Output is correct
38 Correct 25 ms 13696 KB Output is correct
39 Correct 341 ms 130120 KB Output is correct
40 Correct 33 ms 12292 KB Output is correct
41 Correct 18 ms 12096 KB Output is correct
42 Correct 41 ms 18688 KB Output is correct
43 Correct 42 ms 21732 KB Output is correct
44 Correct 130 ms 46420 KB Output is correct
45 Correct 130 ms 71460 KB Output is correct
46 Correct 286 ms 208664 KB Output is correct
47 Correct 366 ms 112828 KB Output is correct
48 Correct 394 ms 132620 KB Output is correct
49 Correct 120 ms 79964 KB Output is correct
50 Correct 185 ms 144132 KB Output is correct
51 Correct 363 ms 104980 KB Output is correct
52 Correct 356 ms 113296 KB Output is correct
53 Correct 322 ms 133004 KB Output is correct
54 Incorrect 1 ms 212 KB Output isn't correct
55 Halted 0 ms 0 KB -

Subtask #8
0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 468 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 324 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 9 ms 5512 KB Output is correct
20 Correct 6 ms 4688 KB Output is correct
21 Correct 9 ms 8400 KB Output is correct
22 Correct 12 ms 4780 KB Output is correct
23 Correct 11 ms 5640 KB Output is correct
24 Correct 5 ms 3432 KB Output is correct
25 Correct 7 ms 5984 KB Output is correct
26 Correct 12 ms 4604 KB Output is correct
27 Correct 13 ms 4996 KB Output is correct
28 Correct 9 ms 5640 KB Output is correct
29 Correct 23 ms 13312 KB Output is correct
30 Correct 9 ms 5380 KB Output is correct
31 Correct 24 ms 21572 KB Output is correct
32 Correct 31 ms 11668 KB Output is correct
33 Correct 22 ms 13568 KB Output is correct
34 Correct 11 ms 8328 KB Output is correct
35 Correct 18 ms 14712 KB Output is correct
36 Correct 29 ms 10884 KB Output is correct
37 Correct 31 ms 11780 KB Output is correct
38 Correct 25 ms 13696 KB Output is correct
39 Correct 341 ms 130120 KB Output is correct
40 Correct 33 ms 12292 KB Output is correct
41 Correct 18 ms 12096 KB Output is correct
42 Correct 41 ms 18688 KB Output is correct
43 Correct 42 ms 21732 KB Output is correct
44 Correct 130 ms 46420 KB Output is correct
45 Correct 130 ms 71460 KB Output is correct
46 Correct 286 ms 208664 KB Output is correct
47 Correct 366 ms 112828 KB Output is correct
48 Correct 394 ms 132620 KB Output is correct
49 Correct 120 ms 79964 KB Output is correct
50 Correct 185 ms 144132 KB Output is correct
51 Correct 363 ms 104980 KB Output is correct
52 Correct 356 ms 113296 KB Output is correct
53 Correct 322 ms 133004 KB Output is correct
54 Incorrect 1 ms 212 KB Output isn't correct
55 Halted 0 ms 0 KB -