답안 #957745

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
957745	2024-04-04T09:07:44 Z	hirayuu_oj	Mecho (IOI09_mecho)	C++17	84 / 100	186 ms	11276 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'){
                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=1<<30;
    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

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	344 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	107 ms	11100 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	0 ms	348 KB	Output is correct
11	Correct	1 ms	600 KB	Output is correct
12	Incorrect	0 ms	348 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	1 ms	600 KB	Output is correct
17	Correct	0 ms	348 KB	Output is correct
18	Correct	0 ms	348 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	344 KB	Output is correct
22	Correct	1 ms	348 KB	Output is correct
23	Correct	0 ms	488 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	348 KB	Output is correct
29	Correct	1 ms	504 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	7 ms	2396 KB	Output is correct
34	Correct	8 ms	2392 KB	Output is correct
35	Correct	24 ms	2392 KB	Output is correct
36	Correct	9 ms	3164 KB	Output is correct
37	Correct	9 ms	3116 KB	Output is correct
38	Correct	35 ms	3168 KB	Output is correct
39	Correct	12 ms	3676 KB	Output is correct
40	Correct	12 ms	3676 KB	Output is correct
41	Correct	39 ms	3676 KB	Output is correct
42	Correct	15 ms	4444 KB	Output is correct
43	Correct	17 ms	4444 KB	Output is correct
44	Correct	50 ms	4444 KB	Output is correct
45	Correct	17 ms	5468 KB	Output is correct
46	Correct	17 ms	5468 KB	Output is correct
47	Correct	60 ms	5468 KB	Output is correct
48	Correct	21 ms	6488 KB	Output is correct
49	Correct	21 ms	6492 KB	Output is correct
50	Correct	79 ms	6528 KB	Output is correct
51	Correct	24 ms	7516 KB	Output is correct
52	Correct	24 ms	7516 KB	Output is correct
53	Correct	92 ms	7580 KB	Output is correct
54	Correct	34 ms	8964 KB	Output is correct
55	Correct	30 ms	8540 KB	Output is correct
56	Correct	109 ms	8708 KB	Output is correct
57	Correct	30 ms	9944 KB	Output is correct
58	Correct	30 ms	9820 KB	Output is correct
59	Correct	118 ms	9820 KB	Output is correct
60	Correct	35 ms	11096 KB	Output is correct
61	Correct	38 ms	11100 KB	Output is correct
62	Correct	158 ms	11100 KB	Output is correct
63	Correct	109 ms	11100 KB	Output is correct
64	Correct	186 ms	11220 KB	Output is correct
65	Correct	176 ms	11096 KB	Output is correct
66	Correct	135 ms	11216 KB	Output is correct
67	Correct	121 ms	11220 KB	Output is correct
68	Correct	65 ms	11232 KB	Output is correct
69	Correct	65 ms	11100 KB	Output is correct
70	Correct	57 ms	11100 KB	Output is correct
71	Correct	55 ms	11248 KB	Output is correct
72	Incorrect	55 ms	11060 KB	Output isn't correct
73	Incorrect	93 ms	11096 KB	Output isn't correct
74	Correct	86 ms	11084 KB	Output is correct
75	Correct	93 ms	11272 KB	Output is correct
76	Correct	93 ms	11272 KB	Output is correct
77	Correct	98 ms	11264 KB	Output is correct
78	Correct	114 ms	11256 KB	Output is correct
79	Correct	79 ms	11100 KB	Output is correct
80	Correct	86 ms	11100 KB	Output is correct
81	Correct	102 ms	11272 KB	Output is correct
82	Correct	96 ms	11264 KB	Output is correct
83	Correct	107 ms	11276 KB	Output is correct
84	Correct	112 ms	11112 KB	Output is correct
85	Correct	101 ms	11256 KB	Output is correct
86	Correct	113 ms	11260 KB	Output is correct
87	Correct	110 ms	11276 KB	Output is correct
88	Correct	110 ms	11216 KB	Output is correct
89	Correct	121 ms	11040 KB	Output is correct
90	Correct	117 ms	11196 KB	Output is correct
91	Correct	127 ms	11100 KB	Output is correct
92	Correct	120 ms	11248 KB	Output is correct