답안 #892978

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
892978	2023-12-26T09:32:49 Z	ilef	Mecho (IOI09_mecho)	C++14	95 / 100	180 ms	25688 KB

mecho

#include<bits/stdc++.h>
#define int long long 
using namespace std;
const int inf=INT_MAX;
 int n,s;
 bool safe(int i,int j){
     return i>=0 && i<n && j>=0 && j<n;
 }
 int di[4]={0,0,-1,1};
 int dj[4]={1,-1,0,0};
int32_t main(){
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
  
    cin>>n>>s;
    char mat[n][n];
    int dist1[n][n];
    int dist2[n][n];
    int homex,homey;
    int honx,hony;
    queue<pair<int,int>>q;
    bool vis1[n][n];
    bool vis2[n][n];
    for(int i=0;i<n;i++){
        for(int j=0;j<n;j++){
            vis1[i][j]=false;
            vis2[i][j]=false;
            dist1[i][j]=inf;
            dist2[i][j]=inf;
        }
    }
    for(int i=0;i<n;i++){
        for(int j=0;j<n;j++){
            cin>>mat[i][j];
            if(mat[i][j]=='M'){
                honx=i;
                hony=j;
            }
            if(mat[i][j]=='D'){
                homex=i;
                homey=j;
            }
            if(mat[i][j]=='H'){
                q.push({i,j});
                dist1[i][j]=0;
                vis1[i][j]=true;
            }
        }
    }
    while(!q.empty()){
        const auto &[i,j]=q.front();
        q.pop();
        for(int l=0;l<4;l++){
            int x=i+di[l];
            int y=j+dj[l];
            if(safe(x,y) && !vis1[x][y] && (mat[x][y]=='G'||mat[x][y]=='M')){
                dist1[x][y]=dist1[i][j]+1;
                vis1[x][y]=true;
                q.push({x,y});
            }
        }
    }
    //bool reached=false;
    int ll=0,rr=n*n;
    int ans=-1;
    while(ll<=rr){
        int mid=(ll+rr)/2;
          for(int i=0;i<n;i++){
          for(int j=0;j<n;j++){
            vis2[i][j]=false;
             dist2[i][j]=inf;
            
        }
    }
       
        if(mid<dist1[honx][hony]){
            dist2[honx][hony]=0;
            vis2[honx][hony]=true;
            q.push({honx,hony});
        }
        while(!q.empty()){
        const auto &[i,j]=q.front();
        q.pop();
        for(int l=0;l<4;l++){
            int x=i+di[l];
            int y=j+dj[l];
                    if(safe(x,y) && (mat[x][y]=='G'|| mat[x][y]=='M')&& !vis2[x][y] &&((dist2[i][j]+1)/s<(dist1[x][y]-mid))){
                        dist2[x][y]=dist2[i][j]+1;
                        vis2[x][y]=true;
                        q.push({x,y});
                    }
                }
             
                }
    bool reached=false;
    for(int i=0;i<4;i++){
        int x=homex+di[i];
        int y=homey+dj[i];
          
        if(safe(x,y) && vis2[x][y]  && (mat[x][y]=='G'|| mat[x][y]=='M') && dist2[x][y]/s<dist1[x][y]-mid){
            reached=true;
        }
    }
            
    if(reached){
        ans=mid;
        ll=mid+1;
    }
    else{
        //ans=mid;
        rr=mid-1;
    }
    }
       cout<<ll-1<<endl;
}

Compilation message

mecho.cpp: In function 'int32_t main()':
mecho.cpp:52:21: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   52 |         const auto &[i,j]=q.front();
      |                     ^
mecho.cpp:83:21: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   83 |         const auto &[i,j]=q.front();
      |                     ^
mecho.cpp:66:9: warning: variable 'ans' set but not used [-Wunused-but-set-variable]
   66 |     int ans=-1;
      |         ^~~
mecho.cpp:78:30: warning: 'hony' may be used uninitialized in this function [-Wmaybe-uninitialized]
   78 |             dist2[honx][hony]=0;
      |             ~~~~~~~~~~~~~~~~~^~
mecho.cpp:99:13: warning: 'homey' may be used uninitialized in this function [-Wmaybe-uninitialized]
   99 |         int y=homey+dj[i];
      |             ^
mecho.cpp:98:13: warning: 'homex' may be used uninitialized in this function [-Wmaybe-uninitialized]
   98 |         int x=homex+di[i];
      |             ^
mecho.cpp:78:30: warning: 'honx' may be used uninitialized in this function [-Wmaybe-uninitialized]
   78 |             dist2[honx][hony]=0;
      |             ~~~~~~~~~~~~~~~~~^~

Subtask #1

95.0 / 100.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	348 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	1 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	0 ms	348 KB	Output is correct
7	Correct	85 ms	12576 KB	Output is correct
8	Correct	0 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	Correct	0 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	348 KB	Output is correct
19	Correct	1 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	1 ms	348 KB	Output is correct
24	Correct	1 ms	348 KB	Output is correct
25	Correct	0 ms	348 KB	Output is correct
26	Correct	0 ms	348 KB	Output is correct
27	Correct	1 ms	348 KB	Output is correct
28	Correct	0 ms	348 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	360 KB	Output is correct
33	Correct	6 ms	2732 KB	Output is correct
34	Correct	6 ms	2652 KB	Output is correct
35	Correct	18 ms	2732 KB	Output is correct
36	Correct	7 ms	3420 KB	Output is correct
37	Correct	8 ms	3428 KB	Output is correct
38	Correct	24 ms	3420 KB	Output is correct
39	Correct	12 ms	4444 KB	Output is correct
40	Correct	10 ms	4216 KB	Output is correct
41	Correct	33 ms	4188 KB	Output is correct
42	Correct	11 ms	4956 KB	Output is correct
43	Correct	12 ms	4860 KB	Output is correct
44	Correct	40 ms	4956 KB	Output is correct
45	Correct	13 ms	5980 KB	Output is correct
46	Correct	14 ms	5908 KB	Output is correct
47	Correct	54 ms	6076 KB	Output is correct
48	Correct	16 ms	7004 KB	Output is correct
49	Correct	23 ms	7004 KB	Output is correct
50	Correct	66 ms	7252 KB	Output is correct
51	Correct	18 ms	8284 KB	Output is correct
52	Correct	20 ms	8280 KB	Output is correct
53	Correct	80 ms	8284 KB	Output is correct
54	Correct	22 ms	9560 KB	Output is correct
55	Correct	23 ms	9304 KB	Output is correct
56	Correct	89 ms	9560 KB	Output is correct
57	Correct	25 ms	10844 KB	Output is correct
58	Correct	26 ms	10840 KB	Output is correct
59	Correct	105 ms	10844 KB	Output is correct
60	Correct	28 ms	12124 KB	Output is correct
61	Correct	31 ms	12124 KB	Output is correct
62	Correct	120 ms	12348 KB	Output is correct
63	Correct	94 ms	12332 KB	Output is correct
64	Correct	180 ms	12332 KB	Output is correct
65	Correct	138 ms	12124 KB	Output is correct
66	Correct	130 ms	12332 KB	Output is correct
67	Correct	102 ms	12336 KB	Output is correct
68	Correct	53 ms	12380 KB	Output is correct
69	Correct	51 ms	12392 KB	Output is correct
70	Correct	49 ms	12392 KB	Output is correct
71	Correct	49 ms	12464 KB	Output is correct
72	Correct	37 ms	12376 KB	Output is correct
73	Runtime error	35 ms	25640 KB	Execution killed with signal 11
74	Runtime error	35 ms	25628 KB	Execution killed with signal 11
75	Correct	71 ms	12892 KB	Output is correct
76	Runtime error	58 ms	25624 KB	Execution killed with signal 11
77	Runtime error	74 ms	25688 KB	Execution killed with signal 11
78	Correct	81 ms	12824 KB	Output is correct
79	Correct	50 ms	12636 KB	Output is correct
80	Correct	57 ms	12636 KB	Output is correct
81	Correct	71 ms	12644 KB	Output is correct
82	Correct	58 ms	12632 KB	Output is correct
83	Correct	76 ms	12636 KB	Output is correct
84	Correct	74 ms	12636 KB	Output is correct
85	Correct	71 ms	12636 KB	Output is correct
86	Correct	70 ms	12636 KB	Output is correct
87	Correct	76 ms	12632 KB	Output is correct
88	Correct	78 ms	12612 KB	Output is correct
89	Correct	85 ms	12636 KB	Output is correct
90	Correct	87 ms	12636 KB	Output is correct
91	Correct	77 ms	12656 KB	Output is correct
92	Correct	83 ms	12636 KB	Output is correct