oj.uz

Submission #1078934

# Submission time Handle Problem Language Result Execution time Memory
1078934 2024-08-28T08:20:39 Z Yang8on Mecho (IOI09_mecho) C++17
100 / 100
 129 ms 7012 KB 
#include <bits/stdc++.h>
#define Y8o "main"
#define maxn (int) 805
#define ll long long
#define pii pair<int, int>
#define gb(i, j) ((i >> j) & 1)
#define all(x) x.begin(), x.end()
#define _left id * 2, l, mid
#define _right id * 2 + 1, mid + 1, r

#define f first
#define s second

using namespace std;

mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
ll GetRandom(ll l, ll r) {
    return uniform_int_distribution<ll> (l, r) (rng);
}
void iof() {
    if(fopen(Y8o".inp", "r"))
    {
        freopen(Y8o".inp", "r", stdin);
//        freopen(Y8o".out", "w", stdout);
    }
    ios_base::sync_with_stdio(0);
    cin.tie(NULL), cout.tie(NULL);
}
void ctime() {
    cerr << "\n" << "\nTime elapsed: " << 1000 * clock() / CLOCKS_PER_SEC << "ms\n";
}

int n, S;
pii st, en;
char a[maxn][maxn];
int lim[maxn][maxn], dp[maxn][maxn];
int dx[] = { 1, -1, 0, 0 };
int dy[] = { 0, 0, -1, 1 };
bool exist(int u, int v) { return 1 <= u && u <= n && 1 <= v && v <= n && a[u][v] != 'T'; }

bool check(int tg) {
    for(int i = 1; i <= n; i ++) for(int j = 1; j <= n; j ++)
        dp[i][j] = 1e9;
    dp[st.f][st.s] = tg * S;

    if(dp[st.f][st.s] >= lim[st.f][st.s]) return false;

    queue<pii> q;
    q.push(st);
    while(q.size()) {
        int i, j; tie(i, j) = q.front();
        q.pop();
        for(int t = 0; t <= 3; t ++) {
            int u = i + dx[t], v = j + dy[t];
            if(exist(u, v) && dp[u][v] > dp[i][j] + 1 && dp[i][j] + 1 < lim[u][v]) {
                dp[u][v] = dp[i][j] + 1;
                q.push({ u, v });
            }
        }
    }

    for(int t = 0; t <= 3; t ++) {
        int u = en.f + dx[t], v = en.s + dy[t];
        if(exist(u, v) && dp[u][v] != 1e9) {
            return true;
        }
    }
    return false;
}

void solve() {
    cin >> n >> S;
    for(int i = 1; i <= n; i ++) for(int j = 1; j <= n; j ++) {
        cin >> a[i][j];
        if(a[i][j] == 'M') st = {i, j};
        else if(a[i][j] == 'D') en = {i, j};
    }

    queue<pii> q;
    for(int i = 1; i <= n; i ++) for(int j = 1; j <= n; j ++) {
        lim[i][j] = 1e9;
        if(a[i][j] == 'H') lim[i][j] = 0, q.push({ i, j });
    }
    while(q.size()) {
        int i, j; tie(i, j) = q.front();
        q.pop();
        for(int t = 0; t <= 3; t ++) {
            int u = i + dx[t], v = j + dy[t];
            if(exist(u, v) && a[u][v] != 'D') {
                if(lim[u][v] > lim[i][j] + S) {
                    lim[u][v] = lim[i][j] + S;
                    q.push({ u, v });
                }
            }
        }
    }

    int l = 0, r = n * n;
    while(l <= r) {
        int mid = (l + r) >> 1;
        if(check(mid)) l = mid + 1;
        else r = mid - 1;
    }
    if(r < 0) cout << -1;
    else cout << r;
}

int main() {
    iof();

    int nTest = 1;
//    cin >> nTest;

    while(nTest --) {
        solve();
    }

    ctime();
    return 0;
}

Compilation message

mecho.cpp: In function 'void iof()':
mecho.cpp:23:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   23 |         freopen(Y8o".inp", "r", stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
100.0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 472 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 464 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 56 ms 6864 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 604 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 860 KB Output is correct
13 Correct 1 ms 860 KB Output is correct
14 Correct 1 ms 860 KB Output is correct
15 Correct 0 ms 604 KB Output is correct
16 Correct 0 ms 604 KB Output is correct
17 Correct 0 ms 604 KB Output is correct
18 Correct 1 ms 604 KB Output is correct
19 Correct 0 ms 604 KB Output is correct
20 Correct 0 ms 604 KB Output is correct
21 Correct 1 ms 600 KB Output is correct
22 Correct 1 ms 604 KB Output is correct
23 Correct 1 ms 604 KB Output is correct
24 Correct 1 ms 604 KB Output is correct
25 Correct 1 ms 860 KB Output is correct
26 Correct 1 ms 860 KB Output is correct
27 Correct 1 ms 860 KB Output is correct
28 Correct 1 ms 856 KB Output is correct
29 Correct 1 ms 860 KB Output is correct
30 Correct 1 ms 860 KB Output is correct
31 Correct 1 ms 860 KB Output is correct
32 Correct 1 ms 956 KB Output is correct
33 Correct 5 ms 2908 KB Output is correct
34 Correct 5 ms 2908 KB Output is correct
35 Correct 14 ms 3084 KB Output is correct
36 Correct 6 ms 3416 KB Output is correct
37 Correct 6 ms 3436 KB Output is correct
38 Correct 18 ms 3420 KB Output is correct
39 Correct 7 ms 3676 KB Output is correct
40 Correct 12 ms 3804 KB Output is correct
41 Correct 26 ms 3876 KB Output is correct
42 Correct 9 ms 4232 KB Output is correct
43 Correct 9 ms 4184 KB Output is correct
44 Correct 30 ms 4228 KB Output is correct
45 Correct 11 ms 4444 KB Output is correct
46 Correct 10 ms 4448 KB Output is correct
47 Correct 34 ms 4444 KB Output is correct
48 Correct 12 ms 4956 KB Output is correct
49 Correct 12 ms 4956 KB Output is correct
50 Correct 40 ms 4952 KB Output is correct
51 Correct 18 ms 5468 KB Output is correct
52 Correct 14 ms 5468 KB Output is correct
53 Correct 54 ms 5468 KB Output is correct
54 Correct 16 ms 5720 KB Output is correct
55 Correct 15 ms 5864 KB Output is correct
56 Correct 59 ms 5720 KB Output is correct
57 Correct 18 ms 6232 KB Output is correct
58 Correct 19 ms 6352 KB Output is correct
59 Correct 66 ms 6236 KB Output is correct
60 Correct 20 ms 6744 KB Output is correct
61 Correct 20 ms 6744 KB Output is correct
62 Correct 78 ms 6748 KB Output is correct
63 Correct 72 ms 6752 KB Output is correct
64 Correct 129 ms 6744 KB Output is correct
65 Correct 99 ms 6748 KB Output is correct
66 Correct 82 ms 6652 KB Output is correct
67 Correct 78 ms 6548 KB Output is correct
68 Correct 37 ms 6740 KB Output is correct
69 Correct 37 ms 6740 KB Output is correct
70 Correct 30 ms 6740 KB Output is correct
71 Correct 35 ms 6996 KB Output is correct
72 Correct 32 ms 6568 KB Output is correct
73 Correct 27 ms 7000 KB Output is correct
74 Correct 40 ms 7004 KB Output is correct
75 Correct 48 ms 7000 KB Output is correct
76 Correct 42 ms 7012 KB Output is correct
77 Correct 41 ms 7000 KB Output is correct
78 Correct 50 ms 7004 KB Output is correct
79 Correct 49 ms 7004 KB Output is correct
80 Correct 42 ms 7004 KB Output is correct
81 Correct 46 ms 7000 KB Output is correct
82 Correct 42 ms 7004 KB Output is correct
83 Correct 52 ms 6736 KB Output is correct
84 Correct 53 ms 7004 KB Output is correct
85 Correct 51 ms 6836 KB Output is correct
86 Correct 51 ms 6740 KB Output is correct
87 Correct 50 ms 6736 KB Output is correct
88 Correct 54 ms 6740 KB Output is correct
89 Correct 53 ms 6924 KB Output is correct
90 Correct 55 ms 6684 KB Output is correct
91 Correct 54 ms 6744 KB Output is correct
92 Correct 57 ms 6748 KB Output is correct