답안 #892957

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
892957	2023-12-26T08:59:09 Z	ilef	Mecho (IOI09_mecho)	C++14	4 / 100	120 ms	25652 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+1;
    while(ll+1<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]=mid;
            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];
            double dss=dist2[i][j]+1;
            dss/=2;
            int ds=ceil(dss);
                    if(safe(x,y) && (mat[x][y]=='G'|| mat[x][y]=='D')&& !vis2[x][y] &&( (ds)<dist1[x][y])){
                        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]){
            double dss=dist2[x][y];
            dss/=2;
            int ds=ceil(dss);
            if(ds<dist1[x][y]){
            reached=true;}
        }
    }
            
    if(reached){
        ll=mid;
    }
    else{
        rr=mid;
    }
    }
       cout<<rr<<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:82:21: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   82 |         const auto &[i,j]=q.front();
      |                     ^
mecho.cpp:100:13: warning: 'homex' may be used uninitialized in this function [-Wmaybe-uninitialized]
  100 |         int x=homex+di[i];
      |             ^
mecho.cpp:76:32: warning: 'honx' may be used uninitialized in this function [-Wmaybe-uninitialized]
   76 |         if(mid<dist1[honx][hony]){
      |                ~~~~~~~~~~~~~~~~^
mecho.cpp:101:13: warning: 'homey' may be used uninitialized in this function [-Wmaybe-uninitialized]
  101 |         int y=homey+dj[i];
      |             ^
mecho.cpp:76:32: warning: 'hony' may be used uninitialized in this function [-Wmaybe-uninitialized]
   76 |         if(mid<dist1[honx][hony]){
      |                ~~~~~~~~~~~~~~~~^

Subtask #1

4.0 / 100.0

#	결과	실행 시간	메모리	Grader output
1	Incorrect	0 ms	344 KB	Output isn't correct
2	Incorrect	1 ms	348 KB	Output isn't correct
3	Incorrect	0 ms	400 KB	Output isn't correct
4	Incorrect	0 ms	348 KB	Output isn't correct
5	Incorrect	0 ms	348 KB	Output isn't correct
6	Correct	0 ms	348 KB	Output is correct
7	Incorrect	52 ms	12552 KB	Output isn't correct
8	Incorrect	0 ms	348 KB	Output isn't correct
9	Correct	0 ms	348 KB	Output is correct
10	Incorrect	0 ms	348 KB	Output isn't correct
11	Incorrect	0 ms	348 KB	Output isn't correct
12	Incorrect	0 ms	344 KB	Output isn't correct
13	Incorrect	1 ms	344 KB	Output isn't correct
14	Incorrect	1 ms	348 KB	Output isn't correct
15	Incorrect	1 ms	348 KB	Output isn't correct
16	Incorrect	0 ms	348 KB	Output isn't correct
17	Incorrect	1 ms	344 KB	Output isn't correct
18	Incorrect	0 ms	344 KB	Output isn't correct
19	Incorrect	0 ms	348 KB	Output isn't correct
20	Incorrect	1 ms	348 KB	Output isn't correct
21	Incorrect	1 ms	348 KB	Output isn't correct
22	Incorrect	1 ms	348 KB	Output isn't correct
23	Incorrect	0 ms	348 KB	Output isn't correct
24	Incorrect	1 ms	348 KB	Output isn't correct
25	Incorrect	1 ms	348 KB	Output isn't correct
26	Incorrect	1 ms	348 KB	Output isn't correct
27	Incorrect	1 ms	348 KB	Output isn't correct
28	Incorrect	1 ms	348 KB	Output isn't correct
29	Incorrect	1 ms	348 KB	Output isn't correct
30	Incorrect	1 ms	344 KB	Output isn't correct
31	Incorrect	1 ms	348 KB	Output isn't correct
32	Incorrect	1 ms	344 KB	Output isn't correct
33	Incorrect	10 ms	2648 KB	Output isn't correct
34	Incorrect	9 ms	2652 KB	Output isn't correct
35	Incorrect	7 ms	2664 KB	Output isn't correct
36	Incorrect	13 ms	3420 KB	Output isn't correct
37	Incorrect	13 ms	3420 KB	Output isn't correct
38	Incorrect	10 ms	3416 KB	Output isn't correct
39	Incorrect	17 ms	4216 KB	Output isn't correct
40	Incorrect	18 ms	4188 KB	Output isn't correct
41	Incorrect	13 ms	4184 KB	Output isn't correct
42	Incorrect	21 ms	5164 KB	Output isn't correct
43	Incorrect	20 ms	4956 KB	Output isn't correct
44	Incorrect	22 ms	5112 KB	Output isn't correct
45	Incorrect	28 ms	6232 KB	Output isn't correct
46	Incorrect	22 ms	5980 KB	Output isn't correct
47	Incorrect	19 ms	5976 KB	Output isn't correct
48	Incorrect	32 ms	7004 KB	Output isn't correct
49	Incorrect	26 ms	7120 KB	Output isn't correct
50	Incorrect	23 ms	7156 KB	Output isn't correct
51	Incorrect	35 ms	8284 KB	Output isn't correct
52	Incorrect	31 ms	8280 KB	Output isn't correct
53	Incorrect	29 ms	8284 KB	Output isn't correct
54	Incorrect	39 ms	9308 KB	Output isn't correct
55	Incorrect	35 ms	9308 KB	Output isn't correct
56	Incorrect	45 ms	9716 KB	Output isn't correct
57	Incorrect	53 ms	10844 KB	Output isn't correct
58	Incorrect	46 ms	11096 KB	Output isn't correct
59	Incorrect	38 ms	10840 KB	Output isn't correct
60	Incorrect	56 ms	12372 KB	Output isn't correct
61	Incorrect	53 ms	12120 KB	Output isn't correct
62	Incorrect	43 ms	12124 KB	Output isn't correct
63	Incorrect	120 ms	12352 KB	Output isn't correct
64	Incorrect	111 ms	12124 KB	Output isn't correct
65	Incorrect	115 ms	12380 KB	Output isn't correct
66	Incorrect	93 ms	12124 KB	Output isn't correct
67	Incorrect	110 ms	12124 KB	Output isn't correct
68	Incorrect	31 ms	12376 KB	Output isn't correct
69	Incorrect	36 ms	12380 KB	Output isn't correct
70	Incorrect	31 ms	12380 KB	Output isn't correct
71	Incorrect	31 ms	12380 KB	Output isn't correct
72	Incorrect	33 ms	12376 KB	Output isn't correct
73	Runtime error	34 ms	25636 KB	Execution killed with signal 11
74	Runtime error	34 ms	25628 KB	Execution killed with signal 11
75	Incorrect	47 ms	12888 KB	Output isn't correct
76	Incorrect	45 ms	12892 KB	Output isn't correct
77	Runtime error	41 ms	25652 KB	Execution killed with signal 11
78	Incorrect	44 ms	12828 KB	Output isn't correct
79	Incorrect	37 ms	12636 KB	Output isn't correct
80	Incorrect	38 ms	12632 KB	Output isn't correct
81	Incorrect	44 ms	12832 KB	Output isn't correct
82	Incorrect	44 ms	12640 KB	Output isn't correct
83	Incorrect	53 ms	12924 KB	Output isn't correct
84	Incorrect	41 ms	12636 KB	Output isn't correct
85	Incorrect	32 ms	12636 KB	Output isn't correct
86	Incorrect	49 ms	12756 KB	Output isn't correct
87	Incorrect	61 ms	12636 KB	Output isn't correct
88	Incorrect	40 ms	12636 KB	Output isn't correct
89	Incorrect	33 ms	12632 KB	Output isn't correct
90	Incorrect	46 ms	12636 KB	Output isn't correct
91	Incorrect	42 ms	12636 KB	Output isn't correct
92	Incorrect	42 ms	12636 KB	Output isn't correct