This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
#define ff first
#define ss second
#define pb push_back
#define all(a) (a).begin(), (a).end()
#define replr(i, a, b) for (int i = int(a); i <= int(b); ++i)
#define reprl(i, a, b) for (int i = int(a); i >= int(b); --i)
#define rep(i, n) for (int i = 0; i < int(n); ++i)
#define mkp(a, b) make_pair(a, b)
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> PII;
typedef vector<int> VI;
typedef vector<PII> VPI;
typedef vector<VI> VVI;
typedef vector<VVI> VVVI;
typedef vector<VPI> VVPI;
typedef pair<ll, ll> PLL;
typedef vector<ll> VL;
typedef vector<PLL> VPL;
typedef vector<VL> VVL;
typedef vector<VVL> VVVL;
typedef vector<VPL> VVPL;
template<class T> T setmax(T& a, T b) {if (a < b) return a = b; return a;}
template<class T> T setmin(T& a, T b) {if (a < b) return a; return a = b;}
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
template<class T>
using indset = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
typedef vector<char> VC;
typedef vector<VC> VVC;
typedef vector<bool> VB;
typedef vector<VB> VVB;
int MAXN = 1500;
char a[1500][1500];
bool vis[1500][1500];
int uw[1500][1500], dw[1500][1500], rw[1500][1500], lw[1500][1500];
int intersection(int al, int ar, int bl, int br) {
return min(ar, br) - max(al, bl) - 1;
}
void solve() {
int m, n, K, L;
cin >> m >> n >> K >> L;
int hy, hx, vy, vx;
cin >> hy >> hx >> vy >> vx;
rep(i, n) rep(j, m) cin >> a[i][j];
rep(i, n) {
int last;
last = -1;
replr(j, 0, m-1) {
if (a[i][j] == 'X') last = j;
lw[i][j] = last;
}
last = m;
reprl(j, m-1, 0) {
if (a[i][j] == 'X') last = j;
rw[i][j] = last;
}
}
rep(j, m) {
int last;
last = -1;
replr(i, 0, n-1) {
if (a[i][j] == 'X') last = i;
uw[i][j] = last;
}
last = m;
reprl(i, n-1, 0) {
if (a[i][j] == 'X') last = i;
dw[i][j] = last;
}
}
rep(i, n) rep(j, m) vis[i][j] = false;
queue<PII> q;
q.push({hx, vy});
vis[hx][vy] = true;
while (q.size()) {
auto[x, y] = q.front();
q.pop();
for (int vx : {x-1, x+1}) {
if (vx < 0 || vx >= n) continue;
if (vis[vx][y]) continue;
if (intersection(lw[vx][y], rw[vx][y], lw[x][y], rw[x][y]) >= K) {
q.push({vx, y});
vis[vx][y] = true;
}
}
for (int vy : {y-1, y+1}) {
if (vy < 0 || vy >= m) continue;
if (vis[x][vy]) continue;
if (intersection(uw[x][vy], dw[x][vy], uw[x][y], dw[x][y]) >= L) {
q.push({x, vy});
vis[x][vy] = true;
}
}
}
rep(i, n) rep(j, m) {
if (a[i][j] == '*') {
if (vis[i][j]) cout << "YES" << endl;
else cout << "NO" << endl;
return;
}
}
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL), cout.tie(NULL);
/*freopen("mincross.in", "r", stdin); */
/*freopen("test.out", "w", stdout); */
int t = 1;
/*cin >> t; */
while (t--) solve();
}
Compilation message (stderr)
Main.cpp: In function 'void solve()':
Main.cpp:84:13: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
84 | auto[x, y] = q.front();
| ^
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |