oj.uz

Submission #759167

# Submission time Handle Problem Language Result Execution time Memory
759167 2023-06-15T20:08:44 Z Blagoj Mecho (IOI09_mecho) C++17
84 / 100
 161 ms 7216 KB 
#include <bits/stdc++.h>
 
using namespace std;
 
#define endl '\n'
#define ll long long
#define all(x) x.begin(), x.end()
 
ll n, s, times[802][802];
vector<string> v(802);
pair<ll, ll> st, en;
 
const ll dx[4] = {0, 0, -1, 1};
const ll dy[4] = {-1, 1, 0, 0};
 
inline bool valid(ll x, ll y) {
    return (x >= 0 && x < n && y >= 0 && y < n && v[x][y] != 'T');
}
 
bool check(ll m) {
    if (!(m < times[st.first][st.second]) || !(m < times[st.first][st.second])) return 0;
    queue<pair<ll, ll>> q;
    q.push(st);
    bool vis[n + 2][n + 2];
    memset(vis, 0, sizeof(vis));
    vis[st.first][st.second] = 1;
    ll moves = 0;
    do {
        moves++;
        if (moves >= s) {
            moves = 0;
            m++;
        }
        ll sz = q.size();
        while (sz--) {
            ll x = q.front().first, y = q.front().second;
            q.pop();
            for (ll d = 0; d < 4; d++) {
                ll nx = x + dx[d], ny = y + dy[d];
                if (valid(nx, ny) && m < times[nx][ny] && !vis[nx][ny]) {
                    vis[nx][ny] = 1;
                    q.push({nx, ny});
                    if (make_pair(nx, ny) == en) return 1;
                }
            }
        }
    }
    while (q.size() > 0);
    return 0;
}
 
int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cin >> n >> s;
    queue<pair<ll, ll>> h;
 
    for (ll i = 0; i < n; i++) {
        cin >> v[i];
        for (ll j = 0; j < n; j++) {
            times[i][j] = n * n + 1000;
            if (v[i][j] == 'M') st = {i, j};
            if (v[i][j] == 'H') {
                h.push({i, j});
                times[i][j] = 0;
            }
            if (v[i][j] == 'D') en = {i, j};
        }
    }
 
    ll mx = 0;
    while (h.size() > 0) {
        ll x = h.front().first, y = h.front().second;
        h.pop();
        for (ll d = 0; d < 4; d++) {
            ll nx = x + dx[d], ny = y + dy[d];
            if (valid(nx, ny) && times[x][y] + 1 < times[nx][ny]) {
                times[nx][ny] = times[x][y] + 1;
                mx = max(mx, times[nx][ny]);
                h.push({nx, ny});
            }
        }
    }

    ll l = -1, r = mx - 1, ans = -1;
    while (l <= r) {
		ll m = (l + r) / 2;
		if (check(m)) {
			ans = m;
			l = m + 1;
		}
		else {
			r = m - 1;
		}
	}
 
    cout << ans;
}

Subtask #1
84.0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Incorrect 0 ms 340 KB Output isn't correct
3 Correct 1 ms 340 KB Output is correct
4 Incorrect 0 ms 340 KB Output isn't correct
5 Correct 0 ms 340 KB Output is correct
6 Incorrect 0 ms 340 KB Output isn't correct
7 Incorrect 107 ms 6876 KB Output isn't correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Correct 0 ms 340 KB Output is correct
12 Incorrect 1 ms 596 KB Output isn't correct
13 Correct 1 ms 468 KB Output is correct
14 Correct 1 ms 596 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 0 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 468 KB Output is correct
20 Correct 0 ms 468 KB Output is correct
21 Correct 0 ms 468 KB Output is correct
22 Correct 1 ms 468 KB Output is correct
23 Correct 1 ms 468 KB Output is correct
24 Correct 0 ms 468 KB Output is correct
25 Correct 1 ms 596 KB Output is correct
26 Correct 1 ms 596 KB Output is correct
27 Correct 1 ms 596 KB Output is correct
28 Correct 1 ms 596 KB Output is correct
29 Correct 1 ms 596 KB Output is correct
30 Correct 1 ms 596 KB Output is correct
31 Correct 1 ms 596 KB Output is correct
32 Correct 1 ms 596 KB Output is correct
33 Correct 3 ms 2772 KB Output is correct
34 Correct 3 ms 2772 KB Output is correct
35 Correct 21 ms 2796 KB Output is correct
36 Correct 4 ms 3156 KB Output is correct
37 Correct 3 ms 3156 KB Output is correct
38 Correct 24 ms 3196 KB Output is correct
39 Correct 3 ms 3540 KB Output is correct
40 Correct 5 ms 3540 KB Output is correct
41 Correct 26 ms 3580 KB Output is correct
42 Correct 6 ms 3872 KB Output is correct
43 Correct 4 ms 3924 KB Output is correct
44 Correct 39 ms 3892 KB Output is correct
45 Correct 5 ms 4308 KB Output is correct
46 Correct 5 ms 4308 KB Output is correct
47 Correct 56 ms 4412 KB Output is correct
48 Correct 9 ms 4820 KB Output is correct
49 Correct 7 ms 4820 KB Output is correct
50 Correct 63 ms 4820 KB Output is correct
51 Correct 7 ms 5268 KB Output is correct
52 Correct 11 ms 5268 KB Output is correct
53 Correct 80 ms 5272 KB Output is correct
54 Correct 12 ms 5648 KB Output is correct
55 Correct 8 ms 5652 KB Output is correct
56 Correct 87 ms 5648 KB Output is correct
57 Correct 13 ms 6100 KB Output is correct
58 Correct 9 ms 6172 KB Output is correct
59 Correct 82 ms 6196 KB Output is correct
60 Correct 9 ms 6612 KB Output is correct
61 Correct 11 ms 6612 KB Output is correct
62 Correct 127 ms 6668 KB Output is correct
63 Correct 82 ms 6600 KB Output is correct
64 Correct 148 ms 6564 KB Output is correct
65 Correct 161 ms 6660 KB Output is correct
66 Correct 100 ms 6652 KB Output is correct
67 Correct 84 ms 6664 KB Output is correct
68 Correct 35 ms 6720 KB Output is correct
69 Correct 29 ms 6620 KB Output is correct
70 Correct 29 ms 6624 KB Output is correct
71 Correct 27 ms 6624 KB Output is correct
72 Correct 20 ms 6624 KB Output is correct
73 Correct 32 ms 7112 KB Output is correct
74 Correct 65 ms 7208 KB Output is correct
75 Correct 55 ms 7216 KB Output is correct
76 Correct 48 ms 7208 KB Output is correct
77 Correct 54 ms 7116 KB Output is correct
78 Correct 65 ms 7056 KB Output is correct
79 Correct 42 ms 7088 KB Output is correct
80 Correct 51 ms 7068 KB Output is correct
81 Correct 56 ms 7156 KB Output is correct
82 Correct 45 ms 7124 KB Output is correct
83 Correct 58 ms 6996 KB Output is correct
84 Correct 60 ms 7076 KB Output is correct
85 Correct 79 ms 7080 KB Output is correct
86 Correct 67 ms 7084 KB Output is correct
87 Correct 60 ms 6980 KB Output is correct
88 Correct 62 ms 6960 KB Output is correct
89 Correct 66 ms 6868 KB Output is correct
90 Correct 77 ms 6892 KB Output is correct
91 Correct 70 ms 6960 KB Output is correct
92 Correct 62 ms 6996 KB Output is correct