oj.uz

답안 #1050702

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1050702 2024-08-09T12:47:56 Z kvintsekstakord Mecho (IOI09_mecho) C++17
84 / 100
 99 ms 5212 KB 
#include <bits/stdc++.h>
using namespace std;

int N, S;
char forest[810][810];
int btime[810][810];
bool visited[810][810];

int dx[]={1, -1, 0, 0};
int dy[]={0, 0, 1, -1};

struct src{
    int x, y;
    int step;
    src(int x, int y, int step) : x(x), y(y), step(step){};
};

int32_t main()
{
    cin >> N >> S;
    queue<src> bfs;
    int si, sj;
    int hi, hj;
    for(int i = 1; i <= N; i++){
        for(int j = 1; j <= N; j++){
            cin >> forest[i][j];
            btime[i][j]=1e9;

            if(forest[i][j]=='H'){
                bfs.push(src(i, j, 0));
                btime[i][j]=0;
            }
            if(forest[i][j]=='M'){
                si = i;
                sj = j;
            }
            if(forest[i][j]=='D'){
                hi=i; hj=j;
            }

        }
    }

    while(!bfs.empty()){
        int x = bfs.front().x;
        int y = bfs.front().y;
        int step = bfs.front().step;
        bfs.pop();
        for(int i = 0; i < 4; i++){
            int nx = x+dx[i];
            int ny = y+dy[i];
            if(nx<1 || nx>N || ny<1 || ny>N) continue;
            if(forest[nx][ny]=='T' || forest[nx][ny]=='D') continue;
            if(step+1<btime[nx][ny]){
                btime[nx][ny]=(step+1);
                bfs.push(src(nx, ny, step+1));
            }
        }
    }
    for(int i = 1; i <= N; i++){
        for(int j = 1; j <= N; j++){
            if(btime[i][j]==1e9){
                //cout << "x "; continue;
            };
            btime[i][j]*=S;
            //cout << btime[i][j] << " ";
        }//cout << endl;
    }
    int lo = 0;
    int hig = 2000000;
    lo--;
    while(lo<hig){
        int mid = lo+(hig-lo+1)/2;

        queue<src> bfs2;
        memset(visited, false, sizeof(visited));
        visited[si][sj]=true;
        bfs2.push({si, sj, mid*S});
        bool possible = false;
        while(!bfs2.empty()){
            int x = bfs2.front().x;
            int y = bfs2.front().y;
            int step = bfs2.front().step;

            bfs2.pop();
            for(int i = 0; i < 4; i++){
                int nx = x+dx[i];
                int ny = y+dy[i];
                if(nx<1 || nx>N || ny<1 || ny>N) continue;
                if(forest[nx][ny]=='T') continue;
                if(forest[nx][ny]=='D'){
                    possible = true;
                    break;
                }
                if(visited[nx][ny]) continue;
                if( step+1<btime[nx][ny]){
                    visited[nx][ny]=true;
                    bfs2.push(src(nx, ny, step+1));
                }
            }
            if(possible) break;
        }

        if(possible){
            lo = mid;
        }else{
            hig = mid-1;
        }
    }
    cout << lo;

    return 0;
}

Compilation message

mecho.cpp: In function 'int32_t main()':
mecho.cpp:23:9: warning: variable 'hi' set but not used [-Wunused-but-set-variable]
   23 |     int hi, hj;
      |         ^~
mecho.cpp:23:13: warning: variable 'hj' set but not used [-Wunused-but-set-variable]
   23 |     int hi, hj;
      |             ^~
mecho.cpp:15:56: warning: 'si' may be used uninitialized in this function [-Wmaybe-uninitialized]
   15 |     src(int x, int y, int step) : x(x), y(y), step(step){};
      |                                                        ^
mecho.cpp:22:9: note: 'si' was declared here
   22 |     int si, sj;
      |         ^~
mecho.cpp:15:56: warning: 'sj' may be used uninitialized in this function [-Wmaybe-uninitialized]
   15 |     src(int x, int y, int step) : x(x), y(y), step(step){};
      |                                                        ^
mecho.cpp:22:13: note: 'sj' was declared here
   22 |     int si, sj;
      |             ^~

Subtask #1
84.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2652 KB Output is correct
2 Correct 0 ms 2652 KB Output is correct
3 Correct 1 ms 2652 KB Output is correct
4 Correct 0 ms 2652 KB Output is correct
5 Correct 0 ms 2652 KB Output is correct
6 Correct 1 ms 2652 KB Output is correct
7 Correct 55 ms 4920 KB Output is correct
8 Correct 1 ms 2652 KB Output is correct
9 Correct 0 ms 2652 KB Output is correct
10 Correct 1 ms 2652 KB Output is correct
11 Correct 0 ms 2652 KB Output is correct
12 Incorrect 1 ms 2652 KB Output isn't correct
13 Incorrect 1 ms 2652 KB Output isn't correct
14 Correct 1 ms 2652 KB Output is correct
15 Correct 1 ms 2652 KB Output is correct
16 Correct 0 ms 2652 KB Output is correct
17 Correct 0 ms 2652 KB Output is correct
18 Correct 1 ms 2652 KB Output is correct
19 Correct 1 ms 2692 KB Output is correct
20 Correct 1 ms 2652 KB Output is correct
21 Correct 1 ms 2652 KB Output is correct
22 Correct 1 ms 2652 KB Output is correct
23 Correct 1 ms 2652 KB Output is correct
24 Correct 1 ms 2652 KB Output is correct
25 Correct 1 ms 2652 KB Output is correct
26 Correct 1 ms 2652 KB Output is correct
27 Correct 1 ms 2652 KB Output is correct
28 Correct 1 ms 2732 KB Output is correct
29 Correct 1 ms 2652 KB Output is correct
30 Correct 1 ms 2652 KB Output is correct
31 Correct 1 ms 2652 KB Output is correct
32 Correct 1 ms 2652 KB Output is correct
33 Correct 5 ms 2908 KB Output is correct
34 Correct 5 ms 2908 KB Output is correct
35 Correct 15 ms 2904 KB Output is correct
36 Correct 5 ms 2908 KB Output is correct
37 Correct 5 ms 2908 KB Output is correct
38 Correct 15 ms 2980 KB Output is correct
39 Correct 7 ms 2908 KB Output is correct
40 Correct 7 ms 3208 KB Output is correct
41 Correct 19 ms 3016 KB Output is correct
42 Correct 8 ms 2908 KB Output is correct
43 Correct 8 ms 3160 KB Output is correct
44 Correct 25 ms 3164 KB Output is correct
45 Correct 10 ms 3164 KB Output is correct
46 Correct 10 ms 3360 KB Output is correct
47 Correct 31 ms 3420 KB Output is correct
48 Correct 12 ms 3292 KB Output is correct
49 Correct 12 ms 3688 KB Output is correct
50 Correct 36 ms 3820 KB Output is correct
51 Correct 14 ms 3420 KB Output is correct
52 Correct 13 ms 3932 KB Output is correct
53 Correct 43 ms 3956 KB Output is correct
54 Correct 16 ms 3676 KB Output is correct
55 Correct 16 ms 4188 KB Output is correct
56 Correct 58 ms 4088 KB Output is correct
57 Correct 23 ms 3872 KB Output is correct
58 Correct 18 ms 4444 KB Output is correct
59 Correct 59 ms 4444 KB Output is correct
60 Correct 20 ms 4184 KB Output is correct
61 Correct 19 ms 4696 KB Output is correct
62 Correct 67 ms 4872 KB Output is correct
63 Correct 68 ms 4700 KB Output is correct
64 Correct 99 ms 4700 KB Output is correct
65 Correct 92 ms 4692 KB Output is correct
66 Correct 83 ms 4860 KB Output is correct
67 Correct 68 ms 4864 KB Output is correct
68 Correct 39 ms 4700 KB Output is correct
69 Correct 37 ms 4700 KB Output is correct
70 Correct 35 ms 4696 KB Output is correct
71 Correct 31 ms 4856 KB Output is correct
72 Incorrect 29 ms 4696 KB Output isn't correct
73 Incorrect 28 ms 5208 KB Output isn't correct
74 Correct 47 ms 5204 KB Output is correct
75 Correct 47 ms 5120 KB Output is correct
76 Correct 41 ms 5212 KB Output is correct
77 Correct 43 ms 5128 KB Output is correct
78 Correct 45 ms 5076 KB Output is correct
79 Correct 44 ms 5212 KB Output is correct
80 Correct 42 ms 5212 KB Output is correct
81 Correct 45 ms 5208 KB Output is correct
82 Correct 38 ms 5212 KB Output is correct
83 Correct 50 ms 4956 KB Output is correct
84 Correct 46 ms 5168 KB Output is correct
85 Correct 47 ms 4956 KB Output is correct
86 Correct 50 ms 4952 KB Output is correct
87 Correct 48 ms 4956 KB Output is correct
88 Correct 51 ms 4956 KB Output is correct
89 Correct 61 ms 4944 KB Output is correct
90 Correct 55 ms 4944 KB Output is correct
91 Correct 51 ms 4944 KB Output is correct
92 Correct 51 ms 5108 KB Output is correct