oj.uz

답안 #1007484

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1007484 2024-06-25T04:03:02 Z huutuan Mecho (IOI09_mecho) C++14
64 / 100
 134 ms 7120 KB 
#include <bits/stdc++.h>

using namespace std;

const int N=810, dx[]={1, -1, 0, 0}, dy[]={0, 0, 1, -1};
int n, s;
char a[N][N];
int d[N][N], f[N][N];
int xm, ym, xd, yd;

bool check(int t){
   queue<pair<int, int>> q;
   memset(f, 0x3f, sizeof f);
   q.emplace(xm, ym); f[xm][ym]=t*s;
   if ((f[xm][ym]+s-1)/s>d[xm][ym]) return 0;
   while (q.size()){
      int x=q.front().first, y=q.front().second; q.pop();
      if (x==xd && y==yd) return 1;
      for (int i=0; i<4; ++i){
         int u=x+dx[i], v=y+dy[i];
         if (u<1 || v<1 || u>n || v>n || f[u][v]<1e9 || (f[x][y]+s)/s>d[x][y] || a[x][y]=='T') continue;
         f[u][v]=f[x][y]+1;
         q.emplace(u, v);
      }
   }
   return 0;
}

int32_t main(){
   ios_base::sync_with_stdio(false);
   cin.tie(nullptr);
   cin >> n >> s;
   queue<pair<int, int>> q;
   memset(d, 0x3f, sizeof d);
   for (int i=1; i<=n; ++i) for (int j=1; j<=n; ++j){
      cin >> a[i][j];
      if (a[i][j]=='M') xm=i, ym=j;
      if (a[i][j]=='D') xd=i, yd=j;
      if (a[i][j]=='H'){
         d[i][j]=0;
         q.emplace(i, j);
      }
   }
   while (q.size()){
      int x=q.front().first, y=q.front().second; q.pop();
      for (int i=0; i<4; ++i){
         int u=x+dx[i], v=y+dy[i];
         if (u<1 || v<1 || u>n || v>n || d[u][v]<1e9 || a[u][v]=='T' || a[u][v]=='D') continue;
         d[u][v]=d[x][y]+1;
         q.emplace(u, v);
      }
   }
   int l=1, r=1e5;
   while (l<=r){
      int mid=(l+r)>>1;
      if (check(mid)) l=mid+1;
      else r=mid-1;
   }
   cout << r << '\n';
   return 0;
}

Subtask #1
64.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 5464 KB Output is correct
2 Correct 2 ms 5464 KB Output is correct
3 Correct 2 ms 5468 KB Output is correct
4 Correct 2 ms 5468 KB Output is correct
5 Correct 2 ms 5468 KB Output is correct
6 Correct 2 ms 5468 KB Output is correct
7 Correct 49 ms 6748 KB Output is correct
8 Incorrect 2 ms 5468 KB Output isn't correct
9 Correct 2 ms 5468 KB Output is correct
10 Correct 2 ms 5468 KB Output is correct
11 Correct 2 ms 5468 KB Output is correct
12 Correct 2 ms 5468 KB Output is correct
13 Correct 2 ms 5468 KB Output is correct
14 Incorrect 3 ms 5468 KB Output isn't correct
15 Correct 2 ms 5576 KB Output is correct
16 Correct 2 ms 5468 KB Output is correct
17 Correct 2 ms 5468 KB Output is correct
18 Correct 2 ms 5468 KB Output is correct
19 Correct 2 ms 5468 KB Output is correct
20 Correct 2 ms 5468 KB Output is correct
21 Correct 2 ms 5468 KB Output is correct
22 Correct 2 ms 5468 KB Output is correct
23 Correct 2 ms 5468 KB Output is correct
24 Correct 2 ms 5468 KB Output is correct
25 Correct 2 ms 5468 KB Output is correct
26 Correct 2 ms 5456 KB Output is correct
27 Correct 2 ms 5468 KB Output is correct
28 Correct 2 ms 5468 KB Output is correct
29 Correct 2 ms 5468 KB Output is correct
30 Correct 2 ms 5468 KB Output is correct
31 Correct 2 ms 5468 KB Output is correct
32 Correct 2 ms 5468 KB Output is correct
33 Correct 4 ms 5980 KB Output is correct
34 Correct 4 ms 5996 KB Output is correct
35 Correct 16 ms 5824 KB Output is correct
36 Correct 4 ms 5980 KB Output is correct
37 Correct 5 ms 5980 KB Output is correct
38 Correct 21 ms 5980 KB Output is correct
39 Incorrect 5 ms 6076 KB Output isn't correct
40 Correct 5 ms 5976 KB Output is correct
41 Correct 29 ms 5976 KB Output is correct
42 Incorrect 6 ms 6236 KB Output isn't correct
43 Correct 7 ms 6104 KB Output is correct
44 Correct 32 ms 6236 KB Output is correct
45 Incorrect 6 ms 6188 KB Output isn't correct
46 Correct 7 ms 6236 KB Output is correct
47 Correct 39 ms 6232 KB Output is correct
48 Incorrect 7 ms 6236 KB Output isn't correct
49 Correct 7 ms 6236 KB Output is correct
50 Correct 44 ms 6324 KB Output is correct
51 Incorrect 11 ms 6524 KB Output isn't correct
52 Incorrect 10 ms 6532 KB Output isn't correct
53 Correct 50 ms 6356 KB Output is correct
54 Incorrect 9 ms 6488 KB Output isn't correct
55 Incorrect 10 ms 6492 KB Output isn't correct
56 Correct 55 ms 6492 KB Output is correct
57 Incorrect 10 ms 6748 KB Output isn't correct
58 Incorrect 12 ms 6740 KB Output isn't correct
59 Correct 71 ms 6748 KB Output is correct
60 Incorrect 13 ms 6748 KB Output isn't correct
61 Incorrect 13 ms 6856 KB Output isn't correct
62 Correct 83 ms 6844 KB Output is correct
63 Correct 71 ms 6736 KB Output is correct
64 Correct 134 ms 6844 KB Output is correct
65 Correct 120 ms 6616 KB Output is correct
66 Correct 117 ms 6680 KB Output is correct
67 Incorrect 96 ms 6748 KB Output isn't correct
68 Correct 35 ms 6736 KB Output is correct
69 Correct 34 ms 6748 KB Output is correct
70 Correct 28 ms 6712 KB Output is correct
71 Correct 27 ms 6736 KB Output is correct
72 Correct 24 ms 6748 KB Output is correct
73 Correct 23 ms 6996 KB Output is correct
74 Correct 30 ms 6996 KB Output is correct
75 Correct 37 ms 7088 KB Output is correct
76 Correct 36 ms 7112 KB Output is correct
77 Correct 35 ms 7120 KB Output is correct
78 Incorrect 42 ms 7004 KB Output isn't correct
79 Correct 34 ms 7004 KB Output is correct
80 Correct 37 ms 6884 KB Output is correct
81 Correct 39 ms 6928 KB Output is correct
82 Correct 36 ms 7004 KB Output is correct
83 Correct 45 ms 7004 KB Output is correct
84 Correct 44 ms 7004 KB Output is correct
85 Correct 42 ms 6884 KB Output is correct
86 Correct 41 ms 6992 KB Output is correct
87 Correct 42 ms 7004 KB Output is correct
88 Correct 47 ms 6992 KB Output is correct
89 Correct 46 ms 7004 KB Output is correct
90 Correct 48 ms 7004 KB Output is correct
91 Correct 44 ms 7004 KB Output is correct
92 Correct 49 ms 7004 KB Output is correct