oj.uz

답안 #567911

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
567911 2022-05-24T10:45:14 Z Quan2003 Mecho (IOI09_mecho) C++17
84 / 100
 291 ms 15552 KB 
#include <bits/stdc++.h>
#include <iostream>
#include<queue>
#include<vector>
#include<utility>
using namespace std;
typedef long long ll;
const int sz=1005;
int n,s;
int d1[sz][sz];
int d0[sz][sz];
bool vis1[sz][sz];
bool vis0[sz][sz];
vector<pair<int,int>>hiv;
int px,py;
int dx,dy;
ll step[sz][sz];
int movex[4]={0,0,1,-1};
int movey[4]={-1,1,0,0};
char c[sz][sz];
void bfs(vector<pair<int,int>>&a,int d[sz][sz],bool visited[sz][sz]){
    queue<pair<int,int>>q;
    for (auto i:a){
        q.push(i);
        visited[i.first][i.second]=1;
    }
    while (!q.empty()){
        int x1=q.front().first;
        int y1=q.front().second;
        q.pop();
        for (int i=0;i<4;i++){
            int x2=x1+movex[i];
            int y2=y1+movey[i];
            if (x2<0 or x2>=n) continue;
            if (y2<0 or y2>=n) continue;
            if (c[x2][y2]=='D' or c[x2][y2]=='T' or visited[x2][y2]) continue;
            visited[x2][y2]=1;
            d[x2][y2]=d[x1][y1]+1;
            q.push({x2,y2}); 
        }
    } 
}
bool bsearch(int k){
    for (int i=0;i<n;i++){
       for(int j=0;j<n;j++){
           vis1[i][j]=0;
           d1[i][j]=0;
           step[i][j]=INT_MAX;
       }
    }
    queue<pair<int,int>>q;
    q.push({px,py});
    step[px][py]=k;
    while (!q.empty()){
        int sx=q.front().first;
        int sy=q.front().second;
        q.pop();
        for (int i=0;i<4;i++){
            int tx=sx+movex[i];
            int ty=sy+movey[i];
            if (tx<0 or tx>=n) continue;
            if (ty<0 or ty>=n) continue;
            if (c[tx][ty]=='H' or c[tx][ty]=='T' or vis1[tx][ty]) continue;
            d1[tx][ty]=d1[sx][sy]+1;
            int moves=k+d1[tx][ty]/s;
            if (moves>=d0[tx][ty]) continue;
            step[tx][ty]=moves+1;
            vis1[tx][ty]=1;
            q.push({tx,ty});
        }
    } for (int i=0;i<4;i++){
         int tx=dx+movex[i];
         int ty=dy+movey[i];
         if (tx<0 or tx>=n or ty<0 or ty>=n or c[tx][ty]=='T' or c[tx][ty]=='H') continue;
         if (step[tx][ty]<=d0[tx][ty]) return 1;
    } return 0;
}
int main(){
    cin>>n>>s;
    for (int i=0;i<n;i++){
        for(int j=0;j<n;j++){
             cin>>c[i][j];
             if (c[i][j]=='D'){
                 dx=i;dy=j;
             }
             if (c[i][j]=='M'){
                 px=i;py=j;
             } if (c[i][j]=='H'){
                 hiv.push_back({i,j});
             }
        }
    } 
      bfs(hiv,d0,vis0);
      int low=0;int high=1e9;
      while (high>low){
          int mid=low+(high-low+1)/2;
          if (bsearch(mid)) low=mid;
          else high=mid-1;
      } 
        if (!bsearch(low)) cout <<-1;
        else cout <<low;
}

Subtask #1
84.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 0 ms 468 KB Output is correct
7 Correct 174 ms 15372 KB Output is correct
8 Correct 1 ms 468 KB Output is correct
9 Correct 1 ms 468 KB Output is correct
10 Correct 1 ms 468 KB Output is correct
11 Correct 1 ms 468 KB Output is correct
12 Incorrect 1 ms 1236 KB Output isn't correct
13 Incorrect 1 ms 980 KB Output isn't correct
14 Correct 1 ms 1236 KB Output is correct
15 Correct 1 ms 596 KB Output is correct
16 Correct 1 ms 596 KB Output is correct
17 Correct 1 ms 596 KB Output is correct
18 Correct 1 ms 596 KB Output is correct
19 Correct 1 ms 724 KB Output is correct
20 Correct 1 ms 724 KB Output is correct
21 Correct 1 ms 852 KB Output is correct
22 Correct 1 ms 852 KB Output is correct
23 Correct 1 ms 980 KB Output is correct
24 Correct 1 ms 980 KB Output is correct
25 Correct 2 ms 1236 KB Output is correct
26 Correct 1 ms 1236 KB Output is correct
27 Correct 1 ms 1236 KB Output is correct
28 Correct 1 ms 1236 KB Output is correct
29 Correct 1 ms 1364 KB Output is correct
30 Correct 2 ms 1364 KB Output is correct
31 Correct 1 ms 1364 KB Output is correct
32 Correct 2 ms 1364 KB Output is correct
33 Correct 14 ms 6356 KB Output is correct
34 Correct 16 ms 6484 KB Output is correct
35 Correct 33 ms 6468 KB Output is correct
36 Correct 22 ms 7508 KB Output is correct
37 Correct 18 ms 7508 KB Output is correct
38 Correct 40 ms 7492 KB Output is correct
39 Correct 23 ms 8488 KB Output is correct
40 Correct 26 ms 8628 KB Output is correct
41 Correct 58 ms 8572 KB Output is correct
42 Correct 27 ms 9592 KB Output is correct
43 Correct 25 ms 9536 KB Output is correct
44 Correct 75 ms 9676 KB Output is correct
45 Correct 39 ms 10588 KB Output is correct
46 Correct 39 ms 10572 KB Output is correct
47 Correct 94 ms 10572 KB Output is correct
48 Correct 42 ms 11532 KB Output is correct
49 Correct 40 ms 11440 KB Output is correct
50 Correct 99 ms 11496 KB Output is correct
51 Correct 50 ms 12492 KB Output is correct
52 Correct 58 ms 12456 KB Output is correct
53 Correct 128 ms 12372 KB Output is correct
54 Correct 58 ms 13388 KB Output is correct
55 Correct 62 ms 13368 KB Output is correct
56 Correct 165 ms 13392 KB Output is correct
57 Correct 74 ms 14320 KB Output is correct
58 Correct 72 ms 14292 KB Output is correct
59 Correct 181 ms 14328 KB Output is correct
60 Correct 90 ms 15244 KB Output is correct
61 Correct 90 ms 15252 KB Output is correct
62 Correct 201 ms 15164 KB Output is correct
63 Correct 176 ms 15200 KB Output is correct
64 Correct 291 ms 15260 KB Output is correct
65 Correct 254 ms 15144 KB Output is correct
66 Correct 203 ms 15264 KB Output is correct
67 Correct 210 ms 15364 KB Output is correct
68 Correct 110 ms 15228 KB Output is correct
69 Correct 127 ms 15308 KB Output is correct
70 Correct 114 ms 15288 KB Output is correct
71 Correct 101 ms 15340 KB Output is correct
72 Incorrect 97 ms 15288 KB Output isn't correct
73 Incorrect 118 ms 15496 KB Output isn't correct
74 Correct 125 ms 15436 KB Output is correct
75 Correct 136 ms 15444 KB Output is correct
76 Correct 134 ms 15456 KB Output is correct
77 Correct 135 ms 15552 KB Output is correct
78 Correct 136 ms 15436 KB Output is correct
79 Correct 130 ms 15448 KB Output is correct
80 Correct 129 ms 15436 KB Output is correct
81 Correct 125 ms 15504 KB Output is correct
82 Correct 120 ms 15428 KB Output is correct
83 Correct 177 ms 15460 KB Output is correct
84 Correct 136 ms 15476 KB Output is correct
85 Correct 145 ms 15476 KB Output is correct
86 Correct 160 ms 15476 KB Output is correct
87 Correct 143 ms 15484 KB Output is correct
88 Correct 143 ms 15416 KB Output is correct
89 Correct 170 ms 15484 KB Output is correct
90 Correct 152 ms 15360 KB Output is correct
91 Correct 148 ms 15308 KB Output is correct
92 Correct 179 ms 15388 KB Output is correct