/**
* Author: Anil Byar
**/
#include <bits/stdc++.h>
// #include <ext/pb_ds/assoc_container.hpp>
// #include <ext/pb_ds/tree_policy.hpp>
// using namespace __gnu_pbds;
using namespace std;
// template<class T>
// using ordered_set = tree<T, null_type, less_equal<T>, rb_tree_tag, tree_order_statistics_node_update> ordered_set;
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define sz(x) (int)(x).size()
#define uniq(v) v.erase(unique(all(v)), v.end())
#define ft first
#define sd second
#define pb push_back
#define eb emplace_back
// Source: https://codeforces.com/blog/entry/68809
// { start
void __print(int x) {cerr << x;}
void __print(long x) {cerr << x;}
void __print(long long x) {cerr << x;}
void __print(unsigned x) {cerr << x;}
void __print(unsigned long x) {cerr << x;}
void __print(unsigned long long x) {cerr << x;}
void __print(float x) {cerr << x;}
void __print(double x) {cerr << x;}
void __print(long double x) {cerr << x;}
void __print(char x) {cerr << '\'' << x << '\'';}
void __print(const char *x) {cerr << '"' << x << '"';}
void __print(const string &x) {cerr << '"' << x << '"';}
void __print(bool x) {cerr << (x ? "true" : "false");}
template<typename T, typename V>
void __print(const pair<T, V> &x) {cerr << '{'; __print(x.first); cerr << ','; __print(x.second); cerr << '}';}
template<typename T>
void __print(const T &x) {int f = 0; cerr << '{'; for (auto &i: x) cerr << (f++ ? "," : ""), __print(i); cerr << "}";}
void _print() {cerr << "]\n";}
template <typename T, typename... V>
void _print(T t, V... v) {__print(t); if (sizeof...(v)) cerr << ", "; _print(v...);}
#ifndef ONLINE_JUDGE
#define debug(x...) cerr << "[" << #x << "] = ["; _print(x)
#else
#define debug(x...)
#endif
// } end
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<pii> vii;
typedef vector<ll> vl;
typedef vector<pll> vll;
typedef vector<vi> vvi;
typedef vector<vii> vvii;
typedef vector<vl> vvl;
#define dbg if(0)
const ll MOD = 1e9+7;
const ll MOD9 = 998244353;
const ll INFLL = 1e18+5;
const int INF = 1e9;
void printbit(int x, int len) {string s="\n";while(len--){s=((x%2)?'1':'0')+s;x/=2;} cout<<s;}
ll power(ll x, ll y, ll mod){if (y==0) return 1;ll ret = power(x, y/2, mod);ret *= ret;ret%=mod;if (y&1) ret *= x;return ret%mod;}
ll modinv(ll x, ll mod = MOD) {return power(x, mod-2, mod);}
template<class T>
istream& operator>>(istream&in, vector<T>&v){
for (T& x:v) in>>x;
return in;
}
template<class T>
ostream& operator<<(ostream&out, vector<T>&v){
for (T& x:v) out<<x<<' ';
cout<<'\n';
return out;
}
// use ?: with brackets (?:)
// check for overflow
// think about dp
// Read the statement carefully
const int maxN = 1;
const int maxK = 8001;
int dx[] = {1, 0, 0, -1};
int dy[] = {0, 1, -1, 0};
void solve(){
int n, s;cin>>n>>s;
vector<string> grid(n);
for (int i = 0;i<n;i++) cin>>grid[i];
vvl beetime(n, vl(n, INF));
queue<pii> q;
for (int i = 0;i<n;i++) for (int j = 0;j<n;j++) if (grid[i][j]=='H') {
q.emplace(i, j);
beetime[i][j] = 0;
}
while(!q.empty()){
auto [x, y] = q.front();q.pop();
int tim = beetime[x][y] + s;
for (int i = 0;i<4;i++){
int xx = x+dx[i];
int yy = y+dy[i];
if (xx<0 || xx>=n || yy<0 || yy>=n || tim>=beetime[xx][yy] || grid[xx][yy]=='T' || grid[xx][yy]=='D'){
continue;
}
beetime[xx][yy] = tim;
q.emplace(xx, yy);
}
}
int mx, my;
int fx, fy;
for (int i = 0;i<n;i++){
for (int j = 0;j<n;j++){
if (grid[i][j]=='M'){
mx = i, my = j;
} else if (grid[i][j]=='D') fx=i, fy = j;
}
}
auto check = [&](int m){
vvi mtim(n, vi(n, INF));
queue<array<int, 3>> qq;
vector<vector<bool>> poss(n, vector<bool>(n, false));
qq.push({mx, my, 0});
mtim[mx][my] = m;
while(!qq.empty()){
auto [x, y, step] = qq.front();qq.pop();
poss[x][y] = true;
int tim = mtim[x][y]+1;
// if (step==0) tim++;
// if (step==s) {
// step = 0;
// if (beetime[x][y]==mtim[x][y]) continue;
// }
// step++;
for (int i = 0;i<4;i++){
int xx = x+dx[i];
int yy = y+dy[i];
if (xx<0 || yy<0 || xx>=n || yy>=n || grid[xx][yy]=='T' || tim>=beetime[xx][yy] || tim>=mtim[xx][yy]){
continue;
}
mtim[xx][yy] = tim;
qq.push({xx, yy, step});
}
}
if (poss[fx][fy]) return true;
// mtim.assign(n, vi(n, INF));
// mtim[fx][fy] = 0;
// while(!q.empty()) q.pop();
// q.emplace(fx, fy);
// while(!q.empty()){
// auto [x, y] = q.front();q.pop();
// if (poss[x][y]) return true;
// int tim = mtim[x][y] + 1;
// for (int i = 0;i<4;i++){
// int xx = x+dx[i];
// int yy = y+dy[i];
// if (xx<0 || xx>=n || yy<0 || yy>=n || grid[xx][yy]=='T' || tim>=mtim[xx][yy] || tim>s){
// continue;
// }
// mtim[xx][yy] = tim;
// q.emplace(xx, yy);
// }
// }
return false;
};
int l = -1, r = INF;
while(r-l>1){
int mid = (l+r)/2;
if (check(mid)) l = mid;
else r = mid;
}
cout<<(l+s-1)/s;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
#define ONLINE_JUDGE
#ifndef ONLINE_JUDGE
freopen("input.in", "r", stdin);
freopen("output.out", "w", stdout);
freopen("debug.dbg", "w", stderr);
int tt = clock();
#endif
int t=1, i = 1;
// cin>>t;
while(t--){
// cout<<"Case #"<<i++<<": ";
solve();
cout<<'\n';
}
#ifndef ONLINE_JUDGE
cerr << "TIME = " << (float)(clock() - tt)/CLOCKS_PER_SEC << endl;
tt = clock();
#endif
}
Compilation message
mecho.cpp: In function 'int main()':
mecho.cpp:211:14: warning: unused variable 'i' [-Wunused-variable]
211 | int t=1, i = 1;
| ^
mecho.cpp: In function 'void solve()':
mecho.cpp:161:20: warning: 'fx' may be used uninitialized in this function [-Wmaybe-uninitialized]
161 | if (poss[fx][fy]) return true;
| ^
mecho.cpp:140:20: warning: 'my' may be used uninitialized in this function [-Wmaybe-uninitialized]
140 | mtim[mx][my] = m;
| ^
mecho.cpp:140:16: warning: 'mx' may be used uninitialized in this function [-Wmaybe-uninitialized]
140 | mtim[mx][my] = m;
| ^
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
1 ms |
212 KB |
Output is correct |
| 2 |
Correct |
0 ms |
212 KB |
Output is correct |
| 3 |
Correct |
0 ms |
212 KB |
Output is correct |
| 4 |
Correct |
1 ms |
212 KB |
Output is correct |
| 5 |
Incorrect |
1 ms |
212 KB |
Output isn't correct |
| 6 |
Correct |
0 ms |
212 KB |
Output is correct |
| 7 |
Incorrect |
111 ms |
8764 KB |
Output isn't correct |
| 8 |
Correct |
0 ms |
212 KB |
Output is correct |
| 9 |
Correct |
1 ms |
212 KB |
Output is correct |
| 10 |
Correct |
0 ms |
212 KB |
Output is correct |
| 11 |
Incorrect |
1 ms |
212 KB |
Output isn't correct |
| 12 |
Incorrect |
1 ms |
340 KB |
Output isn't correct |
| 13 |
Incorrect |
1 ms |
340 KB |
Output isn't correct |
| 14 |
Incorrect |
1 ms |
340 KB |
Output isn't correct |
| 15 |
Correct |
0 ms |
212 KB |
Output is correct |
| 16 |
Incorrect |
1 ms |
212 KB |
Output isn't correct |
| 17 |
Correct |
1 ms |
212 KB |
Output is correct |
| 18 |
Incorrect |
0 ms |
212 KB |
Output isn't correct |
| 19 |
Correct |
1 ms |
340 KB |
Output is correct |
| 20 |
Incorrect |
1 ms |
340 KB |
Output isn't correct |
| 21 |
Correct |
1 ms |
340 KB |
Output is correct |
| 22 |
Incorrect |
1 ms |
340 KB |
Output isn't correct |
| 23 |
Correct |
1 ms |
340 KB |
Output is correct |
| 24 |
Incorrect |
1 ms |
340 KB |
Output isn't correct |
| 25 |
Correct |
1 ms |
340 KB |
Output is correct |
| 26 |
Incorrect |
1 ms |
340 KB |
Output isn't correct |
| 27 |
Correct |
1 ms |
340 KB |
Output is correct |
| 28 |
Incorrect |
1 ms |
340 KB |
Output isn't correct |
| 29 |
Correct |
1 ms |
340 KB |
Output is correct |
| 30 |
Incorrect |
1 ms |
340 KB |
Output isn't correct |
| 31 |
Correct |
1 ms |
340 KB |
Output is correct |
| 32 |
Incorrect |
1 ms |
340 KB |
Output isn't correct |
| 33 |
Correct |
6 ms |
1944 KB |
Output is correct |
| 34 |
Incorrect |
5 ms |
1968 KB |
Output isn't correct |
| 35 |
Incorrect |
33 ms |
1956 KB |
Output isn't correct |
| 36 |
Correct |
7 ms |
2452 KB |
Output is correct |
| 37 |
Incorrect |
6 ms |
2440 KB |
Output isn't correct |
| 38 |
Incorrect |
42 ms |
2436 KB |
Output isn't correct |
| 39 |
Correct |
8 ms |
3004 KB |
Output is correct |
| 40 |
Incorrect |
8 ms |
2980 KB |
Output isn't correct |
| 41 |
Incorrect |
63 ms |
3016 KB |
Output isn't correct |
| 42 |
Correct |
10 ms |
3652 KB |
Output is correct |
| 43 |
Incorrect |
10 ms |
3628 KB |
Output isn't correct |
| 44 |
Incorrect |
76 ms |
3688 KB |
Output isn't correct |
| 45 |
Correct |
11 ms |
4340 KB |
Output is correct |
| 46 |
Incorrect |
10 ms |
4280 KB |
Output isn't correct |
| 47 |
Incorrect |
95 ms |
4308 KB |
Output isn't correct |
| 48 |
Correct |
15 ms |
5064 KB |
Output is correct |
| 49 |
Incorrect |
13 ms |
5056 KB |
Output isn't correct |
| 50 |
Incorrect |
106 ms |
5108 KB |
Output isn't correct |
| 51 |
Correct |
15 ms |
5908 KB |
Output is correct |
| 52 |
Incorrect |
12 ms |
5876 KB |
Output isn't correct |
| 53 |
Incorrect |
136 ms |
5912 KB |
Output isn't correct |
| 54 |
Correct |
19 ms |
6764 KB |
Output is correct |
| 55 |
Incorrect |
16 ms |
6740 KB |
Output isn't correct |
| 56 |
Incorrect |
151 ms |
6772 KB |
Output isn't correct |
| 57 |
Correct |
20 ms |
7732 KB |
Output is correct |
| 58 |
Incorrect |
18 ms |
7712 KB |
Output isn't correct |
| 59 |
Incorrect |
172 ms |
7736 KB |
Output isn't correct |
| 60 |
Correct |
24 ms |
8828 KB |
Output is correct |
| 61 |
Incorrect |
20 ms |
8704 KB |
Output isn't correct |
| 62 |
Incorrect |
196 ms |
8740 KB |
Output isn't correct |
| 63 |
Correct |
100 ms |
8800 KB |
Output is correct |
| 64 |
Correct |
243 ms |
8724 KB |
Output is correct |
| 65 |
Incorrect |
165 ms |
8752 KB |
Output isn't correct |
| 66 |
Incorrect |
123 ms |
8748 KB |
Output isn't correct |
| 67 |
Incorrect |
103 ms |
8760 KB |
Output isn't correct |
| 68 |
Incorrect |
65 ms |
8780 KB |
Output isn't correct |
| 69 |
Correct |
57 ms |
8716 KB |
Output is correct |
| 70 |
Incorrect |
46 ms |
8776 KB |
Output isn't correct |
| 71 |
Incorrect |
53 ms |
8772 KB |
Output isn't correct |
| 72 |
Incorrect |
37 ms |
8704 KB |
Output isn't correct |
| 73 |
Incorrect |
59 ms |
8860 KB |
Output isn't correct |
| 74 |
Correct |
81 ms |
8756 KB |
Output is correct |
| 75 |
Incorrect |
76 ms |
8736 KB |
Output isn't correct |
| 76 |
Correct |
71 ms |
8772 KB |
Output is correct |
| 77 |
Incorrect |
85 ms |
8748 KB |
Output isn't correct |
| 78 |
Incorrect |
93 ms |
8772 KB |
Output isn't correct |
| 79 |
Incorrect |
82 ms |
8788 KB |
Output isn't correct |
| 80 |
Incorrect |
74 ms |
8852 KB |
Output isn't correct |
| 81 |
Incorrect |
89 ms |
8748 KB |
Output isn't correct |
| 82 |
Incorrect |
77 ms |
8752 KB |
Output isn't correct |
| 83 |
Incorrect |
93 ms |
8764 KB |
Output isn't correct |
| 84 |
Correct |
112 ms |
8744 KB |
Output is correct |
| 85 |
Incorrect |
92 ms |
8768 KB |
Output isn't correct |
| 86 |
Incorrect |
99 ms |
8748 KB |
Output isn't correct |
| 87 |
Incorrect |
96 ms |
8772 KB |
Output isn't correct |
| 88 |
Incorrect |
118 ms |
8756 KB |
Output isn't correct |
| 89 |
Correct |
130 ms |
8764 KB |
Output is correct |
| 90 |
Incorrect |
113 ms |
8756 KB |
Output isn't correct |
| 91 |
Incorrect |
116 ms |
8736 KB |
Output isn't correct |
| 92 |
Incorrect |
112 ms |
8740 KB |
Output isn't correct |
