oj.uz

Submission #1008426

# Submission time Handle Problem Language Result Execution time Memory
1008426 2024-06-26T12:20:35 Z ByeWorld Mecho (IOI09_mecho) C++14
39 / 100
 223 ms 18304 KB 
#include <bits/stdc++.h>
#pragma GCC optimize("O3", "unroll-loops")
#define ll long long
#define int long long
#define pb push_back
#define fi first
#define se second
#define lf (id<<1)
#define rg ((id<<1)|1)
#define md ((l+r)>>1)
#define ld long double
using namespace std;
typedef pair<int,int> pii;
typedef pair<pii, int> ipii;
const int MAXN = 1010;
const int MAXA = 2e3+10;
const int INF = 1e18+10;
const int LOG = 63;
const int MOD = 1e9+7;
const int SQRT = 450;
const vector<int> NOL = {};
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
const vector<int> dx = {1, -1, 0, 0};
const vector<int> dy = {0, 0, 1, -1};

int n, m, k;
char c[MAXN][MAXN];
int dis[MAXN][MAXN], val[MAXN][MAXN];
int sta, en;

bool valid(int x, int y){
    if(x<1 || x>n || y<1 || y>m) return 0;
    if(c[x][y] == 'T') return 0;
    return 1;
}

queue <pii> q;
void bfs(){
    while(!q.empty()){
        int dist = q.front().fi, x = q.front().se/MAXN, y = q.front().se%MAXN;
        q.pop();
        if(dist > dis[x][y]) continue;
        for(int i=0; i<4; i++){
            int nx = x+dx[i], ny = y+dy[i];
            if(!valid(nx, ny)) continue;
            if(dis[nx][ny] <= dis[x][y]+k) continue;
            dis[nx][ny] = dis[x][y]+k;
            q.push({dis[nx][ny], nx*MAXN+ny});
        }
    }
}
bool bisa(int num){
    if(dis[sta/MAXN][sta%MAXN] <= num) return 0;
    for(int i=1; i<=n; i++)
        for(int j=1; j<=m; j++) val[i][j] = INF;
    q.push({num, sta}); val[sta/MAXN][sta%MAXN] = num;
    while(!q.empty()){
        int dist = q.front().fi, x = q.front().se/MAXN, y = q.front().se%MAXN;
        q.pop();
        if(dist >= dis[x][y]) continue; // bee ke sini
        if(dist > val[x][y]) continue;
        for(int i=0; i<4; i++){
            int nx = x+dx[i], ny = y+dy[i];
            if(!valid(nx, ny)) continue;
            if(val[nx][ny] <= val[x][y]+1) continue;
            if(dis[nx][ny] <= val[x][y]+1) continue;
            val[nx][ny] = val[x][y]+1;
            q.push({val[nx][ny], nx*MAXN+ny});
        }
    }
    return (val[en/MAXN][en%MAXN] < INF);
}
signed main(){
    // ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
    cin >> n >> k; m = n;
    for(int i=1; i<=n; i++)
        for(int j=1; j<=m; j++) dis[i][j] = INF;
    for(int i=1; i<=n; i++){
        for(int j=1; j<=m; j++){
            cin >> c[i][j];
            if(c[i][j]=='H'){
                q.push({0, i*MAXN+j});
                dis[i][j] = 0;
            } else if(c[i][j]=='D') en = i*MAXN+j;
            else if(c[i][j]=='M') sta = i*MAXN+j;
        }
    }
    bfs();
    // for(int i=1; i<=n; i++){
    //     for(int j=1; j<=m; j++) cout << dis[i][j] << " \n"[j==m];
    // }
    int l=0, r=n*m+100, mid=0, cnt=-1;
    while(l<=r){
        mid = md;
        if(bisa(mid)){ cnt = mid; l = mid+1;}
        else r = mid-1;
    }
    cout << cnt/k << '\n';
}

Subtask #1
39.0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4444 KB Output is correct
2 Incorrect 1 ms 4444 KB Output isn't correct
3 Correct 1 ms 4444 KB Output is correct
4 Incorrect 1 ms 4444 KB Output isn't correct
5 Correct 1 ms 4444 KB Output is correct
6 Incorrect 1 ms 4444 KB Output isn't correct
7 Incorrect 92 ms 18028 KB Output isn't correct
8 Correct 1 ms 4440 KB Output is correct
9 Correct 1 ms 4444 KB Output is correct
10 Correct 1 ms 4700 KB Output is correct
11 Correct 1 ms 4444 KB Output is correct
12 Incorrect 1 ms 8540 KB Output isn't correct
13 Correct 1 ms 6492 KB Output is correct
14 Incorrect 1 ms 6748 KB Output isn't correct
15 Correct 1 ms 4444 KB Output is correct
16 Incorrect 1 ms 4444 KB Output isn't correct
17 Correct 1 ms 6492 KB Output is correct
18 Incorrect 1 ms 6492 KB Output isn't correct
19 Correct 1 ms 6488 KB Output is correct
20 Incorrect 1 ms 6492 KB Output isn't correct
21 Correct 1 ms 6492 KB Output is correct
22 Incorrect 1 ms 6492 KB Output isn't correct
23 Correct 1 ms 6492 KB Output is correct
24 Incorrect 1 ms 6492 KB Output isn't correct
25 Correct 1 ms 8540 KB Output is correct
26 Incorrect 1 ms 8540 KB Output isn't correct
27 Correct 1 ms 8540 KB Output is correct
28 Incorrect 1 ms 8540 KB Output isn't correct
29 Correct 1 ms 8652 KB Output is correct
30 Incorrect 1 ms 8540 KB Output isn't correct
31 Correct 1 ms 8540 KB Output is correct
32 Incorrect 2 ms 8656 KB Output isn't correct
33 Correct 7 ms 11416 KB Output is correct
34 Incorrect 23 ms 12904 KB Output isn't correct
35 Correct 27 ms 12892 KB Output is correct
36 Correct 9 ms 12888 KB Output is correct
37 Incorrect 25 ms 11612 KB Output isn't correct
38 Correct 36 ms 11876 KB Output is correct
39 Correct 11 ms 12120 KB Output is correct
40 Incorrect 32 ms 12892 KB Output isn't correct
41 Correct 45 ms 12124 KB Output is correct
42 Correct 14 ms 12856 KB Output is correct
43 Incorrect 41 ms 12796 KB Output isn't correct
44 Correct 51 ms 12636 KB Output is correct
45 Correct 15 ms 13304 KB Output is correct
46 Incorrect 49 ms 13272 KB Output isn't correct
47 Correct 67 ms 13144 KB Output is correct
48 Correct 19 ms 15708 KB Output is correct
49 Incorrect 72 ms 15656 KB Output isn't correct
50 Correct 88 ms 15700 KB Output is correct
51 Correct 22 ms 16216 KB Output is correct
52 Incorrect 68 ms 16216 KB Output isn't correct
53 Correct 88 ms 16216 KB Output is correct
54 Correct 22 ms 16732 KB Output is correct
55 Incorrect 79 ms 16732 KB Output isn't correct
56 Correct 110 ms 16724 KB Output is correct
57 Correct 27 ms 17236 KB Output is correct
58 Incorrect 85 ms 17244 KB Output isn't correct
59 Correct 123 ms 17300 KB Output is correct
60 Correct 30 ms 17632 KB Output is correct
61 Incorrect 122 ms 17804 KB Output isn't correct
62 Correct 149 ms 17752 KB Output is correct
63 Correct 85 ms 17748 KB Output is correct
64 Incorrect 223 ms 17804 KB Output isn't correct
65 Correct 131 ms 17744 KB Output is correct
66 Correct 115 ms 17744 KB Output is correct
67 Incorrect 95 ms 17756 KB Output isn't correct
68 Correct 63 ms 17684 KB Output is correct
69 Correct 58 ms 17720 KB Output is correct
70 Correct 48 ms 17744 KB Output is correct
71 Correct 43 ms 17748 KB Output is correct
72 Correct 37 ms 17744 KB Output is correct
73 Correct 60 ms 18304 KB Output is correct
74 Correct 69 ms 18224 KB Output is correct
75 Correct 67 ms 18260 KB Output is correct
76 Correct 56 ms 18268 KB Output is correct
77 Correct 66 ms 18268 KB Output is correct
78 Incorrect 77 ms 18260 KB Output isn't correct
79 Correct 67 ms 18256 KB Output is correct
80 Correct 58 ms 18260 KB Output is correct
81 Correct 67 ms 18272 KB Output is correct
82 Correct 63 ms 18300 KB Output is correct
83 Correct 75 ms 18228 KB Output is correct
84 Correct 91 ms 18000 KB Output is correct
85 Correct 75 ms 18104 KB Output is correct
86 Correct 75 ms 18224 KB Output is correct
87 Correct 75 ms 18224 KB Output is correct
88 Correct 84 ms 18124 KB Output is correct
89 Correct 100 ms 18100 KB Output is correct
90 Correct 94 ms 17972 KB Output is correct
91 Correct 88 ms 18000 KB Output is correct
92 Correct 84 ms 18000 KB Output is correct