oj.uz

Submission #1100760

# Submission time Handle Problem Language Result Execution time Memory
1100760 2024-10-14T15:38:48 Z Uniq0rn Mecho (IOI09_mecho) C++14
100 / 100
 177 ms 6604 KB 
#include <bits/stdc++.h>
using namespace std;
 
#define ld long double 
#define ll long long int
#define pi pair<int,int>
#define sz(x) (int)x.size()
#define all(x) begin(x),end(x)
 
int main()
{
    cin.tie(0)->sync_with_stdio(0);
    int n,s;cin >> n >> s;
    vector<vector<char>> a(n + 1,vector<char>(n + 1));
    queue<pair<int,int>> qu;
    vector<vector<int>> bdist(n + 1,vector<int>(n + 1));
    vector<vector<bool>> bvis(n + 1,vector<bool>(n + 1));
    int si = -1,sj = -1,ei = -1,ej = -1;
    for(int i=1;i<=n;i++){
        for(int j=1;j<=n;j++){
            cin >> a[i][j];
            if(a[i][j] == 'H'){
                bvis[i][j] = true;
                qu.push({i,j});
            }
            if(a[i][j] == 'M'){
                si = i;
                sj = j;
            }
            if(a[i][j] == 'D'){
                ei = i;
                ej = j;
            }
        }
    }
    while(sz(qu)){
        int ni = qu.front().first,nj = qu.front().second;
        //cout << ni << ' ' << nj << '\n';
        qu.pop();
        for(int i=-1;i<=1;i++) for(int j=-1;j<=1;j++){
            if(abs(i) == abs(j)) continue;
            int ii = ni + i,jj = nj + j;
            if(ii < 1 || ii > n || jj < 1 || jj > n) continue;
            if(bvis[ii][jj] || a[ii][jj] == 'T' || a[ii][jj] == 'D') continue;
            bvis[ii][jj] = true;
            bdist[ii][jj] = bdist[ni][nj] + 1;
            qu.push({ii,jj});
        }
    }
    /*
    for(int i=1;i<=n;i++){
        for(int j=1;j<=n;j++){
            cout << (bdist[i][j] == 1e9 ? -1 : bdist[i][j]) << ' ';
        }
        cout << '\n';
    }
    cout << "---------------------------------------------\n";
    */
    int ans = -1;
    int l = 0,r = n * n;
    while(l <= r){
        int mid = (l + r) >> 1;
        if(bdist[si][sj] <= mid){
            r = mid - 1;
            continue;
        }
        //cout << mid << '\n';
        vector<vector<int>> dist(n + 1,vector<int>(n + 1));
        vector<vector<bool>> vis(n + 1,vector<bool>(n + 1));
        queue<pair<int,int>> q;
        q.push({si,sj});
        vis[si][sj] = true;
        bool ok = false;
        while(sz(q)){
            int ni = q.front().first,nj = q.front().second;
            q.pop();
            for(int i=-1;i<=1;i++) for(int j=-1;j<=1;j++){
                if(abs(i) == abs(j)) continue;
                int ii = ni + i,jj = nj + j;
                if(ii < 1 || ii > n || jj < 1 || jj > n) continue;
                if(vis[ii][jj]) continue;
                if(a[ii][jj] == 'T' || a[ii][jj] == 'H') continue;
                if(bdist[ii][jj] <= mid + (dist[ni][nj] + 1) / s) continue;
                vis[ii][jj] = true;
                dist[ii][jj] = dist[ni][nj] + 1;
                q.push({ii,jj});
            }
        }
        for(int i=-1;i<=1;i++) for(int j=-1;j<=1;j++){
            if(abs(i) == abs(j)) continue;
            int ii = ei + i,jj = ej + j;
            if(ii < 1 || ii > n || jj < 1 || jj > n) continue;
            if(a[ii][jj] == 'T' || a[ii][jj] == 'H') continue;
            if(!vis[ii][jj]) continue;
            if(dist[ii][jj] / s + mid >= bdist[ii][jj]) continue;
            ok = true;
        }
        /*
        for(int i=1;i<=n;i++) {
            for(int j=1;j<=n;j++) {
                cout << dist[i][j] << ' ';
            }
            cout << '\n';
        }
        */
        if(ok){
            l = mid + 1;
            ans = mid;
        }
        else r = mid - 1;
    }
    cout << ans;
    /*
    for(int i=1;i<=n;i++){
        for(int j=1;j<=n;j++){
            cout << bdist[i][j] << ' ';
        }
        cout << '\n';
    }
    */
    return 0;
}

Subtask #1
100.0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 1 ms 336 KB Output is correct
3 Correct 1 ms 336 KB Output is correct
4 Correct 1 ms 336 KB Output is correct
5 Correct 1 ms 336 KB Output is correct
6 Correct 1 ms 336 KB Output is correct
7 Correct 84 ms 6336 KB Output is correct
8 Correct 1 ms 336 KB Output is correct
9 Correct 1 ms 336 KB Output is correct
10 Correct 1 ms 336 KB Output is correct
11 Correct 1 ms 336 KB Output is correct
12 Correct 1 ms 336 KB Output is correct
13 Correct 1 ms 336 KB Output is correct
14 Correct 1 ms 336 KB Output is correct
15 Correct 1 ms 336 KB Output is correct
16 Correct 1 ms 336 KB Output is correct
17 Correct 1 ms 336 KB Output is correct
18 Correct 1 ms 336 KB Output is correct
19 Correct 1 ms 336 KB Output is correct
20 Correct 1 ms 336 KB Output is correct
21 Correct 1 ms 484 KB Output is correct
22 Correct 1 ms 504 KB Output is correct
23 Correct 1 ms 336 KB Output is correct
24 Correct 1 ms 336 KB Output is correct
25 Correct 1 ms 336 KB Output is correct
26 Correct 1 ms 336 KB Output is correct
27 Correct 1 ms 336 KB Output is correct
28 Correct 1 ms 336 KB Output is correct
29 Correct 1 ms 336 KB Output is correct
30 Correct 1 ms 336 KB Output is correct
31 Correct 1 ms 336 KB Output is correct
32 Correct 1 ms 504 KB Output is correct
33 Correct 5 ms 1616 KB Output is correct
34 Correct 6 ms 1616 KB Output is correct
35 Correct 21 ms 1868 KB Output is correct
36 Correct 7 ms 1872 KB Output is correct
37 Correct 13 ms 1872 KB Output is correct
38 Correct 33 ms 2008 KB Output is correct
39 Correct 8 ms 2556 KB Output is correct
40 Correct 9 ms 2312 KB Output is correct
41 Correct 39 ms 2368 KB Output is correct
42 Correct 11 ms 2640 KB Output is correct
43 Correct 12 ms 2640 KB Output is correct
44 Correct 49 ms 2840 KB Output is correct
45 Correct 22 ms 3152 KB Output is correct
46 Correct 14 ms 3152 KB Output is correct
47 Correct 81 ms 3320 KB Output is correct
48 Correct 14 ms 3636 KB Output is correct
49 Correct 16 ms 3664 KB Output is correct
50 Correct 65 ms 3820 KB Output is correct
51 Correct 16 ms 4432 KB Output is correct
52 Correct 18 ms 4432 KB Output is correct
53 Correct 80 ms 4432 KB Output is correct
54 Correct 20 ms 4944 KB Output is correct
55 Correct 39 ms 4812 KB Output is correct
56 Correct 131 ms 4808 KB Output is correct
57 Correct 37 ms 5712 KB Output is correct
58 Correct 26 ms 5712 KB Output is correct
59 Correct 137 ms 5740 KB Output is correct
60 Correct 25 ms 6224 KB Output is correct
61 Correct 28 ms 6224 KB Output is correct
62 Correct 137 ms 6604 KB Output is correct
63 Correct 99 ms 6324 KB Output is correct
64 Correct 177 ms 6392 KB Output is correct
65 Correct 132 ms 6296 KB Output is correct
66 Correct 111 ms 6400 KB Output is correct
67 Correct 106 ms 6312 KB Output is correct
68 Correct 54 ms 6456 KB Output is correct
69 Correct 55 ms 6452 KB Output is correct
70 Correct 45 ms 6424 KB Output is correct
71 Correct 50 ms 6456 KB Output is correct
72 Correct 47 ms 6440 KB Output is correct
73 Correct 31 ms 6216 KB Output is correct
74 Correct 63 ms 6456 KB Output is correct
75 Correct 77 ms 6444 KB Output is correct
76 Correct 67 ms 6456 KB Output is correct
77 Correct 67 ms 6448 KB Output is correct
78 Correct 90 ms 6236 KB Output is correct
79 Correct 56 ms 6352 KB Output is correct
80 Correct 90 ms 6244 KB Output is correct
81 Correct 81 ms 6296 KB Output is correct
82 Correct 66 ms 6432 KB Output is correct
83 Correct 79 ms 6448 KB Output is correct
84 Correct 74 ms 6484 KB Output is correct
85 Correct 73 ms 6456 KB Output is correct
86 Correct 77 ms 6432 KB Output is correct
87 Correct 91 ms 6440 KB Output is correct
88 Correct 86 ms 6424 KB Output is correct
89 Correct 87 ms 6368 KB Output is correct
90 Correct 91 ms 6424 KB Output is correct
91 Correct 78 ms 6408 KB Output is correct
92 Correct 98 ms 6424 KB Output is correct