oj.uz

Submission #977826

# Submission time Handle Problem Language Result Execution time Memory
977826 2024-05-08T11:36:22 Z farica Mecho (IOI09_mecho) C++14
54 / 100
 189 ms 7248 KB 
#include <bits/stdc++.h>
#define int long long

using namespace std;

const int MAX_N = 4e5 + 5;

int n, s, dist[805][805], sx, sy, ex, ey;
string grid[805];

bool test(int m) {
    if(dist[sx][sy] <= m) return false;
    queue<pair<int, pair<int,int>>>q;
    q.push({0, {sx, sy}});
    vector<vector<bool>>visited(n, vector<bool>(n, 0));
    while(!q.empty()) {
        int cnt = q.front().first, x = q.front().second.first, y = q.front().second.second;
        q.pop();
        if(visited[x][y]) continue;
        visited[x][y] = 1;
        ++cnt;
        int cost = cnt / s + (cnt % s > 0 ? 1 : 0) + m;
        if(x && dist[x-1][y] >= cost && grid[x-1][y] == 'G') q.push({cnt, {x-1, y}});
        if(y && dist[x][y-1] >= cost && grid[x][y-1] == 'G') q.push({cnt, {x, y-1}});
        if(x+1<n && dist[x+1][y] >= cost && grid[x+1][y] == 'G') q.push({cnt, {x+1, y}});
        if(y+1<n && dist[x][y+1] >= cost && grid[x][y+1] == 'G') q.push({cnt, {x, y+1}});
    }
    if(ex && visited[ex-1][ey]) return true;
    if(ey && visited[ex][ey-1]) return true;
    if(ex+1<n && visited[ex+1][ey]) return true;
    if(ey+1<n && visited[ex][ey+1]) return true;
    return false;
}

void solve() {
    cin >> n >> s;
    queue<pair<int,int>>q;
    for(int i=0; i<n; ++i) {
        cin >> grid[i];
        for(int j=0; j<n; ++j) {
            dist[i][j] = -1;
            if(grid[i][j] == 'H') {
                q.push({i, j});
                dist[i][j] = 0;
            } else if(grid[i][j] == 'M') sx=i, sy=j;
            else if(grid[i][j] == 'D') ex=i, ey=j;
        }
    }
    while(!q.empty()) {
        int i = q.front().first, j = q.front().second;
        q.pop();
        if(i && dist[i-1][j] == -1 && grid[i-1][j] != 'T' && grid[i-1][j] != 'D') {
            dist[i-1][j] = dist[i][j] + 1;
            q.push({i-1, j});
        }
        if(j && dist[i][j-1] == -1 && grid[i][j-1] != 'T' && grid[i][j-1] != 'D') {
            dist[i][j-1] = dist[i][j] + 1;
            q.push({i, j-1});
        }
        if(i<n-1 && dist[i+1][j] == -1 && grid[i+1][j] != 'T' && grid[i+1][j] != 'D') {
            dist[i+1][j] = dist[i][j] + 1;
            q.push({i+1, j});
        }
        if(j<n-1 && dist[i][j+1] == -1 && grid[i][j+1] != 'T' && grid[i][j+1] != 'D') {
            dist[i][j+1] = dist[i][j] + 1;
            q.push({i, j+1});
        }
    }
    if(!test(0)) {
        cout << -1 << endl;
        return;
    }
    int l=0, r=n*n, mid;
    while(l<=r) {
        mid = (l+r)/2;
        if(test(mid)) l = mid + 1;
        else r = mid - 1;
    }
    cout << r << endl;
}

signed main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);

    int t = 1;
    while(t--) solve();

    return 0;
}

Subtask #1
54.0 / 100.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 348 KB Output isn't correct
2 Incorrect 0 ms 348 KB Output isn't correct
3 Incorrect 0 ms 348 KB Output isn't correct
4 Incorrect 1 ms 348 KB Output isn't correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 120 ms 6308 KB Output is correct
8 Incorrect 0 ms 344 KB Output isn't correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 344 KB Output is correct
12 Correct 1 ms 2648 KB Output is correct
13 Correct 2 ms 2544 KB Output is correct
14 Correct 1 ms 2652 KB Output is correct
15 Incorrect 0 ms 348 KB Output isn't correct
16 Correct 0 ms 488 KB Output is correct
17 Incorrect 1 ms 2392 KB Output isn't correct
18 Correct 1 ms 2392 KB Output is correct
19 Incorrect 2 ms 2396 KB Output isn't correct
20 Correct 1 ms 2396 KB Output is correct
21 Incorrect 1 ms 2648 KB Output isn't correct
22 Correct 1 ms 2652 KB Output is correct
23 Incorrect 1 ms 2652 KB Output isn't correct
24 Correct 1 ms 2648 KB Output is correct
25 Incorrect 1 ms 2652 KB Output isn't correct
26 Correct 1 ms 2916 KB Output is correct
27 Incorrect 1 ms 2652 KB Output isn't correct
28 Correct 1 ms 2652 KB Output is correct
29 Incorrect 1 ms 2652 KB Output isn't correct
30 Correct 1 ms 2652 KB Output is correct
31 Incorrect 1 ms 2652 KB Output isn't correct
32 Correct 1 ms 2652 KB Output is correct
33 Incorrect 4 ms 4956 KB Output isn't correct
34 Correct 5 ms 5000 KB Output is correct
35 Correct 30 ms 4956 KB Output is correct
36 Incorrect 5 ms 4956 KB Output isn't correct
37 Correct 6 ms 4956 KB Output is correct
38 Correct 38 ms 4956 KB Output is correct
39 Incorrect 6 ms 4956 KB Output isn't correct
40 Correct 9 ms 4956 KB Output is correct
41 Correct 53 ms 5428 KB Output is correct
42 Incorrect 8 ms 5212 KB Output isn't correct
43 Correct 9 ms 5208 KB Output is correct
44 Correct 65 ms 5248 KB Output is correct
45 Incorrect 9 ms 5212 KB Output isn't correct
46 Correct 10 ms 5100 KB Output is correct
47 Correct 73 ms 5212 KB Output is correct
48 Incorrect 10 ms 5212 KB Output isn't correct
49 Correct 12 ms 5208 KB Output is correct
50 Correct 86 ms 5408 KB Output is correct
51 Incorrect 11 ms 5468 KB Output isn't correct
52 Correct 14 ms 5468 KB Output is correct
53 Correct 113 ms 5604 KB Output is correct
54 Incorrect 15 ms 5724 KB Output isn't correct
55 Correct 17 ms 5724 KB Output is correct
56 Correct 139 ms 5720 KB Output is correct
57 Incorrect 15 ms 6236 KB Output isn't correct
58 Correct 19 ms 6236 KB Output is correct
59 Correct 147 ms 6316 KB Output is correct
60 Incorrect 17 ms 6492 KB Output isn't correct
61 Correct 24 ms 6728 KB Output is correct
62 Correct 181 ms 6752 KB Output is correct
63 Correct 102 ms 6712 KB Output is correct
64 Correct 189 ms 6692 KB Output is correct
65 Correct 138 ms 6748 KB Output is correct
66 Incorrect 123 ms 6576 KB Output isn't correct
67 Correct 24 ms 6564 KB Output is correct
68 Correct 37 ms 6736 KB Output is correct
69 Correct 39 ms 6492 KB Output is correct
70 Correct 25 ms 6736 KB Output is correct
71 Correct 30 ms 6736 KB Output is correct
72 Correct 24 ms 6748 KB Output is correct
73 Correct 35 ms 7004 KB Output is correct
74 Correct 89 ms 7140 KB Output is correct
75 Correct 94 ms 7184 KB Output is correct
76 Correct 84 ms 7128 KB Output is correct
77 Correct 79 ms 7000 KB Output is correct
78 Correct 23 ms 6848 KB Output is correct
79 Correct 73 ms 7124 KB Output is correct
80 Correct 76 ms 7048 KB Output is correct
81 Correct 93 ms 7248 KB Output is correct
82 Correct 94 ms 7000 KB Output is correct
83 Correct 105 ms 7016 KB Output is correct
84 Correct 104 ms 6744 KB Output is correct
85 Correct 109 ms 6984 KB Output is correct
86 Correct 113 ms 7032 KB Output is correct
87 Correct 101 ms 7000 KB Output is correct
88 Correct 108 ms 6744 KB Output is correct
89 Correct 132 ms 6892 KB Output is correct
90 Correct 115 ms 6940 KB Output is correct
91 Correct 117 ms 6908 KB Output is correct
92 Correct 124 ms 6944 KB Output is correct