oj.uz

Submission #500732

# Submission time Handle Problem Language Result Execution time Memory
500732 2022-01-01T02:06:29 Z kevin Mecho (IOI09_mecho) C++17
73 / 100
 270 ms 8200 KB 
#include <bits/stdc++.h>
using namespace std;

#define ll long long
#define nl cout<<"\n"
#define f first
#define s second
#define ca(v) for(auto i:v) cout<<i<<" ";

int xm[4] = {-1, 1, 0, 0};
int ym[4] = {0, 0, -1, 1};

int grid[801][801];
int dst[801][801];

int main()
{
    ios_base::sync_with_stdio(0); cin.tie(0);
    if (fopen("input.in", "r")) freopen("input.in", "r", stdin);
    int n; cin>>n; int x; cin>>x;
    queue<pair<int, int>> q;
    pair<int, int> st;
    pair<int, int> ed;
    vector<vector<bool>> vis(n, vector<bool>(n, 0));
    for(int i=0; i<n; i++){
        for(int j=0; j<n; j++){
            char c; cin>>c;
            grid[i][j] = (c != 'T');
            if(c == 'M') st = {i, j};
            if(c == 'D') ed = {i, j};
            if(c == 'H') {
                q.push({i, j});
                vis[i][j] = 1;
            }
        }
    }
    while(q.size()){
        auto c = q.front(); q.pop();
        for(int i=0; i<4; i++){
            int nx = c.f + xm[i];
            int ny = c.s + ym[i];
            if(nx >= 0 && nx < n && ny >= 0 && ny < n && grid[nx][ny] && !vis[nx][ny]){
                vis[nx][ny] = 1;
                dst[nx][ny] = dst[c.f][c.s] + 1;
                q.push({nx, ny});
            }
        }
    }
    int l = 0;
    int r = n*n+5;
    int ans = -1;
    while(l <= r){
        int m = (l + r) / 2;
        vis = vector<vector<bool>>(n, vector<bool>(n, 0));
        vector<vector<int>> d(n, vector<int>(n, 0));
        vis[st.f][st.s] = 1;
        d[st.f][st.s] = m * x;
        q.push({st.f, st.s});
        // cout<<m<<"\n";
        while(q.size()){
            auto c = q.front(); q.pop();
            int mx = (d[c.f][c.s] + 1) / x;
            for(int i=0; i<4; i++){
                int nx = c.f + xm[i];
                int ny = c.s + ym[i];
                if(nx >= 0 && nx < n && ny >= 0 && ny < n && grid[nx][ny] && !vis[nx][ny] && mx < dst[nx][ny]){
                    d[nx][ny] = d[c.f][c.s] + 1;
                    vis[nx][ny] = 1;
                    q.push({nx, ny});
                }
            }
        }
        // for(int i=0; i<n; i++){
        //     for(int j=0; j<n; j++){
        //         cout<<dst[i][j]<<"|"<<d[i][j]<<" ";
        //     } nl;
        // }
        if(vis[ed.f][ed.s]){
            l = m+1;
            ans = m;
        }
        else{
            r = m-1;
        }
        // nl;
    }
    cout<<ans;
}

Compilation message

mecho.cpp: In function 'int main()':
mecho.cpp:19:40: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   19 |     if (fopen("input.in", "r")) freopen("input.in", "r", stdin);
      |                                 ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
73.0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 332 KB Output is correct
2 Incorrect 1 ms 332 KB Output isn't correct
3 Correct 1 ms 332 KB Output is correct
4 Incorrect 1 ms 332 KB Output isn't correct
5 Correct 0 ms 332 KB Output is correct
6 Incorrect 0 ms 332 KB Output isn't correct
7 Incorrect 103 ms 8040 KB Output isn't correct
8 Correct 0 ms 316 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 0 ms 332 KB Output is correct
12 Incorrect 1 ms 716 KB Output isn't correct
13 Incorrect 1 ms 588 KB Output isn't correct
14 Correct 1 ms 716 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 1 ms 332 KB Output is correct
17 Correct 0 ms 460 KB Output is correct
18 Correct 1 ms 460 KB Output is correct
19 Correct 1 ms 460 KB Output is correct
20 Correct 0 ms 460 KB Output is correct
21 Correct 1 ms 460 KB Output is correct
22 Correct 1 ms 460 KB Output is correct
23 Correct 1 ms 588 KB Output is correct
24 Correct 1 ms 588 KB Output is correct
25 Correct 1 ms 716 KB Output is correct
26 Correct 1 ms 716 KB Output is correct
27 Correct 1 ms 716 KB Output is correct
28 Correct 1 ms 716 KB Output is correct
29 Correct 1 ms 716 KB Output is correct
30 Correct 1 ms 716 KB Output is correct
31 Correct 1 ms 716 KB Output is correct
32 Correct 1 ms 716 KB Output is correct
33 Correct 12 ms 3072 KB Output is correct
34 Correct 8 ms 3048 KB Output is correct
35 Correct 26 ms 3100 KB Output is correct
36 Correct 14 ms 3516 KB Output is correct
37 Correct 11 ms 3516 KB Output is correct
38 Correct 47 ms 3524 KB Output is correct
39 Correct 12 ms 4076 KB Output is correct
40 Correct 12 ms 4076 KB Output is correct
41 Correct 50 ms 4052 KB Output is correct
42 Correct 16 ms 4512 KB Output is correct
43 Correct 18 ms 4580 KB Output is correct
44 Correct 56 ms 4576 KB Output is correct
45 Correct 20 ms 5052 KB Output is correct
46 Correct 20 ms 5104 KB Output is correct
47 Correct 72 ms 5168 KB Output is correct
48 Correct 22 ms 5600 KB Output is correct
49 Correct 30 ms 5600 KB Output is correct
50 Correct 76 ms 5612 KB Output is correct
51 Correct 25 ms 6208 KB Output is correct
52 Correct 27 ms 6168 KB Output is correct
53 Correct 96 ms 6200 KB Output is correct
54 Correct 31 ms 6740 KB Output is correct
55 Correct 41 ms 6796 KB Output is correct
56 Correct 144 ms 6828 KB Output is correct
57 Correct 35 ms 7408 KB Output is correct
58 Correct 36 ms 7392 KB Output is correct
59 Correct 132 ms 7376 KB Output is correct
60 Correct 39 ms 8032 KB Output is correct
61 Correct 52 ms 8032 KB Output is correct
62 Correct 186 ms 8088 KB Output is correct
63 Correct 164 ms 8056 KB Output is correct
64 Correct 270 ms 7996 KB Output is correct
65 Correct 173 ms 8028 KB Output is correct
66 Correct 162 ms 8088 KB Output is correct
67 Correct 138 ms 7976 KB Output is correct
68 Correct 70 ms 8040 KB Output is correct
69 Correct 89 ms 8032 KB Output is correct
70 Correct 62 ms 8108 KB Output is correct
71 Correct 71 ms 8200 KB Output is correct
72 Incorrect 48 ms 8044 KB Output isn't correct
73 Incorrect 58 ms 8076 KB Output isn't correct
74 Correct 79 ms 8024 KB Output is correct
75 Correct 118 ms 8048 KB Output is correct
76 Correct 82 ms 8036 KB Output is correct
77 Correct 82 ms 8036 KB Output is correct
78 Correct 96 ms 8012 KB Output is correct
79 Correct 71 ms 8068 KB Output is correct
80 Correct 80 ms 8032 KB Output is correct
81 Correct 92 ms 8032 KB Output is correct
82 Correct 86 ms 8096 KB Output is correct
83 Correct 97 ms 8156 KB Output is correct
84 Correct 90 ms 8052 KB Output is correct
85 Correct 108 ms 8036 KB Output is correct
86 Correct 144 ms 8028 KB Output is correct
87 Correct 96 ms 8012 KB Output is correct
88 Correct 105 ms 8044 KB Output is correct
89 Correct 129 ms 8012 KB Output is correct
90 Correct 160 ms 8024 KB Output is correct
91 Correct 103 ms 8040 KB Output is correct
92 Correct 121 ms 8052 KB Output is correct