oj.uz

Submission #986019

# Submission time Handle Problem Language Result Execution time Memory
986019 2024-05-19T16:13:14 Z VinhLuu Maze (JOI23_ho_t3) C++17
8 / 100
 759 ms 643132 KB 
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
#include <bits/stdc++.h>
//#define int long long
#define ll long long
#define fi first
#define se second
#define pb push_back
#define all(lmao) lmao.begin(), lmao.end()

using namespace std;

typedef pair<int,int> pii;
typedef tuple<ll,int,int> tp;
const int N = 6e6 + 5;
const ll oo = 1e14 + 1;
const int mod = 1e9 + 7;
//const ll oo = 5e18;

const int ha[4] = {1, -1, 0, 0};
const int co[4] = {0, 0, 1, -1};
const int tx[4] = {1, 1, -1, -1};
const int ty[4] = {1, -1, -1, 1};

int m, n, k, xt, yt, xs, ys;

vector<ll> f[N];
vector<int> a[N], ph[N], pc[N];

bool kt(int x,int y){
    return x >= 1 && x <= m && y >= 1 && y <= n;
}

int row(int u,int v){
    return (ph[u][v] == v ? v : ph[u][v] = row(u, ph[u][v]));
}

int col(int u,int v){
    return (pc[u][v] == u ? u : pc[u][v] = col(pc[u][v], v));
}

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

    #define task "v"
    if(fopen(task ".inp","r")){
        freopen(task ".inp","r",stdin);
        freopen(task ".out","w",stdout);
    }

    cin >> m >> n >> k;
    cin >> xs >> ys >> xt >> yt;
    for(int i = 1; i <= m; i ++){
        string s; cin >> s;
        f[i].pb(oo);
        a[i].pb(0);
        ph[i].pb(0);
        pc[i].pb(0);
        for(int j = 0; j < n; j ++){
            f[i].pb(oo);
            pc[i].pb(0);
            ph[i].pb(j + 1);
            if(s[j] == '.') a[i].pb(0);
            else a[i].pb(1);
        }
        f[i].pb(oo);
        a[i].pb(0);
        ph[i].pb(0);
        pc[i].pb(0);
    }
    for(int i = 1; i <= n + 1; i ++) pc[0].pb(0);
    for(int i = 1; i <= n; i ++){
        for(int j = 1; j <= m; j ++){
            pc[j][i] = j;
        }
    }

//    for(int i = 1; i <= m; i ++){
//        for(int j = 1; j <= n; j ++) cout << a[i][j] << " ";
//        cout << "\n";
//    }
    priority_queue<tp, vector<tp>, greater<tp>> q;
    f[xs][ys] = 0;
    q.push({0, xs, ys});
    ll ans = oo;
    while(!q.empty()){
        ll val;
        int px, py; tie(val, px, py) = q.top();
//        int x = q.front().fi;
//        int y = q.front().se;
        q.pop();
        if(val > f[px][py]) continue;
        if(px == xt && py == yt) ans = min(ans, f[px][py]);

        for(int d = 0; d < 4; d ++){
            int x = px + ha[d];
            int y = py + co[d];
            if(!kt(x, y) || f[x][y] <= f[px][py] + a[x][y]) continue;
            f[x][y] = f[px][py] + a[x][y];
            q.push({f[x][y], x, y});
            if(ph[x][y]){
                ph[x][y]--;
                ph[x][y] = row(x, ph[x][y]);
            }
            if(pc[x][y]){
                pc[x][y]--;
                pc[x][y] = col(pc[x][y], y);
            }
            int l = max(1, x - k + 1), r = min(m, x + k - 1), pl = max(1, y - k + 1), pr = min(n, y + k - 1);
            if(xt >= l && xt <= r && yt >= pl && yt <= pr) ans = min(ans, val + 1);
            if(l - 1 >= 1){
                int lx = l - 1, g = pr;
                while(ph[lx][g] >= pl){
                    g = ph[lx][g];
                    if(f[lx][g] > val + 1 + a[lx][g]) f[lx][g] = val + 1 + a[lx][g], q.push({f[lx][g], lx, g});
                    if(!ph[lx][g]) break;
                    ph[lx][g]--;
                    ph[lx][g] = row(lx, ph[lx][g]);
                }
            }
            if(r + 1 <= m){
                int lx = r + 1, g = pr;
                while(ph[lx][g] >= pl){
                    g = ph[lx][g];
                    if(f[lx][g] > val + 1 + a[lx][g]) f[lx][g] = val + 1 + a[lx][g], q.push({f[lx][g], lx, g});
                    if(!ph[lx][g]) break;
                    ph[lx][g]--;
                    ph[lx][g] = row(lx, ph[lx][g]);
                }
            }
            if(pl - 1 >= 1){
                int g = r, ly = pl - 1;
                while(pc[g][ly] >= l){
                    g = pc[g][ly];
                    if(f[g][ly] > val + 1 + a[g][ly]) f[g][ly] = val + 1 + a[g][ly], q.push({f[g][ly], g, ly});
                    if(!pc[g][ly]) break;
                    pc[g][ly]--;
                    pc[g][ly] = col(pc[g][ly], ly);
                }
            }

            if(pr + 1 <= n){
                int g = r, ly = pr + 1;
                while(pc[g][ly] >= l){
                    g = pc[g][ly];
                    if(f[g][ly] > val + 1 + a[g][ly]) f[g][ly] = val + 1 + a[g][ly], q.push({f[g][ly], g, ly});
                    if(!pc[g][ly]) break;
                    pc[g][ly]--;
                    pc[g][ly] = col(pc[g][ly], ly);
                }
            }
        }
    }
    cout << min(ans, f[xt][yt]);
}

/*
6 6 3
5 4
2 1
###.#.
#..#..
...###
###.##
..####
#.#...
*/

Compilation message

Main.cpp: In function 'int main()':
Main.cpp:47:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   47 |         freopen(task ".inp","r",stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
Main.cpp:48:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   48 |         freopen(task ".out","w",stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 317 ms 564028 KB Output is correct
2 Correct 205 ms 564032 KB Output is correct
3 Correct 237 ms 564052 KB Output is correct
4 Correct 207 ms 563944 KB Output is correct
5 Correct 207 ms 563860 KB Output is correct
6 Correct 204 ms 564032 KB Output is correct
7 Correct 203 ms 564180 KB Output is correct
8 Correct 205 ms 563904 KB Output is correct
9 Correct 201 ms 563796 KB Output is correct
10 Correct 205 ms 563816 KB Output is correct
11 Correct 205 ms 563788 KB Output is correct
12 Correct 202 ms 563796 KB Output is correct
13 Correct 206 ms 563860 KB Output is correct
14 Correct 207 ms 563892 KB Output is correct
15 Correct 201 ms 564036 KB Output is correct
16 Correct 204 ms 564052 KB Output is correct
17 Correct 202 ms 563848 KB Output is correct
18 Correct 205 ms 563916 KB Output is correct
19 Correct 213 ms 565276 KB Output is correct
20 Correct 205 ms 565452 KB Output is correct
21 Correct 218 ms 566216 KB Output is correct
22 Correct 219 ms 565332 KB Output is correct
23 Correct 212 ms 565072 KB Output is correct
24 Correct 213 ms 565772 KB Output is correct
25 Correct 204 ms 565916 KB Output is correct
26 Correct 226 ms 565708 KB Output is correct
27 Correct 230 ms 565332 KB Output is correct
28 Correct 215 ms 565328 KB Output is correct
29 Correct 231 ms 568000 KB Output is correct
30 Correct 217 ms 566020 KB Output is correct
31 Correct 245 ms 571964 KB Output is correct
32 Correct 248 ms 568148 KB Output is correct
33 Correct 226 ms 567888 KB Output is correct
34 Correct 228 ms 568876 KB Output is correct
35 Correct 210 ms 569020 KB Output is correct
36 Correct 250 ms 568528 KB Output is correct
37 Correct 248 ms 568192 KB Output is correct
38 Correct 235 ms 568320 KB Output is correct
39 Correct 547 ms 610184 KB Output is correct
40 Correct 247 ms 568400 KB Output is correct
41 Correct 220 ms 569496 KB Output is correct
42 Correct 247 ms 570844 KB Output is correct
43 Correct 242 ms 570192 KB Output is correct
44 Correct 408 ms 579976 KB Output is correct
45 Correct 314 ms 586220 KB Output is correct
46 Correct 690 ms 643132 KB Output is correct
47 Correct 634 ms 610508 KB Output is correct
48 Correct 501 ms 610208 KB Output is correct
49 Correct 389 ms 609820 KB Output is correct
50 Correct 277 ms 609824 KB Output is correct
51 Correct 759 ms 612288 KB Output is correct
52 Correct 680 ms 611276 KB Output is correct
53 Correct 513 ms 610768 KB Output is correct

Subtask #2
0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 208 ms 564108 KB Output is correct
2 Correct 202 ms 563792 KB Output is correct
3 Correct 202 ms 563920 KB Output is correct
4 Correct 211 ms 564052 KB Output is correct
5 Correct 202 ms 563948 KB Output is correct
6 Correct 204 ms 563808 KB Output is correct
7 Correct 209 ms 563944 KB Output is correct
8 Incorrect 205 ms 563792 KB Output isn't correct
9 Halted 0 ms 0 KB -

Subtask #3
0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 205 ms 563972 KB Output is correct
2 Correct 205 ms 563776 KB Output is correct
3 Correct 203 ms 564032 KB Output is correct
4 Correct 204 ms 564212 KB Output is correct
5 Correct 206 ms 563780 KB Output is correct
6 Correct 203 ms 563792 KB Output is correct
7 Correct 207 ms 564304 KB Output is correct
8 Correct 203 ms 564048 KB Output is correct
9 Correct 204 ms 564052 KB Output is correct
10 Correct 203 ms 563992 KB Output is correct
11 Correct 201 ms 564068 KB Output is correct
12 Correct 201 ms 564004 KB Output is correct
13 Correct 206 ms 563792 KB Output is correct
14 Correct 203 ms 564004 KB Output is correct
15 Correct 204 ms 563800 KB Output is correct
16 Correct 208 ms 564304 KB Output is correct
17 Correct 201 ms 563892 KB Output is correct
18 Correct 207 ms 564032 KB Output is correct
19 Correct 206 ms 564072 KB Output is correct
20 Correct 204 ms 563792 KB Output is correct
21 Incorrect 207 ms 564056 KB Output isn't correct
22 Halted 0 ms 0 KB -

Subtask #4
0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 208 ms 564108 KB Output is correct
2 Correct 202 ms 563792 KB Output is correct
3 Correct 202 ms 563920 KB Output is correct
4 Correct 211 ms 564052 KB Output is correct
5 Correct 202 ms 563948 KB Output is correct
6 Correct 204 ms 563808 KB Output is correct
7 Correct 209 ms 563944 KB Output is correct
8 Incorrect 205 ms 563792 KB Output isn't correct
9 Halted 0 ms 0 KB -

Subtask #5
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 208 ms 564108 KB Output is correct
2 Correct 202 ms 563792 KB Output is correct
3 Correct 202 ms 563920 KB Output is correct
4 Correct 211 ms 564052 KB Output is correct
5 Correct 202 ms 563948 KB Output is correct
6 Correct 204 ms 563808 KB Output is correct
7 Correct 209 ms 563944 KB Output is correct
8 Incorrect 205 ms 563792 KB Output isn't correct
9 Halted 0 ms 0 KB -

Subtask #6
0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 317 ms 564028 KB Output is correct
2 Correct 205 ms 564032 KB Output is correct
3 Correct 237 ms 564052 KB Output is correct
4 Correct 207 ms 563944 KB Output is correct
5 Correct 207 ms 563860 KB Output is correct
6 Correct 204 ms 564032 KB Output is correct
7 Correct 203 ms 564180 KB Output is correct
8 Correct 205 ms 563904 KB Output is correct
9 Correct 201 ms 563796 KB Output is correct
10 Correct 205 ms 563816 KB Output is correct
11 Correct 205 ms 563788 KB Output is correct
12 Correct 202 ms 563796 KB Output is correct
13 Correct 206 ms 563860 KB Output is correct
14 Correct 207 ms 563892 KB Output is correct
15 Correct 201 ms 564036 KB Output is correct
16 Correct 204 ms 564052 KB Output is correct
17 Correct 202 ms 563848 KB Output is correct
18 Correct 205 ms 563916 KB Output is correct
19 Correct 213 ms 565276 KB Output is correct
20 Correct 205 ms 565452 KB Output is correct
21 Correct 218 ms 566216 KB Output is correct
22 Correct 219 ms 565332 KB Output is correct
23 Correct 212 ms 565072 KB Output is correct
24 Correct 213 ms 565772 KB Output is correct
25 Correct 204 ms 565916 KB Output is correct
26 Correct 226 ms 565708 KB Output is correct
27 Correct 230 ms 565332 KB Output is correct
28 Correct 215 ms 565328 KB Output is correct
29 Correct 231 ms 568000 KB Output is correct
30 Correct 217 ms 566020 KB Output is correct
31 Correct 245 ms 571964 KB Output is correct
32 Correct 248 ms 568148 KB Output is correct
33 Correct 226 ms 567888 KB Output is correct
34 Correct 228 ms 568876 KB Output is correct
35 Correct 210 ms 569020 KB Output is correct
36 Correct 250 ms 568528 KB Output is correct
37 Correct 248 ms 568192 KB Output is correct
38 Correct 235 ms 568320 KB Output is correct
39 Correct 547 ms 610184 KB Output is correct
40 Correct 247 ms 568400 KB Output is correct
41 Correct 220 ms 569496 KB Output is correct
42 Correct 247 ms 570844 KB Output is correct
43 Correct 242 ms 570192 KB Output is correct
44 Correct 408 ms 579976 KB Output is correct
45 Correct 314 ms 586220 KB Output is correct
46 Correct 690 ms 643132 KB Output is correct
47 Correct 634 ms 610508 KB Output is correct
48 Correct 501 ms 610208 KB Output is correct
49 Correct 389 ms 609820 KB Output is correct
50 Correct 277 ms 609824 KB Output is correct
51 Correct 759 ms 612288 KB Output is correct
52 Correct 680 ms 611276 KB Output is correct
53 Correct 513 ms 610768 KB Output is correct
54 Correct 208 ms 564108 KB Output is correct
55 Correct 202 ms 563792 KB Output is correct
56 Correct 202 ms 563920 KB Output is correct
57 Correct 211 ms 564052 KB Output is correct
58 Correct 202 ms 563948 KB Output is correct
59 Correct 204 ms 563808 KB Output is correct
60 Correct 209 ms 563944 KB Output is correct
61 Incorrect 205 ms 563792 KB Output isn't correct
62 Halted 0 ms 0 KB -

Subtask #7
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 317 ms 564028 KB Output is correct
2 Correct 205 ms 564032 KB Output is correct
3 Correct 237 ms 564052 KB Output is correct
4 Correct 207 ms 563944 KB Output is correct
5 Correct 207 ms 563860 KB Output is correct
6 Correct 204 ms 564032 KB Output is correct
7 Correct 203 ms 564180 KB Output is correct
8 Correct 205 ms 563904 KB Output is correct
9 Correct 201 ms 563796 KB Output is correct
10 Correct 205 ms 563816 KB Output is correct
11 Correct 205 ms 563788 KB Output is correct
12 Correct 202 ms 563796 KB Output is correct
13 Correct 206 ms 563860 KB Output is correct
14 Correct 207 ms 563892 KB Output is correct
15 Correct 201 ms 564036 KB Output is correct
16 Correct 204 ms 564052 KB Output is correct
17 Correct 202 ms 563848 KB Output is correct
18 Correct 205 ms 563916 KB Output is correct
19 Correct 213 ms 565276 KB Output is correct
20 Correct 205 ms 565452 KB Output is correct
21 Correct 218 ms 566216 KB Output is correct
22 Correct 219 ms 565332 KB Output is correct
23 Correct 212 ms 565072 KB Output is correct
24 Correct 213 ms 565772 KB Output is correct
25 Correct 204 ms 565916 KB Output is correct
26 Correct 226 ms 565708 KB Output is correct
27 Correct 230 ms 565332 KB Output is correct
28 Correct 215 ms 565328 KB Output is correct
29 Correct 231 ms 568000 KB Output is correct
30 Correct 217 ms 566020 KB Output is correct
31 Correct 245 ms 571964 KB Output is correct
32 Correct 248 ms 568148 KB Output is correct
33 Correct 226 ms 567888 KB Output is correct
34 Correct 228 ms 568876 KB Output is correct
35 Correct 210 ms 569020 KB Output is correct
36 Correct 250 ms 568528 KB Output is correct
37 Correct 248 ms 568192 KB Output is correct
38 Correct 235 ms 568320 KB Output is correct
39 Correct 547 ms 610184 KB Output is correct
40 Correct 247 ms 568400 KB Output is correct
41 Correct 220 ms 569496 KB Output is correct
42 Correct 247 ms 570844 KB Output is correct
43 Correct 242 ms 570192 KB Output is correct
44 Correct 408 ms 579976 KB Output is correct
45 Correct 314 ms 586220 KB Output is correct
46 Correct 690 ms 643132 KB Output is correct
47 Correct 634 ms 610508 KB Output is correct
48 Correct 501 ms 610208 KB Output is correct
49 Correct 389 ms 609820 KB Output is correct
50 Correct 277 ms 609824 KB Output is correct
51 Correct 759 ms 612288 KB Output is correct
52 Correct 680 ms 611276 KB Output is correct
53 Correct 513 ms 610768 KB Output is correct
54 Correct 208 ms 564108 KB Output is correct
55 Correct 202 ms 563792 KB Output is correct
56 Correct 202 ms 563920 KB Output is correct
57 Correct 211 ms 564052 KB Output is correct
58 Correct 202 ms 563948 KB Output is correct
59 Correct 204 ms 563808 KB Output is correct
60 Correct 209 ms 563944 KB Output is correct
61 Incorrect 205 ms 563792 KB Output isn't correct
62 Halted 0 ms 0 KB -

Subtask #8
0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 317 ms 564028 KB Output is correct
2 Correct 205 ms 564032 KB Output is correct
3 Correct 237 ms 564052 KB Output is correct
4 Correct 207 ms 563944 KB Output is correct
5 Correct 207 ms 563860 KB Output is correct
6 Correct 204 ms 564032 KB Output is correct
7 Correct 203 ms 564180 KB Output is correct
8 Correct 205 ms 563904 KB Output is correct
9 Correct 201 ms 563796 KB Output is correct
10 Correct 205 ms 563816 KB Output is correct
11 Correct 205 ms 563788 KB Output is correct
12 Correct 202 ms 563796 KB Output is correct
13 Correct 206 ms 563860 KB Output is correct
14 Correct 207 ms 563892 KB Output is correct
15 Correct 201 ms 564036 KB Output is correct
16 Correct 204 ms 564052 KB Output is correct
17 Correct 202 ms 563848 KB Output is correct
18 Correct 205 ms 563916 KB Output is correct
19 Correct 213 ms 565276 KB Output is correct
20 Correct 205 ms 565452 KB Output is correct
21 Correct 218 ms 566216 KB Output is correct
22 Correct 219 ms 565332 KB Output is correct
23 Correct 212 ms 565072 KB Output is correct
24 Correct 213 ms 565772 KB Output is correct
25 Correct 204 ms 565916 KB Output is correct
26 Correct 226 ms 565708 KB Output is correct
27 Correct 230 ms 565332 KB Output is correct
28 Correct 215 ms 565328 KB Output is correct
29 Correct 231 ms 568000 KB Output is correct
30 Correct 217 ms 566020 KB Output is correct
31 Correct 245 ms 571964 KB Output is correct
32 Correct 248 ms 568148 KB Output is correct
33 Correct 226 ms 567888 KB Output is correct
34 Correct 228 ms 568876 KB Output is correct
35 Correct 210 ms 569020 KB Output is correct
36 Correct 250 ms 568528 KB Output is correct
37 Correct 248 ms 568192 KB Output is correct
38 Correct 235 ms 568320 KB Output is correct
39 Correct 547 ms 610184 KB Output is correct
40 Correct 247 ms 568400 KB Output is correct
41 Correct 220 ms 569496 KB Output is correct
42 Correct 247 ms 570844 KB Output is correct
43 Correct 242 ms 570192 KB Output is correct
44 Correct 408 ms 579976 KB Output is correct
45 Correct 314 ms 586220 KB Output is correct
46 Correct 690 ms 643132 KB Output is correct
47 Correct 634 ms 610508 KB Output is correct
48 Correct 501 ms 610208 KB Output is correct
49 Correct 389 ms 609820 KB Output is correct
50 Correct 277 ms 609824 KB Output is correct
51 Correct 759 ms 612288 KB Output is correct
52 Correct 680 ms 611276 KB Output is correct
53 Correct 513 ms 610768 KB Output is correct
54 Correct 208 ms 564108 KB Output is correct
55 Correct 202 ms 563792 KB Output is correct
56 Correct 202 ms 563920 KB Output is correct
57 Correct 211 ms 564052 KB Output is correct
58 Correct 202 ms 563948 KB Output is correct
59 Correct 204 ms 563808 KB Output is correct
60 Correct 209 ms 563944 KB Output is correct
61 Incorrect 205 ms 563792 KB Output isn't correct
62 Halted 0 ms 0 KB -