답안 #996915

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
996915	2024-06-11T12:25:18 Z	vjudge1	Mecho (IOI09_mecho)	C++17	100 / 100	137 ms	11848 KB

mecho

#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' and forest[nx][ny]!='M'){
                continue;
            }
            if(bee[nx][ny]>bee[x][y]+1){
                bee[nx][ny]=bee[x][y]+1;
                vert.push({nx,ny});
            }
        }
    }
    int hx,hy;
    ll ok=-1,ng;
    rep(i,n){
        rep(j,n){
            if(forest[i][j]=='D'){
                hx=i;
                hy=j;
            }
            if(forest[i][j]=='M'){
                ng=bee[i][j];
            }
        }
    }
    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]+1LL)/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;
      |            ^~
mecho.cpp:63:19: warning: 'ng' may be used uninitialized in this function [-Wmaybe-uninitialized]
   63 |         ll mid=(ok+ng)>>1;
      |                ~~~^~~~

Subtask #1

100.0 / 100.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	348 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	1 ms	348 KB	Output is correct
7	Correct	75 ms	11296 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	0 ms	468 KB	Output is correct
10	Correct	0 ms	348 KB	Output is correct
11	Correct	0 ms	348 KB	Output is correct
12	Correct	1 ms	348 KB	Output is correct
13	Correct	0 ms	348 KB	Output is 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	348 KB	Output is correct
18	Correct	0 ms	344 KB	Output is correct
19	Correct	0 ms	348 KB	Output is correct
20	Correct	0 ms	348 KB	Output is correct
21	Correct	1 ms	348 KB	Output is correct
22	Correct	0 ms	348 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	0 ms	348 KB	Output is correct
27	Correct	0 ms	348 KB	Output is correct
28	Correct	0 ms	460 KB	Output is correct
29	Correct	1 ms	348 KB	Output is correct
30	Correct	0 ms	404 KB	Output is correct
31	Correct	1 ms	600 KB	Output is correct
32	Correct	1 ms	348 KB	Output is correct
33	Correct	6 ms	2520 KB	Output is correct
34	Correct	6 ms	2416 KB	Output is correct
35	Correct	18 ms	2608 KB	Output is correct
36	Correct	7 ms	3164 KB	Output is correct
37	Correct	7 ms	3164 KB	Output is correct
38	Correct	23 ms	3164 KB	Output is correct
39	Correct	9 ms	3932 KB	Output is correct
40	Correct	9 ms	4048 KB	Output is correct
41	Correct	31 ms	3932 KB	Output is correct
42	Correct	11 ms	4700 KB	Output is correct
43	Correct	17 ms	4884 KB	Output is correct
44	Correct	42 ms	4852 KB	Output is correct
45	Correct	13 ms	5720 KB	Output is correct
46	Correct	16 ms	5724 KB	Output is correct
47	Correct	46 ms	5784 KB	Output is correct
48	Correct	17 ms	6760 KB	Output is correct
49	Correct	20 ms	6580 KB	Output is correct
50	Correct	61 ms	6732 KB	Output is correct
51	Correct	20 ms	7772 KB	Output is correct
52	Correct	20 ms	7728 KB	Output is correct
53	Correct	73 ms	7904 KB	Output is correct
54	Correct	23 ms	8796 KB	Output is correct
55	Correct	23 ms	9052 KB	Output is correct
56	Correct	75 ms	8796 KB	Output is correct
57	Correct	26 ms	10068 KB	Output is correct
58	Correct	27 ms	10076 KB	Output is correct
59	Correct	92 ms	10288 KB	Output is correct
60	Correct	33 ms	11424 KB	Output is correct
61	Correct	30 ms	11612 KB	Output is correct
62	Correct	99 ms	11464 KB	Output is correct
63	Correct	87 ms	11604 KB	Output is correct
64	Correct	137 ms	11348 KB	Output is correct
65	Correct	135 ms	11492 KB	Output is correct
66	Correct	100 ms	11432 KB	Output is correct
67	Correct	92 ms	11600 KB	Output is correct
68	Correct	45 ms	11836 KB	Output is correct
69	Correct	39 ms	11632 KB	Output is correct
70	Correct	36 ms	11504 KB	Output is correct
71	Correct	31 ms	11504 KB	Output is correct
72	Correct	32 ms	11612 KB	Output is correct
73	Correct	30 ms	11676 KB	Output is correct
74	Correct	66 ms	11612 KB	Output is correct
75	Correct	54 ms	11604 KB	Output is correct
76	Correct	54 ms	11664 KB	Output is correct
77	Correct	58 ms	11612 KB	Output is correct
78	Correct	64 ms	11448 KB	Output is correct
79	Correct	50 ms	11604 KB	Output is correct
80	Correct	60 ms	11608 KB	Output is correct
81	Correct	55 ms	11604 KB	Output is correct
82	Correct	56 ms	11600 KB	Output is correct
83	Correct	67 ms	11848 KB	Output is correct
84	Correct	57 ms	11352 KB	Output is correct
85	Correct	63 ms	11684 KB	Output is correct
86	Correct	65 ms	11600 KB	Output is correct
87	Correct	60 ms	11700 KB	Output is correct
88	Correct	69 ms	11696 KB	Output is correct
89	Correct	66 ms	11648 KB	Output is correct
90	Correct	75 ms	11608 KB	Output is correct
91	Correct	71 ms	11608 KB	Output is correct
92	Correct	71 ms	11604 KB	Output is correct