oj.uz

Submission #1100702

# Submission time Handle Problem Language Result Execution time Memory
1100702 2024-10-14T13:16:04 Z Uniq0rn Mecho (IOI09_mecho) C++14
38 / 100
 208 ms 6428 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';
        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] + 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});
            }
        }
        /*
        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
38.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 1 ms 336 KB Output is correct
7 Correct 96 ms 6232 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 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 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 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 2 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 2 ms 336 KB Output is correct
31 Incorrect 1 ms 336 KB Output isn't correct
32 Correct 1 ms 336 KB Output is correct
33 Incorrect 7 ms 1596 KB Output isn't correct
34 Correct 8 ms 1572 KB Output is correct
35 Correct 21 ms 1600 KB Output is correct
36 Incorrect 10 ms 1872 KB Output isn't correct
37 Correct 11 ms 1872 KB Output is correct
38 Correct 29 ms 1928 KB Output is correct
39 Incorrect 12 ms 2304 KB Output isn't correct
40 Correct 17 ms 2272 KB Output is correct
41 Correct 37 ms 2296 KB Output is correct
42 Incorrect 15 ms 2728 KB Output isn't correct
43 Correct 16 ms 2728 KB Output is correct
44 Correct 47 ms 2776 KB Output is correct
45 Incorrect 18 ms 3216 KB Output isn't correct
46 Correct 18 ms 3188 KB Output is correct
47 Correct 53 ms 3200 KB Output is correct
48 Incorrect 23 ms 3700 KB Output isn't correct
49 Correct 21 ms 3700 KB Output is correct
50 Correct 65 ms 3748 KB Output is correct
51 Incorrect 26 ms 4328 KB Output isn't correct
52 Correct 25 ms 4328 KB Output is correct
53 Correct 81 ms 4292 KB Output is correct
54 Incorrect 29 ms 4864 KB Output isn't correct
55 Correct 30 ms 4944 KB Output is correct
56 Correct 95 ms 4896 KB Output is correct
57 Incorrect 34 ms 5568 KB Output isn't correct
58 Correct 35 ms 5584 KB Output is correct
59 Correct 109 ms 5560 KB Output is correct
60 Incorrect 39 ms 6224 KB Output isn't correct
61 Correct 39 ms 6264 KB Output is correct
62 Correct 130 ms 6204 KB Output is correct
63 Correct 111 ms 6200 KB Output is correct
64 Correct 208 ms 6196 KB Output is correct
65 Correct 150 ms 6192 KB Output is correct
66 Incorrect 138 ms 6196 KB Output isn't correct
67 Correct 123 ms 6208 KB Output is correct
68 Correct 67 ms 6252 KB Output is correct
69 Correct 70 ms 6252 KB Output is correct
70 Correct 60 ms 6252 KB Output is correct
71 Correct 63 ms 6252 KB Output is correct
72 Incorrect 53 ms 6276 KB Output isn't correct
73 Incorrect 61 ms 6248 KB Output isn't correct
74 Correct 73 ms 6428 KB Output is correct
75 Correct 86 ms 6240 KB Output is correct
76 Correct 80 ms 6280 KB Output is correct
77 Correct 82 ms 6264 KB Output is correct
78 Correct 92 ms 6392 KB Output is correct
79 Correct 69 ms 6240 KB Output is correct
80 Correct 77 ms 6388 KB Output is correct
81 Correct 82 ms 6244 KB Output is correct
82 Correct 81 ms 6312 KB Output is correct
83 Correct 90 ms 6280 KB Output is correct
84 Correct 81 ms 6288 KB Output is correct
85 Correct 89 ms 6400 KB Output is correct
86 Correct 90 ms 6232 KB Output is correct
87 Correct 89 ms 6232 KB Output is correct
88 Correct 96 ms 6240 KB Output is correct
89 Correct 96 ms 6264 KB Output is correct
90 Correct 98 ms 6292 KB Output is correct
91 Correct 95 ms 6256 KB Output is correct
92 Correct 99 ms 6248 KB Output is correct