답안 #892945

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
892945 2023-12-26T08:24:57 Z ilef Mecho (IOI09_mecho) C++14
8 / 100
149 ms 26296 KB
#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;
    //vector<pair<int,int>>hives;
    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=1e6;
    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;
            
        }
    }
        dist2[honx][hony]=mid;
        if(dist2[honx][hony]<dist1[honx][hony]){
            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]=='D')&& !vis2[x][y] && (((dist2[i][j]+1)/s)<dist1[x][y])){
                        dist2[x][y]=dist2[i][j]+1;
                        vis2[x][y]=true;
                        q.push({x,y});
                    }
                }
             
                }
            
    if(dist2[homex][homey]<inf){
        reached=true;
        ll=mid;
    }
    else{
        rr=mid;
    }
    }
    if(reached){
       cout<<ll-2<<endl;
    }
    else{
        cout<<-1<<endl;
    }
}

Compilation message

mecho.cpp: In function 'int32_t main()':
mecho.cpp:53:21: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   53 |         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:76:26: warning: 'hony' may be used uninitialized in this function [-Wmaybe-uninitialized]
   76 |         dist2[honx][hony]=mid;
      |         ~~~~~~~~~~~~~~~~~^~~~
mecho.cpp:76:26: warning: 'honx' may be used uninitialized in this function [-Wmaybe-uninitialized]
mecho.cpp:96:26: warning: 'homex' may be used uninitialized in this function [-Wmaybe-uninitialized]
   96 |     if(dist2[homex][homey]<inf){
      |        ~~~~~~~~~~~~~~~~~~^
mecho.cpp:96:26: warning: 'homey' may be used uninitialized in this function [-Wmaybe-uninitialized]
# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 344 KB Output isn't correct
2 Incorrect 0 ms 600 KB Output isn't correct
3 Incorrect 0 ms 348 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 66 ms 13148 KB Output isn't correct
8 Correct 0 ms 348 KB Output is correct
9 Incorrect 1 ms 348 KB Output isn't correct
10 Incorrect 0 ms 348 KB Output isn't correct
11 Correct 0 ms 344 KB Output is correct
12 Incorrect 0 ms 348 KB Output isn't correct
13 Incorrect 0 ms 348 KB Output isn't correct
14 Correct 1 ms 344 KB Output is correct
15 Incorrect 1 ms 344 KB Output isn't correct
16 Incorrect 0 ms 600 KB Output isn't correct
17 Incorrect 0 ms 348 KB Output isn't correct
18 Incorrect 1 ms 348 KB Output isn't correct
19 Incorrect 0 ms 348 KB Output isn't correct
20 Incorrect 0 ms 348 KB Output isn't correct
21 Incorrect 0 ms 344 KB Output isn't correct
22 Incorrect 0 ms 348 KB Output isn't correct
23 Incorrect 0 ms 348 KB Output isn't correct
24 Incorrect 0 ms 348 KB Output isn't correct
25 Incorrect 0 ms 348 KB Output isn't correct
26 Incorrect 1 ms 348 KB Output isn't correct
27 Incorrect 0 ms 464 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 456 KB Output isn't correct
31 Incorrect 1 ms 348 KB Output isn't correct
32 Incorrect 1 ms 348 KB Output isn't correct
33 Incorrect 5 ms 2852 KB Output isn't correct
34 Incorrect 15 ms 2648 KB Output isn't correct
35 Incorrect 12 ms 2652 KB Output isn't correct
36 Incorrect 6 ms 3420 KB Output isn't correct
37 Incorrect 16 ms 3672 KB Output isn't correct
38 Incorrect 17 ms 3416 KB Output isn't correct
39 Incorrect 9 ms 4408 KB Output isn't correct
40 Incorrect 22 ms 4188 KB Output isn't correct
41 Incorrect 25 ms 4188 KB Output isn't correct
42 Incorrect 10 ms 5212 KB Output isn't correct
43 Incorrect 39 ms 5192 KB Output isn't correct
44 Incorrect 25 ms 5212 KB Output isn't correct
45 Incorrect 11 ms 6236 KB Output isn't correct
46 Incorrect 33 ms 6236 KB Output isn't correct
47 Incorrect 27 ms 6368 KB Output isn't correct
48 Incorrect 13 ms 7260 KB Output isn't correct
49 Incorrect 49 ms 7260 KB Output isn't correct
50 Incorrect 45 ms 7492 KB Output isn't correct
51 Incorrect 17 ms 8696 KB Output isn't correct
52 Incorrect 50 ms 8540 KB Output isn't correct
53 Incorrect 62 ms 8716 KB Output isn't correct
54 Incorrect 20 ms 9820 KB Output isn't correct
55 Incorrect 68 ms 9820 KB Output isn't correct
56 Incorrect 46 ms 10028 KB Output isn't correct
57 Incorrect 20 ms 11356 KB Output isn't correct
58 Incorrect 70 ms 11352 KB Output isn't correct
59 Incorrect 61 ms 11356 KB Output isn't correct
60 Incorrect 23 ms 12840 KB Output isn't correct
61 Incorrect 63 ms 12844 KB Output isn't correct
62 Incorrect 75 ms 13216 KB Output isn't correct
63 Incorrect 86 ms 12892 KB Output isn't correct
64 Incorrect 117 ms 12984 KB Output isn't correct
65 Incorrect 149 ms 12892 KB Output isn't correct
66 Incorrect 129 ms 13140 KB Output isn't correct
67 Correct 98 ms 12892 KB Output is correct
68 Incorrect 59 ms 13020 KB Output isn't correct
69 Incorrect 49 ms 12888 KB Output isn't correct
70 Incorrect 41 ms 12892 KB Output isn't correct
71 Incorrect 42 ms 12892 KB Output isn't correct
72 Incorrect 54 ms 12888 KB Output isn't correct
73 Runtime error 37 ms 26152 KB Execution killed with signal 11
74 Runtime error 36 ms 26288 KB Execution killed with signal 11
75 Incorrect 57 ms 13404 KB Output isn't correct
76 Incorrect 45 ms 13404 KB Output isn't correct
77 Runtime error 56 ms 26296 KB Execution killed with signal 11
78 Correct 78 ms 13456 KB Output is correct
79 Incorrect 120 ms 13392 KB Output isn't correct
80 Incorrect 49 ms 13400 KB Output isn't correct
81 Incorrect 63 ms 13404 KB Output isn't correct
82 Incorrect 63 ms 13404 KB Output isn't correct
83 Correct 85 ms 13400 KB Output is correct
84 Incorrect 147 ms 13144 KB Output isn't correct
85 Incorrect 52 ms 13144 KB Output isn't correct
86 Incorrect 78 ms 13148 KB Output isn't correct
87 Incorrect 77 ms 13144 KB Output isn't correct
88 Incorrect 80 ms 13144 KB Output isn't correct
89 Incorrect 77 ms 13148 KB Output isn't correct
90 Incorrect 65 ms 13144 KB Output isn't correct
91 Incorrect 81 ms 13244 KB Output isn't correct
92 Incorrect 98 ms 13464 KB Output isn't correct