oj.uz

Submission #738944

# Submission time Handle Problem Language Result Execution time Memory
738944 2023-05-09T16:51:27 Z He_Huanglu Maze (JOI23_ho_t3) C++17
24 / 100
 536 ms 775320 KB 
#include <bits/stdc++.h>
#define ii pair<int, int>
#define fi first
#define se second
using namespace std;

const int N = 6e6 + 5;
int n, m, s, rs, cs, re, ce;
int dx[4] = {0, -1, 0, 1};
int dy[4] = {-1, 0, 1, 0};
vector <int> f[N], a[N], p[2][N], ok[N];
queue <ii> q[2];

void upd(int t, int id, int i, int j, int val) {
    for(int x = i; x <= j; x++) {
        if(t) {
            if(!f[id][x]) q[1].push({id, x}), f[id][x] = val;
        }
        else {
            if(!f[x][id]) q[1].push({x, id}), f[x][id] = val;
        }
    }
}

main () {
    cin.tie(0)->sync_with_stdio(0);
    if(fopen("task.inp", "r")) {
        freopen("task.inp", "r", stdin);
        freopen("wa.out", "w", stdout);
    }
    cin >> m >> n >> s >> rs >> cs >> re >> ce;
    for(int i = 1; i <= m; i++) a[i].resize(n + 1), f[i].resize(n + 1), ok[i].resize(n + 1);
    for(int i = 1; i <= m; i++) {
        for(int j = 0; j <= n + 1; j++) p[1][i].push_back(j);
    }
    for(int i = 1; i <= n; i++) {
        for(int j = 0; j <= m + 1; j++) p[0][i].push_back(j);
    }
    for(int i = 1; i <= m; i++) {
        for(int j = 1; j <= n; j++) {
            char ch; cin >> ch;
            a[i][j] = (ch == '.' ? 1 : 0);
        }
    }
    q[1].push({rs, cs}); f[rs][cs] = 1;
    while (!q[1].empty() || !q[0].empty()) {
        while (!q[1].empty()) {
            int x, y; tie(x, y) = q[1].front(); q[1].pop();
            q[0].push({x, y});
//            cout << x << " " << y << " " << f[x][y] << " $$\n";
            if(x == re && y == ce) return cout << f[x][y] - 1 << "\n", 0;
            for(int i = 0; i < 4; i++) {
                int u = x + dx[i], v = y + dy[i];
                if(u && u <= m && v && v <= n && !f[u][v] && a[u][v]) {
//                    cout << x << " " << y << " : " << u << " " << v << "\n";
                    f[u][v] = f[x][y];
                    q[1].push({u, v});
//                    cout << u << " " << v << "*\n";
                }
            }
        }
        while (!q[0].empty()) {
            int x, y; tie(x, y) = q[0].front(); q[0].pop();
            if(s != 1) {
                if(x == rs && y == cs) {
                    int s1 = max(1, x - s), s2 = max(1, y - s);
                    int s3 = min(m, x + s), s4 = min(n, y + s);
                    for(int i = s1; i <= s3; i++) {
                        for(int j = s2; j <= s4; j++) if(!f[i][j]) {
                            f[i][j] = f[x][y] + 1;
                            q[1].push({i, j});
                        }
                    }
                }
                else {
                    for(int i = 0; i < 4; i++) {
                        int u = x + dx[i], v = y + dy[i], val = f[x][y] + 1;
                        if(u && u <= m && v && v <= n && ok[u][v]) {
                            if(i == 0 && y + s <= n) upd(0, y + s, max(1, x - s), min(m, x + s), val);
                            if(i == 1 && x + s <= m) upd(1, x + s, max(1, y - s), min(n, y + s), val);
                            if(i == 2 && y - s >= 1) upd(0, y - s, max(1, x - s), min(m, x + s), val);
                            if(i == 3 && x - s >= 1) upd(1, x - s, max(1, y - s), min(n, y + s), val);
                            break ;
                        }
                    }
                }
                ok[x][y] = 1;
            }
            else {
                for(int i = 0; i < 4; i++) {
                    int u = x + dx[i], v = y + dy[i];
                    if(u && u <= m && v && v <= n && !f[u][v]) {
                        f[u][v] = f[x][y] + 1;
                        q[1].push({u, v});
//                        cout << u << " " << v << " ****\n";
                    }
                }
            }
        }
    }
}

Compilation message

Main.cpp:25:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   25 | main () {
      | ^~~~
Main.cpp: In function 'int main()':
Main.cpp:28:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   28 |         freopen("task.inp", "r", stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
Main.cpp:29:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   29 |         freopen("wa.out", "w", stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 332 ms 704808 KB Output is correct
2 Correct 329 ms 704828 KB Output is correct
3 Correct 353 ms 704840 KB Output is correct
4 Correct 335 ms 704848 KB Output is correct
5 Correct 315 ms 704776 KB Output is correct
6 Correct 322 ms 704844 KB Output is correct
7 Correct 339 ms 704768 KB Output is correct
8 Correct 341 ms 704848 KB Output is correct
9 Correct 314 ms 704808 KB Output is correct
10 Correct 323 ms 704880 KB Output is correct
11 Correct 309 ms 704820 KB Output is correct
12 Correct 318 ms 704716 KB Output is correct
13 Correct 335 ms 704696 KB Output is correct
14 Correct 322 ms 704688 KB Output is correct
15 Correct 345 ms 704776 KB Output is correct
16 Correct 315 ms 704832 KB Output is correct
17 Correct 338 ms 704820 KB Output is correct
18 Correct 322 ms 704716 KB Output is correct
19 Correct 329 ms 705984 KB Output is correct
20 Correct 342 ms 706952 KB Output is correct
21 Correct 330 ms 706384 KB Output is correct
22 Correct 341 ms 706148 KB Output is correct
23 Correct 324 ms 706072 KB Output is correct
24 Correct 337 ms 707580 KB Output is correct
25 Correct 328 ms 707612 KB Output is correct
26 Correct 324 ms 705988 KB Output is correct
27 Correct 318 ms 705996 KB Output is correct
28 Correct 345 ms 705996 KB Output is correct
29 Correct 348 ms 708160 KB Output is correct
30 Correct 332 ms 706764 KB Output is correct
31 Correct 329 ms 709184 KB Output is correct
32 Correct 326 ms 708124 KB Output is correct
33 Correct 354 ms 708264 KB Output is correct
34 Correct 333 ms 711828 KB Output is correct
35 Correct 333 ms 711884 KB Output is correct
36 Correct 330 ms 708176 KB Output is correct
37 Correct 326 ms 708296 KB Output is correct
38 Correct 331 ms 708176 KB Output is correct
39 Correct 467 ms 742092 KB Output is correct
40 Correct 342 ms 709040 KB Output is correct
41 Correct 335 ms 713488 KB Output is correct
42 Correct 351 ms 709968 KB Output is correct
43 Correct 373 ms 712432 KB Output is correct
44 Correct 379 ms 722344 KB Output is correct
45 Correct 410 ms 725060 KB Output is correct
46 Correct 404 ms 745040 KB Output is correct
47 Correct 490 ms 742124 KB Output is correct
48 Correct 456 ms 742128 KB Output is correct
49 Correct 536 ms 775280 KB Output is correct
50 Correct 524 ms 775320 KB Output is correct
51 Correct 422 ms 742628 KB Output is correct
52 Correct 461 ms 742308 KB Output is correct
53 Correct 436 ms 742252 KB Output is correct

Subtask #2
0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 335 ms 704692 KB Output is correct
2 Correct 331 ms 704732 KB Output is correct
3 Correct 351 ms 704716 KB Output is correct
4 Correct 330 ms 704844 KB Output is correct
5 Correct 332 ms 704732 KB Output is correct
6 Correct 314 ms 704716 KB Output is correct
7 Correct 334 ms 704808 KB Output is correct
8 Incorrect 321 ms 704912 KB Output isn't correct
9 Halted 0 ms 0 KB -

Subtask #3
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 354 ms 704696 KB Output is correct
2 Correct 398 ms 704760 KB Output is correct
3 Correct 339 ms 704796 KB Output is correct
4 Correct 315 ms 704808 KB Output is correct
5 Correct 319 ms 704800 KB Output is correct
6 Correct 313 ms 704744 KB Output is correct
7 Correct 347 ms 704736 KB Output is correct
8 Correct 343 ms 704840 KB Output is correct
9 Correct 312 ms 704844 KB Output is correct
10 Correct 313 ms 704884 KB Output is correct
11 Correct 319 ms 704968 KB Output is correct
12 Correct 335 ms 704880 KB Output is correct
13 Correct 322 ms 704768 KB Output is correct
14 Correct 317 ms 704828 KB Output is correct
15 Correct 315 ms 704784 KB Output is correct
16 Correct 311 ms 704844 KB Output is correct
17 Correct 321 ms 704684 KB Output is correct
18 Correct 317 ms 704820 KB Output is correct
19 Correct 318 ms 704832 KB Output is correct
20 Correct 333 ms 704884 KB Output is correct
21 Correct 326 ms 704856 KB Output is correct
22 Correct 317 ms 704768 KB Output is correct
23 Correct 309 ms 704820 KB Output is correct
24 Correct 310 ms 704844 KB Output is correct
25 Correct 314 ms 706020 KB Output is correct
26 Correct 319 ms 706332 KB Output is correct
27 Correct 322 ms 706488 KB Output is correct
28 Correct 322 ms 706392 KB Output is correct
29 Correct 336 ms 706576 KB Output is correct
30 Correct 328 ms 706460 KB Output is correct
31 Correct 322 ms 706008 KB Output is correct
32 Correct 333 ms 706060 KB Output is correct
33 Correct 334 ms 705940 KB Output is correct
34 Correct 352 ms 708108 KB Output is correct
35 Correct 349 ms 709176 KB Output is correct
36 Correct 335 ms 709068 KB Output is correct
37 Correct 349 ms 709356 KB Output is correct
38 Correct 316 ms 709384 KB Output is correct
39 Correct 339 ms 716804 KB Output is correct
40 Correct 390 ms 738104 KB Output is correct
41 Correct 383 ms 744884 KB Output is correct
42 Correct 413 ms 752348 KB Output is correct
43 Correct 379 ms 754524 KB Output is correct
44 Correct 387 ms 754728 KB Output is correct
45 Correct 402 ms 745328 KB Output is correct
46 Correct 393 ms 741096 KB Output is correct

Subtask #4
0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 335 ms 704692 KB Output is correct
2 Correct 331 ms 704732 KB Output is correct
3 Correct 351 ms 704716 KB Output is correct
4 Correct 330 ms 704844 KB Output is correct
5 Correct 332 ms 704732 KB Output is correct
6 Correct 314 ms 704716 KB Output is correct
7 Correct 334 ms 704808 KB Output is correct
8 Incorrect 321 ms 704912 KB Output isn't correct
9 Halted 0 ms 0 KB -

Subtask #5
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 335 ms 704692 KB Output is correct
2 Correct 331 ms 704732 KB Output is correct
3 Correct 351 ms 704716 KB Output is correct
4 Correct 330 ms 704844 KB Output is correct
5 Correct 332 ms 704732 KB Output is correct
6 Correct 314 ms 704716 KB Output is correct
7 Correct 334 ms 704808 KB Output is correct
8 Incorrect 321 ms 704912 KB Output isn't correct
9 Halted 0 ms 0 KB -

Subtask #6
0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 332 ms 704808 KB Output is correct
2 Correct 329 ms 704828 KB Output is correct
3 Correct 353 ms 704840 KB Output is correct
4 Correct 335 ms 704848 KB Output is correct
5 Correct 315 ms 704776 KB Output is correct
6 Correct 322 ms 704844 KB Output is correct
7 Correct 339 ms 704768 KB Output is correct
8 Correct 341 ms 704848 KB Output is correct
9 Correct 314 ms 704808 KB Output is correct
10 Correct 323 ms 704880 KB Output is correct
11 Correct 309 ms 704820 KB Output is correct
12 Correct 318 ms 704716 KB Output is correct
13 Correct 335 ms 704696 KB Output is correct
14 Correct 322 ms 704688 KB Output is correct
15 Correct 345 ms 704776 KB Output is correct
16 Correct 315 ms 704832 KB Output is correct
17 Correct 338 ms 704820 KB Output is correct
18 Correct 322 ms 704716 KB Output is correct
19 Correct 329 ms 705984 KB Output is correct
20 Correct 342 ms 706952 KB Output is correct
21 Correct 330 ms 706384 KB Output is correct
22 Correct 341 ms 706148 KB Output is correct
23 Correct 324 ms 706072 KB Output is correct
24 Correct 337 ms 707580 KB Output is correct
25 Correct 328 ms 707612 KB Output is correct
26 Correct 324 ms 705988 KB Output is correct
27 Correct 318 ms 705996 KB Output is correct
28 Correct 345 ms 705996 KB Output is correct
29 Correct 348 ms 708160 KB Output is correct
30 Correct 332 ms 706764 KB Output is correct
31 Correct 329 ms 709184 KB Output is correct
32 Correct 326 ms 708124 KB Output is correct
33 Correct 354 ms 708264 KB Output is correct
34 Correct 333 ms 711828 KB Output is correct
35 Correct 333 ms 711884 KB Output is correct
36 Correct 330 ms 708176 KB Output is correct
37 Correct 326 ms 708296 KB Output is correct
38 Correct 331 ms 708176 KB Output is correct
39 Correct 467 ms 742092 KB Output is correct
40 Correct 342 ms 709040 KB Output is correct
41 Correct 335 ms 713488 KB Output is correct
42 Correct 351 ms 709968 KB Output is correct
43 Correct 373 ms 712432 KB Output is correct
44 Correct 379 ms 722344 KB Output is correct
45 Correct 410 ms 725060 KB Output is correct
46 Correct 404 ms 745040 KB Output is correct
47 Correct 490 ms 742124 KB Output is correct
48 Correct 456 ms 742128 KB Output is correct
49 Correct 536 ms 775280 KB Output is correct
50 Correct 524 ms 775320 KB Output is correct
51 Correct 422 ms 742628 KB Output is correct
52 Correct 461 ms 742308 KB Output is correct
53 Correct 436 ms 742252 KB Output is correct
54 Correct 335 ms 704692 KB Output is correct
55 Correct 331 ms 704732 KB Output is correct
56 Correct 351 ms 704716 KB Output is correct
57 Correct 330 ms 704844 KB Output is correct
58 Correct 332 ms 704732 KB Output is correct
59 Correct 314 ms 704716 KB Output is correct
60 Correct 334 ms 704808 KB Output is correct
61 Incorrect 321 ms 704912 KB Output isn't correct
62 Halted 0 ms 0 KB -

Subtask #7
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 332 ms 704808 KB Output is correct
2 Correct 329 ms 704828 KB Output is correct
3 Correct 353 ms 704840 KB Output is correct
4 Correct 335 ms 704848 KB Output is correct
5 Correct 315 ms 704776 KB Output is correct
6 Correct 322 ms 704844 KB Output is correct
7 Correct 339 ms 704768 KB Output is correct
8 Correct 341 ms 704848 KB Output is correct
9 Correct 314 ms 704808 KB Output is correct
10 Correct 323 ms 704880 KB Output is correct
11 Correct 309 ms 704820 KB Output is correct
12 Correct 318 ms 704716 KB Output is correct
13 Correct 335 ms 704696 KB Output is correct
14 Correct 322 ms 704688 KB Output is correct
15 Correct 345 ms 704776 KB Output is correct
16 Correct 315 ms 704832 KB Output is correct
17 Correct 338 ms 704820 KB Output is correct
18 Correct 322 ms 704716 KB Output is correct
19 Correct 329 ms 705984 KB Output is correct
20 Correct 342 ms 706952 KB Output is correct
21 Correct 330 ms 706384 KB Output is correct
22 Correct 341 ms 706148 KB Output is correct
23 Correct 324 ms 706072 KB Output is correct
24 Correct 337 ms 707580 KB Output is correct
25 Correct 328 ms 707612 KB Output is correct
26 Correct 324 ms 705988 KB Output is correct
27 Correct 318 ms 705996 KB Output is correct
28 Correct 345 ms 705996 KB Output is correct
29 Correct 348 ms 708160 KB Output is correct
30 Correct 332 ms 706764 KB Output is correct
31 Correct 329 ms 709184 KB Output is correct
32 Correct 326 ms 708124 KB Output is correct
33 Correct 354 ms 708264 KB Output is correct
34 Correct 333 ms 711828 KB Output is correct
35 Correct 333 ms 711884 KB Output is correct
36 Correct 330 ms 708176 KB Output is correct
37 Correct 326 ms 708296 KB Output is correct
38 Correct 331 ms 708176 KB Output is correct
39 Correct 467 ms 742092 KB Output is correct
40 Correct 342 ms 709040 KB Output is correct
41 Correct 335 ms 713488 KB Output is correct
42 Correct 351 ms 709968 KB Output is correct
43 Correct 373 ms 712432 KB Output is correct
44 Correct 379 ms 722344 KB Output is correct
45 Correct 410 ms 725060 KB Output is correct
46 Correct 404 ms 745040 KB Output is correct
47 Correct 490 ms 742124 KB Output is correct
48 Correct 456 ms 742128 KB Output is correct
49 Correct 536 ms 775280 KB Output is correct
50 Correct 524 ms 775320 KB Output is correct
51 Correct 422 ms 742628 KB Output is correct
52 Correct 461 ms 742308 KB Output is correct
53 Correct 436 ms 742252 KB Output is correct
54 Correct 335 ms 704692 KB Output is correct
55 Correct 331 ms 704732 KB Output is correct
56 Correct 351 ms 704716 KB Output is correct
57 Correct 330 ms 704844 KB Output is correct
58 Correct 332 ms 704732 KB Output is correct
59 Correct 314 ms 704716 KB Output is correct
60 Correct 334 ms 704808 KB Output is correct
61 Incorrect 321 ms 704912 KB Output isn't correct
62 Halted 0 ms 0 KB -

Subtask #8
0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 332 ms 704808 KB Output is correct
2 Correct 329 ms 704828 KB Output is correct
3 Correct 353 ms 704840 KB Output is correct
4 Correct 335 ms 704848 KB Output is correct
5 Correct 315 ms 704776 KB Output is correct
6 Correct 322 ms 704844 KB Output is correct
7 Correct 339 ms 704768 KB Output is correct
8 Correct 341 ms 704848 KB Output is correct
9 Correct 314 ms 704808 KB Output is correct
10 Correct 323 ms 704880 KB Output is correct
11 Correct 309 ms 704820 KB Output is correct
12 Correct 318 ms 704716 KB Output is correct
13 Correct 335 ms 704696 KB Output is correct
14 Correct 322 ms 704688 KB Output is correct
15 Correct 345 ms 704776 KB Output is correct
16 Correct 315 ms 704832 KB Output is correct
17 Correct 338 ms 704820 KB Output is correct
18 Correct 322 ms 704716 KB Output is correct
19 Correct 329 ms 705984 KB Output is correct
20 Correct 342 ms 706952 KB Output is correct
21 Correct 330 ms 706384 KB Output is correct
22 Correct 341 ms 706148 KB Output is correct
23 Correct 324 ms 706072 KB Output is correct
24 Correct 337 ms 707580 KB Output is correct
25 Correct 328 ms 707612 KB Output is correct
26 Correct 324 ms 705988 KB Output is correct
27 Correct 318 ms 705996 KB Output is correct
28 Correct 345 ms 705996 KB Output is correct
29 Correct 348 ms 708160 KB Output is correct
30 Correct 332 ms 706764 KB Output is correct
31 Correct 329 ms 709184 KB Output is correct
32 Correct 326 ms 708124 KB Output is correct
33 Correct 354 ms 708264 KB Output is correct
34 Correct 333 ms 711828 KB Output is correct
35 Correct 333 ms 711884 KB Output is correct
36 Correct 330 ms 708176 KB Output is correct
37 Correct 326 ms 708296 KB Output is correct
38 Correct 331 ms 708176 KB Output is correct
39 Correct 467 ms 742092 KB Output is correct
40 Correct 342 ms 709040 KB Output is correct
41 Correct 335 ms 713488 KB Output is correct
42 Correct 351 ms 709968 KB Output is correct
43 Correct 373 ms 712432 KB Output is correct
44 Correct 379 ms 722344 KB Output is correct
45 Correct 410 ms 725060 KB Output is correct
46 Correct 404 ms 745040 KB Output is correct
47 Correct 490 ms 742124 KB Output is correct
48 Correct 456 ms 742128 KB Output is correct
49 Correct 536 ms 775280 KB Output is correct
50 Correct 524 ms 775320 KB Output is correct
51 Correct 422 ms 742628 KB Output is correct
52 Correct 461 ms 742308 KB Output is correct
53 Correct 436 ms 742252 KB Output is correct
54 Correct 335 ms 704692 KB Output is correct
55 Correct 331 ms 704732 KB Output is correct
56 Correct 351 ms 704716 KB Output is correct
57 Correct 330 ms 704844 KB Output is correct
58 Correct 332 ms 704732 KB Output is correct
59 Correct 314 ms 704716 KB Output is correct
60 Correct 334 ms 704808 KB Output is correct
61 Incorrect 321 ms 704912 KB Output isn't correct
62 Halted 0 ms 0 KB -