oj.uz

답안 #977562

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
977562 2024-05-08T06:57:54 Z farica Mecho (IOI09_mecho) C++14
30 / 100
 203 ms 6700 KB 
#include <bits/stdc++.h>
#define int long long

using namespace std;

const int MAX_N = 4e5 + 5;

int n, s, dist[800][800], sx, sy;
string grid[800];

bool test(int m) {
    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;
        if(grid[x][y] == 'D') return true;
        ++cnt;
        int cost = cnt / s + (cnt % s > 0 ? 1 : 0) + m;
        if(x && dist[x-1][y] >= cost && grid[x-1][y] != 'T') q.push({cnt, {x-1, y}});
        if(y && dist[x][y-1] >= cost && grid[x][y-1] != 'T') q.push({cnt, {x, y-1}});
        if(x+1<n && dist[x+1][y] >= cost && grid[x+1][y] != 'T') q.push({cnt, {x+1, y}});
        if(y+1<n && dist[x][y+1] >= cost && grid[x][y+1] != 'T') q.push({cnt, {x, y+1}});
    }
    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;
        }
    }
    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] != 'M') {
            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] != 'M') {
            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] != 'M') {
            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] != 'M') {
            dist[i][j+1] = dist[i][j] + 1;
            q.push({i, j+1});
        }
    }
    dist[sx][sy] = n*n*n;
    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 << l - 1 << endl;
}

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

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

    return 0;
}

Subtask #1
30.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 344 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 0 ms 376 KB Output isn't correct
5 Correct 1 ms 348 KB Output is correct
6 Incorrect 0 ms 348 KB Output isn't correct
7 Incorrect 132 ms 6364 KB Output isn't 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 348 KB Output is correct
12 Incorrect 1 ms 2652 KB Output isn't correct
13 Incorrect 1 ms 2652 KB Output isn't correct
14 Correct 1 ms 2652 KB Output is correct
15 Incorrect 0 ms 348 KB Output isn't correct
16 Correct 1 ms 348 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 1 ms 2396 KB Output isn't correct
20 Correct 1 ms 2396 KB Output is correct
21 Incorrect 2 ms 2648 KB Output isn't correct
22 Correct 1 ms 2648 KB Output is correct
23 Incorrect 2 ms 2652 KB Output isn't correct
24 Correct 1 ms 2652 KB Output is correct
25 Incorrect 1 ms 2652 KB Output isn't correct
26 Correct 1 ms 2652 KB Output is correct
27 Incorrect 2 ms 2652 KB Output isn't correct
28 Correct 1 ms 2648 KB Output is correct
29 Incorrect 1 ms 2648 KB Output isn't correct
30 Correct 1 ms 2648 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 2 ms 2652 KB Output isn't correct
34 Correct 2 ms 2652 KB Output is correct
35 Correct 27 ms 2872 KB Output is correct
36 Incorrect 3 ms 4700 KB Output isn't correct
37 Correct 3 ms 4700 KB Output is correct
38 Correct 34 ms 5208 KB Output is correct
39 Incorrect 3 ms 5204 KB Output isn't correct
40 Correct 3 ms 4956 KB Output is correct
41 Correct 45 ms 4960 KB Output is correct
42 Incorrect 4 ms 4952 KB Output isn't correct
43 Correct 4 ms 4952 KB Output is correct
44 Correct 57 ms 4952 KB Output is correct
45 Incorrect 5 ms 4956 KB Output isn't correct
46 Correct 5 ms 4956 KB Output is correct
47 Correct 69 ms 5128 KB Output is correct
48 Incorrect 5 ms 4952 KB Output isn't correct
49 Correct 5 ms 4952 KB Output is correct
50 Correct 78 ms 5212 KB Output is correct
51 Incorrect 7 ms 5464 KB Output isn't correct
52 Correct 6 ms 5208 KB Output is correct
53 Correct 93 ms 5280 KB Output is correct
54 Incorrect 8 ms 5468 KB Output isn't correct
55 Correct 7 ms 5468 KB Output is correct
56 Correct 115 ms 5500 KB Output is correct
57 Incorrect 8 ms 5720 KB Output isn't correct
58 Correct 7 ms 5720 KB Output is correct
59 Correct 133 ms 5724 KB Output is correct
60 Incorrect 9 ms 6232 KB Output isn't correct
61 Correct 10 ms 6236 KB Output is correct
62 Correct 150 ms 6296 KB Output is correct
63 Correct 100 ms 6236 KB Output is correct
64 Correct 203 ms 6276 KB Output is correct
65 Correct 149 ms 6232 KB Output is correct
66 Incorrect 128 ms 6276 KB Output isn't correct
67 Correct 24 ms 6232 KB Output is correct
68 Correct 38 ms 6176 KB Output is correct
69 Correct 38 ms 6272 KB Output is correct
70 Correct 25 ms 6232 KB Output is correct
71 Correct 30 ms 6484 KB Output is correct
72 Incorrect 20 ms 6236 KB Output isn't correct
73 Incorrect 96 ms 6700 KB Output isn't correct
74 Correct 79 ms 6488 KB Output is correct
75 Correct 92 ms 6488 KB Output is correct
76 Correct 80 ms 6700 KB Output is correct
77 Correct 92 ms 6492 KB Output is correct
78 Correct 22 ms 6488 KB Output is correct
79 Correct 67 ms 6492 KB Output is correct
80 Correct 75 ms 6488 KB Output is correct
81 Correct 89 ms 6492 KB Output is correct
82 Correct 80 ms 6640 KB Output is correct
83 Correct 105 ms 6564 KB Output is correct
84 Correct 99 ms 6488 KB Output is correct
85 Correct 102 ms 6492 KB Output is correct
86 Correct 111 ms 6568 KB Output is correct
87 Correct 101 ms 6488 KB Output is correct
88 Correct 109 ms 6464 KB Output is correct
89 Correct 119 ms 6464 KB Output is correct
90 Correct 126 ms 6480 KB Output is correct
91 Correct 118 ms 6464 KB Output is correct
92 Correct 122 ms 6232 KB Output is correct