oj.uz

Submission #1080821

# Submission time Handle Problem Language Result Execution time Memory
1080821 2024-08-29T14:35:20 Z TrinhKhanhDung Maze (JOI23_ho_t3) C++14
8 / 100
 169 ms 35488 KB 
#include <bits/stdc++.h>
#define ll long long
#define fi first
#define se second
#define sz(x) (int)x.size()
#define ALL(v) v.begin(),v.end()
#define MASK(k) (1LL << (k))
#define BIT(x, i) (((x) >> (i)) & 1)
#define oo (ll)1e18
#define INF (ll)1e9
#define MOD (ll)(998244353)

using namespace std;

template<class T1, class T2>
    bool maximize(T1 &a, T2 b){if(a < b){a = b; return true;} return false;}

template<class T1, class T2>
    bool minimize(T1 &a, T2 b){if(a > b){a = b; return true;} return false;}

template<class T1, class T2>
    void add(T1 &a, T2 b){a += b; if(a >= MOD) a -= MOD;}

template<class T1, class T2>
    void sub(T1 &a, T2 b){a -= b; if(a < 0) a += MOD;}

template<class T>
    void cps(T &v){sort(ALL(v)); v.resize(unique(ALL(v)) - v.begin());}

const int dx[] = {0, 0, 1, -1}, dy[] = {1, -1, 0, 0};

int N, M, L;
int sx, sy, tx, ty;
vector<vector<char>> a;
vector<vector<int>> d;

void solve(){
    cin >> N >> M >> L;
    cin >> sx >> sy >> tx >> ty;
    a.resize(N + 3, vector<char>(M + 3, 0));
    d.resize(N + 3, vector<int>(M + 3, INF));
    for(int i=1; i<=N; i++){
        for(int j=1; j<=M; j++){
            cin >> a[i][j];
        }
    }

    queue<pair<int, int>> q;
    q.push({sx, sy});
    d[sx][sy] = 0;
    
    while(true){
        vector<pair<int, int>> pos;
        while(sz(q)){
            int x = q.front().fi;
            int y = q.front().se;
            q.pop();
            pos.push_back({x, y});
            for(int k=0; k<4; k++){
                int nx = x + dx[k], ny = y + dy[k];
                if(nx < 1 || nx > N || ny < 1 || ny > M || a[nx][ny] == '#') continue;
                if(minimize(d[nx][ny], d[x][y])){
                    q.push({nx, ny});
                }
            }
        }
        for(auto o: pos){
            queue<pair<int, int>> qq;
            qq.push({o.fi, o.se});
            while(sz(qq)){
                int x = qq.front().fi;
                int y = qq.front().se;
                qq.pop();
                for(int k=0; k<4; k++){
                    int nx = x + dx[k], ny = y + dy[k];
                    if(nx < 1 || nx > N || ny < 1 || ny > M) continue;
                    int t1 = abs(nx - o.fi), t2 = abs(ny - o.se);
                    if(t1 > L || t2 > L || t1 + t2 == 2 * L) continue;
                    if(minimize(d[nx][ny], d[o.fi][o.se] + 1)){
                        qq.push({nx, ny});
                        q.push({nx, ny});
                    }
                }
            }
        }
        if(d[tx][ty] < INF) break;
    }

    // for(int i=1; i<=N; i++){
    //     for(int j=1; j<=M; j++){
    //         cout << d[i][j] << ' ';
    //     }
    //     cout << '\n';
    // }
    cout << d[tx][ty] << '\n';  
}

int main(){
    ios_base::sync_with_stdio(0); cin.tie(0);
    // freopen("flowers.inp", "r", stdin);
    // freopen("flowers.out", "w", stdout);

    int nTest = 1;

    while(nTest--)
        solve();

    return 0;
}

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 604 KB Output is correct
5 Correct 0 ms 456 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 344 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 344 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 1 ms 352 KB Output is correct
17 Correct 1 ms 344 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 5 ms 832 KB Output is correct
20 Correct 4 ms 1476 KB Output is correct
21 Correct 8 ms 1748 KB Output is correct
22 Correct 6 ms 860 KB Output is correct
23 Correct 6 ms 604 KB Output is correct
24 Correct 5 ms 1880 KB Output is correct
25 Correct 5 ms 1884 KB Output is correct
26 Correct 2 ms 860 KB Output is correct
27 Correct 2 ms 860 KB Output is correct
28 Correct 4 ms 720 KB Output is correct
29 Correct 17 ms 1372 KB Output is correct
30 Correct 5 ms 1372 KB Output is correct
31 Correct 14 ms 3332 KB Output is correct
32 Correct 16 ms 1368 KB Output is correct
33 Correct 14 ms 1384 KB Output is correct
34 Correct 13 ms 3784 KB Output is correct
35 Correct 22 ms 4036 KB Output is correct
36 Correct 10 ms 1600 KB Output is correct
37 Correct 14 ms 1372 KB Output is correct
38 Correct 3 ms 1372 KB Output is correct
39 Correct 169 ms 9420 KB Output is correct
40 Correct 7 ms 1628 KB Output is correct
41 Correct 9 ms 4768 KB Output is correct
42 Correct 23 ms 1624 KB Output is correct
43 Correct 24 ms 3932 KB Output is correct
44 Correct 31 ms 6520 KB Output is correct
45 Correct 41 ms 7492 KB Output is correct
46 Correct 138 ms 27076 KB Output is correct
47 Correct 158 ms 9452 KB Output is correct
48 Correct 147 ms 9424 KB Output is correct
49 Correct 84 ms 35488 KB Output is correct
50 Correct 98 ms 35484 KB Output is correct
51 Correct 130 ms 10584 KB Output is correct
52 Correct 95 ms 9892 KB Output is correct
53 Correct 136 ms 9328 KB Output is correct

Subtask #2
0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 460 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Incorrect 0 ms 348 KB Output isn't correct
9 Halted 0 ms 0 KB -

Subtask #3
0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 344 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 452 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 344 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 604 KB Output is correct
21 Incorrect 0 ms 348 KB Output isn't correct
22 Halted 0 ms 0 KB -

Subtask #4
0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 460 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Incorrect 0 ms 348 KB Output isn't correct
9 Halted 0 ms 0 KB -

Subtask #5
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 460 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Incorrect 0 ms 348 KB Output isn't correct
9 Halted 0 ms 0 KB -

Subtask #6
0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 604 KB Output is correct
5 Correct 0 ms 456 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 344 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 344 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 1 ms 352 KB Output is correct
17 Correct 1 ms 344 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 5 ms 832 KB Output is correct
20 Correct 4 ms 1476 KB Output is correct
21 Correct 8 ms 1748 KB Output is correct
22 Correct 6 ms 860 KB Output is correct
23 Correct 6 ms 604 KB Output is correct
24 Correct 5 ms 1880 KB Output is correct
25 Correct 5 ms 1884 KB Output is correct
26 Correct 2 ms 860 KB Output is correct
27 Correct 2 ms 860 KB Output is correct
28 Correct 4 ms 720 KB Output is correct
29 Correct 17 ms 1372 KB Output is correct
30 Correct 5 ms 1372 KB Output is correct
31 Correct 14 ms 3332 KB Output is correct
32 Correct 16 ms 1368 KB Output is correct
33 Correct 14 ms 1384 KB Output is correct
34 Correct 13 ms 3784 KB Output is correct
35 Correct 22 ms 4036 KB Output is correct
36 Correct 10 ms 1600 KB Output is correct
37 Correct 14 ms 1372 KB Output is correct
38 Correct 3 ms 1372 KB Output is correct
39 Correct 169 ms 9420 KB Output is correct
40 Correct 7 ms 1628 KB Output is correct
41 Correct 9 ms 4768 KB Output is correct
42 Correct 23 ms 1624 KB Output is correct
43 Correct 24 ms 3932 KB Output is correct
44 Correct 31 ms 6520 KB Output is correct
45 Correct 41 ms 7492 KB Output is correct
46 Correct 138 ms 27076 KB Output is correct
47 Correct 158 ms 9452 KB Output is correct
48 Correct 147 ms 9424 KB Output is correct
49 Correct 84 ms 35488 KB Output is correct
50 Correct 98 ms 35484 KB Output is correct
51 Correct 130 ms 10584 KB Output is correct
52 Correct 95 ms 9892 KB Output is correct
53 Correct 136 ms 9328 KB Output is correct
54 Correct 0 ms 348 KB Output is correct
55 Correct 0 ms 460 KB Output is correct
56 Correct 1 ms 348 KB Output is correct
57 Correct 0 ms 348 KB Output is correct
58 Correct 0 ms 348 KB Output is correct
59 Correct 0 ms 348 KB Output is correct
60 Correct 0 ms 348 KB Output is correct
61 Incorrect 0 ms 348 KB Output isn't correct
62 Halted 0 ms 0 KB -

Subtask #7
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 604 KB Output is correct
5 Correct 0 ms 456 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 344 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 344 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 1 ms 352 KB Output is correct
17 Correct 1 ms 344 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 5 ms 832 KB Output is correct
20 Correct 4 ms 1476 KB Output is correct
21 Correct 8 ms 1748 KB Output is correct
22 Correct 6 ms 860 KB Output is correct
23 Correct 6 ms 604 KB Output is correct
24 Correct 5 ms 1880 KB Output is correct
25 Correct 5 ms 1884 KB Output is correct
26 Correct 2 ms 860 KB Output is correct
27 Correct 2 ms 860 KB Output is correct
28 Correct 4 ms 720 KB Output is correct
29 Correct 17 ms 1372 KB Output is correct
30 Correct 5 ms 1372 KB Output is correct
31 Correct 14 ms 3332 KB Output is correct
32 Correct 16 ms 1368 KB Output is correct
33 Correct 14 ms 1384 KB Output is correct
34 Correct 13 ms 3784 KB Output is correct
35 Correct 22 ms 4036 KB Output is correct
36 Correct 10 ms 1600 KB Output is correct
37 Correct 14 ms 1372 KB Output is correct
38 Correct 3 ms 1372 KB Output is correct
39 Correct 169 ms 9420 KB Output is correct
40 Correct 7 ms 1628 KB Output is correct
41 Correct 9 ms 4768 KB Output is correct
42 Correct 23 ms 1624 KB Output is correct
43 Correct 24 ms 3932 KB Output is correct
44 Correct 31 ms 6520 KB Output is correct
45 Correct 41 ms 7492 KB Output is correct
46 Correct 138 ms 27076 KB Output is correct
47 Correct 158 ms 9452 KB Output is correct
48 Correct 147 ms 9424 KB Output is correct
49 Correct 84 ms 35488 KB Output is correct
50 Correct 98 ms 35484 KB Output is correct
51 Correct 130 ms 10584 KB Output is correct
52 Correct 95 ms 9892 KB Output is correct
53 Correct 136 ms 9328 KB Output is correct
54 Correct 0 ms 348 KB Output is correct
55 Correct 0 ms 460 KB Output is correct
56 Correct 1 ms 348 KB Output is correct
57 Correct 0 ms 348 KB Output is correct
58 Correct 0 ms 348 KB Output is correct
59 Correct 0 ms 348 KB Output is correct
60 Correct 0 ms 348 KB Output is correct
61 Incorrect 0 ms 348 KB Output isn't correct
62 Halted 0 ms 0 KB -

Subtask #8
0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 604 KB Output is correct
5 Correct 0 ms 456 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 344 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 344 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 1 ms 352 KB Output is correct
17 Correct 1 ms 344 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 5 ms 832 KB Output is correct
20 Correct 4 ms 1476 KB Output is correct
21 Correct 8 ms 1748 KB Output is correct
22 Correct 6 ms 860 KB Output is correct
23 Correct 6 ms 604 KB Output is correct
24 Correct 5 ms 1880 KB Output is correct
25 Correct 5 ms 1884 KB Output is correct
26 Correct 2 ms 860 KB Output is correct
27 Correct 2 ms 860 KB Output is correct
28 Correct 4 ms 720 KB Output is correct
29 Correct 17 ms 1372 KB Output is correct
30 Correct 5 ms 1372 KB Output is correct
31 Correct 14 ms 3332 KB Output is correct
32 Correct 16 ms 1368 KB Output is correct
33 Correct 14 ms 1384 KB Output is correct
34 Correct 13 ms 3784 KB Output is correct
35 Correct 22 ms 4036 KB Output is correct
36 Correct 10 ms 1600 KB Output is correct
37 Correct 14 ms 1372 KB Output is correct
38 Correct 3 ms 1372 KB Output is correct
39 Correct 169 ms 9420 KB Output is correct
40 Correct 7 ms 1628 KB Output is correct
41 Correct 9 ms 4768 KB Output is correct
42 Correct 23 ms 1624 KB Output is correct
43 Correct 24 ms 3932 KB Output is correct
44 Correct 31 ms 6520 KB Output is correct
45 Correct 41 ms 7492 KB Output is correct
46 Correct 138 ms 27076 KB Output is correct
47 Correct 158 ms 9452 KB Output is correct
48 Correct 147 ms 9424 KB Output is correct
49 Correct 84 ms 35488 KB Output is correct
50 Correct 98 ms 35484 KB Output is correct
51 Correct 130 ms 10584 KB Output is correct
52 Correct 95 ms 9892 KB Output is correct
53 Correct 136 ms 9328 KB Output is correct
54 Correct 0 ms 348 KB Output is correct
55 Correct 0 ms 460 KB Output is correct
56 Correct 1 ms 348 KB Output is correct
57 Correct 0 ms 348 KB Output is correct
58 Correct 0 ms 348 KB Output is correct
59 Correct 0 ms 348 KB Output is correct
60 Correct 0 ms 348 KB Output is correct
61 Incorrect 0 ms 348 KB Output isn't correct
62 Halted 0 ms 0 KB -