oj.uz

Submission #1100755

# Submission time Handle Problem Language Result Execution time Memory
1100755 2024-10-14T15:28:40 Z Uniq0rn Mecho (IOI09_mecho) C++14
89 / 100
 187 ms 6508 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;
        //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
89.0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 0 ms 336 KB Output is correct
3 Correct 1 ms 504 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 97 ms 6452 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 Incorrect 1 ms 336 KB Output isn't correct
14 Correct 1 ms 504 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 336 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 504 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 1660 KB Output is correct
34 Correct 7 ms 1668 KB Output is correct
35 Correct 24 ms 1640 KB Output is correct
36 Correct 7 ms 1832 KB Output is correct
37 Correct 9 ms 1872 KB Output is correct
38 Correct 31 ms 1980 KB Output is correct
39 Correct 9 ms 2424 KB Output is correct
40 Correct 10 ms 2412 KB Output is correct
41 Correct 56 ms 2416 KB Output is correct
42 Correct 11 ms 2908 KB Output is correct
43 Correct 14 ms 2800 KB Output is correct
44 Correct 53 ms 2864 KB Output is correct
45 Correct 14 ms 3288 KB Output is correct
46 Correct 16 ms 3288 KB Output is correct
47 Correct 61 ms 3336 KB Output is correct
48 Correct 15 ms 3676 KB Output is correct
49 Correct 17 ms 3680 KB Output is correct
50 Correct 72 ms 3868 KB Output is correct
51 Correct 17 ms 4220 KB Output is correct
52 Correct 19 ms 4432 KB Output is correct
53 Correct 87 ms 4432 KB Output is correct
54 Correct 20 ms 4944 KB Output is correct
55 Correct 22 ms 4944 KB Output is correct
56 Correct 104 ms 5072 KB Output is correct
57 Correct 22 ms 5712 KB Output is correct
58 Correct 27 ms 5712 KB Output is correct
59 Correct 123 ms 5776 KB Output is correct
60 Correct 25 ms 6264 KB Output is correct
61 Correct 31 ms 6300 KB Output is correct
62 Correct 141 ms 6456 KB Output is correct
63 Correct 106 ms 6468 KB Output is correct
64 Correct 187 ms 6432 KB Output is correct
65 Correct 145 ms 6440 KB Output is correct
66 Correct 117 ms 6480 KB Output is correct
67 Correct 112 ms 6432 KB Output is correct
68 Correct 67 ms 6492 KB Output is correct
69 Correct 69 ms 6468 KB Output is correct
70 Correct 58 ms 6500 KB Output is correct
71 Correct 64 ms 6484 KB Output is correct
72 Incorrect 53 ms 6480 KB Output isn't correct
73 Incorrect 61 ms 6480 KB Output isn't correct
74 Correct 77 ms 6472 KB Output is correct
75 Correct 90 ms 6488 KB Output is correct
76 Correct 88 ms 6492 KB Output is correct
77 Correct 80 ms 6456 KB Output is correct
78 Correct 91 ms 6276 KB Output is correct
79 Correct 70 ms 6288 KB Output is correct
80 Correct 81 ms 6392 KB Output is correct
81 Correct 91 ms 6440 KB Output is correct
82 Correct 89 ms 6464 KB Output is correct
83 Correct 95 ms 6500 KB Output is correct
84 Correct 91 ms 6472 KB Output is correct
85 Correct 93 ms 6440 KB Output is correct
86 Correct 92 ms 6448 KB Output is correct
87 Correct 98 ms 6480 KB Output is correct
88 Correct 96 ms 6460 KB Output is correct
89 Correct 105 ms 6492 KB Output is correct
90 Correct 106 ms 6508 KB Output is correct
91 Correct 98 ms 6468 KB Output is correct
92 Correct 106 ms 6452 KB Output is correct