oj.uz

Submission #1100683

# Submission time Handle Problem Language Result Execution time Memory
1100683 2024-10-14T12:47:15 Z Uniq0rn Mecho (IOI09_mecho) C++14
30 / 100
 153 ms 6352 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>> q;
    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;
                q.push({i,j});
            }
            if(a[i][j] == 'M'){
                si = i;
                sj = j;
            }
        }
    }
    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(bdist[ii][jj] != 1e9 || a[ii][jj] == 'T' || a[ii][jj] == 'D') continue;
            bdist[ii][jj] = bdist[ni][nj] + 1;
            q.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 = bdist[si][sj];
    while(l < r){
        int mid = (l + r + 1) >> 1;
        //cout << mid << '\n';
        vector<vector<int>> dist(n + 1,vector<int>(n + 1,-1));
        q.push({si,sj});
        dist[si][sj] = mid * s;
        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(dist[ii][jj] != -1) continue;
                if(bdist[ii][jj] < (dist[ni][nj] + s) / 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});
                if(a[ii][jj] == 'D') 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;
            ans = l;
        }
        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
30.0 / 100.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 336 KB Output isn't correct
2 Incorrect 1 ms 336 KB Output isn't correct
3 Incorrect 0 ms 336 KB Output isn't correct
4 Incorrect 1 ms 336 KB Output isn't correct
5 Incorrect 1 ms 352 KB Output isn't correct
6 Correct 0 ms 336 KB Output is correct
7 Correct 80 ms 6232 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 0 ms 336 KB Output is correct
12 Incorrect 1 ms 336 KB Output isn't correct
13 Incorrect 1 ms 336 KB Output isn't correct
14 Correct 1 ms 336 KB Output is correct
15 Incorrect 0 ms 336 KB Output isn't correct
16 Correct 1 ms 336 KB Output is correct
17 Incorrect 1 ms 336 KB Output isn't correct
18 Correct 1 ms 336 KB Output is correct
19 Incorrect 1 ms 336 KB Output isn't correct
20 Correct 1 ms 336 KB Output is correct
21 Incorrect 1 ms 336 KB Output isn't correct
22 Correct 1 ms 336 KB Output is correct
23 Incorrect 1 ms 336 KB Output isn't correct
24 Correct 1 ms 336 KB Output is correct
25 Incorrect 1 ms 336 KB Output isn't correct
26 Correct 1 ms 336 KB Output is correct
27 Incorrect 1 ms 336 KB Output isn't correct
28 Correct 1 ms 336 KB Output is correct
29 Incorrect 1 ms 336 KB Output isn't correct
30 Correct 1 ms 336 KB Output is correct
31 Incorrect 1 ms 336 KB Output isn't correct
32 Correct 2 ms 336 KB Output is correct
33 Incorrect 8 ms 1556 KB Output isn't correct
34 Correct 9 ms 1572 KB Output is correct
35 Correct 23 ms 1600 KB Output is correct
36 Incorrect 11 ms 1872 KB Output isn't correct
37 Correct 12 ms 1872 KB Output is correct
38 Correct 29 ms 1924 KB Output is correct
39 Incorrect 14 ms 2304 KB Output isn't correct
40 Correct 15 ms 2336 KB Output is correct
41 Correct 37 ms 2288 KB Output is correct
42 Incorrect 16 ms 2940 KB Output isn't correct
43 Correct 17 ms 2776 KB Output is correct
44 Correct 45 ms 2688 KB Output is correct
45 Incorrect 21 ms 3216 KB Output isn't correct
46 Correct 23 ms 3164 KB Output is correct
47 Correct 53 ms 3168 KB Output is correct
48 Incorrect 22 ms 3696 KB Output isn't correct
49 Correct 24 ms 3756 KB Output is correct
50 Correct 64 ms 3692 KB Output is correct
51 Incorrect 30 ms 4320 KB Output isn't correct
52 Correct 31 ms 4264 KB Output is correct
53 Correct 83 ms 4288 KB Output is correct
54 Incorrect 36 ms 4892 KB Output isn't correct
55 Correct 36 ms 4884 KB Output is correct
56 Correct 94 ms 4872 KB Output is correct
57 Incorrect 45 ms 5688 KB Output isn't correct
58 Correct 41 ms 5584 KB Output is correct
59 Correct 114 ms 5536 KB Output is correct
60 Incorrect 44 ms 6240 KB Output isn't correct
61 Correct 47 ms 6216 KB Output is correct
62 Correct 133 ms 6352 KB Output is correct
63 Incorrect 97 ms 6192 KB Output isn't correct
64 Correct 153 ms 6188 KB Output is correct
65 Correct 142 ms 6184 KB Output is correct
66 Incorrect 120 ms 6200 KB Output isn't correct
67 Correct 113 ms 6204 KB Output is correct
68 Incorrect 60 ms 6228 KB Output isn't correct
69 Correct 44 ms 6224 KB Output is correct
70 Correct 46 ms 6172 KB Output is correct
71 Correct 42 ms 6192 KB Output is correct
72 Incorrect 40 ms 6188 KB Output isn't correct
73 Incorrect 39 ms 6216 KB Output isn't correct
74 Correct 70 ms 6224 KB Output is correct
75 Correct 72 ms 6232 KB Output is correct
76 Correct 74 ms 6228 KB Output is correct
77 Correct 71 ms 6224 KB Output is correct
78 Correct 72 ms 6224 KB Output is correct
79 Correct 57 ms 6240 KB Output is correct
80 Correct 63 ms 6216 KB Output is correct
81 Correct 73 ms 6216 KB Output is correct
82 Correct 65 ms 6204 KB Output is correct
83 Incorrect 77 ms 6220 KB Output isn't correct
84 Correct 77 ms 6224 KB Output is correct
85 Correct 72 ms 6236 KB Output is correct
86 Correct 81 ms 6224 KB Output is correct
87 Correct 82 ms 6212 KB Output is correct
88 Incorrect 77 ms 6216 KB Output isn't correct
89 Correct 84 ms 6236 KB Output is correct
90 Correct 90 ms 6224 KB Output is correct
91 Correct 89 ms 6216 KB Output is correct
92 Correct 85 ms 6164 KB Output is correct