oj.uz

Submission #1100761

# Submission time Handle Problem Language Result Execution time Memory
1100761 2024-10-14T15:41:10 Z Uniq0rn Mecho (IOI09_mecho) C++14
100 / 100
 183 ms 6248 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,1e9));
    int si = -1,sj = -1;
    for(int i=1;i<=n;i++){
        for(int j=1;j<=n;j++){
            cin >> a[i][j];
            if(a[i][j] == 'H'){
                bdist[i][j] = 0;
                qu.push({i,j});
            }
            if(a[i][j] == 'M'){
                si = i;
                sj = j;
            }
        }
    }
    while(sz(qu)){
        int ni = qu.front().first,nj = qu.front().second;
        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(bdist[ii][jj] != 1e9 || a[ii][jj] == 'T' || a[ii][jj] == 'D') continue;
            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;
        //cout << mid << '\n';
        if(bdist[si][sj] <= mid){
            r = mid - 1;
            continue;
        }
        vector<vector<int>> dist(n + 1,vector<int>(n + 1,-1));
        queue<pair<int,int>> q;
        q.push({si,sj});
        dist[si][sj] = 0;
        bool ok = false;
        while(sz(q)){
            int ni = q.front().first,nj = q.front().second;
            q.pop();
            if(a[ni][nj] == 'D'){
                ok = true;
                break;
            }
            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(dist[ii][jj] != -1) continue;
                if(bdist[ii][jj] - mid <= (dist[ni][nj] + 1) / s) continue;
                if(a[ii][jj] == 'T') continue;
                //cout << ni << ' ' << nj << ' ' << (dist[ni][nj] + s - 1) / s  <<   '\n';
                dist[ii][jj] = dist[ni][nj] + 1;
                q.push({ii,jj});
            }
        }
        /*
        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 348 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 504 KB Output is correct
5 Correct 1 ms 336 KB Output is correct
6 Correct 1 ms 336 KB Output is correct
7 Correct 94 ms 6204 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 336 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 504 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 336 KB Output is correct
33 Correct 7 ms 1584 KB Output is correct
34 Correct 7 ms 1572 KB Output is correct
35 Correct 22 ms 1596 KB Output is correct
36 Correct 8 ms 1872 KB Output is correct
37 Correct 9 ms 1872 KB Output is correct
38 Correct 27 ms 1872 KB Output is correct
39 Correct 9 ms 2336 KB Output is correct
40 Correct 11 ms 2288 KB Output is correct
41 Correct 39 ms 2288 KB Output is correct
42 Correct 16 ms 2728 KB Output is correct
43 Correct 14 ms 2776 KB Output is correct
44 Correct 47 ms 2688 KB Output is correct
45 Correct 20 ms 3200 KB Output is correct
46 Correct 16 ms 3356 KB Output is correct
47 Correct 56 ms 3152 KB Output is correct
48 Correct 19 ms 3724 KB Output is correct
49 Correct 18 ms 3892 KB Output is correct
50 Correct 64 ms 3700 KB Output is correct
51 Correct 22 ms 4288 KB Output is correct
52 Correct 22 ms 4288 KB Output is correct
53 Correct 82 ms 4284 KB Output is correct
54 Correct 30 ms 4864 KB Output is correct
55 Correct 26 ms 4900 KB Output is correct
56 Correct 95 ms 4852 KB Output is correct
57 Correct 31 ms 5584 KB Output is correct
58 Correct 32 ms 5584 KB Output is correct
59 Correct 122 ms 5516 KB Output is correct
60 Correct 39 ms 6208 KB Output is correct
61 Correct 33 ms 6216 KB Output is correct
62 Correct 121 ms 6204 KB Output is correct
63 Correct 103 ms 6192 KB Output is correct
64 Correct 183 ms 6180 KB Output is correct
65 Correct 139 ms 6212 KB Output is correct
66 Correct 113 ms 6192 KB Output is correct
67 Correct 114 ms 6188 KB Output is correct
68 Correct 52 ms 6180 KB Output is correct
69 Correct 51 ms 6216 KB Output is correct
70 Correct 39 ms 6180 KB Output is correct
71 Correct 47 ms 6216 KB Output is correct
72 Correct 31 ms 6172 KB Output is correct
73 Correct 29 ms 6240 KB Output is correct
74 Correct 65 ms 6236 KB Output is correct
75 Correct 72 ms 6220 KB Output is correct
76 Correct 64 ms 6224 KB Output is correct
77 Correct 62 ms 6224 KB Output is correct
78 Correct 81 ms 6224 KB Output is correct
79 Correct 54 ms 6232 KB Output is correct
80 Correct 64 ms 6248 KB Output is correct
81 Correct 69 ms 6240 KB Output is correct
82 Correct 65 ms 6220 KB Output is correct
83 Correct 80 ms 6224 KB Output is correct
84 Correct 72 ms 6224 KB Output is correct
85 Correct 81 ms 6232 KB Output is correct
86 Correct 84 ms 6224 KB Output is correct
87 Correct 84 ms 6224 KB Output is correct
88 Correct 87 ms 6216 KB Output is correct
89 Correct 87 ms 6232 KB Output is correct
90 Correct 99 ms 6224 KB Output is correct
91 Correct 84 ms 6224 KB Output is correct
92 Correct 94 ms 6192 KB Output is correct