oj.uz

Submission #1008471

# Submission time Handle Problem Language Result Execution time Memory
1008471 2024-06-26T13:04:27 Z ByeWorld Mecho (IOI09_mecho) C++14
100 / 100
 132 ms 15068 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(c[nx][ny] == 'D') 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*k) return 0;
    for(int i=1; i<=n; i++)
        for(int j=1; j<=m; j++) val[i][j] = INF;
    q.push({num*k, sta}); val[sta/MAXN][sta%MAXN] = num*k;
    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, mid=0, cnt=-1;
    while(l<=r){
        mid = md;
        if(bisa(mid)){ cnt = mid; l = mid+1;}
        else r = mid-1;
    }
    cout << cnt << '\n';
}

Subtask #1
100.0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 68 ms 14556 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 0 ms 604 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 1 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 1 ms 852 KB Output is correct
17 Correct 0 ms 600 KB Output is correct
18 Correct 0 ms 600 KB Output is correct
19 Correct 0 ms 604 KB Output is correct
20 Correct 0 ms 600 KB Output is correct
21 Correct 1 ms 604 KB Output is correct
22 Correct 1 ms 600 KB Output is correct
23 Correct 0 ms 860 KB Output is correct
24 Correct 0 ms 860 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 1116 KB Output is correct
28 Correct 1 ms 1116 KB Output is correct
29 Correct 1 ms 1116 KB Output is correct
30 Correct 1 ms 1116 KB Output is correct
31 Correct 1 ms 1116 KB Output is correct
32 Correct 1 ms 1112 KB Output is correct
33 Correct 8 ms 5468 KB Output is correct
34 Correct 8 ms 5544 KB Output is correct
35 Correct 18 ms 5644 KB Output is correct
36 Correct 10 ms 6492 KB Output is correct
37 Correct 10 ms 6716 KB Output is correct
38 Correct 21 ms 6492 KB Output is correct
39 Correct 12 ms 7772 KB Output is correct
40 Correct 12 ms 7772 KB Output is correct
41 Correct 29 ms 7796 KB Output is correct
42 Correct 16 ms 9052 KB Output is correct
43 Correct 18 ms 9052 KB Output is correct
44 Correct 36 ms 9052 KB Output is correct
45 Correct 19 ms 9816 KB Output is correct
46 Correct 16 ms 9820 KB Output is correct
47 Correct 40 ms 9748 KB Output is correct
48 Correct 20 ms 10704 KB Output is correct
49 Correct 19 ms 10696 KB Output is correct
50 Correct 49 ms 10840 KB Output is correct
51 Correct 23 ms 11864 KB Output is correct
52 Correct 23 ms 11600 KB Output is correct
53 Correct 66 ms 11612 KB Output is correct
54 Correct 33 ms 12492 KB Output is correct
55 Correct 31 ms 12632 KB Output is correct
56 Correct 76 ms 12628 KB Output is correct
57 Correct 31 ms 13392 KB Output is correct
58 Correct 29 ms 13404 KB Output is correct
59 Correct 78 ms 13404 KB Output is correct
60 Correct 33 ms 14428 KB Output is correct
61 Correct 38 ms 14304 KB Output is correct
62 Correct 107 ms 14524 KB Output is correct
63 Correct 85 ms 14416 KB Output is correct
64 Correct 132 ms 14344 KB Output is correct
65 Correct 113 ms 14508 KB Output is correct
66 Correct 92 ms 14416 KB Output is correct
67 Correct 96 ms 14512 KB Output is correct
68 Correct 52 ms 14416 KB Output is correct
69 Correct 49 ms 14416 KB Output is correct
70 Correct 40 ms 14416 KB Output is correct
71 Correct 46 ms 14420 KB Output is correct
72 Correct 35 ms 14416 KB Output is correct
73 Correct 36 ms 14932 KB Output is correct
74 Correct 52 ms 14936 KB Output is correct
75 Correct 70 ms 15068 KB Output is correct
76 Correct 59 ms 14932 KB Output is correct
77 Correct 65 ms 14936 KB Output is correct
78 Correct 71 ms 14928 KB Output is correct
79 Correct 54 ms 14928 KB Output is correct
80 Correct 53 ms 14928 KB Output is correct
81 Correct 58 ms 15004 KB Output is correct
82 Correct 54 ms 14940 KB Output is correct
83 Correct 62 ms 14928 KB Output is correct
84 Correct 61 ms 14932 KB Output is correct
85 Correct 69 ms 14888 KB Output is correct
86 Correct 76 ms 14924 KB Output is correct
87 Correct 64 ms 14928 KB Output is correct
88 Correct 70 ms 14676 KB Output is correct
89 Correct 68 ms 14676 KB Output is correct
90 Correct 99 ms 14672 KB Output is correct
91 Correct 68 ms 14664 KB Output is correct
92 Correct 88 ms 14672 KB Output is correct