oj.uz

Submission #957744

# Submission time Handle Problem Language Result Execution time Memory
957744 2024-04-04T09:05:15 Z hirayuu_oj Mecho (IOI09_mecho) C++17
84 / 100
 182 ms 11860 KB 
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<(n); i++)
#define rep2(i,a,b) for(int i=a; i<(b); i++)
#define all(x) x.begin(),x.end()
using ll=long long;
const ll INF=1LL<<60;
const int four[5]={0,1,0,-1,0};

int main(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    int n;
    ll s;
    cin>>n>>s;
    vector<string> forest(n);
    rep(i,n){
        cin>>forest[i];
    }
    vector<vector<ll>> bee(n,vector<ll>(n,INF));
    queue<pair<int,int>> vert;
    rep(i,n){
        rep(j,n){
            if(forest[i][j]=='H'){
                bee[i][j]=0;
                vert.push({i,j});
            }
        }
    }
    while(!vert.empty()){
        int x,y;
        tie(x,y)=vert.front();
        vert.pop();
        rep(i,4){
            int nx=x+four[i],ny=y+four[i+1];
            if(nx<0 or n<=nx or ny<0 or n<=ny){
                continue;
            }
            if(forest[nx][ny]!='G'){
                continue;
            }
            if(bee[nx][ny]>bee[x][y]+1){
                bee[nx][ny]=bee[x][y]+1;
                vert.push({nx,ny});
            }
        }
    }
    int hx,hy;
    rep(i,n){
        rep(j,n){
            if(forest[i][j]=='D'){
                hx=i;
                hy=j;
            }
        }
    }
    ll ok=-1,ng=n*n+1000;
    vector<vector<ll>> dist(n,vector<ll>(n));
    while(ng-ok>1){
        ll mid=(ok+ng)>>1;
        rep(i,n){
            rep(j,n){
                if(forest[i][j]=='M'){
                    dist[i][j]=mid*s;
                    vert.push({i,j});
                }
                else{
                    dist[i][j]=INF;
                }
            }
        }
        bool can=false;
        while(!vert.empty()){
            int x,y;
            tie(x,y)=vert.front();
            vert.pop();
            rep(i,4){
                int nx=x+four[i],ny=y+four[i+1];
                if(nx<0 or n<=nx or ny<0 or n<=ny){
                    continue;
                }
                if(forest[nx][ny]=='D'){
                    can=true;
                }
                if(forest[nx][ny]!='G'){
                    continue;
                }
                if((dist[x][y]+1)/s>=bee[nx][ny]){
                    continue;
                }
                if(dist[nx][ny]>dist[x][y]+1){
                    dist[nx][ny]=dist[x][y]+1;
                    vert.push({nx,ny});
                }
            }
        }
        if(can){
            ok=mid;
        }
        else{
            ng=mid;
        }
    }
    cout<<ok<<"\n";
}

Compilation message

mecho.cpp: In function 'int main()':
mecho.cpp:48:9: warning: variable 'hx' set but not used [-Wunused-but-set-variable]
   48 |     int hx,hy;
      |         ^~
mecho.cpp:48:12: warning: variable 'hy' set but not used [-Wunused-but-set-variable]
   48 |     int hx,hy;
      |            ^~

Subtask #1
84.0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 460 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 344 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 344 KB Output is correct
7 Correct 96 ms 11292 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Incorrect 1 ms 344 KB Output isn't correct
13 Incorrect 1 ms 348 KB Output isn't correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 472 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 1 ms 344 KB Output is correct
21 Correct 1 ms 344 KB Output is correct
22 Correct 1 ms 600 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Correct 1 ms 348 KB Output is correct
27 Correct 1 ms 348 KB Output is correct
28 Correct 1 ms 344 KB Output is correct
29 Correct 1 ms 348 KB Output is correct
30 Correct 1 ms 348 KB Output is correct
31 Correct 1 ms 348 KB Output is correct
32 Correct 1 ms 348 KB Output is correct
33 Correct 6 ms 2400 KB Output is correct
34 Correct 6 ms 2396 KB Output is correct
35 Correct 21 ms 2612 KB Output is correct
36 Correct 8 ms 3164 KB Output is correct
37 Correct 8 ms 3292 KB Output is correct
38 Correct 27 ms 3164 KB Output is correct
39 Correct 10 ms 3816 KB Output is correct
40 Correct 10 ms 3844 KB Output is correct
41 Correct 38 ms 3932 KB Output is correct
42 Correct 12 ms 4700 KB Output is correct
43 Correct 13 ms 4880 KB Output is correct
44 Correct 46 ms 4708 KB Output is correct
45 Correct 14 ms 5756 KB Output is correct
46 Correct 17 ms 5588 KB Output is correct
47 Correct 52 ms 5788 KB Output is correct
48 Correct 17 ms 6760 KB Output is correct
49 Correct 18 ms 6724 KB Output is correct
50 Correct 64 ms 6760 KB Output is correct
51 Correct 21 ms 7768 KB Output is correct
52 Correct 20 ms 7772 KB Output is correct
53 Correct 99 ms 7900 KB Output is correct
54 Correct 23 ms 8788 KB Output is correct
55 Correct 23 ms 9052 KB Output is correct
56 Correct 112 ms 9052 KB Output is correct
57 Correct 30 ms 10076 KB Output is correct
58 Correct 29 ms 10064 KB Output is correct
59 Correct 117 ms 10064 KB Output is correct
60 Correct 38 ms 11612 KB Output is correct
61 Correct 32 ms 11464 KB Output is correct
62 Correct 141 ms 11612 KB Output is correct
63 Correct 96 ms 11600 KB Output is correct
64 Correct 182 ms 11348 KB Output is correct
65 Correct 143 ms 11656 KB Output is correct
66 Correct 115 ms 11612 KB Output is correct
67 Correct 108 ms 11636 KB Output is correct
68 Correct 53 ms 11668 KB Output is correct
69 Correct 55 ms 11612 KB Output is correct
70 Correct 43 ms 11604 KB Output is correct
71 Correct 50 ms 11528 KB Output is correct
72 Incorrect 41 ms 11480 KB Output isn't correct
73 Incorrect 81 ms 11604 KB Output isn't correct
74 Correct 75 ms 11660 KB Output is correct
75 Correct 82 ms 11604 KB Output is correct
76 Correct 69 ms 11624 KB Output is correct
77 Correct 89 ms 11696 KB Output is correct
78 Correct 100 ms 11652 KB Output is correct
79 Correct 55 ms 11600 KB Output is correct
80 Correct 68 ms 11600 KB Output is correct
81 Correct 77 ms 11600 KB Output is correct
82 Correct 84 ms 11644 KB Output is correct
83 Correct 86 ms 11604 KB Output is correct
84 Correct 79 ms 11500 KB Output is correct
85 Correct 81 ms 11600 KB Output is correct
86 Correct 106 ms 11860 KB Output is correct
87 Correct 83 ms 11600 KB Output is correct
88 Correct 99 ms 11600 KB Output is correct
89 Correct 85 ms 11420 KB Output is correct
90 Correct 120 ms 11644 KB Output is correct
91 Correct 90 ms 11664 KB Output is correct
92 Correct 100 ms 11612 KB Output is correct