oj.uz

답안 #1007495

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

using namespace std;

#define int long long

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]<1e18 || (f[x][y]+s)/s>d[x][y] || a[u][v]=='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]<1e18 || a[u][v]=='T' || a[u][v]=='D') continue;
         d[u][v]=d[x][y]+1;
         q.emplace(u, v);
      }
   }
   int l=0, r=1e9;
   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
100.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 10844 KB Output is correct
2 Correct 4 ms 10896 KB Output is correct
3 Correct 4 ms 10840 KB Output is correct
4 Correct 4 ms 10708 KB Output is correct
5 Correct 4 ms 10844 KB Output is correct
6 Correct 5 ms 10844 KB Output is correct
7 Correct 54 ms 11356 KB Output is correct
8 Correct 4 ms 10844 KB Output is correct
9 Correct 4 ms 10896 KB Output is correct
10 Correct 4 ms 10844 KB Output is correct
11 Correct 4 ms 10872 KB Output is correct
12 Correct 3 ms 10844 KB Output is correct
13 Correct 4 ms 10844 KB Output is correct
14 Correct 4 ms 10844 KB Output is correct
15 Correct 4 ms 10844 KB Output is correct
16 Correct 4 ms 10844 KB Output is correct
17 Correct 4 ms 10896 KB Output is correct
18 Correct 4 ms 10844 KB Output is correct
19 Correct 4 ms 10844 KB Output is correct
20 Correct 4 ms 10844 KB Output is correct
21 Correct 3 ms 10844 KB Output is correct
22 Correct 4 ms 10844 KB Output is correct
23 Correct 4 ms 10844 KB Output is correct
24 Correct 4 ms 10844 KB Output is correct
25 Correct 4 ms 10844 KB Output is correct
26 Correct 4 ms 10844 KB Output is correct
27 Correct 4 ms 10844 KB Output is correct
28 Correct 4 ms 10900 KB Output is correct
29 Correct 4 ms 10844 KB Output is correct
30 Correct 4 ms 10844 KB Output is correct
31 Correct 5 ms 10844 KB Output is correct
32 Correct 4 ms 10900 KB Output is correct
33 Correct 6 ms 11012 KB Output is correct
34 Correct 6 ms 10844 KB Output is correct
35 Correct 14 ms 11024 KB Output is correct
36 Correct 7 ms 11096 KB Output is correct
37 Correct 7 ms 11096 KB Output is correct
38 Correct 17 ms 10844 KB Output is correct
39 Correct 7 ms 10968 KB Output is correct
40 Correct 6 ms 10844 KB Output is correct
41 Correct 21 ms 11096 KB Output is correct
42 Correct 8 ms 11100 KB Output is correct
43 Correct 7 ms 11100 KB Output is correct
44 Correct 28 ms 11148 KB Output is correct
45 Correct 9 ms 11132 KB Output is correct
46 Correct 7 ms 11100 KB Output is correct
47 Correct 35 ms 11100 KB Output is correct
48 Correct 8 ms 11096 KB Output is correct
49 Correct 12 ms 11028 KB Output is correct
50 Correct 40 ms 11100 KB Output is correct
51 Correct 10 ms 11100 KB Output is correct
52 Correct 10 ms 11100 KB Output is correct
53 Correct 47 ms 11236 KB Output is correct
54 Correct 10 ms 11096 KB Output is correct
55 Correct 10 ms 11100 KB Output is correct
56 Correct 51 ms 11100 KB Output is correct
57 Correct 11 ms 11100 KB Output is correct
58 Correct 11 ms 11100 KB Output is correct
59 Correct 58 ms 11100 KB Output is correct
60 Correct 13 ms 11356 KB Output is correct
61 Correct 12 ms 11356 KB Output is correct
62 Correct 70 ms 11356 KB Output is correct
63 Correct 75 ms 11352 KB Output is correct
64 Correct 121 ms 11352 KB Output is correct
65 Correct 113 ms 11352 KB Output is correct
66 Correct 81 ms 11352 KB Output is correct
67 Correct 78 ms 11356 KB Output is correct
68 Correct 33 ms 11356 KB Output is correct
69 Correct 37 ms 11348 KB Output is correct
70 Correct 27 ms 11240 KB Output is correct
71 Correct 28 ms 11236 KB Output is correct
72 Correct 24 ms 11348 KB Output is correct
73 Correct 24 ms 11868 KB Output is correct
74 Correct 39 ms 11832 KB Output is correct
75 Correct 42 ms 11864 KB Output is correct
76 Correct 34 ms 11868 KB Output is correct
77 Correct 37 ms 11720 KB Output is correct
78 Correct 41 ms 11864 KB Output is correct
79 Correct 34 ms 11612 KB Output is correct
80 Correct 37 ms 11864 KB Output is correct
81 Correct 42 ms 11624 KB Output is correct
82 Correct 41 ms 11612 KB Output is correct
83 Correct 46 ms 11612 KB Output is correct
84 Correct 45 ms 11608 KB Output is correct
85 Correct 44 ms 11612 KB Output is correct
86 Correct 45 ms 11608 KB Output is correct
87 Correct 44 ms 11612 KB Output is correct
88 Correct 46 ms 11600 KB Output is correct
89 Correct 51 ms 11612 KB Output is correct
90 Correct 51 ms 11608 KB Output is correct
91 Correct 44 ms 11608 KB Output is correct
92 Correct 47 ms 11688 KB Output is correct