oj.uz

Submission #1100685

# Submission time Handle Problem Language Result Execution time Memory
1100685 2024-10-14T12:49:20 Z Uniq0rn Mecho (IOI09_mecho) C++14
29 / 100
 151 ms 6256 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 l = 0,r = bdist[si][sj] + 1;
    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;
        }
        else r = mid - 1;
    }
    cout << (l == bdist[si][sj] + 1 ? -1 : l);
    /*
    for(int i=1;i<=n;i++){
        for(int j=1;j<=n;j++){
            cout << bdist[i][j] << ' ';
        }
        cout << '\n';
    }
    */
    return 0;
}

Subtask #1
29.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 1 ms 336 KB Output isn't correct
4 Incorrect 1 ms 336 KB Output isn't correct
5 Correct 1 ms 336 KB Output is correct
6 Correct 0 ms 336 KB Output is correct
7 Correct 86 ms 6220 KB Output is correct
8 Incorrect 1 ms 336 KB Output isn't 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 Incorrect 1 ms 336 KB Output isn't correct
13 Incorrect 1 ms 336 KB Output isn't correct
14 Incorrect 1 ms 336 KB Output isn't correct
15 Incorrect 1 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 504 KB Output is correct
21 Incorrect 1 ms 336 KB Output isn't correct
22 Correct 1 ms 508 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 588 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 1 ms 508 KB Output is correct
33 Incorrect 9 ms 1572 KB Output isn't correct
34 Correct 9 ms 1644 KB Output is correct
35 Correct 21 ms 1568 KB Output is correct
36 Incorrect 11 ms 1784 KB Output isn't correct
37 Correct 10 ms 1872 KB Output is correct
38 Correct 31 ms 1924 KB Output is correct
39 Incorrect 13 ms 2336 KB Output isn't correct
40 Correct 14 ms 2296 KB Output is correct
41 Correct 35 ms 2288 KB Output is correct
42 Incorrect 18 ms 2728 KB Output isn't correct
43 Correct 18 ms 2736 KB Output is correct
44 Correct 45 ms 2688 KB Output is correct
45 Incorrect 21 ms 3200 KB Output isn't correct
46 Correct 22 ms 3252 KB Output is correct
47 Correct 55 ms 3168 KB Output is correct
48 Incorrect 24 ms 3768 KB Output isn't correct
49 Correct 28 ms 3688 KB Output is correct
50 Correct 64 ms 3716 KB Output is correct
51 Incorrect 30 ms 4328 KB Output isn't correct
52 Correct 37 ms 4320 KB Output is correct
53 Correct 89 ms 4268 KB Output is correct
54 Incorrect 35 ms 4892 KB Output isn't correct
55 Correct 36 ms 4892 KB Output is correct
56 Correct 109 ms 4832 KB Output is correct
57 Incorrect 40 ms 5520 KB Output isn't correct
58 Correct 42 ms 5520 KB Output is correct
59 Correct 123 ms 5624 KB Output is correct
60 Incorrect 45 ms 6240 KB Output isn't correct
61 Correct 46 ms 6220 KB Output is correct
62 Correct 143 ms 6216 KB Output is correct
63 Correct 92 ms 6184 KB Output is correct
64 Correct 151 ms 6204 KB Output is correct
65 Correct 145 ms 6176 KB Output is correct
66 Incorrect 120 ms 6180 KB Output isn't correct
67 Incorrect 126 ms 6172 KB Output isn't correct
68 Correct 53 ms 6256 KB Output is correct
69 Correct 44 ms 6192 KB Output is correct
70 Correct 45 ms 6172 KB Output is correct
71 Correct 50 ms 6184 KB Output is correct
72 Incorrect 39 ms 6236 KB Output isn't correct
73 Incorrect 33 ms 6224 KB Output isn't correct
74 Correct 68 ms 6220 KB Output is correct
75 Correct 74 ms 6232 KB Output is correct
76 Correct 67 ms 6188 KB Output is correct
77 Correct 65 ms 6236 KB Output is correct
78 Incorrect 72 ms 6224 KB Output isn't correct
79 Correct 64 ms 6224 KB Output is correct
80 Correct 62 ms 6232 KB Output is correct
81 Correct 72 ms 6244 KB Output is correct
82 Correct 63 ms 6200 KB Output is correct
83 Correct 80 ms 6232 KB Output is correct
84 Correct 84 ms 6224 KB Output is correct
85 Correct 70 ms 6184 KB Output is correct
86 Correct 94 ms 6216 KB Output is correct
87 Correct 82 ms 6216 KB Output is correct
88 Correct 87 ms 6140 KB Output is correct
89 Correct 87 ms 6236 KB Output is correct
90 Correct 93 ms 6224 KB Output is correct
91 Correct 87 ms 6204 KB Output is correct
92 Correct 89 ms 6176 KB Output is correct