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 _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <iomanip>
#include <array>
#include <string>
#include <algorithm>
#include <cmath>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <vector>
#include <stack>
#include <queue>
#include <deque>
#include <bitset>
#include <list>
#include <iterator>
#include <numeric>
#include <complex>
#include <utility>
#include <random>
#include <cassert>
#include <fstream>
using namespace std;
mt19937_64 rnd(7069);
/* -------------------- Typedefs -------------------- */
typedef int itn;
typedef long long ll;
typedef unsigned long long ull;
typedef double db;
typedef float fl;
typedef long double ld;
/* -------------------- Usings -------------------- */
using vi = vector<int>;
using vll = vector<ll>;
using mii = map<int, int>;
using mll = map<ll, ll>;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
/* -------------------- Defines -------------------- */
#define ff first
#define ss second
#define pub push_back
#define pob pop_back
#define puf push_front
#define pof pop_front
#define mpr make_pair
#define yes cout<<"YES\n"
#define no cout<<"NO\n"
#define all(x) (x).begin(), (x).end()
#define USACO freopen("feast.in", "r", stdin); freopen("feast.out", "w", stdout);
/* -------------------- Constants -------------------- */
const int dx[8] = { -1, 0, 1, 0, -1, -1, 1, 1 };
const int dy[8] = { 0, -1, 0, 1, -1, 1, -1, 1 };
const int MAX = int(1e9 + 5);
const ll MAXL = ll(1e18) + 5ll;
const ll MOD = ll(1000000007);
const ll MOD2 = ll(998244353);
/* -------------------- Functions -------------------- */
void fastio() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
}
void precision(int x) {
cout.setf(ios::fixed | ios::showpoint);
cout.precision(x);
}
ll gcd(ll a, ll b) {
if (a == 0 || b == 0) return(max(a, b));
while (b) {
a %= b;
swap(a, b);
}
return a;
}
ll lcm(ll a, ll b) {
return a / gcd(a, b) * b;
}
ll range_sum(ll a, ll b) {
if (a > b) return 0ll;
ll dif = a - 1, cnt = b - a + 1;
ll ans = ((b - a + 1) * (b - a + 2)) / 2;
ans += ((b - a + 1) * dif);
return ans;
}
string dec_to_bin(ll a) {
string s = "";
for (ll i = a; i > 0; ) {
ll k = i % 2;
i /= 2;
char c = k + 48;
s += c;
}
if (a == 0) {
s = "0";
}
reverse(all(s));
return s;
}
ll bin_to_dec(string s) {
ll num = 0;
for (int i = 0; i < s.size(); i++) {
num *= 2ll;
num += (s[i] - '0');
}
return num;
}
ll factorial_by_mod(ll n, ll mod) {
ll ans = 1;
ll num;
for (ll i = 1; i <= n; ++i) {
num = i % mod;
ans *= num;
ans %= mod;
}
return ans;
}
bool isPrime(ll a) {
if (a == 1) return false;
for (ll i = 2; i * i <= a; i++) {
if (a % i == 0) return false;
}
return true;
}
ll binpow(ll a, ll b) {
if (!a) return 0;
ll ans = 1;
while (b) {
if (b & 1) {
ans *= a;
}
b >>= 1;
a *= a;
}
return ans;
}
ll binpow_by_mod(ll a, ll b, ll mod) {
if (!a) return 0;
ll ans = 1;
while (b) {
if (b & 1) {
ans *= a;
ans %= mod;
}
b >>= 1;
a *= a;
a %= mod;
}
return ans;
}
/* -------------------- Solution -------------------- */
const int N = 1505;
int can1[N][N], can2[N][N];
char a[N][N];
vi g[N], g1[N];
int n, m, k, l, tx, ty, x1, y1a, x2, y2;
void rec1(int i, int yl, int yr) {
for (int j = yl; j <= yr; ++j) {
can1[i][j] = 1;
}
for (int j = yl; j <= yr; ++j) {
if (i != 0 && a[i - 1][j] != 'X' && !can1[i - 1][j]) {
int ind = upper_bound(all(g[i - 1]), j) - g[i - 1].begin();
int l_up = g[i - 1][ind - 1] + 1, r_up = g[i - 1][ind] - 1;
if (r_up - l_up + 1 < k) continue;
rec1(i - 1, l_up, r_up);
}
if (i != n - 1 && a[i + 1][j] != 'X' && !can1[i + 1][j]) {
int ind = upper_bound(all(g[i + 1]), j) - g[i + 1].begin();
int l_down = g[i + 1][ind - 1] + 1, r_down = g[i + 1][ind] - 1;
if (r_down - l_down + 1 < k) continue;
rec1(i + 1, l_down, r_down);
}
}
}
void rec2(int j, int xl, int xr) {
for (int i = xl; i <= xr; ++i) {
can2[i][j] = 1;
}
for (int i = xl; i <= xr; ++i) {
if (j != 0 && a[i][j - 1] != 'X' && !can2[i][j - 1]) {
int ind = upper_bound(all(g1[j - 1]), i) - g1[j - 1].begin();
int l_left = g1[j - 1][ind - 1] + 1, r_left = g1[j - 1][ind] - 1;
if (r_left - l_left + 1 < l) continue;
rec2(j - 1, l_left, r_left);
}
if (j != m - 1 && a[i][j + 1] != 'X' && !can2[i][j + 1]) {
int ind = upper_bound(all(g1[j + 1]), i) - g1[j + 1].begin();
int l_right = g1[j + 1][ind - 1] + 1, r_right = g1[j + 1][ind] - 1;
if (r_right - l_right + 1 < l) continue;
rec2(j + 1, l_right, r_right);
}
}
}
void slv() {
cin >> n >> m >> k >> l >> x1 >> y1a >> x2 >> y2;
swap(x1, y1a);
swap(x2, y2);
swap(n, m);
for (int i = 0; i < n; ++i) {
g[i].pub(-1);
for (int j = 0; j < m; ++j) {
cin >> a[i][j];
if (a[i][j] == 'X') {
g[i].pub(j);
}
if (a[i][j] == '*') {
tx = i, ty = j;
}
}
g[i].pub(m);
}
for (int j = 0; j < m; ++j) {
g1[j].pub(-1);
for (int i = 0; i < n; ++i) {
if (a[i][j] == 'X') {
g1[j].pub(i);
}
}
g1[j].pub(n);
}
int ind = upper_bound(all(g[x1]), y1a) - g[x1].begin();
rec1(x1, g[x1][ind - 1] + 1, g[x1][ind] - 1);
ind = upper_bound(all(g1[y2]), x2) - g1[y2].begin();
rec2(y2, g1[y2][ind - 1] + 1, g1[y2][ind] - 1);
if (can1[tx][ty] && can2[tx][ty]) {
yes;
return;
}
no;
}
void cs() {
int tstc = 1;
//cin >> tstc;
while (tstc--) {
slv();
}
}
void precalc() {
return;
}
int main() {
fastio();
precalc();
//precision(0);
cs();
return 0;
}
Compilation message (stderr)
Main.cpp: In function 'll range_sum(ll, ll)':
Main.cpp:97:21: warning: unused variable 'cnt' [-Wunused-variable]
97 | ll dif = a - 1, cnt = b - a + 1;
| ^~~
Main.cpp: In function 'll bin_to_dec(std::string)':
Main.cpp:120:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
120 | for (int i = 0; i < s.size(); i++) {
| ~~^~~~~~~~~~
# | 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... |