problem_id stringlengths 6 6 | buggy_code stringlengths 8 526k ⌀ | fixed_code stringlengths 12 526k ⌀ | labels listlengths 0 15 ⌀ | buggy_submission_id int64 1 1.54M ⌀ | fixed_submission_id int64 2 1.54M ⌀ | user_id stringlengths 10 10 ⌀ | language stringclasses 9 values |
|---|---|---|---|---|---|---|---|
p03017 | #include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define rrep(i, n) for (ll i = 1; i <= (n); ++i)
#define drep(i, n) for (ll i = (n)-1; i >= 0; --i)
#define all(v) v.begin(), v.end()
#define len(x) (ll)(x).length()
#define maxs(x, y) x = max(x, y)
#define mins(x, y) x = min(x, y)
#define pb push_back
#define sz(x) (ll)(x).size()
#define v(T) vector<T>
#define vv(T) vector<vector<T>>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vl;
typedef vector<P> vp;
ll gcd(ll a, ll b) {
if (a % b == 0) {
return b;
} else {
return (gcd(b, a % b));
}
}
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
const int INF = 1e9;
const ll MX = 1e18;
const ll MOD = INF + 7;
const int di[] = {-1, 0, 1, 0};
const int dj[] = {0, -1, 0, 1};
const double PI = acos(-1);
#define dame \
{ \
puts("-1"); \
return 0; \
}
#define yn \
{ puts("Yes"); } \
else { \
puts("No"); \
}
#define YN \
{ puts("YES"); } \
else { \
puts("NO"); \
}
const ll MAX = 1000001;
long long fac[MAX], finv[MAX], inv[MAX];
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (ll i = 2; i < MAX; i++) {
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
long long COM(ll n, ll k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
ll llpow(ll n, ll i) {
ll cnt = n;
for (ll j = 0; j < i - 1; j++) {
n *= cnt;
}
return n;
}
int main() {
ll n, a, b, c, d;
cin >> n >> a >> b >> c >> d;
string s;
cin >> s;
int cntl = 0;
int cntr = 0;
for (int i = a; i < c; i++) {
if (s[i] != '#') {
cntr = 0;
continue;
}
cntr++;
if (cntr == 2) {
cout << "No" << endl;
return 0;
}
}
cntr = 0;
for (int i = b; i < d; i++) {
if (s[i] != '#') {
cntr = 0;
continue;
}
cntr++;
if (cntr == 2) {
cout << "No" << endl;
return 0;
}
}
if (d < c) {
for (int i = b - 1; i <= d + 1; i++) {
if (s[i] != '.') {
cntl = 0;
continue;
}
cntl++;
if (cntl == 3) {
cout << "Yes" << endl;
return 0;
}
}
cout << "No" << endl;
return 0;
} else {
cout << "Yes" << endl;
return 0;
}
}
| #include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define rrep(i, n) for (ll i = 1; i <= (n); ++i)
#define drep(i, n) for (ll i = (n)-1; i >= 0; --i)
#define all(v) v.begin(), v.end()
#define len(x) (ll)(x).length()
#define maxs(x, y) x = max(x, y)
#define mins(x, y) x = min(x, y)
#define pb push_back
#define sz(x) (ll)(x).size()
#define v(T) vector<T>
#define vv(T) vector<vector<T>>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vl;
typedef vector<P> vp;
ll gcd(ll a, ll b) {
if (a % b == 0) {
return b;
} else {
return (gcd(b, a % b));
}
}
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
const int INF = 1e9;
const ll MX = 1e18;
const ll MOD = INF + 7;
const int di[] = {-1, 0, 1, 0};
const int dj[] = {0, -1, 0, 1};
const double PI = acos(-1);
#define dame \
{ \
puts("-1"); \
return 0; \
}
#define yn \
{ puts("Yes"); } \
else { \
puts("No"); \
}
#define YN \
{ puts("YES"); } \
else { \
puts("NO"); \
}
const ll MAX = 1000001;
long long fac[MAX], finv[MAX], inv[MAX];
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (ll i = 2; i < MAX; i++) {
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
long long COM(ll n, ll k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
ll llpow(ll n, ll i) {
ll cnt = n;
for (ll j = 0; j < i - 1; j++) {
n *= cnt;
}
return n;
}
int main() {
ll n, a, b, c, d;
cin >> n >> a >> b >> c >> d;
string s;
cin >> s;
int cntl = 0;
int cntr = 0;
for (int i = a; i < c; i++) {
if (s[i - 1] != '#') {
cntr = 0;
continue;
}
cntr++;
if (cntr == 2) {
cout << "No" << endl;
return 0;
}
}
cntr = 0;
for (int i = b; i < d; i++) {
if (s[i - 1] != '#') {
cntr = 0;
continue;
}
cntr++;
if (cntr == 2) {
cout << "No" << endl;
return 0;
}
}
if (d < c) {
for (int i = b - 1; i <= d + 1; i++) {
if (s[i - 1] != '.') {
cntl = 0;
continue;
}
cntl++;
if (cntl == 3) {
cout << "Yes" << endl;
return 0;
}
}
cout << "No" << endl;
return 0;
} else {
cout << "Yes" << endl;
return 0;
}
}
| [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 829,760 | 829,761 | u818755983 | cpp |
p03017 | // includes
#include <bits/stdc++.h>
using namespace std;
// macros
#define pb emplace_back
#define mk make_pair
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(i, n) FOR(i, 0, n)
#define rrep(i, n) for (int i = ((int)(n)-1); i >= 0; i--)
#define irep(itr, st) for (auto itr = (st).begin(); itr != (st).end(); ++itr)
#define irrep(itr, st) for (auto itr = (st).rbegin(); itr != (st).rend(); ++itr)
#define whole(x) (x).begin(), (x).end()
#define sz(x) ((int)(x).size())
#define bit(n) (1LL << (n))
#define F first
#define S second
// functions
template <typename T> void unique(T &c) {
c.erase(std::unique(c.begin(), c.end()), c.end());
}
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
template <typename T> istream &operator>>(istream &is, vector<T> &vec) {
for (auto &v : vec)
is >> v;
return is;
}
template <typename T> ostream &operator<<(ostream &os, const vector<T> &vec) {
for (int i = 0; i < vec.size(); i++) {
os << vec[i];
if (i + 1 != vec.size())
os << " ";
}
return os;
}
template <typename T> ostream &operator<<(ostream &os, const set<T> &st) {
for (auto itr = st.begin(); itr != st.end(); ++itr) {
os << *itr;
auto titr = itr;
if (++titr != st.end())
os << " ";
}
return os;
}
template <typename T>
ostream &operator<<(ostream &os, const unordered_set<T> &st) {
for (auto itr = st.begin(); itr != st.end(); ++itr) {
os << *itr;
auto titr = itr;
if (++titr != st.end())
os << " ";
}
return os;
}
template <typename T> ostream &operator<<(ostream &os, const multiset<T> &st) {
for (auto itr = st.begin(); itr != st.end(); ++itr) {
os << *itr;
auto titr = itr;
if (++titr != st.end())
os << " ";
}
return os;
}
template <typename T>
ostream &operator<<(ostream &os, const unordered_multiset<T> &st) {
for (auto itr = st.begin(); itr != st.end(); ++itr) {
os << *itr;
auto titr = itr;
if (++titr != st.end())
os << " ";
}
return os;
}
template <typename T1, typename T2>
ostream &operator<<(ostream &os, const pair<T1, T2> &p) {
os << "(" << p.first << ", " << p.second << ")";
return os;
}
template <typename T1, typename T2>
ostream &operator<<(ostream &os, const map<T1, T2> &mp) {
for (auto itr = mp.begin(); itr != mp.end(); ++itr) {
os << "(" << itr->first << ", " << itr->second << ")";
auto titr = itr;
if (++titr != mp.end())
os << " ";
}
return os;
}
template <typename T1, typename T2>
ostream &operator<<(ostream &os, const unordered_map<T1, T2> &mp) {
for (auto itr = mp.begin(); itr != mp.end(); ++itr) {
os << "(" << itr->first << ", " << itr->second << ")";
auto titr = itr;
if (++titr != mp.end())
os << " ";
}
return os;
}
// types
using ll = long long int;
using P = pair<int, int>;
// constants
const int inf = 1e9;
const ll linf = 1LL << 60;
const double EPS = 1e-10;
const int mod = 1000000007;
const int dx[4] = {-1, 0, 1, 0};
const int dy[4] = {0, -1, 0, 1};
// io
struct fast_io {
fast_io() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
cout << fixed << setprecision(20);
}
} fast_io_;
int main(int argc, char const *argv[]) {
int n, a, b, c, d;
cin >> n >> a >> b >> c >> d;
a--;
b--;
c--;
d--;
string s;
cin >> s;
bool res = true;
for (int i = a; i < c; i++) {
if (s[i] == '#' && s[i + 1] == '#')
res = false;
}
for (int i = b; i < d; i++) {
if (s[i] == '#' && s[i + 1] == '#')
res = false;
}
if (c > d) {
bool ok = false;
for (int i = min(0, b - 1); i < min(d, n - 2); i++) {
if (s[i] == '.' && s[i + 1] == '.' && s[i + 2] == '.')
ok = true;
}
if (!ok)
res = false;
}
cout << (res ? "Yes" : "No") << endl;
return 0;
}
| // includes
#include <bits/stdc++.h>
using namespace std;
// macros
#define pb emplace_back
#define mk make_pair
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(i, n) FOR(i, 0, n)
#define rrep(i, n) for (int i = ((int)(n)-1); i >= 0; i--)
#define irep(itr, st) for (auto itr = (st).begin(); itr != (st).end(); ++itr)
#define irrep(itr, st) for (auto itr = (st).rbegin(); itr != (st).rend(); ++itr)
#define whole(x) (x).begin(), (x).end()
#define sz(x) ((int)(x).size())
#define bit(n) (1LL << (n))
#define F first
#define S second
// functions
template <typename T> void unique(T &c) {
c.erase(std::unique(c.begin(), c.end()), c.end());
}
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
template <typename T> istream &operator>>(istream &is, vector<T> &vec) {
for (auto &v : vec)
is >> v;
return is;
}
template <typename T> ostream &operator<<(ostream &os, const vector<T> &vec) {
for (int i = 0; i < vec.size(); i++) {
os << vec[i];
if (i + 1 != vec.size())
os << " ";
}
return os;
}
template <typename T> ostream &operator<<(ostream &os, const set<T> &st) {
for (auto itr = st.begin(); itr != st.end(); ++itr) {
os << *itr;
auto titr = itr;
if (++titr != st.end())
os << " ";
}
return os;
}
template <typename T>
ostream &operator<<(ostream &os, const unordered_set<T> &st) {
for (auto itr = st.begin(); itr != st.end(); ++itr) {
os << *itr;
auto titr = itr;
if (++titr != st.end())
os << " ";
}
return os;
}
template <typename T> ostream &operator<<(ostream &os, const multiset<T> &st) {
for (auto itr = st.begin(); itr != st.end(); ++itr) {
os << *itr;
auto titr = itr;
if (++titr != st.end())
os << " ";
}
return os;
}
template <typename T>
ostream &operator<<(ostream &os, const unordered_multiset<T> &st) {
for (auto itr = st.begin(); itr != st.end(); ++itr) {
os << *itr;
auto titr = itr;
if (++titr != st.end())
os << " ";
}
return os;
}
template <typename T1, typename T2>
ostream &operator<<(ostream &os, const pair<T1, T2> &p) {
os << "(" << p.first << ", " << p.second << ")";
return os;
}
template <typename T1, typename T2>
ostream &operator<<(ostream &os, const map<T1, T2> &mp) {
for (auto itr = mp.begin(); itr != mp.end(); ++itr) {
os << "(" << itr->first << ", " << itr->second << ")";
auto titr = itr;
if (++titr != mp.end())
os << " ";
}
return os;
}
template <typename T1, typename T2>
ostream &operator<<(ostream &os, const unordered_map<T1, T2> &mp) {
for (auto itr = mp.begin(); itr != mp.end(); ++itr) {
os << "(" << itr->first << ", " << itr->second << ")";
auto titr = itr;
if (++titr != mp.end())
os << " ";
}
return os;
}
// types
using ll = long long int;
using P = pair<int, int>;
// constants
const int inf = 1e9;
const ll linf = 1LL << 60;
const double EPS = 1e-10;
const int mod = 1000000007;
const int dx[4] = {-1, 0, 1, 0};
const int dy[4] = {0, -1, 0, 1};
// io
struct fast_io {
fast_io() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
cout << fixed << setprecision(20);
}
} fast_io_;
int main(int argc, char const *argv[]) {
int n, a, b, c, d;
cin >> n >> a >> b >> c >> d;
a--;
b--;
c--;
d--;
string s;
cin >> s;
bool res = true;
for (int i = a; i < c; i++) {
if (s[i] == '#' && s[i + 1] == '#')
res = false;
}
for (int i = b; i < d; i++) {
if (s[i] == '#' && s[i + 1] == '#')
res = false;
}
if (c > d) {
bool ok = false;
for (int i = max(0, b - 1); i < min(d, n - 2); i++) {
if (s[i] == '.' && s[i + 1] == '.' && s[i + 2] == '.')
ok = true;
}
if (!ok)
res = false;
}
cout << (res ? "Yes" : "No") << endl;
return 0;
}
| [
"misc.opposites",
"identifier.change",
"call.function.change",
"control_flow.loop.for.initializer.change"
] | 829,791 | 829,792 | u424110125 | cpp |
p03017 | // includes
#include <bits/stdc++.h>
using namespace std;
// macros
#define pb emplace_back
#define mk make_pair
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(i, n) FOR(i, 0, n)
#define rrep(i, n) for (int i = ((int)(n)-1); i >= 0; i--)
#define irep(itr, st) for (auto itr = (st).begin(); itr != (st).end(); ++itr)
#define irrep(itr, st) for (auto itr = (st).rbegin(); itr != (st).rend(); ++itr)
#define whole(x) (x).begin(), (x).end()
#define sz(x) ((int)(x).size())
#define bit(n) (1LL << (n))
#define F first
#define S second
// functions
template <typename T> void unique(T &c) {
c.erase(std::unique(c.begin(), c.end()), c.end());
}
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
template <typename T> istream &operator>>(istream &is, vector<T> &vec) {
for (auto &v : vec)
is >> v;
return is;
}
template <typename T> ostream &operator<<(ostream &os, const vector<T> &vec) {
for (int i = 0; i < vec.size(); i++) {
os << vec[i];
if (i + 1 != vec.size())
os << " ";
}
return os;
}
template <typename T> ostream &operator<<(ostream &os, const set<T> &st) {
for (auto itr = st.begin(); itr != st.end(); ++itr) {
os << *itr;
auto titr = itr;
if (++titr != st.end())
os << " ";
}
return os;
}
template <typename T>
ostream &operator<<(ostream &os, const unordered_set<T> &st) {
for (auto itr = st.begin(); itr != st.end(); ++itr) {
os << *itr;
auto titr = itr;
if (++titr != st.end())
os << " ";
}
return os;
}
template <typename T> ostream &operator<<(ostream &os, const multiset<T> &st) {
for (auto itr = st.begin(); itr != st.end(); ++itr) {
os << *itr;
auto titr = itr;
if (++titr != st.end())
os << " ";
}
return os;
}
template <typename T>
ostream &operator<<(ostream &os, const unordered_multiset<T> &st) {
for (auto itr = st.begin(); itr != st.end(); ++itr) {
os << *itr;
auto titr = itr;
if (++titr != st.end())
os << " ";
}
return os;
}
template <typename T1, typename T2>
ostream &operator<<(ostream &os, const pair<T1, T2> &p) {
os << "(" << p.first << ", " << p.second << ")";
return os;
}
template <typename T1, typename T2>
ostream &operator<<(ostream &os, const map<T1, T2> &mp) {
for (auto itr = mp.begin(); itr != mp.end(); ++itr) {
os << "(" << itr->first << ", " << itr->second << ")";
auto titr = itr;
if (++titr != mp.end())
os << " ";
}
return os;
}
template <typename T1, typename T2>
ostream &operator<<(ostream &os, const unordered_map<T1, T2> &mp) {
for (auto itr = mp.begin(); itr != mp.end(); ++itr) {
os << "(" << itr->first << ", " << itr->second << ")";
auto titr = itr;
if (++titr != mp.end())
os << " ";
}
return os;
}
// types
using ll = long long int;
using P = pair<int, int>;
// constants
const int inf = 1e9;
const ll linf = 1LL << 60;
const double EPS = 1e-10;
const int mod = 1000000007;
const int dx[4] = {-1, 0, 1, 0};
const int dy[4] = {0, -1, 0, 1};
// io
struct fast_io {
fast_io() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
cout << fixed << setprecision(20);
}
} fast_io_;
int main(int argc, char const *argv[]) {
int n, a, b, c, d;
cin >> n >> a >> b >> c >> d;
a--;
b--;
c--;
d--;
string s;
cin >> s;
bool res = true;
for (int i = a; i < c; i++) {
if (s[i] == '#' && s[i + 1] == '#')
res = false;
}
for (int i = b; i < d; i++) {
if (s[i] == '#' && s[i + 1] == '#')
res = false;
}
if (c > d) {
bool ok = false;
for (int i = min(0, b - 1); i < min(d - 1, n - 2); i++) {
if (s[i] == '.' && s[i + 1] == '.' && s[i + 2] == '.')
ok = true;
}
if (!ok)
res = false;
}
cout << (res ? "Yes" : "No") << endl;
return 0;
}
| // includes
#include <bits/stdc++.h>
using namespace std;
// macros
#define pb emplace_back
#define mk make_pair
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(i, n) FOR(i, 0, n)
#define rrep(i, n) for (int i = ((int)(n)-1); i >= 0; i--)
#define irep(itr, st) for (auto itr = (st).begin(); itr != (st).end(); ++itr)
#define irrep(itr, st) for (auto itr = (st).rbegin(); itr != (st).rend(); ++itr)
#define whole(x) (x).begin(), (x).end()
#define sz(x) ((int)(x).size())
#define bit(n) (1LL << (n))
#define F first
#define S second
// functions
template <typename T> void unique(T &c) {
c.erase(std::unique(c.begin(), c.end()), c.end());
}
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
template <typename T> istream &operator>>(istream &is, vector<T> &vec) {
for (auto &v : vec)
is >> v;
return is;
}
template <typename T> ostream &operator<<(ostream &os, const vector<T> &vec) {
for (int i = 0; i < vec.size(); i++) {
os << vec[i];
if (i + 1 != vec.size())
os << " ";
}
return os;
}
template <typename T> ostream &operator<<(ostream &os, const set<T> &st) {
for (auto itr = st.begin(); itr != st.end(); ++itr) {
os << *itr;
auto titr = itr;
if (++titr != st.end())
os << " ";
}
return os;
}
template <typename T>
ostream &operator<<(ostream &os, const unordered_set<T> &st) {
for (auto itr = st.begin(); itr != st.end(); ++itr) {
os << *itr;
auto titr = itr;
if (++titr != st.end())
os << " ";
}
return os;
}
template <typename T> ostream &operator<<(ostream &os, const multiset<T> &st) {
for (auto itr = st.begin(); itr != st.end(); ++itr) {
os << *itr;
auto titr = itr;
if (++titr != st.end())
os << " ";
}
return os;
}
template <typename T>
ostream &operator<<(ostream &os, const unordered_multiset<T> &st) {
for (auto itr = st.begin(); itr != st.end(); ++itr) {
os << *itr;
auto titr = itr;
if (++titr != st.end())
os << " ";
}
return os;
}
template <typename T1, typename T2>
ostream &operator<<(ostream &os, const pair<T1, T2> &p) {
os << "(" << p.first << ", " << p.second << ")";
return os;
}
template <typename T1, typename T2>
ostream &operator<<(ostream &os, const map<T1, T2> &mp) {
for (auto itr = mp.begin(); itr != mp.end(); ++itr) {
os << "(" << itr->first << ", " << itr->second << ")";
auto titr = itr;
if (++titr != mp.end())
os << " ";
}
return os;
}
template <typename T1, typename T2>
ostream &operator<<(ostream &os, const unordered_map<T1, T2> &mp) {
for (auto itr = mp.begin(); itr != mp.end(); ++itr) {
os << "(" << itr->first << ", " << itr->second << ")";
auto titr = itr;
if (++titr != mp.end())
os << " ";
}
return os;
}
// types
using ll = long long int;
using P = pair<int, int>;
// constants
const int inf = 1e9;
const ll linf = 1LL << 60;
const double EPS = 1e-10;
const int mod = 1000000007;
const int dx[4] = {-1, 0, 1, 0};
const int dy[4] = {0, -1, 0, 1};
// io
struct fast_io {
fast_io() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
cout << fixed << setprecision(20);
}
} fast_io_;
int main(int argc, char const *argv[]) {
int n, a, b, c, d;
cin >> n >> a >> b >> c >> d;
a--;
b--;
c--;
d--;
string s;
cin >> s;
bool res = true;
for (int i = a; i < c; i++) {
if (s[i] == '#' && s[i + 1] == '#')
res = false;
}
for (int i = b; i < d; i++) {
if (s[i] == '#' && s[i + 1] == '#')
res = false;
}
if (c > d) {
bool ok = false;
for (int i = max(0, b - 1); i < min(d, n - 2); i++) {
if (s[i] == '.' && s[i + 1] == '.' && s[i + 2] == '.')
ok = true;
}
if (!ok)
res = false;
}
cout << (res ? "Yes" : "No") << endl;
return 0;
}
| [
"misc.opposites",
"identifier.change",
"call.function.change",
"control_flow.loop.for.initializer.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 829,793 | 829,792 | u424110125 | cpp |
p03017 | // includes
#include <bits/stdc++.h>
using namespace std;
// macros
#define pb emplace_back
#define mk make_pair
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(i, n) FOR(i, 0, n)
#define rrep(i, n) for (int i = ((int)(n)-1); i >= 0; i--)
#define irep(itr, st) for (auto itr = (st).begin(); itr != (st).end(); ++itr)
#define irrep(itr, st) for (auto itr = (st).rbegin(); itr != (st).rend(); ++itr)
#define whole(x) (x).begin(), (x).end()
#define sz(x) ((int)(x).size())
#define bit(n) (1LL << (n))
#define F first
#define S second
// functions
template <typename T> void unique(T &c) {
c.erase(std::unique(c.begin(), c.end()), c.end());
}
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
template <typename T> istream &operator>>(istream &is, vector<T> &vec) {
for (auto &v : vec)
is >> v;
return is;
}
template <typename T> ostream &operator<<(ostream &os, const vector<T> &vec) {
for (int i = 0; i < vec.size(); i++) {
os << vec[i];
if (i + 1 != vec.size())
os << " ";
}
return os;
}
template <typename T> ostream &operator<<(ostream &os, const set<T> &st) {
for (auto itr = st.begin(); itr != st.end(); ++itr) {
os << *itr;
auto titr = itr;
if (++titr != st.end())
os << " ";
}
return os;
}
template <typename T>
ostream &operator<<(ostream &os, const unordered_set<T> &st) {
for (auto itr = st.begin(); itr != st.end(); ++itr) {
os << *itr;
auto titr = itr;
if (++titr != st.end())
os << " ";
}
return os;
}
template <typename T> ostream &operator<<(ostream &os, const multiset<T> &st) {
for (auto itr = st.begin(); itr != st.end(); ++itr) {
os << *itr;
auto titr = itr;
if (++titr != st.end())
os << " ";
}
return os;
}
template <typename T>
ostream &operator<<(ostream &os, const unordered_multiset<T> &st) {
for (auto itr = st.begin(); itr != st.end(); ++itr) {
os << *itr;
auto titr = itr;
if (++titr != st.end())
os << " ";
}
return os;
}
template <typename T1, typename T2>
ostream &operator<<(ostream &os, const pair<T1, T2> &p) {
os << "(" << p.first << ", " << p.second << ")";
return os;
}
template <typename T1, typename T2>
ostream &operator<<(ostream &os, const map<T1, T2> &mp) {
for (auto itr = mp.begin(); itr != mp.end(); ++itr) {
os << "(" << itr->first << ", " << itr->second << ")";
auto titr = itr;
if (++titr != mp.end())
os << " ";
}
return os;
}
template <typename T1, typename T2>
ostream &operator<<(ostream &os, const unordered_map<T1, T2> &mp) {
for (auto itr = mp.begin(); itr != mp.end(); ++itr) {
os << "(" << itr->first << ", " << itr->second << ")";
auto titr = itr;
if (++titr != mp.end())
os << " ";
}
return os;
}
// types
using ll = long long int;
using P = pair<int, int>;
// constants
const int inf = 1e9;
const ll linf = 1LL << 60;
const double EPS = 1e-10;
const int mod = 1000000007;
const int dx[4] = {-1, 0, 1, 0};
const int dy[4] = {0, -1, 0, 1};
// io
struct fast_io {
fast_io() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
cout << fixed << setprecision(20);
}
} fast_io_;
int main(int argc, char const *argv[]) {
int n, a, b, c, d;
cin >> n >> a >> b >> c >> d;
a--;
b--;
c--;
d--;
string s;
cin >> s;
bool res = true;
for (int i = a; i < c; i++) {
if (s[i] == '#' && s[i + 1] == '#')
res = false;
}
for (int i = b; i < d; i++) {
if (s[i] == '#' && s[i + 1] == '#')
res = false;
}
if (c > d) {
bool ok = false;
for (int i = min(0, b - 1); i < min(c - 1, n - 2); i++) {
if (s[i] == '.' && s[i + 1] == '.' && s[i + 2] == '.')
ok = true;
}
if (!ok)
res = false;
}
cout << (res ? "Yes" : "No") << endl;
return 0;
}
| // includes
#include <bits/stdc++.h>
using namespace std;
// macros
#define pb emplace_back
#define mk make_pair
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(i, n) FOR(i, 0, n)
#define rrep(i, n) for (int i = ((int)(n)-1); i >= 0; i--)
#define irep(itr, st) for (auto itr = (st).begin(); itr != (st).end(); ++itr)
#define irrep(itr, st) for (auto itr = (st).rbegin(); itr != (st).rend(); ++itr)
#define whole(x) (x).begin(), (x).end()
#define sz(x) ((int)(x).size())
#define bit(n) (1LL << (n))
#define F first
#define S second
// functions
template <typename T> void unique(T &c) {
c.erase(std::unique(c.begin(), c.end()), c.end());
}
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
template <typename T> istream &operator>>(istream &is, vector<T> &vec) {
for (auto &v : vec)
is >> v;
return is;
}
template <typename T> ostream &operator<<(ostream &os, const vector<T> &vec) {
for (int i = 0; i < vec.size(); i++) {
os << vec[i];
if (i + 1 != vec.size())
os << " ";
}
return os;
}
template <typename T> ostream &operator<<(ostream &os, const set<T> &st) {
for (auto itr = st.begin(); itr != st.end(); ++itr) {
os << *itr;
auto titr = itr;
if (++titr != st.end())
os << " ";
}
return os;
}
template <typename T>
ostream &operator<<(ostream &os, const unordered_set<T> &st) {
for (auto itr = st.begin(); itr != st.end(); ++itr) {
os << *itr;
auto titr = itr;
if (++titr != st.end())
os << " ";
}
return os;
}
template <typename T> ostream &operator<<(ostream &os, const multiset<T> &st) {
for (auto itr = st.begin(); itr != st.end(); ++itr) {
os << *itr;
auto titr = itr;
if (++titr != st.end())
os << " ";
}
return os;
}
template <typename T>
ostream &operator<<(ostream &os, const unordered_multiset<T> &st) {
for (auto itr = st.begin(); itr != st.end(); ++itr) {
os << *itr;
auto titr = itr;
if (++titr != st.end())
os << " ";
}
return os;
}
template <typename T1, typename T2>
ostream &operator<<(ostream &os, const pair<T1, T2> &p) {
os << "(" << p.first << ", " << p.second << ")";
return os;
}
template <typename T1, typename T2>
ostream &operator<<(ostream &os, const map<T1, T2> &mp) {
for (auto itr = mp.begin(); itr != mp.end(); ++itr) {
os << "(" << itr->first << ", " << itr->second << ")";
auto titr = itr;
if (++titr != mp.end())
os << " ";
}
return os;
}
template <typename T1, typename T2>
ostream &operator<<(ostream &os, const unordered_map<T1, T2> &mp) {
for (auto itr = mp.begin(); itr != mp.end(); ++itr) {
os << "(" << itr->first << ", " << itr->second << ")";
auto titr = itr;
if (++titr != mp.end())
os << " ";
}
return os;
}
// types
using ll = long long int;
using P = pair<int, int>;
// constants
const int inf = 1e9;
const ll linf = 1LL << 60;
const double EPS = 1e-10;
const int mod = 1000000007;
const int dx[4] = {-1, 0, 1, 0};
const int dy[4] = {0, -1, 0, 1};
// io
struct fast_io {
fast_io() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
cout << fixed << setprecision(20);
}
} fast_io_;
int main(int argc, char const *argv[]) {
int n, a, b, c, d;
cin >> n >> a >> b >> c >> d;
a--;
b--;
c--;
d--;
string s;
cin >> s;
bool res = true;
for (int i = a; i < c; i++) {
if (s[i] == '#' && s[i + 1] == '#')
res = false;
}
for (int i = b; i < d; i++) {
if (s[i] == '#' && s[i + 1] == '#')
res = false;
}
if (c > d) {
bool ok = false;
for (int i = max(0, b - 1); i < min(d, n - 2); i++) {
if (s[i] == '.' && s[i + 1] == '.' && s[i + 2] == '.')
ok = true;
}
if (!ok)
res = false;
}
cout << (res ? "Yes" : "No") << endl;
return 0;
}
| [
"misc.opposites",
"identifier.change",
"call.function.change",
"control_flow.loop.for.initializer.change",
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 829,794 | 829,792 | u424110125 | cpp |
p03017 | // includes
#include <bits/stdc++.h>
using namespace std;
// macros
#define pb emplace_back
#define mk make_pair
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(i, n) FOR(i, 0, n)
#define rrep(i, n) for (int i = ((int)(n)-1); i >= 0; i--)
#define irep(itr, st) for (auto itr = (st).begin(); itr != (st).end(); ++itr)
#define irrep(itr, st) for (auto itr = (st).rbegin(); itr != (st).rend(); ++itr)
#define whole(x) (x).begin(), (x).end()
#define sz(x) ((int)(x).size())
#define bit(n) (1LL << (n))
#define F first
#define S second
// functions
template <typename T> void unique(T &c) {
c.erase(std::unique(c.begin(), c.end()), c.end());
}
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
template <typename T> istream &operator>>(istream &is, vector<T> &vec) {
for (auto &v : vec)
is >> v;
return is;
}
template <typename T> ostream &operator<<(ostream &os, const vector<T> &vec) {
for (int i = 0; i < vec.size(); i++) {
os << vec[i];
if (i + 1 != vec.size())
os << " ";
}
return os;
}
template <typename T> ostream &operator<<(ostream &os, const set<T> &st) {
for (auto itr = st.begin(); itr != st.end(); ++itr) {
os << *itr;
auto titr = itr;
if (++titr != st.end())
os << " ";
}
return os;
}
template <typename T>
ostream &operator<<(ostream &os, const unordered_set<T> &st) {
for (auto itr = st.begin(); itr != st.end(); ++itr) {
os << *itr;
auto titr = itr;
if (++titr != st.end())
os << " ";
}
return os;
}
template <typename T> ostream &operator<<(ostream &os, const multiset<T> &st) {
for (auto itr = st.begin(); itr != st.end(); ++itr) {
os << *itr;
auto titr = itr;
if (++titr != st.end())
os << " ";
}
return os;
}
template <typename T>
ostream &operator<<(ostream &os, const unordered_multiset<T> &st) {
for (auto itr = st.begin(); itr != st.end(); ++itr) {
os << *itr;
auto titr = itr;
if (++titr != st.end())
os << " ";
}
return os;
}
template <typename T1, typename T2>
ostream &operator<<(ostream &os, const pair<T1, T2> &p) {
os << "(" << p.first << ", " << p.second << ")";
return os;
}
template <typename T1, typename T2>
ostream &operator<<(ostream &os, const map<T1, T2> &mp) {
for (auto itr = mp.begin(); itr != mp.end(); ++itr) {
os << "(" << itr->first << ", " << itr->second << ")";
auto titr = itr;
if (++titr != mp.end())
os << " ";
}
return os;
}
template <typename T1, typename T2>
ostream &operator<<(ostream &os, const unordered_map<T1, T2> &mp) {
for (auto itr = mp.begin(); itr != mp.end(); ++itr) {
os << "(" << itr->first << ", " << itr->second << ")";
auto titr = itr;
if (++titr != mp.end())
os << " ";
}
return os;
}
// types
using ll = long long int;
using P = pair<int, int>;
// constants
const int inf = 1e9;
const ll linf = 1LL << 60;
const double EPS = 1e-10;
const int mod = 1000000007;
const int dx[4] = {-1, 0, 1, 0};
const int dy[4] = {0, -1, 0, 1};
// io
struct fast_io {
fast_io() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
cout << fixed << setprecision(20);
}
} fast_io_;
int main(int argc, char const *argv[]) {
int n, a, b, c, d;
cin >> n >> a >> b >> c >> d;
a--;
b--;
c--;
d--;
string s;
cin >> s;
bool res = true;
for (int i = a; i < b; i++) {
if (s[i] == '#' && s[i + 1] == '#')
res = false;
}
for (int i = c; i < d; i++) {
if (s[i] == '#' && s[i + 1] == '#')
res = false;
}
if (c > d) {
bool ok = false;
for (int i = min(0, b - 1); i < min(c - 1, n - 2); i++) {
if (s[i] == '.' && s[i + 1] == '.' && s[i + 2] == '.')
ok = true;
}
if (!ok)
res = false;
}
cout << (res ? "Yes" : "No") << endl;
return 0;
}
| // includes
#include <bits/stdc++.h>
using namespace std;
// macros
#define pb emplace_back
#define mk make_pair
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(i, n) FOR(i, 0, n)
#define rrep(i, n) for (int i = ((int)(n)-1); i >= 0; i--)
#define irep(itr, st) for (auto itr = (st).begin(); itr != (st).end(); ++itr)
#define irrep(itr, st) for (auto itr = (st).rbegin(); itr != (st).rend(); ++itr)
#define whole(x) (x).begin(), (x).end()
#define sz(x) ((int)(x).size())
#define bit(n) (1LL << (n))
#define F first
#define S second
// functions
template <typename T> void unique(T &c) {
c.erase(std::unique(c.begin(), c.end()), c.end());
}
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
template <typename T> istream &operator>>(istream &is, vector<T> &vec) {
for (auto &v : vec)
is >> v;
return is;
}
template <typename T> ostream &operator<<(ostream &os, const vector<T> &vec) {
for (int i = 0; i < vec.size(); i++) {
os << vec[i];
if (i + 1 != vec.size())
os << " ";
}
return os;
}
template <typename T> ostream &operator<<(ostream &os, const set<T> &st) {
for (auto itr = st.begin(); itr != st.end(); ++itr) {
os << *itr;
auto titr = itr;
if (++titr != st.end())
os << " ";
}
return os;
}
template <typename T>
ostream &operator<<(ostream &os, const unordered_set<T> &st) {
for (auto itr = st.begin(); itr != st.end(); ++itr) {
os << *itr;
auto titr = itr;
if (++titr != st.end())
os << " ";
}
return os;
}
template <typename T> ostream &operator<<(ostream &os, const multiset<T> &st) {
for (auto itr = st.begin(); itr != st.end(); ++itr) {
os << *itr;
auto titr = itr;
if (++titr != st.end())
os << " ";
}
return os;
}
template <typename T>
ostream &operator<<(ostream &os, const unordered_multiset<T> &st) {
for (auto itr = st.begin(); itr != st.end(); ++itr) {
os << *itr;
auto titr = itr;
if (++titr != st.end())
os << " ";
}
return os;
}
template <typename T1, typename T2>
ostream &operator<<(ostream &os, const pair<T1, T2> &p) {
os << "(" << p.first << ", " << p.second << ")";
return os;
}
template <typename T1, typename T2>
ostream &operator<<(ostream &os, const map<T1, T2> &mp) {
for (auto itr = mp.begin(); itr != mp.end(); ++itr) {
os << "(" << itr->first << ", " << itr->second << ")";
auto titr = itr;
if (++titr != mp.end())
os << " ";
}
return os;
}
template <typename T1, typename T2>
ostream &operator<<(ostream &os, const unordered_map<T1, T2> &mp) {
for (auto itr = mp.begin(); itr != mp.end(); ++itr) {
os << "(" << itr->first << ", " << itr->second << ")";
auto titr = itr;
if (++titr != mp.end())
os << " ";
}
return os;
}
// types
using ll = long long int;
using P = pair<int, int>;
// constants
const int inf = 1e9;
const ll linf = 1LL << 60;
const double EPS = 1e-10;
const int mod = 1000000007;
const int dx[4] = {-1, 0, 1, 0};
const int dy[4] = {0, -1, 0, 1};
// io
struct fast_io {
fast_io() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
cout << fixed << setprecision(20);
}
} fast_io_;
int main(int argc, char const *argv[]) {
int n, a, b, c, d;
cin >> n >> a >> b >> c >> d;
a--;
b--;
c--;
d--;
string s;
cin >> s;
bool res = true;
for (int i = a; i < c; i++) {
if (s[i] == '#' && s[i + 1] == '#')
res = false;
}
for (int i = b; i < d; i++) {
if (s[i] == '#' && s[i + 1] == '#')
res = false;
}
if (c > d) {
bool ok = false;
for (int i = max(0, b - 1); i < min(d, n - 2); i++) {
if (s[i] == '.' && s[i + 1] == '.' && s[i + 2] == '.')
ok = true;
}
if (!ok)
res = false;
}
cout << (res ? "Yes" : "No") << endl;
return 0;
}
| [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"misc.opposites",
"call.function.change",
"control_flow.branch.if.condition.change",
"expression.operation.binary.remo... | 829,795 | 829,792 | u424110125 | cpp |
p03017 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define ll long long
int main() {
int n, a, b, c, d;
bool ok = true;
bool ok_2 = false;
string s;
cin >> n >> a >> b >> c >> d >> s;
a--;
b--;
c--;
d--;
if (c < d) {
for (int i = a; i < c - 1; i++) {
if (s[i] == '#' && s[i + 1] == '#')
ok = false;
}
for (int i = b; i < d - 1; i++) {
if (s[i] == '#' && s[i + 1] == '#')
ok = false;
}
ok_2 = true;
} else {
for (int i = a; i < c - 1; i++) {
if (s[i] == '#' && s[i + 1] == '#')
ok = false;
}
for (int i = b; i < d - 1; i++) {
if (s[i] == '#' && s[i + 1] == '#')
ok = false;
}
for (int i = b + 1; i < d - 1; i++) {
if (s[i - 1] == '.' && s[i] == '.' && s[i + 1] == '.')
ok_2 = true;
}
}
if (ok && ok_2)
cout << "Yes" << endl;
else
cout << "No" << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define ll long long
int main() {
int n, a, b, c, d;
bool ok = true;
bool ok_2 = false;
string s;
cin >> n >> a >> b >> c >> d >> s;
a--;
b--;
c--;
d--;
if (c < d) {
for (int i = a; i < c - 1; i++) {
if (s[i] == '#' && s[i + 1] == '#')
ok = false;
}
for (int i = b; i < d - 1; i++) {
if (s[i] == '#' && s[i + 1] == '#')
ok = false;
}
ok_2 = true;
} else {
for (int i = a; i < c - 1; i++) {
if (s[i] == '#' && s[i + 1] == '#')
ok = false;
}
for (int i = b; i < d - 1; i++) {
if (s[i] == '#' && s[i + 1] == '#')
ok = false;
}
for (int i = b; i <= d; i++) {
if (s[i - 1] == '.' && s[i] == '.' && s[i + 1] == '.')
ok_2 = true;
}
}
if (ok && ok_2)
cout << "Yes" << endl;
else
cout << "No" << endl;
} | [
"control_flow.loop.for.initializer.change",
"expression.operation.binary.remove",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 829,796 | 829,797 | u796273093 | cpp |
p03017 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
int main() {
int n, a, b, c, d;
string s;
cin >> n >> a >> b >> c >> d >> s;
s = '.' + s;
if (c < d) {
for (int i = a; i <= d - 2; ++i) {
if (s[i] == '#' && s[i + 1] == '#') {
cout << "No" << endl;
return 0;
}
}
cout << "Yes" << endl;
} else {
for (int i = a; i <= c - 2; ++i) {
if (s[i] == '#' && s[i + 1] == '#') {
cout << "No" << endl;
return 0;
}
}
bool ok = false;
for (int i = b - 1; i <= d - 3; ++i) {
if (s[i] == '.' && s[i + 1] == '.' && s[i + 2] == '.')
ok = true;
}
cout << (ok == true ? "Yes" : "No") << endl;
}
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
int main() {
int n, a, b, c, d;
string s;
cin >> n >> a >> b >> c >> d >> s;
s = '.' + s;
if (c < d) {
for (int i = a; i <= d - 2; ++i) {
if (s[i] == '#' && s[i + 1] == '#') {
cout << "No" << endl;
return 0;
}
}
cout << "Yes" << endl;
} else {
for (int i = a; i <= c - 2; ++i) {
if (s[i] == '#' && s[i + 1] == '#') {
cout << "No" << endl;
return 0;
}
}
bool ok = false;
for (int i = b - 1; i <= d - 1; ++i) {
if (s[i] == '.' && s[i + 1] == '.' && s[i + 2] == '.')
ok = true;
}
cout << (ok == true ? "Yes" : "No") << endl;
}
} | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 829,806 | 829,807 | u754114382 | cpp |
p03017 | // #include <iostream>
// #include <cstdio>
// #include <cstdlib>
// #include <cstring>
// #include <algorithm>
// #include <string>
// #include <sstream>
// #include <complex>
// #include <vector>
// #include <list>
// #include <queue>
// #include <deque>
// #include <stack>
// #include <map>
// #include <set>
// #include <functional>
// #include <iomanip>
// #include <limits>
#include <bits/stdc++.h>
using namespace std;
typedef long long ll; // 10^18
typedef unsigned long ul;
using Graph = vector<vector<ll>>;
typedef map<ll, ll> m;
typedef multimap<ll, ll> mm;
typedef set<ll> s;
typedef multiset<ll> ms;
typedef priority_queue<ll> pq;
typedef queue<ll> q;
typedef deque<ll> dq;
typedef list<ll> lst;
typedef pair<ll, ll> p;
#define EPS (1e-7)
#define INF (1e9)
#define PI (acos(-1))
#define MOD 1000000007LL
#define WALL '#'
//#define and &&a
//#define or ||
//#define not !
//#define neq !=
//#define eq ==
#define REP(i, n) for (ll i = 0; i < n; i++) // from 0 to n
#define REPR(i, n) for (ll i = n; i >= 0; i--) // from n to 0
#define FOR(i, m, n) for (ll i = m; i < n; i++) // from m to n
#define FORR(i, m, n) for (ll i = m; i >= n; i--) // from m to n
#define DBG(a) cout << #a << " : " << a << "\n";
#define MSG(a) cout << a << "\n";
#define ALL(v) v.begin(), v.end()
#define SZ(x) ((int)(x).size())
#define PNT(a) printf("%lld", (a))
#define pb push_back //配列などの最後に要素を追加
#define mp make_pair
#define lb lower_bound
#define ub upper_bound
#define FST first
#define SND second
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
// グローバル変数宣言
// 迷路用
vector<ll> dy = {0, 0, -1, 1, 0};
vector<ll> dx = {-1, 1, 0, 0, 0};
//
vector<ll> factorial = {};
vector<ll> factorialInverse = {};
// swap(a, b);
// sort(arr, arr + n); //昇順
// sort(arr, arr+n, greater<int>()); //降順
// max(a, b);
// min(a, b);
// upper_bound(a, a+n, k)
// //配列aの中で、kより大きい値が初めて現れる位置へのポインタ upper_bound(ALL(v),
// k) //STLvの中で、kより大きい値が初めて現れる位置へのポインタ lower_bound(a,
// a+n, k) lower_bound(ALL(v), k)
// //STLvの中で、kの以上値が初めて現れる位置へのポインタ lower_bound(ALL(v),k) -
// upper_bound(ALL(v),k) //二分探索を用いて、ある列aに含まれる数kの個数を求める
// n個のデータをvectorで取得
vector<ll> INV(ll n) {
vector<ll> v(n);
REP(i, n)
cin >> v[i];
return v;
}
// n個のデータをvectorで取得
vector<vector<ll>> INV2(ll n, ll m) {
vector<vector<ll>> v(n, vector<ll>(m));
REP(i, n) {
REP(j, m) { cin >> v[i][j]; }
}
return v;
}
// index が条件を満たすかどうか
bool isOK(vector<ll> &v, int index, int key) {
if (v[index] >= key)
return true;
else
return false;
}
// 汎用的な二分探索
// sort
ll bs(vector<ll> &v, ll key) {
int ng = -1; //「index = 0」が条件を満たすこともあるので、初期値は -1
int ok =
SZ(v); // 「index = a.size()-1」が条件を満たさないこともあるので、初期値は
// a.size()
/* ok と ng のどちらが大きいかわからないことを考慮 */
while (abs(ok - ng) > 1) {
int mid = (ok + ng) / 2;
if (isOK(v, mid, key))
ok = mid;
else
ng = mid;
}
return ok;
}
// 最大公約数
ll gcd(ll a, ll b) {
if (a < b)
swap(a, b);
ll r = a % b;
while (r != 0) {
a = b;
b = r;
r = a % b;
}
return b;
}
// 最小公倍数
void lcm(ll a, ll b) {}
// 素数判定
bool is_prime(ll n) {
bool flg = true;
if (n <= 1)
flg = false;
else if (n == 2)
flg = true;
else if (n % 2 == 0)
flg = false;
else {
for (ll i = 3; i * i <= n; i += 2) {
if (n % i == 0)
flg = false;
}
}
return flg;
}
// 素因数分解
// iで割った回数をcnt_pf[i - 1]に格納している
// cnt_pf[0]に入力が素数だった場合にその素数が入る
vector<ll> prime_factorization(ll n) {
vector<ll> cnt_pf(sqrt(n), 0);
FOR(i, 1, SZ(cnt_pf)) {
while (n % (i + 1) == 0) {
cnt_pf[i]++;
n /= (i + 1);
}
if (n == 1)
break;
}
if (n != 1) {
cnt_pf[0] = n;
}
return cnt_pf;
}
// 迷路のマップ情報をベクトル化する
// 通れるところを0に、壁を-1にする
// スタート地点からの距離を格納するときなどに使う
vector<vector<ll>> map_vec(vector<string> &str) {
// SZ(str[0] = SZ(str[distance(str.begin(), max_element(ALL(str)))])
vector<vector<ll>> v(
SZ(str), vector<ll>(SZ(str[distance(str.begin(), max_element(ALL(str)))]),
(int)INF));
REP(i, SZ(str)) {
REP(j, SZ(str[i])) {
if (str[i][j] == WALL)
v[i][j] = -1;
// else v[i][j] = INF; // if (str[i][j] == '.')
}
}
return v;
}
// str中のWALL='#'の数を数える
ll cnt_wall(vector<string> str) {
ll cnt = 0;
REP(i, SZ(str)) {
REP(j, SZ(str[i])) {
if (str[i][j] == WALL)
cnt++;
}
}
return cnt;
}
// 迷路用幅優先探索
// フィールドの広さと壁の位置を受け取り、ゴールへの最短距離を返す
ll bfs_maze(vector<string> &str, ll s_y, ll s_x, ll g_y, ll g_x) {
struct Corr {
ll y;
ll x;
ll depth;
};
queue<Corr> que;
// SZ(str[0] = SZ(str[distance(str.begin(), max_element(ALL(str)))])
vector<vector<ll>> v(
SZ(str),
vector<ll>(SZ(str[distance(str.begin(), max_element(ALL(str)))])));
v = map_vec(str);
// スタート地点を含めるのか
que.push({s_y, s_x, 0});
while (!que.empty()) {
Corr now = que.front();
que.pop();
if (now.y == g_y && now.x == g_x)
break;
REP(i, 4) {
Corr next = {now.y + dy[i], now.x + dx[i], now.depth + 1};
// SZ(v[0] = SZ(v[distance(v.begin(), max_element(ALL(v)))])
if (0 <= (int)next.y && (int)next.y < SZ(v) && 0 <= (int)next.x &&
(int)next.x < SZ(v[distance(v.begin(), max_element(ALL(v)))]) &&
v[(int)next.y][(int)next.x] == INF) {
v[(int)next.y][(int)next.x] = next.depth;
que.push(next);
}
}
}
return v[(int)g_y][(int)g_x];
}
// 累積和
vector<ll> cumulative_sum(vector<ll> a) {
vector<ll> v(SZ(a) + 1);
v[0] = 0;
REP(i, SZ(a)) { v[i + 1] = v[i] + a[i]; }
return v;
}
// 繰り返し二乗法 a^n
ll iterativePower(ll a, ll n) {
ll res = 1;
while (n > 0) {
if (n & 1)
res = (res * a) % MOD;
a = a * a % MOD;
n >>= 1;
}
return res;
}
// MODの逆元
vector<ll> MODInverse(ll n, ll factN) {
vector<ll> res(n + 1);
res[n] = iterativePower(factN, MOD - 2);
REPR(i, n - 1) { res[i] = res[i + 1] * (i + 1) % MOD; }
return res;
}
// 階乗
void factorialFunc(ll n) {
factorial.pb(1);
FOR(i, 1, n + 1) { factorial.pb(factorial[i - 1] * i % MOD); }
vector<ll> fact;
fact = MODInverse(n, factorial[n]);
REP(i, n + 1) { factorialInverse.pb(fact[i]); }
}
// 二項係数nCr
ll comb(ll n, ll r) {
if (n < r)
return 0;
// ll fact = factorial(n);
// vector<ll> fact_inv;
// fact_inv = MODInverse(n, fact);
return (factorial[n] * factorialInverse[r]) % MOD * factorialInverse[n - r] %
MOD;
}
// 文字列を連続した文字ごとに分解
vector<pair<char, ll>> decompose_str(string s) {
vector<pair<char, ll>> moji_cnt;
moji_cnt.pb(mp(s[0], 0));
REP(i, SZ(s)) {
if (moji_cnt.back().first == s[i]) {
moji_cnt.back().second++;
} else {
moji_cnt.pb(mp(s[i], 1));
}
}
return moji_cnt;
}
// 解答のベクトル出力(空白区切り)
void ans_vec(vector<ll> ans) {
REP(i, SZ(ans)) { cout << ans[i] << " "; }
cout << endl;
}
//
void dinamic_programming(void) {}
// 総和の公式：Σk
ll totalSumFirst(ll x, ll y) {
x = x - 1;
return (y * (y + 1) - x * (x + 1)) / 2;
}
// 総和の公式：Σk^2
ll totalSumSecond(ll x, ll y) {
x = x - 1;
return (y * (y + 1) * (2 * y + 1) - x * (x + 1) * (2 * x + 1)) / 6;
}
// 総和の公式：Σk^3
ll totalSumThird(ll x, ll y) { return pow(totalSumFirst(x, y), 2); }
// 約数
vector<ll> makeDivisors(ll n) {
vector<ll> divisors;
for (ll i = 1; i * i <= n; i++) {
if (n % i == 0) {
divisors.pb(i);
if (i != n / i) {
divisors.pb(n / i);
}
}
}
sort(ALL(divisors));
return divisors;
}
// 尺取り法
ll shakutori(vector<ll> &v, ll x) {
ll res = 0;
ll n = SZ(v);
ll sum = 0;
ll right = 0;
REP(left, n) {
while (right < n && sum + v[right] <= x) {
sum += v[right];
right++;
}
res += (right - left);
if (right == left)
right++;
else
sum -= v[left];
}
return res;
}
// 深さ優先探索
void dfs(const Graph &g, ll x) {}
// 幅優先探索
void bfs() {}
// bit全探索
void bitFullSearch(ll n) {
REP(bit, 1 << n) {
vector<ll> vec;
REP(i, n) {
if (bit >> i & 1) {
vec.pb(i);
}
}
}
}
//
// main関数
//
signed main() {
// cin.tie(0);
// ios::sync_with_stdio(false);
// 変数（scala）取得
ll n, a, b, c, d;
cin >> n >> a >> b >> c >> d;
// 変数（vector）取得
// vector<ll> a(n);
// a = INV(n);
////m=2;
// vector<vector<ll>> vec(n, vector<ll>(m));
// vec = INV2(n, m);
// vector<vector<ll>> a(3);
// REP(i, a)
// {
// ll tmp;
// cin >> tmp;
// a[0].pb(tmp);
// }
// REP(i, b)
// {
// ll tmp;
// cin >> tmp;
// a[1].pb(tmp);
// }
// REP(i, c)
// {
// ll tmp;
// cin >> tmp;
// a[2].pb(tmp);
// }
// 文字列取得
string s;
cin >> s;
// 文字列（vector）取得
// vector<string> str(n);
// REP(i, n)
// {
// cin >> str[i];
// }
// グラフ取得
// Graph g(n);
// REP(i, k) {
// ll from, weight;
// cin >> from >> weight;
// g[from].pb(to);
// //g[to].pb(from);
//}
// 迷路用string取得
// vector<string> str(h);
// REP(i, h) {
// cin >> str[i];
//}
// 二項係数を計算する際に必要
// factorialFunc(n);
//
// 実装部分
//
string ans = "Yes";
a--;
b--;
c--;
d--;
FOR(i, a + 1, c) {
if (s[i] == '#' && s[i + 1] == '#') {
ans = "No";
}
}
FOR(i, b + 1, d) {
if (s[i] == '#' && s[i + 1] == '#') {
ans = "No";
}
}
if (c > d) {
ans = "No";
FOR(i, b - 1, d - 1) {
if (s[i] == '.' && s[i + 1] == '.' && s[i + 2] == '.') {
ans = "Yes";
}
}
}
//
// 実装部分おわり
//
// 解答出力
// cout << fixed << setprecision(10);
MSG(ans);
// ans_vec(ans);
return 0;
}
//
// memo
//
// for(ll i=0; i<n;i++) // ループ
// cout << << endl; // 出力
// sort(ALL(a), greater<ll>()); // 降順
// abs(k) // 絶対値
// sqrt(n) // ルート
// ceil(n) // 切り上げ
// floor(n) // 切り捨て
// round(n) // 四捨五入
// map<ll, ll, greater<ll>> mp; // mapの降順
| // #include <iostream>
// #include <cstdio>
// #include <cstdlib>
// #include <cstring>
// #include <algorithm>
// #include <string>
// #include <sstream>
// #include <complex>
// #include <vector>
// #include <list>
// #include <queue>
// #include <deque>
// #include <stack>
// #include <map>
// #include <set>
// #include <functional>
// #include <iomanip>
// #include <limits>
#include <bits/stdc++.h>
using namespace std;
typedef long long ll; // 10^18
typedef unsigned long ul;
using Graph = vector<vector<ll>>;
typedef map<ll, ll> m;
typedef multimap<ll, ll> mm;
typedef set<ll> s;
typedef multiset<ll> ms;
typedef priority_queue<ll> pq;
typedef queue<ll> q;
typedef deque<ll> dq;
typedef list<ll> lst;
typedef pair<ll, ll> p;
#define EPS (1e-7)
#define INF (1e9)
#define PI (acos(-1))
#define MOD 1000000007LL
#define WALL '#'
//#define and &&a
//#define or ||
//#define not !
//#define neq !=
//#define eq ==
#define REP(i, n) for (ll i = 0; i < n; i++) // from 0 to n
#define REPR(i, n) for (ll i = n; i >= 0; i--) // from n to 0
#define FOR(i, m, n) for (ll i = m; i < n; i++) // from m to n
#define FORR(i, m, n) for (ll i = m; i >= n; i--) // from m to n
#define DBG(a) cout << #a << " : " << a << "\n";
#define MSG(a) cout << a << "\n";
#define ALL(v) v.begin(), v.end()
#define SZ(x) ((int)(x).size())
#define PNT(a) printf("%lld", (a))
#define pb push_back //配列などの最後に要素を追加
#define mp make_pair
#define lb lower_bound
#define ub upper_bound
#define FST first
#define SND second
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
// グローバル変数宣言
// 迷路用
vector<ll> dy = {0, 0, -1, 1, 0};
vector<ll> dx = {-1, 1, 0, 0, 0};
//
vector<ll> factorial = {};
vector<ll> factorialInverse = {};
// swap(a, b);
// sort(arr, arr + n); //昇順
// sort(arr, arr+n, greater<int>()); //降順
// max(a, b);
// min(a, b);
// upper_bound(a, a+n, k)
// //配列aの中で、kより大きい値が初めて現れる位置へのポインタ upper_bound(ALL(v),
// k) //STLvの中で、kより大きい値が初めて現れる位置へのポインタ lower_bound(a,
// a+n, k) lower_bound(ALL(v), k)
// //STLvの中で、kの以上値が初めて現れる位置へのポインタ lower_bound(ALL(v),k) -
// upper_bound(ALL(v),k) //二分探索を用いて、ある列aに含まれる数kの個数を求める
// n個のデータをvectorで取得
vector<ll> INV(ll n) {
vector<ll> v(n);
REP(i, n)
cin >> v[i];
return v;
}
// n個のデータをvectorで取得
vector<vector<ll>> INV2(ll n, ll m) {
vector<vector<ll>> v(n, vector<ll>(m));
REP(i, n) {
REP(j, m) { cin >> v[i][j]; }
}
return v;
}
// index が条件を満たすかどうか
bool isOK(vector<ll> &v, int index, int key) {
if (v[index] >= key)
return true;
else
return false;
}
// 汎用的な二分探索
// sort
ll bs(vector<ll> &v, ll key) {
int ng = -1; //「index = 0」が条件を満たすこともあるので、初期値は -1
int ok =
SZ(v); // 「index = a.size()-1」が条件を満たさないこともあるので、初期値は
// a.size()
/* ok と ng のどちらが大きいかわからないことを考慮 */
while (abs(ok - ng) > 1) {
int mid = (ok + ng) / 2;
if (isOK(v, mid, key))
ok = mid;
else
ng = mid;
}
return ok;
}
// 最大公約数
ll gcd(ll a, ll b) {
if (a < b)
swap(a, b);
ll r = a % b;
while (r != 0) {
a = b;
b = r;
r = a % b;
}
return b;
}
// 最小公倍数
void lcm(ll a, ll b) {}
// 素数判定
bool is_prime(ll n) {
bool flg = true;
if (n <= 1)
flg = false;
else if (n == 2)
flg = true;
else if (n % 2 == 0)
flg = false;
else {
for (ll i = 3; i * i <= n; i += 2) {
if (n % i == 0)
flg = false;
}
}
return flg;
}
// 素因数分解
// iで割った回数をcnt_pf[i - 1]に格納している
// cnt_pf[0]に入力が素数だった場合にその素数が入る
vector<ll> prime_factorization(ll n) {
vector<ll> cnt_pf(sqrt(n), 0);
FOR(i, 1, SZ(cnt_pf)) {
while (n % (i + 1) == 0) {
cnt_pf[i]++;
n /= (i + 1);
}
if (n == 1)
break;
}
if (n != 1) {
cnt_pf[0] = n;
}
return cnt_pf;
}
// 迷路のマップ情報をベクトル化する
// 通れるところを0に、壁を-1にする
// スタート地点からの距離を格納するときなどに使う
vector<vector<ll>> map_vec(vector<string> &str) {
// SZ(str[0] = SZ(str[distance(str.begin(), max_element(ALL(str)))])
vector<vector<ll>> v(
SZ(str), vector<ll>(SZ(str[distance(str.begin(), max_element(ALL(str)))]),
(int)INF));
REP(i, SZ(str)) {
REP(j, SZ(str[i])) {
if (str[i][j] == WALL)
v[i][j] = -1;
// else v[i][j] = INF; // if (str[i][j] == '.')
}
}
return v;
}
// str中のWALL='#'の数を数える
ll cnt_wall(vector<string> str) {
ll cnt = 0;
REP(i, SZ(str)) {
REP(j, SZ(str[i])) {
if (str[i][j] == WALL)
cnt++;
}
}
return cnt;
}
// 迷路用幅優先探索
// フィールドの広さと壁の位置を受け取り、ゴールへの最短距離を返す
ll bfs_maze(vector<string> &str, ll s_y, ll s_x, ll g_y, ll g_x) {
struct Corr {
ll y;
ll x;
ll depth;
};
queue<Corr> que;
// SZ(str[0] = SZ(str[distance(str.begin(), max_element(ALL(str)))])
vector<vector<ll>> v(
SZ(str),
vector<ll>(SZ(str[distance(str.begin(), max_element(ALL(str)))])));
v = map_vec(str);
// スタート地点を含めるのか
que.push({s_y, s_x, 0});
while (!que.empty()) {
Corr now = que.front();
que.pop();
if (now.y == g_y && now.x == g_x)
break;
REP(i, 4) {
Corr next = {now.y + dy[i], now.x + dx[i], now.depth + 1};
// SZ(v[0] = SZ(v[distance(v.begin(), max_element(ALL(v)))])
if (0 <= (int)next.y && (int)next.y < SZ(v) && 0 <= (int)next.x &&
(int)next.x < SZ(v[distance(v.begin(), max_element(ALL(v)))]) &&
v[(int)next.y][(int)next.x] == INF) {
v[(int)next.y][(int)next.x] = next.depth;
que.push(next);
}
}
}
return v[(int)g_y][(int)g_x];
}
// 累積和
vector<ll> cumulative_sum(vector<ll> a) {
vector<ll> v(SZ(a) + 1);
v[0] = 0;
REP(i, SZ(a)) { v[i + 1] = v[i] + a[i]; }
return v;
}
// 繰り返し二乗法 a^n
ll iterativePower(ll a, ll n) {
ll res = 1;
while (n > 0) {
if (n & 1)
res = (res * a) % MOD;
a = a * a % MOD;
n >>= 1;
}
return res;
}
// MODの逆元
vector<ll> MODInverse(ll n, ll factN) {
vector<ll> res(n + 1);
res[n] = iterativePower(factN, MOD - 2);
REPR(i, n - 1) { res[i] = res[i + 1] * (i + 1) % MOD; }
return res;
}
// 階乗
void factorialFunc(ll n) {
factorial.pb(1);
FOR(i, 1, n + 1) { factorial.pb(factorial[i - 1] * i % MOD); }
vector<ll> fact;
fact = MODInverse(n, factorial[n]);
REP(i, n + 1) { factorialInverse.pb(fact[i]); }
}
// 二項係数nCr
ll comb(ll n, ll r) {
if (n < r)
return 0;
// ll fact = factorial(n);
// vector<ll> fact_inv;
// fact_inv = MODInverse(n, fact);
return (factorial[n] * factorialInverse[r]) % MOD * factorialInverse[n - r] %
MOD;
}
// 文字列を連続した文字ごとに分解
vector<pair<char, ll>> decompose_str(string s) {
vector<pair<char, ll>> moji_cnt;
moji_cnt.pb(mp(s[0], 0));
REP(i, SZ(s)) {
if (moji_cnt.back().first == s[i]) {
moji_cnt.back().second++;
} else {
moji_cnt.pb(mp(s[i], 1));
}
}
return moji_cnt;
}
// 解答のベクトル出力(空白区切り)
void ans_vec(vector<ll> ans) {
REP(i, SZ(ans)) { cout << ans[i] << " "; }
cout << endl;
}
//
void dinamic_programming(void) {}
// 総和の公式：Σk
ll totalSumFirst(ll x, ll y) {
x = x - 1;
return (y * (y + 1) - x * (x + 1)) / 2;
}
// 総和の公式：Σk^2
ll totalSumSecond(ll x, ll y) {
x = x - 1;
return (y * (y + 1) * (2 * y + 1) - x * (x + 1) * (2 * x + 1)) / 6;
}
// 総和の公式：Σk^3
ll totalSumThird(ll x, ll y) { return pow(totalSumFirst(x, y), 2); }
// 約数
vector<ll> makeDivisors(ll n) {
vector<ll> divisors;
for (ll i = 1; i * i <= n; i++) {
if (n % i == 0) {
divisors.pb(i);
if (i != n / i) {
divisors.pb(n / i);
}
}
}
sort(ALL(divisors));
return divisors;
}
// 尺取り法
ll shakutori(vector<ll> &v, ll x) {
ll res = 0;
ll n = SZ(v);
ll sum = 0;
ll right = 0;
REP(left, n) {
while (right < n && sum + v[right] <= x) {
sum += v[right];
right++;
}
res += (right - left);
if (right == left)
right++;
else
sum -= v[left];
}
return res;
}
// 深さ優先探索
void dfs(const Graph &g, ll x) {}
// 幅優先探索
void bfs() {}
// bit全探索
void bitFullSearch(ll n) {
REP(bit, 1 << n) {
vector<ll> vec;
REP(i, n) {
if (bit >> i & 1) {
vec.pb(i);
}
}
}
}
//
// main関数
//
signed main() {
// cin.tie(0);
// ios::sync_with_stdio(false);
// 変数（scala）取得
ll n, a, b, c, d;
cin >> n >> a >> b >> c >> d;
// 変数（vector）取得
// vector<ll> a(n);
// a = INV(n);
////m=2;
// vector<vector<ll>> vec(n, vector<ll>(m));
// vec = INV2(n, m);
// vector<vector<ll>> a(3);
// REP(i, a)
// {
// ll tmp;
// cin >> tmp;
// a[0].pb(tmp);
// }
// REP(i, b)
// {
// ll tmp;
// cin >> tmp;
// a[1].pb(tmp);
// }
// REP(i, c)
// {
// ll tmp;
// cin >> tmp;
// a[2].pb(tmp);
// }
// 文字列取得
string s;
cin >> s;
// 文字列（vector）取得
// vector<string> str(n);
// REP(i, n)
// {
// cin >> str[i];
// }
// グラフ取得
// Graph g(n);
// REP(i, k) {
// ll from, weight;
// cin >> from >> weight;
// g[from].pb(to);
// //g[to].pb(from);
//}
// 迷路用string取得
// vector<string> str(h);
// REP(i, h) {
// cin >> str[i];
//}
// 二項係数を計算する際に必要
// factorialFunc(n);
//
// 実装部分
//
string ans = "Yes";
a--;
b--;
c--;
d--;
FOR(i, a + 1, c) {
if (s[i] == '#' && s[i + 1] == '#') {
ans = "No";
}
}
FOR(i, b + 1, d) {
if (s[i] == '#' && s[i + 1] == '#') {
ans = "No";
}
}
if (c > d) {
ans = "No";
FOR(i, b - 1, d) {
if (s[i] == '.' && s[i + 1] == '.' && s[i + 2] == '.') {
ans = "Yes";
}
}
}
//
// 実装部分おわり
//
// 解答出力
// cout << fixed << setprecision(10);
MSG(ans);
// ans_vec(ans);
return 0;
}
//
// memo
//
// for(ll i=0; i<n;i++) // ループ
// cout << << endl; // 出力
// sort(ALL(a), greater<ll>()); // 降順
// abs(k) // 絶対値
// sqrt(n) // ルート
// ceil(n) // 切り上げ
// floor(n) // 切り捨て
// round(n) // 四捨五入
// map<ll, ll, greater<ll>> mp; // mapの降順
| [
"expression.operation.binary.remove"
] | 829,810 | 829,811 | u337845373 | cpp |
p03017 | // #include <iostream>
// #include <cstdio>
// #include <cstdlib>
// #include <cstring>
// #include <algorithm>
// #include <string>
// #include <sstream>
// #include <complex>
// #include <vector>
// #include <list>
// #include <queue>
// #include <deque>
// #include <stack>
// #include <map>
// #include <set>
// #include <functional>
// #include <iomanip>
// #include <limits>
#include <bits/stdc++.h>
using namespace std;
typedef long long ll; // 10^18
typedef unsigned long ul;
using Graph = vector<vector<ll>>;
typedef map<ll, ll> m;
typedef multimap<ll, ll> mm;
typedef set<ll> s;
typedef multiset<ll> ms;
typedef priority_queue<ll> pq;
typedef queue<ll> q;
typedef deque<ll> dq;
typedef list<ll> lst;
typedef pair<ll, ll> p;
#define EPS (1e-7)
#define INF (1e9)
#define PI (acos(-1))
#define MOD 1000000007LL
#define WALL '#'
//#define and &&a
//#define or ||
//#define not !
//#define neq !=
//#define eq ==
#define REP(i, n) for (ll i = 0; i < n; i++) // from 0 to n
#define REPR(i, n) for (ll i = n; i >= 0; i--) // from n to 0
#define FOR(i, m, n) for (ll i = m; i < n; i++) // from m to n
#define FORR(i, m, n) for (ll i = m; i >= n; i--) // from m to n
#define DBG(a) cout << #a << " : " << a << "\n";
#define MSG(a) cout << a << "\n";
#define ALL(v) v.begin(), v.end()
#define SZ(x) ((int)(x).size())
#define PNT(a) printf("%lld", (a))
#define pb push_back //配列などの最後に要素を追加
#define mp make_pair
#define lb lower_bound
#define ub upper_bound
#define FST first
#define SND second
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
// グローバル変数宣言
// 迷路用
vector<ll> dy = {0, 0, -1, 1, 0};
vector<ll> dx = {-1, 1, 0, 0, 0};
//
vector<ll> factorial = {};
vector<ll> factorialInverse = {};
// swap(a, b);
// sort(arr, arr + n); //昇順
// sort(arr, arr+n, greater<int>()); //降順
// max(a, b);
// min(a, b);
// upper_bound(a, a+n, k)
// //配列aの中で、kより大きい値が初めて現れる位置へのポインタ upper_bound(ALL(v),
// k) //STLvの中で、kより大きい値が初めて現れる位置へのポインタ lower_bound(a,
// a+n, k) lower_bound(ALL(v), k)
// //STLvの中で、kの以上値が初めて現れる位置へのポインタ lower_bound(ALL(v),k) -
// upper_bound(ALL(v),k) //二分探索を用いて、ある列aに含まれる数kの個数を求める
// n個のデータをvectorで取得
vector<ll> INV(ll n) {
vector<ll> v(n);
REP(i, n)
cin >> v[i];
return v;
}
// n個のデータをvectorで取得
vector<vector<ll>> INV2(ll n, ll m) {
vector<vector<ll>> v(n, vector<ll>(m));
REP(i, n) {
REP(j, m) { cin >> v[i][j]; }
}
return v;
}
// index が条件を満たすかどうか
bool isOK(vector<ll> &v, int index, int key) {
if (v[index] >= key)
return true;
else
return false;
}
// 汎用的な二分探索
// sort
ll bs(vector<ll> &v, ll key) {
int ng = -1; //「index = 0」が条件を満たすこともあるので、初期値は -1
int ok =
SZ(v); // 「index = a.size()-1」が条件を満たさないこともあるので、初期値は
// a.size()
/* ok と ng のどちらが大きいかわからないことを考慮 */
while (abs(ok - ng) > 1) {
int mid = (ok + ng) / 2;
if (isOK(v, mid, key))
ok = mid;
else
ng = mid;
}
return ok;
}
// 最大公約数
ll gcd(ll a, ll b) {
if (a < b)
swap(a, b);
ll r = a % b;
while (r != 0) {
a = b;
b = r;
r = a % b;
}
return b;
}
// 最小公倍数
void lcm(ll a, ll b) {}
// 素数判定
bool is_prime(ll n) {
bool flg = true;
if (n <= 1)
flg = false;
else if (n == 2)
flg = true;
else if (n % 2 == 0)
flg = false;
else {
for (ll i = 3; i * i <= n; i += 2) {
if (n % i == 0)
flg = false;
}
}
return flg;
}
// 素因数分解
// iで割った回数をcnt_pf[i - 1]に格納している
// cnt_pf[0]に入力が素数だった場合にその素数が入る
vector<ll> prime_factorization(ll n) {
vector<ll> cnt_pf(sqrt(n), 0);
FOR(i, 1, SZ(cnt_pf)) {
while (n % (i + 1) == 0) {
cnt_pf[i]++;
n /= (i + 1);
}
if (n == 1)
break;
}
if (n != 1) {
cnt_pf[0] = n;
}
return cnt_pf;
}
// 迷路のマップ情報をベクトル化する
// 通れるところを0に、壁を-1にする
// スタート地点からの距離を格納するときなどに使う
vector<vector<ll>> map_vec(vector<string> &str) {
// SZ(str[0] = SZ(str[distance(str.begin(), max_element(ALL(str)))])
vector<vector<ll>> v(
SZ(str), vector<ll>(SZ(str[distance(str.begin(), max_element(ALL(str)))]),
(int)INF));
REP(i, SZ(str)) {
REP(j, SZ(str[i])) {
if (str[i][j] == WALL)
v[i][j] = -1;
// else v[i][j] = INF; // if (str[i][j] == '.')
}
}
return v;
}
// str中のWALL='#'の数を数える
ll cnt_wall(vector<string> str) {
ll cnt = 0;
REP(i, SZ(str)) {
REP(j, SZ(str[i])) {
if (str[i][j] == WALL)
cnt++;
}
}
return cnt;
}
// 迷路用幅優先探索
// フィールドの広さと壁の位置を受け取り、ゴールへの最短距離を返す
ll bfs_maze(vector<string> &str, ll s_y, ll s_x, ll g_y, ll g_x) {
struct Corr {
ll y;
ll x;
ll depth;
};
queue<Corr> que;
// SZ(str[0] = SZ(str[distance(str.begin(), max_element(ALL(str)))])
vector<vector<ll>> v(
SZ(str),
vector<ll>(SZ(str[distance(str.begin(), max_element(ALL(str)))])));
v = map_vec(str);
// スタート地点を含めるのか
que.push({s_y, s_x, 0});
while (!que.empty()) {
Corr now = que.front();
que.pop();
if (now.y == g_y && now.x == g_x)
break;
REP(i, 4) {
Corr next = {now.y + dy[i], now.x + dx[i], now.depth + 1};
// SZ(v[0] = SZ(v[distance(v.begin(), max_element(ALL(v)))])
if (0 <= (int)next.y && (int)next.y < SZ(v) && 0 <= (int)next.x &&
(int)next.x < SZ(v[distance(v.begin(), max_element(ALL(v)))]) &&
v[(int)next.y][(int)next.x] == INF) {
v[(int)next.y][(int)next.x] = next.depth;
que.push(next);
}
}
}
return v[(int)g_y][(int)g_x];
}
// 累積和
vector<ll> cumulative_sum(vector<ll> a) {
vector<ll> v(SZ(a) + 1);
v[0] = 0;
REP(i, SZ(a)) { v[i + 1] = v[i] + a[i]; }
return v;
}
// 繰り返し二乗法 a^n
ll iterativePower(ll a, ll n) {
ll res = 1;
while (n > 0) {
if (n & 1)
res = (res * a) % MOD;
a = a * a % MOD;
n >>= 1;
}
return res;
}
// MODの逆元
vector<ll> MODInverse(ll n, ll factN) {
vector<ll> res(n + 1);
res[n] = iterativePower(factN, MOD - 2);
REPR(i, n - 1) { res[i] = res[i + 1] * (i + 1) % MOD; }
return res;
}
// 階乗
void factorialFunc(ll n) {
factorial.pb(1);
FOR(i, 1, n + 1) { factorial.pb(factorial[i - 1] * i % MOD); }
vector<ll> fact;
fact = MODInverse(n, factorial[n]);
REP(i, n + 1) { factorialInverse.pb(fact[i]); }
}
// 二項係数nCr
ll comb(ll n, ll r) {
if (n < r)
return 0;
// ll fact = factorial(n);
// vector<ll> fact_inv;
// fact_inv = MODInverse(n, fact);
return (factorial[n] * factorialInverse[r]) % MOD * factorialInverse[n - r] %
MOD;
}
// 文字列を連続した文字ごとに分解
vector<pair<char, ll>> decompose_str(string s) {
vector<pair<char, ll>> moji_cnt;
moji_cnt.pb(mp(s[0], 0));
REP(i, SZ(s)) {
if (moji_cnt.back().first == s[i]) {
moji_cnt.back().second++;
} else {
moji_cnt.pb(mp(s[i], 1));
}
}
return moji_cnt;
}
// 解答のベクトル出力(空白区切り)
void ans_vec(vector<ll> ans) {
REP(i, SZ(ans)) { cout << ans[i] << " "; }
cout << endl;
}
//
void dinamic_programming(void) {}
// 総和の公式：Σk
ll totalSumFirst(ll x, ll y) {
x = x - 1;
return (y * (y + 1) - x * (x + 1)) / 2;
}
// 総和の公式：Σk^2
ll totalSumSecond(ll x, ll y) {
x = x - 1;
return (y * (y + 1) * (2 * y + 1) - x * (x + 1) * (2 * x + 1)) / 6;
}
// 総和の公式：Σk^3
ll totalSumThird(ll x, ll y) { return pow(totalSumFirst(x, y), 2); }
// 約数
vector<ll> makeDivisors(ll n) {
vector<ll> divisors;
for (ll i = 1; i * i <= n; i++) {
if (n % i == 0) {
divisors.pb(i);
if (i != n / i) {
divisors.pb(n / i);
}
}
}
sort(ALL(divisors));
return divisors;
}
// 尺取り法
ll shakutori(vector<ll> &v, ll x) {
ll res = 0;
ll n = SZ(v);
ll sum = 0;
ll right = 0;
REP(left, n) {
while (right < n && sum + v[right] <= x) {
sum += v[right];
right++;
}
res += (right - left);
if (right == left)
right++;
else
sum -= v[left];
}
return res;
}
// 深さ優先探索
void dfs(const Graph &g, ll x) {}
// 幅優先探索
void bfs() {}
// bit全探索
void bitFullSearch(ll n) {
REP(bit, 1 << n) {
vector<ll> vec;
REP(i, n) {
if (bit >> i & 1) {
vec.pb(i);
}
}
}
}
//
// main関数
//
signed main() {
// cin.tie(0);
// ios::sync_with_stdio(false);
// 変数（scala）取得
ll n, a, b, c, d;
cin >> n >> a >> b >> c >> d;
// 変数（vector）取得
// vector<ll> a(n);
// a = INV(n);
////m=2;
// vector<vector<ll>> vec(n, vector<ll>(m));
// vec = INV2(n, m);
// vector<vector<ll>> a(3);
// REP(i, a)
// {
// ll tmp;
// cin >> tmp;
// a[0].pb(tmp);
// }
// REP(i, b)
// {
// ll tmp;
// cin >> tmp;
// a[1].pb(tmp);
// }
// REP(i, c)
// {
// ll tmp;
// cin >> tmp;
// a[2].pb(tmp);
// }
// 文字列取得
string s;
cin >> s;
// 文字列（vector）取得
// vector<string> str(n);
// REP(i, n)
// {
// cin >> str[i];
// }
// グラフ取得
// Graph g(n);
// REP(i, k) {
// ll from, weight;
// cin >> from >> weight;
// g[from].pb(to);
// //g[to].pb(from);
//}
// 迷路用string取得
// vector<string> str(h);
// REP(i, h) {
// cin >> str[i];
//}
// 二項係数を計算する際に必要
// factorialFunc(n);
//
// 実装部分
//
string ans = "Yes";
a--;
b--;
c--;
d--;
FOR(i, a + 1, c) {
if (s[i] == '#' && s[i + 1] == '#') {
ans = "No";
}
}
FOR(i, b + 1, d) {
if (s[i] == '#' && s[i + 1] == '#') {
ans = "No";
}
}
if (c > d) {
ans = "No";
FOR(i, b + 1, d - 1) {
if (s[i] == '.' && s[i + 1] == '.' && s[i + 2] == '.') {
ans = "Yes";
}
}
}
//
// 実装部分おわり
//
// 解答出力
// cout << fixed << setprecision(10);
MSG(ans);
// ans_vec(ans);
return 0;
}
//
// memo
//
// for(ll i=0; i<n;i++) // ループ
// cout << << endl; // 出力
// sort(ALL(a), greater<ll>()); // 降順
// abs(k) // 絶対値
// sqrt(n) // ルート
// ceil(n) // 切り上げ
// floor(n) // 切り捨て
// round(n) // 四捨五入
// map<ll, ll, greater<ll>> mp; // mapの降順
| // #include <iostream>
// #include <cstdio>
// #include <cstdlib>
// #include <cstring>
// #include <algorithm>
// #include <string>
// #include <sstream>
// #include <complex>
// #include <vector>
// #include <list>
// #include <queue>
// #include <deque>
// #include <stack>
// #include <map>
// #include <set>
// #include <functional>
// #include <iomanip>
// #include <limits>
#include <bits/stdc++.h>
using namespace std;
typedef long long ll; // 10^18
typedef unsigned long ul;
using Graph = vector<vector<ll>>;
typedef map<ll, ll> m;
typedef multimap<ll, ll> mm;
typedef set<ll> s;
typedef multiset<ll> ms;
typedef priority_queue<ll> pq;
typedef queue<ll> q;
typedef deque<ll> dq;
typedef list<ll> lst;
typedef pair<ll, ll> p;
#define EPS (1e-7)
#define INF (1e9)
#define PI (acos(-1))
#define MOD 1000000007LL
#define WALL '#'
//#define and &&a
//#define or ||
//#define not !
//#define neq !=
//#define eq ==
#define REP(i, n) for (ll i = 0; i < n; i++) // from 0 to n
#define REPR(i, n) for (ll i = n; i >= 0; i--) // from n to 0
#define FOR(i, m, n) for (ll i = m; i < n; i++) // from m to n
#define FORR(i, m, n) for (ll i = m; i >= n; i--) // from m to n
#define DBG(a) cout << #a << " : " << a << "\n";
#define MSG(a) cout << a << "\n";
#define ALL(v) v.begin(), v.end()
#define SZ(x) ((int)(x).size())
#define PNT(a) printf("%lld", (a))
#define pb push_back //配列などの最後に要素を追加
#define mp make_pair
#define lb lower_bound
#define ub upper_bound
#define FST first
#define SND second
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
// グローバル変数宣言
// 迷路用
vector<ll> dy = {0, 0, -1, 1, 0};
vector<ll> dx = {-1, 1, 0, 0, 0};
//
vector<ll> factorial = {};
vector<ll> factorialInverse = {};
// swap(a, b);
// sort(arr, arr + n); //昇順
// sort(arr, arr+n, greater<int>()); //降順
// max(a, b);
// min(a, b);
// upper_bound(a, a+n, k)
// //配列aの中で、kより大きい値が初めて現れる位置へのポインタ upper_bound(ALL(v),
// k) //STLvの中で、kより大きい値が初めて現れる位置へのポインタ lower_bound(a,
// a+n, k) lower_bound(ALL(v), k)
// //STLvの中で、kの以上値が初めて現れる位置へのポインタ lower_bound(ALL(v),k) -
// upper_bound(ALL(v),k) //二分探索を用いて、ある列aに含まれる数kの個数を求める
// n個のデータをvectorで取得
vector<ll> INV(ll n) {
vector<ll> v(n);
REP(i, n)
cin >> v[i];
return v;
}
// n個のデータをvectorで取得
vector<vector<ll>> INV2(ll n, ll m) {
vector<vector<ll>> v(n, vector<ll>(m));
REP(i, n) {
REP(j, m) { cin >> v[i][j]; }
}
return v;
}
// index が条件を満たすかどうか
bool isOK(vector<ll> &v, int index, int key) {
if (v[index] >= key)
return true;
else
return false;
}
// 汎用的な二分探索
// sort
ll bs(vector<ll> &v, ll key) {
int ng = -1; //「index = 0」が条件を満たすこともあるので、初期値は -1
int ok =
SZ(v); // 「index = a.size()-1」が条件を満たさないこともあるので、初期値は
// a.size()
/* ok と ng のどちらが大きいかわからないことを考慮 */
while (abs(ok - ng) > 1) {
int mid = (ok + ng) / 2;
if (isOK(v, mid, key))
ok = mid;
else
ng = mid;
}
return ok;
}
// 最大公約数
ll gcd(ll a, ll b) {
if (a < b)
swap(a, b);
ll r = a % b;
while (r != 0) {
a = b;
b = r;
r = a % b;
}
return b;
}
// 最小公倍数
void lcm(ll a, ll b) {}
// 素数判定
bool is_prime(ll n) {
bool flg = true;
if (n <= 1)
flg = false;
else if (n == 2)
flg = true;
else if (n % 2 == 0)
flg = false;
else {
for (ll i = 3; i * i <= n; i += 2) {
if (n % i == 0)
flg = false;
}
}
return flg;
}
// 素因数分解
// iで割った回数をcnt_pf[i - 1]に格納している
// cnt_pf[0]に入力が素数だった場合にその素数が入る
vector<ll> prime_factorization(ll n) {
vector<ll> cnt_pf(sqrt(n), 0);
FOR(i, 1, SZ(cnt_pf)) {
while (n % (i + 1) == 0) {
cnt_pf[i]++;
n /= (i + 1);
}
if (n == 1)
break;
}
if (n != 1) {
cnt_pf[0] = n;
}
return cnt_pf;
}
// 迷路のマップ情報をベクトル化する
// 通れるところを0に、壁を-1にする
// スタート地点からの距離を格納するときなどに使う
vector<vector<ll>> map_vec(vector<string> &str) {
// SZ(str[0] = SZ(str[distance(str.begin(), max_element(ALL(str)))])
vector<vector<ll>> v(
SZ(str), vector<ll>(SZ(str[distance(str.begin(), max_element(ALL(str)))]),
(int)INF));
REP(i, SZ(str)) {
REP(j, SZ(str[i])) {
if (str[i][j] == WALL)
v[i][j] = -1;
// else v[i][j] = INF; // if (str[i][j] == '.')
}
}
return v;
}
// str中のWALL='#'の数を数える
ll cnt_wall(vector<string> str) {
ll cnt = 0;
REP(i, SZ(str)) {
REP(j, SZ(str[i])) {
if (str[i][j] == WALL)
cnt++;
}
}
return cnt;
}
// 迷路用幅優先探索
// フィールドの広さと壁の位置を受け取り、ゴールへの最短距離を返す
ll bfs_maze(vector<string> &str, ll s_y, ll s_x, ll g_y, ll g_x) {
struct Corr {
ll y;
ll x;
ll depth;
};
queue<Corr> que;
// SZ(str[0] = SZ(str[distance(str.begin(), max_element(ALL(str)))])
vector<vector<ll>> v(
SZ(str),
vector<ll>(SZ(str[distance(str.begin(), max_element(ALL(str)))])));
v = map_vec(str);
// スタート地点を含めるのか
que.push({s_y, s_x, 0});
while (!que.empty()) {
Corr now = que.front();
que.pop();
if (now.y == g_y && now.x == g_x)
break;
REP(i, 4) {
Corr next = {now.y + dy[i], now.x + dx[i], now.depth + 1};
// SZ(v[0] = SZ(v[distance(v.begin(), max_element(ALL(v)))])
if (0 <= (int)next.y && (int)next.y < SZ(v) && 0 <= (int)next.x &&
(int)next.x < SZ(v[distance(v.begin(), max_element(ALL(v)))]) &&
v[(int)next.y][(int)next.x] == INF) {
v[(int)next.y][(int)next.x] = next.depth;
que.push(next);
}
}
}
return v[(int)g_y][(int)g_x];
}
// 累積和
vector<ll> cumulative_sum(vector<ll> a) {
vector<ll> v(SZ(a) + 1);
v[0] = 0;
REP(i, SZ(a)) { v[i + 1] = v[i] + a[i]; }
return v;
}
// 繰り返し二乗法 a^n
ll iterativePower(ll a, ll n) {
ll res = 1;
while (n > 0) {
if (n & 1)
res = (res * a) % MOD;
a = a * a % MOD;
n >>= 1;
}
return res;
}
// MODの逆元
vector<ll> MODInverse(ll n, ll factN) {
vector<ll> res(n + 1);
res[n] = iterativePower(factN, MOD - 2);
REPR(i, n - 1) { res[i] = res[i + 1] * (i + 1) % MOD; }
return res;
}
// 階乗
void factorialFunc(ll n) {
factorial.pb(1);
FOR(i, 1, n + 1) { factorial.pb(factorial[i - 1] * i % MOD); }
vector<ll> fact;
fact = MODInverse(n, factorial[n]);
REP(i, n + 1) { factorialInverse.pb(fact[i]); }
}
// 二項係数nCr
ll comb(ll n, ll r) {
if (n < r)
return 0;
// ll fact = factorial(n);
// vector<ll> fact_inv;
// fact_inv = MODInverse(n, fact);
return (factorial[n] * factorialInverse[r]) % MOD * factorialInverse[n - r] %
MOD;
}
// 文字列を連続した文字ごとに分解
vector<pair<char, ll>> decompose_str(string s) {
vector<pair<char, ll>> moji_cnt;
moji_cnt.pb(mp(s[0], 0));
REP(i, SZ(s)) {
if (moji_cnt.back().first == s[i]) {
moji_cnt.back().second++;
} else {
moji_cnt.pb(mp(s[i], 1));
}
}
return moji_cnt;
}
// 解答のベクトル出力(空白区切り)
void ans_vec(vector<ll> ans) {
REP(i, SZ(ans)) { cout << ans[i] << " "; }
cout << endl;
}
//
void dinamic_programming(void) {}
// 総和の公式：Σk
ll totalSumFirst(ll x, ll y) {
x = x - 1;
return (y * (y + 1) - x * (x + 1)) / 2;
}
// 総和の公式：Σk^2
ll totalSumSecond(ll x, ll y) {
x = x - 1;
return (y * (y + 1) * (2 * y + 1) - x * (x + 1) * (2 * x + 1)) / 6;
}
// 総和の公式：Σk^3
ll totalSumThird(ll x, ll y) { return pow(totalSumFirst(x, y), 2); }
// 約数
vector<ll> makeDivisors(ll n) {
vector<ll> divisors;
for (ll i = 1; i * i <= n; i++) {
if (n % i == 0) {
divisors.pb(i);
if (i != n / i) {
divisors.pb(n / i);
}
}
}
sort(ALL(divisors));
return divisors;
}
// 尺取り法
ll shakutori(vector<ll> &v, ll x) {
ll res = 0;
ll n = SZ(v);
ll sum = 0;
ll right = 0;
REP(left, n) {
while (right < n && sum + v[right] <= x) {
sum += v[right];
right++;
}
res += (right - left);
if (right == left)
right++;
else
sum -= v[left];
}
return res;
}
// 深さ優先探索
void dfs(const Graph &g, ll x) {}
// 幅優先探索
void bfs() {}
// bit全探索
void bitFullSearch(ll n) {
REP(bit, 1 << n) {
vector<ll> vec;
REP(i, n) {
if (bit >> i & 1) {
vec.pb(i);
}
}
}
}
//
// main関数
//
signed main() {
// cin.tie(0);
// ios::sync_with_stdio(false);
// 変数（scala）取得
ll n, a, b, c, d;
cin >> n >> a >> b >> c >> d;
// 変数（vector）取得
// vector<ll> a(n);
// a = INV(n);
////m=2;
// vector<vector<ll>> vec(n, vector<ll>(m));
// vec = INV2(n, m);
// vector<vector<ll>> a(3);
// REP(i, a)
// {
// ll tmp;
// cin >> tmp;
// a[0].pb(tmp);
// }
// REP(i, b)
// {
// ll tmp;
// cin >> tmp;
// a[1].pb(tmp);
// }
// REP(i, c)
// {
// ll tmp;
// cin >> tmp;
// a[2].pb(tmp);
// }
// 文字列取得
string s;
cin >> s;
// 文字列（vector）取得
// vector<string> str(n);
// REP(i, n)
// {
// cin >> str[i];
// }
// グラフ取得
// Graph g(n);
// REP(i, k) {
// ll from, weight;
// cin >> from >> weight;
// g[from].pb(to);
// //g[to].pb(from);
//}
// 迷路用string取得
// vector<string> str(h);
// REP(i, h) {
// cin >> str[i];
//}
// 二項係数を計算する際に必要
// factorialFunc(n);
//
// 実装部分
//
string ans = "Yes";
a--;
b--;
c--;
d--;
FOR(i, a + 1, c) {
if (s[i] == '#' && s[i + 1] == '#') {
ans = "No";
}
}
FOR(i, b + 1, d) {
if (s[i] == '#' && s[i + 1] == '#') {
ans = "No";
}
}
if (c > d) {
ans = "No";
FOR(i, b - 1, d) {
if (s[i] == '.' && s[i + 1] == '.' && s[i + 2] == '.') {
ans = "Yes";
}
}
}
//
// 実装部分おわり
//
// 解答出力
// cout << fixed << setprecision(10);
MSG(ans);
// ans_vec(ans);
return 0;
}
//
// memo
//
// for(ll i=0; i<n;i++) // ループ
// cout << << endl; // 出力
// sort(ALL(a), greater<ll>()); // 降順
// abs(k) // 絶対値
// sqrt(n) // ルート
// ceil(n) // 切り上げ
// floor(n) // 切り捨て
// round(n) // 四捨五入
// map<ll, ll, greater<ll>> mp; // mapの降順
| [
"misc.opposites",
"expression.operator.arithmetic.change",
"call.arguments.change",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 829,813 | 829,811 | u337845373 | cpp |
p03017 | // include
// ------------------------------------------------
#include <algorithm>
#include <bits/stdc++.h>
#include <math.h>
#include <vector>
using namespace std;
// func
// ------------------------------------------------
int CalcSumOfDigit(int n); // 各桁の和を計算する。
long long getDigit(long long n); // 数字の桁数を取得する。
string upper(string str); // 英字を大文字に変換する。
string lower(string str); // 英字を小文字に変換する。
// define
// ------------------------------------------------
#define all(a) (a).begin(), (a).end()
#define rall(a) (a).rbegin(), (a).rend()
#define sz(a) int((a).size())
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define repe(i, n) for (int(i) = 0; (i) <= (n); (i)++)
#define vsort(v) sort((v).begin(), (v).end())
#define rvsort(v) sort(rall((v)))
#define vi vector<int>
#define GCD(a, b) __gcd((a), (b))
#define LCM(a, b) ((a) / GCD((a), (b)) * (b))
#define kiriage(a, b) ((a) + (b)-1) / (b)
const int INF = 1e9;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<ll> vll;
// code
// ------------------------------------------------
int main() {
ll n, a, b, c, d;
cin >> n >> a >> b >> c >> d;
string s;
cin >> s;
a--;
b--;
c--;
d--;
bool flg_cont = false; //連続
bool flg_chg = c > d;
bool flg_tri = false;
// 2連続いわのばしょがあるかチェック
ll cnt_rock = 0;
for (ll i = a; i <= max(c, d); ++i) {
if (s[i] == '#') {
cnt_rock++;
} else {
cnt_rock = 0;
}
if (cnt_rock == 2) {
flg_cont = true;
break;
}
}
// 3連続の場所があるかチェック
ll cnt_agola = 0;
for (ll i = b - 1; i < d + 1; ++i) {
if (s[i] == '.') {
cnt_agola++;
} else {
cnt_agola = 0;
}
if (cnt_agola > 2) {
flg_tri = true;
break;
}
}
bool ans = false;
if (!flg_chg) {
ans = true;
} else {
if (flg_tri) {
ans = true;
}
}
if (flg_cont)
ans = false;
if (ans)
cout << "Yes" << endl;
else
cout << "No" << endl;
return 0;
}
// funcの実体
// ------------------------------------------------
ll getDigit(ll n) {
int i = 1;
while (1) {
n = n / 10;
if (n == 0)
break;
i++;
}
return i;
}
ll CalcSumOfDigit(ll n) {
ll s = 0;
while (n) {
s += n % 10;
n = n / 10;
}
return s;
}
string upper(string str) {
for (auto itr = str.begin(); itr != str.end(); itr++) {
if (97 <= *itr && *itr <= 122) {
*itr = *itr - 32;
}
}
return str;
}
string lower(string str) {
for (auto itr = str.begin(); itr != str.end(); itr++) {
if (65 <= *itr && *itr <= 90) {
*itr = *itr + 32;
}
}
return str;
}
| // include
// ------------------------------------------------
#include <algorithm>
#include <bits/stdc++.h>
#include <math.h>
#include <vector>
using namespace std;
// func
// ------------------------------------------------
int CalcSumOfDigit(int n); // 各桁の和を計算する。
long long getDigit(long long n); // 数字の桁数を取得する。
string upper(string str); // 英字を大文字に変換する。
string lower(string str); // 英字を小文字に変換する。
// define
// ------------------------------------------------
#define all(a) (a).begin(), (a).end()
#define rall(a) (a).rbegin(), (a).rend()
#define sz(a) int((a).size())
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define repe(i, n) for (int(i) = 0; (i) <= (n); (i)++)
#define vsort(v) sort((v).begin(), (v).end())
#define rvsort(v) sort(rall((v)))
#define vi vector<int>
#define GCD(a, b) __gcd((a), (b))
#define LCM(a, b) ((a) / GCD((a), (b)) * (b))
#define kiriage(a, b) ((a) + (b)-1) / (b)
const int INF = 1e9;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<ll> vll;
// code
// ------------------------------------------------
int main() {
ll n, a, b, c, d;
cin >> n >> a >> b >> c >> d;
string s;
cin >> s;
a--;
b--;
c--;
d--;
bool flg_cont = false; //連続
bool flg_chg = c > d;
bool flg_tri = false;
// 2連続いわのばしょがあるかチェック
ll cnt_rock = 0;
for (ll i = a; i <= max(c, d); ++i) {
if (s[i] == '#') {
cnt_rock++;
} else {
cnt_rock = 0;
}
if (cnt_rock == 2) {
flg_cont = true;
break;
}
}
// 3連続の場所があるかチェック
ll cnt_agola = 0;
for (ll i = b - 1; i <= d + 1; ++i) {
if (s[i] == '.') {
cnt_agola++;
} else {
cnt_agola = 0;
}
if (cnt_agola > 2) {
flg_tri = true;
break;
}
}
bool ans = false;
if (!flg_chg) {
ans = true;
} else {
if (flg_tri) {
ans = true;
}
}
if (flg_cont)
ans = false;
if (ans)
cout << "Yes" << endl;
else
cout << "No" << endl;
return 0;
}
// funcの実体
// ------------------------------------------------
ll getDigit(ll n) {
int i = 1;
while (1) {
n = n / 10;
if (n == 0)
break;
i++;
}
return i;
}
ll CalcSumOfDigit(ll n) {
ll s = 0;
while (n) {
s += n % 10;
n = n / 10;
}
return s;
}
string upper(string str) {
for (auto itr = str.begin(); itr != str.end(); itr++) {
if (97 <= *itr && *itr <= 122) {
*itr = *itr - 32;
}
}
return str;
}
string lower(string str) {
for (auto itr = str.begin(); itr != str.end(); itr++) {
if (65 <= *itr && *itr <= 90) {
*itr = *itr + 32;
}
}
return str;
}
| [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 829,835 | 829,836 | u610897920 | cpp |
p03017 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define FOR(i, s, e) for (int i = (int)(s); i <= (int)(e); i++)
#define printYesNo(is_ok) puts(is_ok ? "Yes" : "No");
#define SORT(v) sort(v.begin(), v.end());
#define RSORT(v) sort(v.rbegin(), v.rend());
#define REVERSE(v) reverse(v.begin(), v.end());
template <typename T> void printlnVector(T v) {
rep(i, v.size()) { cout << v[i] << endl; }
}
template <typename T> void printVector(T v) {
rep(i, v.size()) { cout << v[i] << " "; }
cout << endl;
}
int main() {
int N, A, B, C, D;
string S;
cin >> N >> A >> B >> C >> D >> S;
bool AisOK = true, BisOk = true, croosisOK = true;
for (int i = A - 1; i < C - 1; i++) {
if (S[i] == '#' && S[i + 1] == '#')
AisOK = false;
}
for (int i = B - 1; i < D - 1; i++) {
if (S[i] == '#' && S[i + 1] == '#')
BisOk = false;
}
if (D < C) {
croosisOK = false;
for (int i = B - 1; i <= D - 1; i++) {
if (S[i - 1] == '.' && S[i] == '.' && S[i + 1] == '.')
croosisOK = false;
}
}
if (AisOK && BisOk && croosisOK)
cout << "Yes" << endl;
else
cout << "No" << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define FOR(i, s, e) for (int i = (int)(s); i <= (int)(e); i++)
#define printYesNo(is_ok) puts(is_ok ? "Yes" : "No");
#define SORT(v) sort(v.begin(), v.end());
#define RSORT(v) sort(v.rbegin(), v.rend());
#define REVERSE(v) reverse(v.begin(), v.end());
template <typename T> void printlnVector(T v) {
rep(i, v.size()) { cout << v[i] << endl; }
}
template <typename T> void printVector(T v) {
rep(i, v.size()) { cout << v[i] << " "; }
cout << endl;
}
int main() {
int N, A, B, C, D;
string S;
cin >> N >> A >> B >> C >> D >> S;
bool AisOK = true, BisOk = true, croosisOK = true;
for (int i = A - 1; i < C - 1; i++) {
if (S[i] == '#' && S[i + 1] == '#')
AisOK = false;
}
for (int i = B - 1; i < D - 1; i++) {
if (S[i] == '#' && S[i + 1] == '#')
BisOk = false;
}
if (D < C) {
croosisOK = false;
for (int i = B - 1; i <= D - 1; i++) {
if (S[i - 1] == '.' && S[i] == '.' && S[i + 1] == '.')
croosisOK = true;
}
}
if (AisOK && BisOk && croosisOK)
cout << "Yes" << endl;
else
cout << "No" << endl;
return 0;
} | [
"misc.opposites",
"assignment.value.change"
] | 829,840 | 829,841 | u063131621 | cpp |
p03017 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define FOR(i, s, e) for (int i = (int)(s); i <= (int)(e); i++)
#define printYesNo(is_ok) puts(is_ok ? "Yes" : "No");
#define SORT(v) sort(v.begin(), v.end());
#define RSORT(v) sort(v.rbegin(), v.rend());
#define REVERSE(v) reverse(v.begin(), v.end());
template <typename T> void printlnVector(T v) {
rep(i, v.size()) { cout << v[i] << endl; }
}
template <typename T> void printVector(T v) {
rep(i, v.size()) { cout << v[i] << " "; }
cout << endl;
}
int main() {
int N, A, B, C, D;
string S;
cin >> N >> A >> B >> C >> D >> S;
bool AisOK = true, BisOk = true, croosisOK = true;
for (int i = A - 1; i < C - 1; i++) {
if (S[i] == '#' && S[i + 1] == '#')
AisOK = false;
}
for (int i = B - 1; i < D - 1; i++) {
if (S[i] == '#' && S[i + 1] == '#')
BisOk = false;
}
if (D < C) {
croosisOK = false;
for (int i = B; i < D - 1; i++) {
if (S[i - 1] == '.' && S[i] == '.' && S[i + 1] == '.')
croosisOK = true;
}
}
if (AisOK && BisOk && croosisOK)
cout << "Yes" << endl;
else
cout << "No" << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define FOR(i, s, e) for (int i = (int)(s); i <= (int)(e); i++)
#define printYesNo(is_ok) puts(is_ok ? "Yes" : "No");
#define SORT(v) sort(v.begin(), v.end());
#define RSORT(v) sort(v.rbegin(), v.rend());
#define REVERSE(v) reverse(v.begin(), v.end());
template <typename T> void printlnVector(T v) {
rep(i, v.size()) { cout << v[i] << endl; }
}
template <typename T> void printVector(T v) {
rep(i, v.size()) { cout << v[i] << " "; }
cout << endl;
}
int main() {
int N, A, B, C, D;
string S;
cin >> N >> A >> B >> C >> D >> S;
bool AisOK = true, BisOk = true, croosisOK = true;
for (int i = A - 1; i < C - 1; i++) {
if (S[i] == '#' && S[i + 1] == '#')
AisOK = false;
}
for (int i = B - 1; i < D - 1; i++) {
if (S[i] == '#' && S[i + 1] == '#')
BisOk = false;
}
if (D < C) {
croosisOK = false;
for (int i = B - 1; i <= D - 1; i++) {
if (S[i - 1] == '.' && S[i] == '.' && S[i + 1] == '.')
croosisOK = true;
}
}
if (AisOK && BisOk && croosisOK)
cout << "Yes" << endl;
else
cout << "No" << endl;
return 0;
} | [
"control_flow.loop.for.initializer.change",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 829,842 | 829,841 | u063131621 | cpp |
p03017 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
#define MOD 1000000007
#define rep(i, n) for (ll(i) = 0LL; (i) < (ll)(n); (i)++)
#define rep2(i, s, e) for (ll(i) = (ll)(s); (i) < (ll)(e); (i)++)
#define repi(i, n) for (ll(i) = 0LL; (i) <= (ll)(n); (i)++)
#define repi2(i, s, e) for (ll(i) = (ll)(s); (i) <= (ll)(e); (i)++)
#define per(i, n) for (ll(i) = (ll)(n)-1LL; (i) >= 0LL; (i)--)
#define per2(i, s, e) for (ll(i) = (ll)(s)-1LL; (i) >= (ll)(e); (i)--)
#define peri(i, n) for (ll(i) = (ll)(n); (i) >= 0LL; (i)--)
#define peri2(i, s, e) for (ll(i) = (ll)(s); (i) >= (ll)(e); (i)--)
#define iter(i, it) for (auto &(i) : (it))
template <typename T, typename U>
ostream &operator<<(ostream &s, const pair<T, U> m) {
cout << "(" << m.first << ", " << m.second << ")";
return s;
}
template <typename T, typename U>
ostream &operator<<(ostream &s, const map<T, U> m) {
ll c = 0;
cout << "{ ";
iter(i, m) cout << i << (c++ == m.size() - 1 ? " " : ", ");
cout << "}";
return s;
}
template <typename T> ostream &operator<<(ostream &s, const vector<T> &v) {
cout << "{ ";
rep(i, v.size()) cout << v[i] << (i == v.size() - 1 ? " " : ", ");
cout << "}";
return s;
}
template <typename T> ostream &operator<<(ostream &s, const list<T> &v) {
ll c = 0;
cout << "{ ";
iter(i, v) cout << i << (c++ == v.size() - 1 ? " " : ", ");
cout << "}";
return s;
}
int main(void) {
ll N, A, B, C, D;
string S;
ll maxi = 0;
ll count = 0;
cin >> N >> A >> B >> C >> D;
A--;
B--;
C--;
D--;
cin >> S;
rep2(i, min(A, B), max(C, D)) {
if (i != min(A, B) && S[i - 1] == '#' && S[i] == '#') {
cout << "No" << endl;
return 0;
} else if (max(A, B) <= i && i <= min(C, D)) {
if (S[i] == '.') {
count++;
} else {
maxi = max(maxi, count);
count = 0;
}
}
}
maxi = max(maxi, count);
if (((A < B && C > D) || (A > B && C < D)) && maxi < 3)
cout << "No" << endl;
else
cout << "Yes" << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
#define MOD 1000000007
#define rep(i, n) for (ll(i) = 0LL; (i) < (ll)(n); (i)++)
#define rep2(i, s, e) for (ll(i) = (ll)(s); (i) < (ll)(e); (i)++)
#define repi(i, n) for (ll(i) = 0LL; (i) <= (ll)(n); (i)++)
#define repi2(i, s, e) for (ll(i) = (ll)(s); (i) <= (ll)(e); (i)++)
#define per(i, n) for (ll(i) = (ll)(n)-1LL; (i) >= 0LL; (i)--)
#define per2(i, s, e) for (ll(i) = (ll)(s)-1LL; (i) >= (ll)(e); (i)--)
#define peri(i, n) for (ll(i) = (ll)(n); (i) >= 0LL; (i)--)
#define peri2(i, s, e) for (ll(i) = (ll)(s); (i) >= (ll)(e); (i)--)
#define iter(i, it) for (auto &(i) : (it))
template <typename T, typename U>
ostream &operator<<(ostream &s, const pair<T, U> m) {
cout << "(" << m.first << ", " << m.second << ")";
return s;
}
template <typename T, typename U>
ostream &operator<<(ostream &s, const map<T, U> m) {
ll c = 0;
cout << "{ ";
iter(i, m) cout << i << (c++ == m.size() - 1 ? " " : ", ");
cout << "}";
return s;
}
template <typename T> ostream &operator<<(ostream &s, const vector<T> &v) {
cout << "{ ";
rep(i, v.size()) cout << v[i] << (i == v.size() - 1 ? " " : ", ");
cout << "}";
return s;
}
template <typename T> ostream &operator<<(ostream &s, const list<T> &v) {
ll c = 0;
cout << "{ ";
iter(i, v) cout << i << (c++ == v.size() - 1 ? " " : ", ");
cout << "}";
return s;
}
int main(void) {
ll N, A, B, C, D;
string S;
ll maxi = 0;
ll count = 0;
cin >> N >> A >> B >> C >> D;
A--;
B--;
C--;
D--;
cin >> S;
rep2(i, min(A, B), max(C, D)) {
if (i != min(A, B) && S[i - 1] == '#' && S[i] == '#') {
cout << "No" << endl;
return 0;
} else if (max(A, B) - 1 <= i && i <= min(C, D) + 1) {
if (S[i] == '.') {
count++;
} else {
maxi = max(maxi, count);
count = 0;
}
}
}
maxi = max(maxi, count);
if (((A < B && C > D) || (A > B && C < D)) && maxi < 3)
cout << "No" << endl;
else
cout << "Yes" << endl;
return 0;
}
| [
"control_flow.branch.if.condition.change"
] | 829,851 | 829,852 | u196953553 | cpp |
p03017 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
#define MOD 1000000007
#define rep(i, n) for (ll(i) = 0LL; (i) < (ll)(n); (i)++)
#define rep2(i, s, e) for (ll(i) = (ll)(s); (i) < (ll)(e); (i)++)
#define repi(i, n) for (ll(i) = 0LL; (i) <= (ll)(n); (i)++)
#define repi2(i, s, e) for (ll(i) = (ll)(s); (i) <= (ll)(e); (i)++)
#define per(i, n) for (ll(i) = (ll)(n)-1LL; (i) >= 0LL; (i)--)
#define per2(i, s, e) for (ll(i) = (ll)(s)-1LL; (i) >= (ll)(e); (i)--)
#define peri(i, n) for (ll(i) = (ll)(n); (i) >= 0LL; (i)--)
#define peri2(i, s, e) for (ll(i) = (ll)(s); (i) >= (ll)(e); (i)--)
#define iter(i, it) for (auto &(i) : (it))
template <typename T, typename U>
ostream &operator<<(ostream &s, const pair<T, U> m) {
cout << "(" << m.first << ", " << m.second << ")";
return s;
}
template <typename T, typename U>
ostream &operator<<(ostream &s, const map<T, U> m) {
ll c = 0;
cout << "{ ";
iter(i, m) cout << i << (c++ == m.size() - 1 ? " " : ", ");
cout << "}";
return s;
}
template <typename T> ostream &operator<<(ostream &s, const vector<T> &v) {
cout << "{ ";
rep(i, v.size()) cout << v[i] << (i == v.size() - 1 ? " " : ", ");
cout << "}";
return s;
}
template <typename T> ostream &operator<<(ostream &s, const list<T> &v) {
ll c = 0;
cout << "{ ";
iter(i, v) cout << i << (c++ == v.size() - 1 ? " " : ", ");
cout << "}";
return s;
}
int main(void) {
ll N, A, B, C, D;
string S;
ll maxi = 0;
ll count = 0;
cin >> N >> A >> B >> C >> D;
A--;
B--;
C--;
D--;
cin >> S;
rep2(i, min(A, B), max(C, D)) {
if (i != min(A, B) && S[i - 1] == '#' && S[i] == '#') {
cout << "No" << endl;
return 0;
} else if (max(A, B) <= i && i <= min(C, D) + 1) {
if (S[i] == '.') {
count++;
} else {
maxi = max(maxi, count);
count = 0;
}
}
}
maxi = max(maxi, count);
if (((A < B && C > D) || (A > B && C < D)) && maxi < 3)
cout << "No" << endl;
else
cout << "Yes" << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
#define MOD 1000000007
#define rep(i, n) for (ll(i) = 0LL; (i) < (ll)(n); (i)++)
#define rep2(i, s, e) for (ll(i) = (ll)(s); (i) < (ll)(e); (i)++)
#define repi(i, n) for (ll(i) = 0LL; (i) <= (ll)(n); (i)++)
#define repi2(i, s, e) for (ll(i) = (ll)(s); (i) <= (ll)(e); (i)++)
#define per(i, n) for (ll(i) = (ll)(n)-1LL; (i) >= 0LL; (i)--)
#define per2(i, s, e) for (ll(i) = (ll)(s)-1LL; (i) >= (ll)(e); (i)--)
#define peri(i, n) for (ll(i) = (ll)(n); (i) >= 0LL; (i)--)
#define peri2(i, s, e) for (ll(i) = (ll)(s); (i) >= (ll)(e); (i)--)
#define iter(i, it) for (auto &(i) : (it))
template <typename T, typename U>
ostream &operator<<(ostream &s, const pair<T, U> m) {
cout << "(" << m.first << ", " << m.second << ")";
return s;
}
template <typename T, typename U>
ostream &operator<<(ostream &s, const map<T, U> m) {
ll c = 0;
cout << "{ ";
iter(i, m) cout << i << (c++ == m.size() - 1 ? " " : ", ");
cout << "}";
return s;
}
template <typename T> ostream &operator<<(ostream &s, const vector<T> &v) {
cout << "{ ";
rep(i, v.size()) cout << v[i] << (i == v.size() - 1 ? " " : ", ");
cout << "}";
return s;
}
template <typename T> ostream &operator<<(ostream &s, const list<T> &v) {
ll c = 0;
cout << "{ ";
iter(i, v) cout << i << (c++ == v.size() - 1 ? " " : ", ");
cout << "}";
return s;
}
int main(void) {
ll N, A, B, C, D;
string S;
ll maxi = 0;
ll count = 0;
cin >> N >> A >> B >> C >> D;
A--;
B--;
C--;
D--;
cin >> S;
rep2(i, min(A, B), max(C, D)) {
if (i != min(A, B) && S[i - 1] == '#' && S[i] == '#') {
cout << "No" << endl;
return 0;
} else if (max(A, B) - 1 <= i && i <= min(C, D) + 1) {
if (S[i] == '.') {
count++;
} else {
maxi = max(maxi, count);
count = 0;
}
}
}
maxi = max(maxi, count);
if (((A < B && C > D) || (A > B && C < D)) && maxi < 3)
cout << "No" << endl;
else
cout << "Yes" << endl;
return 0;
}
| [
"control_flow.branch.if.condition.change"
] | 829,853 | 829,852 | u196953553 | cpp |
p03017 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cfloat>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <list>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
using namespace std;
#define int long long
#define ll long long
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define P pair<ll, ll>
#define sz(x) (ll) x.size()
#define ALL(x) (x).begin(), (x).end()
#define ALLR(x) (x).rbegin(), (x).rend()
#define VE vector<ll>
#define COUT(x) cout << (x) << endl
#define MA map<ll, ll>
#define SE set<ll>
#define PQ priority_queue<ll>
#define PQR priority_queue<ll, VE, greater<ll>>
#define YES(n) cout << ((n) ? "YES" : "NO") << endl
#define Yes(n) cout << ((n) ? "Yes" : "No") << endl
#define EPS (1e-14)
#define pb push_back
long long MOD = 1000000007;
// const long long MOD = 998244353;
const long long INF = 1LL << 60;
const double PI = acos(-1.0);
using Graph = vector<VE>;
struct mint {
ll x; // typedef long long ll;
mint(ll x = 0) : x((x % MOD + MOD) % MOD) {}
mint operator-() const { return mint(-x); }
mint &operator+=(const mint a) {
if ((x += a.x) >= MOD)
x -= MOD;
return *this;
}
mint &operator-=(const mint a) {
if ((x += MOD - a.x) >= MOD)
x -= MOD;
return *this;
}
mint &operator*=(const mint a) {
(x *= a.x) %= MOD;
return *this;
}
mint operator+(const mint a) const {
mint res(*this);
return res += a;
}
mint operator-(const mint a) const {
mint res(*this);
return res -= a;
}
mint operator*(const mint a) const {
mint res(*this);
return res *= a;
}
mint pow(ll t) const {
if (!t)
return 1;
mint a = pow(t >> 1);
a *= a;
if (t & 1)
a *= *this;
return a;
}
// for prime MOD
mint inv() const { return pow(MOD - 2); }
mint &operator/=(const mint a) { return (*this) *= a.inv(); }
mint operator/(const mint a) const {
mint res(*this);
return res /= a;
}
friend ostream &operator<<(ostream &os, const mint &m) {
os << m.x;
return os;
}
};
struct combination {
vector<mint> fact, ifact;
combination(int n) : fact(n + 1), ifact(n + 1) {
// assert(n < MOD);
fact[0] = 1;
for (int i = 1; i <= n; ++i)
fact[i] = fact[i - 1] * i;
ifact[n] = fact[n].inv();
for (int i = n; i >= 1; --i)
ifact[i - 1] = ifact[i] * i;
}
mint operator()(int n, int k) {
if (k < 0 || k > n)
return 0;
return fact[n] * ifact[k] * ifact[n - k];
}
} com(10);
struct Sieve {
int n;
vector<int> f, primes;
Sieve(int n = 1) : n(n), f(n + 1) {
f[0] = f[1] = -1;
for (ll i = 2; i <= n; ++i) {
if (f[i])
continue;
primes.push_back(i);
f[i] = i;
for (ll j = i * i; j <= n; j += i) {
if (!f[j])
f[j] = i;
}
}
}
bool isPrime(int x) { return f[x] == x; }
vector<int> factorList(int x) {
vector<int> res;
while (x != 1) {
res.push_back(f[x]);
x /= f[x];
}
return res;
}
vector<P> factor(int x) {
vector<int> fl = factorList(x);
if (fl.size() == 0)
return {};
vector<P> res(1, P(fl[0], 0));
for (int p : fl) {
if (res.back().first == p) {
res.back().second++;
} else {
res.emplace_back(p, 1);
}
}
return res;
}
};
class UnionFind {
public:
vector<ll> par;
vector<ll> siz;
// Constructor
UnionFind(ll sz_) : par(sz_), siz(sz_, 1) {
for (ll i = 0; i < sz_; ++i)
par[i] = i;
}
void init(ll sz_) {
par.resize(sz_);
siz.resize(sz_, 1);
for (ll i = 0; i < sz_; ++i)
par[i] = i;
}
// Member Function
// Find
ll root(ll x) {
while (par[x] != x) {
x = par[x] = par[par[x]];
}
return x;
}
// Union(Unite, Merge)
bool merge(ll x, ll y) {
x = root(x);
y = root(y);
if (x == y)
return false;
if (siz[x] < siz[y])
swap(x, y);
siz[x] += siz[y];
par[y] = x;
return true;
}
bool issame(ll x, ll y) { return root(x) == root(y); }
ll size(ll x) { return siz[root(x)]; }
};
template <class t> t gcd(t a, t b) { return b != 0 ? gcd(b, a % b) : a; }
ll lcm(ll a, ll b) {
ll g = gcd(a, b);
return a * b / g;
}
bool prime(ll n) {
for (ll i = 2; i <= sqrt(n); i++) {
if (n % i == 0)
return false;
}
return n != 1;
}
map<ll, ll> prime_factor(ll n) {
map<ll, ll> ret;
for (ll i = 2; i * i <= n; i++) {
while (n % i == 0) {
ret[i]++;
n /= i;
}
}
if (n != 1)
ret[n] = 1;
return ret;
}
ll modinv(ll a, ll m) {
ll b = m, u = 1, v = 0;
while (b) {
ll t = a / b;
a -= t * b;
swap(a, b);
u -= t * v;
swap(u, v);
}
u %= m;
if (u < 0)
u += m;
return u;
}
vector<pair<char, int>> RunLength(string s) {
if (s.size() == 0)
return {};
vector<pair<char, int>> res(1, pair<char, int>(s[0], 0));
for (char p : s) {
if (res.back().first == p) {
res.back().second++;
} else {
res.emplace_back(p, 1);
}
}
return res;
}
// Digit Count
int GetDigit(int num) { return log10(num) + 1; }
// bit calculation[how many "1"] (= __builtin_popcount())
int bit_count(int n) {
int cnt = 0;
while (n > 0) {
if (n % 2 == 1)
cnt++;
n /= 2;
}
return cnt;
}
mint POW(mint n, int p) {
if (p == 0)
return 1;
if (p % 2 == 0) {
mint t = POW(n, p / 2);
return t * t;
}
return n * POW(n, p - 1);
}
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
struct edge {
ll to, cost;
};
typedef long double ld;
signed main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
// cout << fixed << setprecision(15);
int n, a, b, c, d;
cin >> n >> a >> b >> c >> d;
a--;
b--;
c--;
d--;
string s;
cin >> s;
for (int i = a; i < b; i++) {
if (s[i] == '#' && s[i + 1] == '#') {
cout << "No" << endl;
return 0;
}
}
for (int i = c; i < d; i++) {
if (s[i] == '#' && s[i + 1] == '#') {
cout << "No" << endl;
return 0;
}
}
if (c > d) {
bool ok = false;
for (int i = b; i < min(d, n - 2); i++) {
if (s[i] == '.' && s[i + 1] == '.' && s[i + 2] == '.') {
ok = true;
}
}
if (!ok) {
cout << "No" << endl;
return 0;
}
}
cout << "Yes" << endl;
return 0;
} | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cfloat>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <list>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
using namespace std;
#define int long long
#define ll long long
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define P pair<ll, ll>
#define sz(x) (ll) x.size()
#define ALL(x) (x).begin(), (x).end()
#define ALLR(x) (x).rbegin(), (x).rend()
#define VE vector<ll>
#define COUT(x) cout << (x) << endl
#define MA map<ll, ll>
#define SE set<ll>
#define PQ priority_queue<ll>
#define PQR priority_queue<ll, VE, greater<ll>>
#define YES(n) cout << ((n) ? "YES" : "NO") << endl
#define Yes(n) cout << ((n) ? "Yes" : "No") << endl
#define EPS (1e-14)
#define pb push_back
long long MOD = 1000000007;
// const long long MOD = 998244353;
const long long INF = 1LL << 60;
const double PI = acos(-1.0);
using Graph = vector<VE>;
struct mint {
ll x; // typedef long long ll;
mint(ll x = 0) : x((x % MOD + MOD) % MOD) {}
mint operator-() const { return mint(-x); }
mint &operator+=(const mint a) {
if ((x += a.x) >= MOD)
x -= MOD;
return *this;
}
mint &operator-=(const mint a) {
if ((x += MOD - a.x) >= MOD)
x -= MOD;
return *this;
}
mint &operator*=(const mint a) {
(x *= a.x) %= MOD;
return *this;
}
mint operator+(const mint a) const {
mint res(*this);
return res += a;
}
mint operator-(const mint a) const {
mint res(*this);
return res -= a;
}
mint operator*(const mint a) const {
mint res(*this);
return res *= a;
}
mint pow(ll t) const {
if (!t)
return 1;
mint a = pow(t >> 1);
a *= a;
if (t & 1)
a *= *this;
return a;
}
// for prime MOD
mint inv() const { return pow(MOD - 2); }
mint &operator/=(const mint a) { return (*this) *= a.inv(); }
mint operator/(const mint a) const {
mint res(*this);
return res /= a;
}
friend ostream &operator<<(ostream &os, const mint &m) {
os << m.x;
return os;
}
};
struct combination {
vector<mint> fact, ifact;
combination(int n) : fact(n + 1), ifact(n + 1) {
// assert(n < MOD);
fact[0] = 1;
for (int i = 1; i <= n; ++i)
fact[i] = fact[i - 1] * i;
ifact[n] = fact[n].inv();
for (int i = n; i >= 1; --i)
ifact[i - 1] = ifact[i] * i;
}
mint operator()(int n, int k) {
if (k < 0 || k > n)
return 0;
return fact[n] * ifact[k] * ifact[n - k];
}
} com(10);
struct Sieve {
int n;
vector<int> f, primes;
Sieve(int n = 1) : n(n), f(n + 1) {
f[0] = f[1] = -1;
for (ll i = 2; i <= n; ++i) {
if (f[i])
continue;
primes.push_back(i);
f[i] = i;
for (ll j = i * i; j <= n; j += i) {
if (!f[j])
f[j] = i;
}
}
}
bool isPrime(int x) { return f[x] == x; }
vector<int> factorList(int x) {
vector<int> res;
while (x != 1) {
res.push_back(f[x]);
x /= f[x];
}
return res;
}
vector<P> factor(int x) {
vector<int> fl = factorList(x);
if (fl.size() == 0)
return {};
vector<P> res(1, P(fl[0], 0));
for (int p : fl) {
if (res.back().first == p) {
res.back().second++;
} else {
res.emplace_back(p, 1);
}
}
return res;
}
};
class UnionFind {
public:
vector<ll> par;
vector<ll> siz;
// Constructor
UnionFind(ll sz_) : par(sz_), siz(sz_, 1) {
for (ll i = 0; i < sz_; ++i)
par[i] = i;
}
void init(ll sz_) {
par.resize(sz_);
siz.resize(sz_, 1);
for (ll i = 0; i < sz_; ++i)
par[i] = i;
}
// Member Function
// Find
ll root(ll x) {
while (par[x] != x) {
x = par[x] = par[par[x]];
}
return x;
}
// Union(Unite, Merge)
bool merge(ll x, ll y) {
x = root(x);
y = root(y);
if (x == y)
return false;
if (siz[x] < siz[y])
swap(x, y);
siz[x] += siz[y];
par[y] = x;
return true;
}
bool issame(ll x, ll y) { return root(x) == root(y); }
ll size(ll x) { return siz[root(x)]; }
};
template <class t> t gcd(t a, t b) { return b != 0 ? gcd(b, a % b) : a; }
ll lcm(ll a, ll b) {
ll g = gcd(a, b);
return a * b / g;
}
bool prime(ll n) {
for (ll i = 2; i <= sqrt(n); i++) {
if (n % i == 0)
return false;
}
return n != 1;
}
map<ll, ll> prime_factor(ll n) {
map<ll, ll> ret;
for (ll i = 2; i * i <= n; i++) {
while (n % i == 0) {
ret[i]++;
n /= i;
}
}
if (n != 1)
ret[n] = 1;
return ret;
}
ll modinv(ll a, ll m) {
ll b = m, u = 1, v = 0;
while (b) {
ll t = a / b;
a -= t * b;
swap(a, b);
u -= t * v;
swap(u, v);
}
u %= m;
if (u < 0)
u += m;
return u;
}
vector<pair<char, int>> RunLength(string s) {
if (s.size() == 0)
return {};
vector<pair<char, int>> res(1, pair<char, int>(s[0], 0));
for (char p : s) {
if (res.back().first == p) {
res.back().second++;
} else {
res.emplace_back(p, 1);
}
}
return res;
}
// Digit Count
int GetDigit(int num) { return log10(num) + 1; }
// bit calculation[how many "1"] (= __builtin_popcount())
int bit_count(int n) {
int cnt = 0;
while (n > 0) {
if (n % 2 == 1)
cnt++;
n /= 2;
}
return cnt;
}
mint POW(mint n, int p) {
if (p == 0)
return 1;
if (p % 2 == 0) {
mint t = POW(n, p / 2);
return t * t;
}
return n * POW(n, p - 1);
}
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
struct edge {
ll to, cost;
};
typedef long double ld;
signed main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
// cout << fixed << setprecision(15);
int n, a, b, c, d;
cin >> n >> a >> b >> c >> d;
a--;
b--;
c--;
d--;
string s;
cin >> s;
for (int i = a; i < b; i++) {
if (s[i] == '#' && s[i + 1] == '#') {
cout << "No" << endl;
return 0;
}
}
for (int i = c; i < d; i++) {
if (s[i] == '#' && s[i + 1] == '#') {
cout << "No" << endl;
return 0;
}
}
if (c > d) {
bool ok = false;
for (int i = b - 1; i < min(d, n - 2); i++) {
if (s[i] == '.' && s[i + 1] == '.' && s[i + 2] == '.') {
ok = true;
}
}
if (!ok) {
cout << "No" << endl;
return 0;
}
}
cout << "Yes" << endl;
return 0;
} | [
"control_flow.loop.for.initializer.change"
] | 829,872 | 829,873 | u809967037 | cpp |
p03017 | #include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < (ll)(n); ++i)
#define repk(i, k, n) for (ll i = k; i < (ll)(n); ++i)
#define MAX 500010
#define MOD 1000000007
typedef long long ll;
using namespace std;
ll ans;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll N, A, B, C, D;
cin >> N >> A >> B >> C >> D;
A--;
B--;
C--;
D--;
string S;
cin >> S;
ll n = S.size();
rep(i, max(C, D)) {
if (S[i] == '#' && S[i + 1] == '#') {
cout << "No" << endl;
return 0;
}
}
if (C < D) {
cout << "Yes" << endl;
return 0;
} else {
repk(i, B - 1, D - 1) {
if (S[i] == '.' && S[i + 1] == '.' && S[i + 2] == '.') {
cout << "Yes" << endl;
return 0;
}
}
}
cout << "No" << endl;
return 0;
} | #include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < (ll)(n); ++i)
#define repk(i, k, n) for (ll i = k; i < (ll)(n); ++i)
#define MAX 500010
#define MOD 1000000007
typedef long long ll;
using namespace std;
ll ans;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll N, A, B, C, D;
cin >> N >> A >> B >> C >> D;
A--;
B--;
C--;
D--;
string S;
cin >> S;
ll n = S.size();
repk(i, A, max(C, D)) {
if (S[i] == '#' && S[i + 1] == '#') {
cout << "No" << endl;
return 0;
}
}
if (C < D) {
cout << "Yes" << endl;
return 0;
} else {
repk(i, B - 1, D) {
if (S[i] == '.' && S[i + 1] == '.' && S[i + 2] == '.') {
cout << "Yes" << endl;
return 0;
}
}
}
cout << "No" << endl;
return 0;
} | [
"identifier.change",
"expression.operation.binary.remove"
] | 829,876 | 829,875 | u344988629 | cpp |
p03017 | #include <bits/stdc++.h>
using namespace std;
#define int long long
signed main() {
int n, a, b, c, d;
string s;
cin >> n >> a >> b >> c >> d >> s;
int t = 0;
for (int i = a - 1; i < c - 1; i++) {
if (s[i] == '#' && s[i + 1] == '#') {
t = 1;
break;
}
}
for (int i = b - 1; i < d - 1; i++) {
if (s[i] == '#' && s[i + 1] == '#') {
t = 1;
break;
}
}
if (t == 0 && d < c) {
t = 1;
for (int i = b - 1; i < d - 2; i++) {
if (s[i] == '.' && s[i + 1] == '.' && s[i + 2] == '.') {
t = 0;
break;
}
}
}
if (t == 0)
cout << "Yes";
else
cout << "No";
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define int long long
signed main() {
int n, a, b, c, d;
string s;
cin >> n >> a >> b >> c >> d >> s;
int t = 0;
for (int i = a - 1; i < c - 1; i++) {
if (s[i] == '#' && s[i + 1] == '#') {
t = 1;
break;
}
}
for (int i = b - 1; i < d - 1; i++) {
if (s[i] == '#' && s[i + 1] == '#') {
t = 1;
break;
}
}
if (t == 0 && d < c) {
t = 1;
for (int i = b - 1; i <= d - 1; i++) {
if (s[i] == '.' && s[i + 1] == '.' && s[i - 1] == '.') {
t = 0;
break;
}
}
}
if (t == 0)
cout << "Yes";
else
cout << "No";
return 0;
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"literal.number.change",
"control_flow.loop.for.condition.change"
] | 829,881 | 829,882 | u651317892 | cpp |
p03017 | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define ALL(x) (x).begin(), (x).end()
typedef long long ll;
#define REP(i, n) for (ll i = 0; i < (ll)n; ++i)
#define REPN(i, m, n) for (ll i = m; i < (ll)n; ++i)
#define INF (ll)1e9
#define MOD (1000 * 1000 * 1000 + 7)
#define Ceil(x, n) (((((x)) + ((n)-1)) / n))
#define CeilN(x, n) (((((x)) + ((n)-1)) / n) * n)
#define FloorN(x, n) ((x) - (x) % (n))
#define IsOdd(x) (((x)&0x01UL) == 0x01UL)
#define IsEven(x) (!IsOdd((x)))
#define M_PI 3.14159265358979323846
typedef pair<ll, ll> P;
/*-----------------------------------------------------------------------------
処理
-----------------------------------------------------------------------------*/
/* 最大公約数 */
ll gcd(ll a, ll b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
/* 最小公倍数 */
ll lcm(ll a, ll b) {
ll gcdRes = gcd(a, b);
return (a * (b / gcdRes));
}
int main() {
ll N, A, B, C, D;
string S;
cin >> N >> A >> B >> C >> D >> S;
string ans = "No";
A--;
B--, C--, D--;
/* if (C < D) {
auto movExec = [&](ll idx, ll End) {
while (idx == End) {
if (S[idx + 1] = '.') {
idx++;
} else if (S[idx + 2] = '.') {
idx += 2;
} else {
return false;
}
}
return true;
};
if (movExec(B, D)) {
if (movExec(A, C)) {
ans = "Yes";
}
}
} else {
while (1) {
}
}*/
ll endPos = max(C, D);
for (ll i = A; i < endPos; i++) {
if (S[i] == '#' && S[i + 1] == '#') {
goto EXIT;
}
}
if (C < D) {
ans = "Yes";
goto EXIT;
}
endPos = max((ll)N - 2, D);
for (ll i = B; i <= endPos; i++) {
if (S[i - 1] == '.' && S[i] == '.' && S[i + 1] == '.') {
ans = "Yes";
goto EXIT;
}
}
EXIT:
cout << ans << endl;
return 0;
}
| #include <algorithm>
#include <climits>
#include <cmath>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define ALL(x) (x).begin(), (x).end()
typedef long long ll;
#define REP(i, n) for (ll i = 0; i < (ll)n; ++i)
#define REPN(i, m, n) for (ll i = m; i < (ll)n; ++i)
#define INF (ll)1e9
#define MOD (1000 * 1000 * 1000 + 7)
#define Ceil(x, n) (((((x)) + ((n)-1)) / n))
#define CeilN(x, n) (((((x)) + ((n)-1)) / n) * n)
#define FloorN(x, n) ((x) - (x) % (n))
#define IsOdd(x) (((x)&0x01UL) == 0x01UL)
#define IsEven(x) (!IsOdd((x)))
#define M_PI 3.14159265358979323846
typedef pair<ll, ll> P;
/*-----------------------------------------------------------------------------
処理
-----------------------------------------------------------------------------*/
/* 最大公約数 */
ll gcd(ll a, ll b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
/* 最小公倍数 */
ll lcm(ll a, ll b) {
ll gcdRes = gcd(a, b);
return (a * (b / gcdRes));
}
int main() {
ll N, A, B, C, D;
string S;
cin >> N >> A >> B >> C >> D >> S;
string ans = "No";
A--;
B--, C--, D--;
ll endPos = max(C, D);
for (ll i = A; i < endPos; i++) {
if (S[i] == '#' && S[i + 1] == '#') {
goto EXIT;
}
}
if (C < D) {
ans = "Yes";
goto EXIT;
}
endPos = min((ll)N - 2, D);
for (ll i = B; i <= endPos; i++) {
if (S[i - 1] == '.' && S[i] == '.' && S[i + 1] == '.') {
ans = "Yes";
goto EXIT;
}
}
EXIT:
cout << ans << endl;
return 0;
}
| [
"misc.opposites",
"assignment.value.change",
"identifier.change",
"call.function.change"
] | 829,884 | 829,885 | u796408111 | cpp |
p03017 | #include <bits/stdc++.h>
typedef long long ll;
typedef long double ld;
using namespace std;
using Pii = pair<int, int>;
using Pll = pair<ll, ll>;
#define REP(i, l, n) for (int i = (l), i##_len = (n); i < i##_len; ++i)
#define ALL(x) (x).begin(), (x).end()
#define pb push_back
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
char alpha[26] = {'a', 'b', 'c', 'd', 'e', 'f', 'g', 'h', 'i',
'j', 'k', 'l', 'm', 'n', 'o', 'p', 'q', 'r',
's', 't', 'u', 'v', 'w', 'x', 'y', 'z'};
int dx[4] = {-1, 1, 0, 0};
int dy[4] = {0, 0, 1, -1};
int main() {
int n, a, b, c, d;
string s;
cin >> n >> a >> b >> c >> d >> s;
a--;
b--;
c--;
d--;
if (c > d) {
REP(i, a, c - 1) {
if (s[i] == '#' && s[i + 1] == '#') {
cout << "No" << endl;
return 0;
}
}
REP(i, b - 1, d - 1) {
if (s[i] == '.' && s[i + 1] == '.' && s[i + 2] == '.') {
cout << "Yes" << endl;
return 0;
}
}
cout << "No" << endl;
return 0;
} else {
REP(i, a, d) {
if (s[i] == '#' && s[i + 1] == '#') {
cout << "No" << endl;
return 0;
}
}
cout << "Yes" << endl;
return 0;
}
} | #include <bits/stdc++.h>
typedef long long ll;
typedef long double ld;
using namespace std;
using Pii = pair<int, int>;
using Pll = pair<ll, ll>;
#define REP(i, l, n) for (int i = (l), i##_len = (n); i < i##_len; ++i)
#define ALL(x) (x).begin(), (x).end()
#define pb push_back
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
char alpha[26] = {'a', 'b', 'c', 'd', 'e', 'f', 'g', 'h', 'i',
'j', 'k', 'l', 'm', 'n', 'o', 'p', 'q', 'r',
's', 't', 'u', 'v', 'w', 'x', 'y', 'z'};
int dx[4] = {-1, 1, 0, 0};
int dy[4] = {0, 0, 1, -1};
int main() {
int n, a, b, c, d;
string s;
cin >> n >> a >> b >> c >> d >> s;
a--;
b--;
c--;
d--;
if (c > d) {
REP(i, a, c) {
if (s[i] == '#' && s[i + 1] == '#') {
cout << "No" << endl;
return 0;
}
}
REP(i, b - 1, d) {
if (s[i] == '.' && s[i + 1] == '.' && s[i + 2] == '.') {
cout << "Yes" << endl;
return 0;
}
}
cout << "No" << endl;
return 0;
} else {
REP(i, a, d) {
if (s[i] == '#' && s[i + 1] == '#') {
cout << "No" << endl;
return 0;
}
}
cout << "Yes" << endl;
return 0;
}
} | [
"expression.operation.binary.remove"
] | 829,917 | 829,918 | u639426108 | cpp |
p03017 | #include <bits/stdc++.h>
#define cout16 cout << setprecision(16)
#define rep(i, n) for (int i = 0; i < n; i++)
#define rep2(i, f, n) for (int i = f; i < n; i++)
#define SORT(A) sort(A.begin(), A.end())
#define REV(A) reverse(A.begin(), A.end())
typedef long long int ll;
using vi = std::vector<int>;
using vvi = std::vector<std::vector<int>>;
using vll = std::vector<ll>;
using vvll = std::vector<std::vector<ll>>;
using P = std::pair<int, int>;
using vp = std::vector<P>;
using namespace std;
#define INF 1001001001
#define LL_INF 1001001001001001001
#define fi first
#define se second
int main(void) {
int n, a, b, c, d;
cin >> n >> a >> b >> c >> d;
string s;
cin >> s;
vi iwaiwa, oinuki;
rep(i, n - 1) {
if (s[i] == '#' && s[i + 1] == '#')
iwaiwa.push_back(i);
}
rep(i, n - 2) {
if (s[i] == '.' && s[i + 1] == '.' && s[i + 2] == '.')
oinuki.push_back(i);
}
rep(i, iwaiwa.size()) {
if (a <= iwaiwa[i] && iwaiwa[i] < c) {
cout << "No" << endl;
return 0;
}
if (b <= iwaiwa[i] && iwaiwa[i] < d - 2) {
cout << "No" << endl;
return 0;
}
}
if (c < d) {
cout << "Yes" << endl;
return 0;
} else {
rep(i, oinuki.size()) {
if (b - 1 <= oinuki[i] && oinuki[i] <= d - 1) {
cout << "Yes" << endl;
return 0;
}
}
cout << "No" << endl;
}
}
| #include <bits/stdc++.h>
#define cout16 cout << setprecision(16)
#define rep(i, n) for (int i = 0; i < n; i++)
#define rep2(i, f, n) for (int i = f; i < n; i++)
#define SORT(A) sort(A.begin(), A.end())
#define REV(A) reverse(A.begin(), A.end())
typedef long long int ll;
using vi = std::vector<int>;
using vvi = std::vector<std::vector<int>>;
using vll = std::vector<ll>;
using vvll = std::vector<std::vector<ll>>;
using P = std::pair<int, int>;
using vp = std::vector<P>;
using namespace std;
#define INF 1001001001
#define LL_INF 1001001001001001001
#define fi first
#define se second
int main(void) {
int n, a, b, c, d;
cin >> n >> a >> b >> c >> d;
string s;
cin >> s;
vi iwaiwa, oinuki;
rep(i, n - 1) {
if (s[i] == '#' && s[i + 1] == '#')
iwaiwa.push_back(i);
}
rep(i, n - 2) {
if (s[i] == '.' && s[i + 1] == '.' && s[i + 2] == '.')
oinuki.push_back(i);
}
rep(i, iwaiwa.size()) {
if (a <= iwaiwa[i] && iwaiwa[i] < c) {
cout << "No" << endl;
return 0;
}
if (b <= iwaiwa[i] && iwaiwa[i] < d - 2) {
cout << "No" << endl;
return 0;
}
}
if (c < d) {
cout << "Yes" << endl;
return 0;
} else {
rep(i, oinuki.size()) {
if (b - 2 <= oinuki[i] && oinuki[i] <= d - 2) {
cout << "Yes" << endl;
return 0;
}
}
cout << "No" << endl;
}
}
| [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 829,922 | 829,923 | u086672186 | cpp |
p03017 | #include <bits/stdc++.h>
#define cout16 cout << setprecision(16)
#define rep(i, n) for (int i = 0; i < n; i++)
#define rep2(i, f, n) for (int i = f; i < n; i++)
#define SORT(A) sort(A.begin(), A.end())
#define REV(A) reverse(A.begin(), A.end())
typedef long long int ll;
using vi = std::vector<int>;
using vvi = std::vector<std::vector<int>>;
using vll = std::vector<ll>;
using vvll = std::vector<std::vector<ll>>;
using P = std::pair<int, int>;
using vp = std::vector<P>;
using namespace std;
#define INF 1001001001
#define LL_INF 1001001001001001001
#define fi first
#define se second
int main(void) {
int n, a, b, c, d;
cin >> n >> a >> b >> c >> d;
string s;
cin >> s;
vi iwaiwa, oinuki;
rep(i, n - 1) {
if (s[i] == '#' && s[i + 1] == '#')
iwaiwa.push_back(i);
}
rep(i, n - 2) {
if (s[i] == '.' && s[i + 1] == '.' && s[i + 2] == '.')
oinuki.push_back(i);
}
rep(i, iwaiwa.size()) {
if (a <= iwaiwa[i] && iwaiwa[i] < c) {
cout << "No" << endl;
return 0;
}
if (b <= iwaiwa[i] && iwaiwa[i] < d - 2) {
cout << "No" << endl;
return 0;
}
}
if (c < d) {
cout << "Yes" << endl;
return 0;
} else {
rep(i, oinuki.size()) {
if (b + 1 <= oinuki[i] && oinuki[i] <= d + 1) {
cout << "Yes" << endl;
return 0;
}
}
cout << "No" << endl;
}
}
| #include <bits/stdc++.h>
#define cout16 cout << setprecision(16)
#define rep(i, n) for (int i = 0; i < n; i++)
#define rep2(i, f, n) for (int i = f; i < n; i++)
#define SORT(A) sort(A.begin(), A.end())
#define REV(A) reverse(A.begin(), A.end())
typedef long long int ll;
using vi = std::vector<int>;
using vvi = std::vector<std::vector<int>>;
using vll = std::vector<ll>;
using vvll = std::vector<std::vector<ll>>;
using P = std::pair<int, int>;
using vp = std::vector<P>;
using namespace std;
#define INF 1001001001
#define LL_INF 1001001001001001001
#define fi first
#define se second
int main(void) {
int n, a, b, c, d;
cin >> n >> a >> b >> c >> d;
string s;
cin >> s;
vi iwaiwa, oinuki;
rep(i, n - 1) {
if (s[i] == '#' && s[i + 1] == '#')
iwaiwa.push_back(i);
}
rep(i, n - 2) {
if (s[i] == '.' && s[i + 1] == '.' && s[i + 2] == '.')
oinuki.push_back(i);
}
rep(i, iwaiwa.size()) {
if (a <= iwaiwa[i] && iwaiwa[i] < c) {
cout << "No" << endl;
return 0;
}
if (b <= iwaiwa[i] && iwaiwa[i] < d - 2) {
cout << "No" << endl;
return 0;
}
}
if (c < d) {
cout << "Yes" << endl;
return 0;
} else {
rep(i, oinuki.size()) {
if (b - 2 <= oinuki[i] && oinuki[i] <= d - 2) {
cout << "Yes" << endl;
return 0;
}
}
cout << "No" << endl;
}
}
| [] | 829,924 | 829,923 | u086672186 | cpp |
p03017 | #include <bits/stdc++.h>
#define cout16 cout << setprecision(16)
#define rep(i, n) for (int i = 0; i < n; i++)
#define rep2(i, f, n) for (int i = f; i < n; i++)
#define SORT(A) sort(A.begin(), A.end())
#define REV(A) reverse(A.begin(), A.end())
typedef long long int ll;
using vi = std::vector<int>;
using vvi = std::vector<std::vector<int>>;
using vll = std::vector<ll>;
using vvll = std::vector<std::vector<ll>>;
using P = std::pair<int, int>;
using vp = std::vector<P>;
using namespace std;
#define INF 1001001001
#define LL_INF 1001001001001001001
#define fi first
#define se second
int main(void) {
int n, a, b, c, d;
cin >> n >> a >> b >> c >> d;
string s;
cin >> s;
vi iwaiwa, oinuki;
rep(i, n - 1) {
if (s[i] == '#' && s[i + 1] == '#')
iwaiwa.push_back(i);
}
rep(i, n - 2) {
if (s[i] == '.' && s[i + 1] == '.' && s[i + 2] == '.')
oinuki.push_back(i);
}
rep(i, iwaiwa.size()) {
if (a <= iwaiwa[i] && iwaiwa[i] < c) {
cout << "No" << endl;
return 0;
}
if (b <= iwaiwa[i] && iwaiwa[i] < d - 2) {
cout << "No" << endl;
return 0;
}
}
if (c < d) {
cout << "Yes" << endl;
return 0;
} else {
rep(i, oinuki.size()) {
if (b <= oinuki[i] && oinuki[i] <= d) {
cout << "Yes" << endl;
return 0;
}
}
cout << "No" << endl;
}
}
| #include <bits/stdc++.h>
#define cout16 cout << setprecision(16)
#define rep(i, n) for (int i = 0; i < n; i++)
#define rep2(i, f, n) for (int i = f; i < n; i++)
#define SORT(A) sort(A.begin(), A.end())
#define REV(A) reverse(A.begin(), A.end())
typedef long long int ll;
using vi = std::vector<int>;
using vvi = std::vector<std::vector<int>>;
using vll = std::vector<ll>;
using vvll = std::vector<std::vector<ll>>;
using P = std::pair<int, int>;
using vp = std::vector<P>;
using namespace std;
#define INF 1001001001
#define LL_INF 1001001001001001001
#define fi first
#define se second
int main(void) {
int n, a, b, c, d;
cin >> n >> a >> b >> c >> d;
string s;
cin >> s;
vi iwaiwa, oinuki;
rep(i, n - 1) {
if (s[i] == '#' && s[i + 1] == '#')
iwaiwa.push_back(i);
}
rep(i, n - 2) {
if (s[i] == '.' && s[i + 1] == '.' && s[i + 2] == '.')
oinuki.push_back(i);
}
rep(i, iwaiwa.size()) {
if (a <= iwaiwa[i] && iwaiwa[i] < c) {
cout << "No" << endl;
return 0;
}
if (b <= iwaiwa[i] && iwaiwa[i] < d - 2) {
cout << "No" << endl;
return 0;
}
}
if (c < d) {
cout << "Yes" << endl;
return 0;
} else {
rep(i, oinuki.size()) {
if (b - 2 <= oinuki[i] && oinuki[i] <= d - 2) {
cout << "Yes" << endl;
return 0;
}
}
cout << "No" << endl;
}
}
| [
"control_flow.branch.if.condition.change"
] | 829,925 | 829,923 | u086672186 | cpp |
p03017 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, a, b, c, d;
int space = 0, stone = 0, max_sp = 0, max_st = 0;
string s;
cin >> n >> a >> b >> c >> d >> s;
for (int i = b - 1; i < d; i++) {
if (s[i] == '.')
space++;
else {
max_sp = max(max_sp, space);
space = 0;
}
}
max_sp = max(max_sp, space);
for (int i = a - 1; i < max(c, d); i++) {
if (s[i] == '#')
stone++;
else {
max_st = max(max_st, stone);
stone = 0;
}
}
max_st = max(max_st, stone);
if (d < c && max_sp <= 2 || max_st >= 2)
cout << "No" << endl;
else
cout << "Yes" << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n, a, b, c, d;
int space = 0, stone = 0, max_sp = 0, max_st = 0;
string s;
cin >> n >> a >> b >> c >> d >> s;
for (int i = b - 2; i <= d; i++) {
if (s[i] == '.')
space++;
else {
max_sp = max(max_sp, space);
space = 0;
}
}
max_sp = max(max_sp, space);
for (int i = a - 1; i < max(c, d); i++) {
if (s[i] == '#')
stone++;
else {
max_st = max(max_st, stone);
stone = 0;
}
}
max_st = max(max_st, stone);
if (d < c && max_sp <= 2 || max_st >= 2)
cout << "No" << endl;
else
cout << "Yes" << endl;
}
| [
"literal.number.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"expression.operation.binary.change",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change"
] | 829,943 | 829,942 | u623759422 | cpp |
p03017 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, a, b, c, d;
int space = 0, stone = 0, max_sp = 0, max_st = 0;
string s;
cin >> n >> a >> b >> c >> d >> s;
for (int i = a - 1; i < n; i++) {
if (s[i] == '.')
space++;
else {
max_sp = max(max_sp, space);
space = 0;
}
}
max_sp = max(max_sp, space);
for (int i = a - 1; i < max(c, d); i++) {
if (s[i] == '#')
stone++;
else {
max_st = max(max_st, stone);
stone = 0;
}
}
max_st = max(max_st, stone);
if (d < c && max_sp <= 2 || max_st >= 2)
cout << "No" << endl;
else
cout << "Yes" << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n, a, b, c, d;
int space = 0, stone = 0, max_sp = 0, max_st = 0;
string s;
cin >> n >> a >> b >> c >> d >> s;
for (int i = b - 2; i <= d; i++) {
if (s[i] == '.')
space++;
else {
max_sp = max(max_sp, space);
space = 0;
}
}
max_sp = max(max_sp, space);
for (int i = a - 1; i < max(c, d); i++) {
if (s[i] == '#')
stone++;
else {
max_st = max(max_st, stone);
stone = 0;
}
}
max_st = max(max_st, stone);
if (d < c && max_sp <= 2 || max_st >= 2)
cout << "No" << endl;
else
cout << "Yes" << endl;
}
| [
"identifier.change",
"control_flow.loop.for.initializer.change",
"expression.operation.binary.change",
"literal.number.change",
"expression.off_by_one",
"control_flow.loop.for.condition.change"
] | 829,944 | 829,942 | u623759422 | cpp |
p03017 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, a, b, c, d;
int space = 0, stone = 0, max_sp = 0, max_st = 0;
string s;
cin >> n >> a >> b >> c >> d >> s;
for (int i = a - 1; i <= d; i++) {
if (s[i] == '.')
space++;
else {
max_sp = max(max_sp, space);
space = 0;
}
}
max_sp = max(max_sp, space);
for (int i = a - 1; i < max(c, d); i++) {
if (s[i] == '#')
stone++;
else {
max_st = max(max_st, stone);
stone = 0;
}
}
max_st = max(max_st, stone);
if (d < c && max_sp <= 2 || max_st >= 2)
cout << "No" << endl;
else
cout << "Yes" << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n, a, b, c, d;
int space = 0, stone = 0, max_sp = 0, max_st = 0;
string s;
cin >> n >> a >> b >> c >> d >> s;
for (int i = b - 2; i <= d; i++) {
if (s[i] == '.')
space++;
else {
max_sp = max(max_sp, space);
space = 0;
}
}
max_sp = max(max_sp, space);
for (int i = a - 1; i < max(c, d); i++) {
if (s[i] == '#')
stone++;
else {
max_st = max(max_st, stone);
stone = 0;
}
}
max_st = max(max_st, stone);
if (d < c && max_sp <= 2 || max_st >= 2)
cout << "No" << endl;
else
cout << "Yes" << endl;
}
| [
"identifier.change",
"control_flow.loop.for.initializer.change",
"expression.operation.binary.change",
"literal.number.change",
"expression.off_by_one"
] | 829,945 | 829,942 | u623759422 | cpp |
p03017 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
/*
目的地が深い人優先で配置
とちゅう追い抜きが必要かどうか。
追い抜ける場所があるか
...があれば追い抜き可能
CかD+1のちかいほうまでで抜けること。
#.C.は可能
遠いほうまでで、岩が2個並んでいないこと。
1WA
11 1 3 8 7
...#.#...##
これか
*/
int main() {
ll N, A, B, C, D;
cin >> N >> A >> B >> C >> D;
string S;
cin >> S;
ll start1 = min(A, B);
ll start2 = max(A, B);
ll goal1 = min(C, D);
ll goal2 = max(C, D);
bool overtake = false;
if ((A - B) * (C - D) < 0)
overtake = true;
for (int i = start1 - 1; i < goal2 - 1; i++) {
if (S[i] == '#' && S[i + 1] == '#') {
cout << "No" << endl;
return 0;
}
}
if (overtake) {
for (int i = start2; i <= goal1 - 1; i++) {
if (S[i - 1] == '.' && S[i] == '.' && S[i + 1] == '.')
break;
if (i == goal1 - 1) {
cout << "No" << endl;
return 0;
}
}
}
cout << "Yes" << endl;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
/*
目的地が深い人優先で配置
とちゅう追い抜きが必要かどうか。
追い抜ける場所があるか
...があれば追い抜き可能
CかD+1のちかいほうまでで抜けること。
#.C.は可能
遠いほうまでで、岩が2個並んでいないこと。
1WA
11 1 3 8 7
...#.#...##
これか
あれ、別のがWAに
開始位置か
*/
int main() {
ll N, A, B, C, D;
cin >> N >> A >> B >> C >> D;
string S;
cin >> S;
ll start1 = min(A, B);
ll start2 = max(A, B);
ll goal1 = min(C, D);
ll goal2 = max(C, D);
bool overtake = false;
if ((A - B) * (C - D) < 0)
overtake = true;
for (int i = start1 - 1; i < goal2 - 1; i++) {
if (S[i] == '#' && S[i + 1] == '#') {
cout << "No" << endl;
return 0;
}
}
if (overtake) {
for (int i = start2 - 1; i <= goal1 - 1; i++) {
if (S[i - 1] == '.' && S[i] == '.' && S[i + 1] == '.')
break;
if (i == goal1 - 1) {
cout << "No" << endl;
return 0;
}
}
}
cout << "Yes" << endl;
} | [
"control_flow.loop.for.initializer.change"
] | 829,953 | 829,954 | u071282706 | cpp |
p03017 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
/*
目的地が深い人優先で配置
とちゅう追い抜きが必要かどうか。
追い抜ける場所があるか
...があれば追い抜き可能
CかD+1のちかいほうまでで抜けること。
#.C.は可能
遠いほうまでで、岩が2個並んでいないこと。
*/
int main() {
ll N, A, B, C, D;
cin >> N >> A >> B >> C >> D;
string S;
cin >> S;
ll start1 = min(A, B);
ll start2 = max(A, B);
ll goal1 = min(C, D);
ll goal2 = max(C, D);
bool overtake = false;
if ((A - B) * (C - D) < 0)
overtake = true;
for (int i = start1 - 1; i < goal2 - 1; i++) {
if (S[i] == '#' && S[i + 1] == '#') {
cout << "No" << endl;
return 0;
}
}
if (overtake) {
for (int i = start1; i <= goal1 - 1; i++) {
if (S[i - 1] == '.' && S[i] == '.' && S[i + 1] == '.')
break;
if (i == goal1 - 1) {
cout << "No" << endl;
return 0;
}
}
}
cout << "Yes" << endl;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
/*
目的地が深い人優先で配置
とちゅう追い抜きが必要かどうか。
追い抜ける場所があるか
...があれば追い抜き可能
CかD+1のちかいほうまでで抜けること。
#.C.は可能
遠いほうまでで、岩が2個並んでいないこと。
1WA
11 1 3 8 7
...#.#...##
これか
あれ、別のがWAに
開始位置か
*/
int main() {
ll N, A, B, C, D;
cin >> N >> A >> B >> C >> D;
string S;
cin >> S;
ll start1 = min(A, B);
ll start2 = max(A, B);
ll goal1 = min(C, D);
ll goal2 = max(C, D);
bool overtake = false;
if ((A - B) * (C - D) < 0)
overtake = true;
for (int i = start1 - 1; i < goal2 - 1; i++) {
if (S[i] == '#' && S[i + 1] == '#') {
cout << "No" << endl;
return 0;
}
}
if (overtake) {
for (int i = start2 - 1; i <= goal1 - 1; i++) {
if (S[i - 1] == '.' && S[i] == '.' && S[i + 1] == '.')
break;
if (i == goal1 - 1) {
cout << "No" << endl;
return 0;
}
}
}
cout << "Yes" << endl;
} | [
"control_flow.loop.for.initializer.change"
] | 829,955 | 829,954 | u071282706 | cpp |
p03017 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, a, b, c, d;
cin >> n >> a >> b >> c >> d;
string s;
cin >> s;
for (int i = 0; i < max(c, d) - 1; i++) {
if (s[i] == '#' && s[i + 1] == '#') {
cout << "No" << endl;
return 0;
}
}
if (d < c && (s[d - 2] == '#' || s[d] == '#')) {
int t = d - 1;
while (t >= 0) {
if (s[t + 1] == '.' && s[t] == '.' && s[t - 1] == '.') {
cout << "Yes" << endl;
return 0;
}
t--;
}
cout << "No" << endl;
} else
cout << "Yes" << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, a, b, c, d;
cin >> n >> a >> b >> c >> d;
string s;
cin >> s;
for (int i = a - 1; i < max(c, d) - 1; i++) {
if (s[i] == '#' && s[i + 1] == '#') {
cout << "No" << endl;
return 0;
}
}
if (d < c && (s[d - 2] == '#' || s[d] == '#')) {
int t = d - 1;
while (t >= b - 1) {
if (s[t + 1] == '.' && s[t] == '.' && s[t - 1] == '.') {
cout << "Yes" << endl;
return 0;
}
t--;
}
cout << "No" << endl;
} else
cout << "Yes" << endl;
return 0;
} | [
"identifier.replace.add",
"literal.replace.remove",
"control_flow.loop.for.initializer.change",
"control_flow.loop.condition.change"
] | 829,963 | 829,962 | u161616073 | cpp |
p03017 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, A, B, C, D;
string s;
cin >> N >> A >> B >> C >> D >> s;
A--;
B--;
C--;
D--;
int dotsq = 0;
int rocksq = 0;
bool b = false;
bool P = false;
for (int i = A; i < max(C, D); i++) {
if (s[i] == '.') {
if (i >= B - 1 && i < D)
dotsq += 1;
rocksq = 0;
}
if (s[i] == '#') {
dotsq = 0;
rocksq += 1;
}
if (dotsq > 2)
b = true;
if (rocksq > 1) {
cout << "No" << endl;
return 0;
}
}
if (C > D) {
if (b)
P = true;
} else
P = true;
if (P)
cout << "Yes" << endl;
else
cout << "No" << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, A, B, C, D;
string s;
cin >> N >> A >> B >> C >> D >> s;
A--;
B--;
C--;
D--;
int dotsq = 0;
int rocksq = 0;
bool b = false;
bool P = false;
for (int i = A; i < max(C, D); i++) {
if (s[i] == '.') {
if (i >= B - 1 && i <= D + 1)
dotsq += 1;
rocksq = 0;
}
if (s[i] == '#') {
dotsq = 0;
rocksq += 1;
}
if (dotsq > 2)
b = true;
if (rocksq > 1) {
cout << "No" << endl;
return 0;
}
}
if (C > D) {
if (b)
P = true;
} else
P = true;
if (P)
cout << "Yes" << endl;
else
cout << "No" << endl;
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 829,966 | 829,967 | u619653948 | cpp |
p03017 | #include <algorithm>
#include <algorithm>
#include <bitset>
#include <cassert>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
typedef vector<int> VI;
typedef pair<int, int> P;
typedef pair<double, double> P_D;
#define PI 3.1415926535897932384626433832795
#define rep(i, n) for (int i = 0; i < (int)n; i++)
#define reprev(i, n) for (int i = (int)n - 1; i >= 0; i--)
#define ALL(a) (a).begin(), (a).end()
#define C_MAX(a, b) ((a) > (b) ? (a) : (b))
#define fi first
#define se second
#define MAX 100100 // 5
#define MAX_N 200100
#define MAX_B 1001001 // 6
#define MAX_S 10010010 // 7
#define SENTINEL 2000000000 // 9
#define NIL -1
#define MOD 1000000007
#define INF 1 << 29
#define INFTY 1000000000000000000LL
#define MAX_INT INT_MAX
int main() {
int n, a, b, c, d;
string s;
cin >> n >> a >> b >> c >> d >> s;
a--;
b--;
c--;
d--;
for (int i = 0; i < n - 1; i++) {
if (s[i] == '#' && s[i + 1] == '#' && i > a && max(c, d) > i) {
cout << "No" << endl;
return 0;
}
}
if (c > d) {
bool can = false;
for (int i = 0; i < n - 2; i++) {
if (s[i] == '.' && s[i + 1] == '.' && s[i + 2] == '.' && i >= b &&
i + 1 <= d) {
can = true;
break;
}
}
if (!can) {
cout << "No" << endl;
return 0;
}
}
cout << "Yes" << endl;
return 0;
}
| #include <algorithm>
#include <algorithm>
#include <bitset>
#include <cassert>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
typedef vector<int> VI;
typedef pair<int, int> P;
typedef pair<double, double> P_D;
#define PI 3.1415926535897932384626433832795
#define rep(i, n) for (int i = 0; i < (int)n; i++)
#define reprev(i, n) for (int i = (int)n - 1; i >= 0; i--)
#define ALL(a) (a).begin(), (a).end()
#define C_MAX(a, b) ((a) > (b) ? (a) : (b))
#define fi first
#define se second
#define MAX 100100 // 5
#define MAX_N 200100
#define MAX_B 1001001 // 6
#define MAX_S 10010010 // 7
#define SENTINEL 2000000000 // 9
#define NIL -1
#define MOD 1000000007
#define INF 1 << 29
#define INFTY 1000000000000000000LL
#define MAX_INT INT_MAX
int main() {
int n, a, b, c, d;
string s;
cin >> n >> a >> b >> c >> d >> s;
a--;
b--;
c--;
d--;
for (int i = 0; i < n - 1; i++) {
if (s[i] == '#' && s[i + 1] == '#' && a < i && max(c, d) > i) {
cout << "No" << endl;
return 0;
}
}
if (c > d) {
bool can = false;
for (int i = 0; i < n - 2; i++) {
if (s[i] == '.' && s[i + 1] == '.' && s[i + 2] == '.' && i + 1 >= b &&
i + 1 <= d) {
can = true;
break;
}
}
if (!can) {
cout << "No" << endl;
return 0;
}
}
cout << "Yes" << endl;
return 0;
}
| [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove",
"control_flow.branch.if.condition.change",
"misc.off_by_one"
] | 829,969 | 829,970 | u000212387 | cpp |
p03017 | #include <bits/stdc++.h>
using namespace std;
// #define int long long
#define rep(i, n) for (long long i = (long long)(0); i < (long long)(n); ++i)
#define reps(i, n) for (long long i = (long long)(1); i <= (long long)(n); ++i)
#define rrep(i, n) for (long long i = ((long long)(n)-1); i >= 0; i--)
#define rreps(i, n) for (long long i = ((long long)(n)); i > 0; i--)
#define irep(i, m, n) \
for (long long i = (long long)(m); i < (long long)(n); ++i)
#define ireps(i, m, n) \
for (long long i = (long long)(m); i <= (long long)(n); ++i)
#define SORT(v, n) sort(v, v + n);
#define REVERSE(v, n) reverse(v, v + n);
#define vsort(v) sort(v.begin(), v.end());
#define all(v) v.begin(), v.end()
#define mp(n, m) make_pair(n, m);
#define cout(d) cout << d << endl;
#define coutd(d) cout << std::setprecision(10) << d << endl;
#define cinline(n) getline(cin, n);
#define replace_all(s, b, a) replace(s.begin(), s.end(), b, a);
#define PI (acos(-1))
#define FILL(v, n, x) fill(v, v + n, x);
#define sz(x) long long(x.size())
using ll = long long;
using vi = vector<int>;
using vvi = vector<vi>;
using vll = vector<ll>;
using vvll = vector<vll>;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using vs = vector<string>;
using vpll = vector<pair<ll, ll>>;
using vtp = vector<tuple<ll, ll, ll>>;
using vb = vector<bool>;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
const ll INF = 1e15;
const ll MOD = 1e9 + 7;
const ll LINF = 1e18;
signed main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll n, a, b, c, d;
cin >> n >> a >> b >> c >> d;
a--, b--, c--, d--;
string s;
cin >> s;
bool ok = true;
irep(i, a, c) {
if (s[i] == '#' && s[i + 1] == '#')
ok = false;
}
irep(i, b, d) {
if (s[i] == '#' && s[i + 1] == '#')
ok = false;
}
if (c > d) {
bool flg = false;
irep(i, b - 1, d - 1) {
if (s[i] == '.' && s[i + 1] == '.' && s[i + 2] == '.')
flg = true;
}
if (!flg)
ok = false;
}
if (ok)
cout << "Yes" << endl;
else
cout << "No" << endl;
} | #include <bits/stdc++.h>
using namespace std;
// #define int long long
#define rep(i, n) for (long long i = (long long)(0); i < (long long)(n); ++i)
#define reps(i, n) for (long long i = (long long)(1); i <= (long long)(n); ++i)
#define rrep(i, n) for (long long i = ((long long)(n)-1); i >= 0; i--)
#define rreps(i, n) for (long long i = ((long long)(n)); i > 0; i--)
#define irep(i, m, n) \
for (long long i = (long long)(m); i < (long long)(n); ++i)
#define ireps(i, m, n) \
for (long long i = (long long)(m); i <= (long long)(n); ++i)
#define SORT(v, n) sort(v, v + n);
#define REVERSE(v, n) reverse(v, v + n);
#define vsort(v) sort(v.begin(), v.end());
#define all(v) v.begin(), v.end()
#define mp(n, m) make_pair(n, m);
#define cout(d) cout << d << endl;
#define coutd(d) cout << std::setprecision(10) << d << endl;
#define cinline(n) getline(cin, n);
#define replace_all(s, b, a) replace(s.begin(), s.end(), b, a);
#define PI (acos(-1))
#define FILL(v, n, x) fill(v, v + n, x);
#define sz(x) long long(x.size())
using ll = long long;
using vi = vector<int>;
using vvi = vector<vi>;
using vll = vector<ll>;
using vvll = vector<vll>;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using vs = vector<string>;
using vpll = vector<pair<ll, ll>>;
using vtp = vector<tuple<ll, ll, ll>>;
using vb = vector<bool>;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
const ll INF = 1e15;
const ll MOD = 1e9 + 7;
const ll LINF = 1e18;
signed main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll n, a, b, c, d;
cin >> n >> a >> b >> c >> d;
a--, b--, c--, d--;
string s;
cin >> s;
bool ok = true;
irep(i, a, c) {
if (s[i] == '#' && s[i + 1] == '#')
ok = false;
}
irep(i, b, d) {
if (s[i] == '#' && s[i + 1] == '#')
ok = false;
}
if (c > d) {
bool flg = false;
irep(i, b - 1, d) {
if (s[i] == '.' && s[i + 1] == '.' && s[i + 2] == '.')
flg = true;
}
if (!flg)
ok = false;
}
if (ok)
cout << "Yes" << endl;
else
cout << "No" << endl;
} | [
"expression.operation.binary.remove"
] | 829,971 | 829,972 | u530107518 | cpp |
p03017 | #include <bits/stdc++.h>
using namespace std;
// #define int long long
#define rep(i, n) for (long long i = (long long)(0); i < (long long)(n); ++i)
#define reps(i, n) for (long long i = (long long)(1); i <= (long long)(n); ++i)
#define rrep(i, n) for (long long i = ((long long)(n)-1); i >= 0; i--)
#define rreps(i, n) for (long long i = ((long long)(n)); i > 0; i--)
#define irep(i, m, n) \
for (long long i = (long long)(m); i < (long long)(n); ++i)
#define ireps(i, m, n) \
for (long long i = (long long)(m); i <= (long long)(n); ++i)
#define SORT(v, n) sort(v, v + n);
#define REVERSE(v, n) reverse(v, v + n);
#define vsort(v) sort(v.begin(), v.end());
#define all(v) v.begin(), v.end()
#define mp(n, m) make_pair(n, m);
#define cout(d) cout << d << endl;
#define coutd(d) cout << std::setprecision(10) << d << endl;
#define cinline(n) getline(cin, n);
#define replace_all(s, b, a) replace(s.begin(), s.end(), b, a);
#define PI (acos(-1))
#define FILL(v, n, x) fill(v, v + n, x);
#define sz(x) long long(x.size())
using ll = long long;
using vi = vector<int>;
using vvi = vector<vi>;
using vll = vector<ll>;
using vvll = vector<vll>;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using vs = vector<string>;
using vpll = vector<pair<ll, ll>>;
using vtp = vector<tuple<ll, ll, ll>>;
using vb = vector<bool>;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
const ll INF = 1e15;
const ll MOD = 1e9 + 7;
const ll LINF = 1e18;
signed main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll n, a, b, c, d;
cin >> n >> a >> b >> c >> d;
a--, b--, c--, d--;
string s;
cin >> s;
bool ok = true;
irep(i, a, c) {
if (s[i] == '#' && s[i + 1] == '#')
ok = false;
}
irep(i, b, d) {
if (s[i] == '#' && s[i + 1] == '#')
ok = false;
}
if (c > d) {
bool flg = false;
irep(i, b - 1, c - 1) {
if (s[i] == '.' && s[i + 1] == '.' && s[i + 2] == '.')
flg = true;
}
if (!flg)
ok = false;
}
if (ok)
cout << "Yes" << endl;
else
cout << "No" << endl;
} | #include <bits/stdc++.h>
using namespace std;
// #define int long long
#define rep(i, n) for (long long i = (long long)(0); i < (long long)(n); ++i)
#define reps(i, n) for (long long i = (long long)(1); i <= (long long)(n); ++i)
#define rrep(i, n) for (long long i = ((long long)(n)-1); i >= 0; i--)
#define rreps(i, n) for (long long i = ((long long)(n)); i > 0; i--)
#define irep(i, m, n) \
for (long long i = (long long)(m); i < (long long)(n); ++i)
#define ireps(i, m, n) \
for (long long i = (long long)(m); i <= (long long)(n); ++i)
#define SORT(v, n) sort(v, v + n);
#define REVERSE(v, n) reverse(v, v + n);
#define vsort(v) sort(v.begin(), v.end());
#define all(v) v.begin(), v.end()
#define mp(n, m) make_pair(n, m);
#define cout(d) cout << d << endl;
#define coutd(d) cout << std::setprecision(10) << d << endl;
#define cinline(n) getline(cin, n);
#define replace_all(s, b, a) replace(s.begin(), s.end(), b, a);
#define PI (acos(-1))
#define FILL(v, n, x) fill(v, v + n, x);
#define sz(x) long long(x.size())
using ll = long long;
using vi = vector<int>;
using vvi = vector<vi>;
using vll = vector<ll>;
using vvll = vector<vll>;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using vs = vector<string>;
using vpll = vector<pair<ll, ll>>;
using vtp = vector<tuple<ll, ll, ll>>;
using vb = vector<bool>;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
const ll INF = 1e15;
const ll MOD = 1e9 + 7;
const ll LINF = 1e18;
signed main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll n, a, b, c, d;
cin >> n >> a >> b >> c >> d;
a--, b--, c--, d--;
string s;
cin >> s;
bool ok = true;
irep(i, a, c) {
if (s[i] == '#' && s[i + 1] == '#')
ok = false;
}
irep(i, b, d) {
if (s[i] == '#' && s[i + 1] == '#')
ok = false;
}
if (c > d) {
bool flg = false;
irep(i, b - 1, d) {
if (s[i] == '.' && s[i + 1] == '.' && s[i + 2] == '.')
flg = true;
}
if (!flg)
ok = false;
}
if (ok)
cout << "Yes" << endl;
else
cout << "No" << endl;
} | [
"call.arguments.change",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 829,973 | 829,972 | u530107518 | cpp |
p03017 | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = (int)(0); i < (int)(n); ++i)
#define REPE(i, n) for (int i = (int)(0); i <= (int)(n); ++i)
#define REPR(i, m, n) for (int i = (int)(m); i < (int)(n); ++i)
#define REPRE(i, m, n) for (int i = (int)(m); i <= (int)(n); ++i)
#define FOR(e, c) for (auto &e : c)
#define SORT(v, n) sort(v, v + n);
#define VSORT(v) sort(v.begin(), v.end());
using VI = vector<int>;
using VVI = vector<VI>;
using PII = pair<int, int>;
using ll = long long;
int main() {
int n, a, b, c, d;
string s;
cin >> n >> a >> b >> c >> d;
cin >> s;
a--;
b--;
c--;
d--;
if (c < d) {
string ans = "Yes";
for (int i = a; i < d; i++) {
if (s[i] == '#' & s[i + 1] == '#') {
ans = "No";
}
}
cout << ans << endl;
return 0;
} else {
string ans = "No";
for (int i = a; i < c; i++) {
if (s[i] == '#' & s[i + 1] == '#') {
cout << ans << endl;
return 0;
}
}
for (int i = b - 1; i <= d + 1; i++) {
if (s[i] == '.' & s[i + 1] == '.' & s[i + 2] == '.')
ans = "Yes";
}
cout << ans << endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = (int)(0); i < (int)(n); ++i)
#define REPE(i, n) for (int i = (int)(0); i <= (int)(n); ++i)
#define REPR(i, m, n) for (int i = (int)(m); i < (int)(n); ++i)
#define REPRE(i, m, n) for (int i = (int)(m); i <= (int)(n); ++i)
#define FOR(e, c) for (auto &e : c)
#define SORT(v, n) sort(v, v + n);
#define VSORT(v) sort(v.begin(), v.end());
using VI = vector<int>;
using VVI = vector<VI>;
using PII = pair<int, int>;
using ll = long long;
int main() {
int n, a, b, c, d;
string s;
cin >> n >> a >> b >> c >> d;
cin >> s;
a--;
b--;
c--;
d--;
if (c < d) {
string ans = "Yes";
for (int i = a; i < d; i++) {
if (s[i] == '#' & s[i + 1] == '#') {
ans = "No";
}
}
cout << ans << endl;
return 0;
} else {
string ans = "No";
for (int i = a; i < c; i++) {
if (s[i] == '#' & s[i + 1] == '#') {
cout << ans << endl;
return 0;
}
}
for (int i = b - 1; i <= d - 1; i++) {
if (s[i] == '.' & s[i + 1] == '.' & s[i + 2] == '.')
ans = "Yes";
}
cout << ans << endl;
}
return 0;
} | [
"misc.opposites",
"expression.operator.arithmetic.change",
"control_flow.branch.if.condition.change"
] | 829,974 | 829,975 | u530107518 | cpp |
p03017 | #define _CRT_SECURE_NO_WARNINGS
#include <algorithm>
#include <functional>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <vector>
#define _USE_MATH_DEFINES
#include <deque>
#include <iostream>
#include <math.h>
#include <set>
using namespace std;
typedef long long ll;
#define rep(i, a, b) for (auto i = a; i < b; i++)
#define all(_x) _x.begin(), _x.end()
#define r_sort(_x) sort(_x.begin(), _x.end(), std::greater<int>())
#define vec_cnt(_a, _n) (upper_bound(all(_a), _n) - lower_bound(all(_a), _n))
#define INF 1 << 30
#define MAX 1000000000
#define SIZE 1000000000
int main() {
int n, a, b, c, d, f, t;
scanf("%d%d%d%d%d", &n, &a, &b, &c, &d);
char str[200000];
scanf("%s", str);
a--, b--, c--, d--;
if (a < b) {
swap(a, b);
swap(c, d);
} // a > bにする
// printf("%d-%d %d-%d\n", a, c, b, d);
if (c > d) {
f = 1;
rep(i, b, c) {
if (str[i] == '#' && str[i] == str[i + 1]) {
f = 0;
break;
}
}
puts(f ? "Yes" : "No");
} else { // c < d
f = 0;
rep(i, a - 1, c - 1) {
if (str[i] == '.' && str[i + 1] == '.' && str[i + 2] == '.') {
f++;
}
}
rep(i, b, d) {
if (str[i] == '#' && str[i] == str[i + 1]) {
f = 0;
break;
}
}
puts(f ? "Yes" : "No");
}
return 0;
} | #define _CRT_SECURE_NO_WARNINGS
#include <algorithm>
#include <functional>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <vector>
#define _USE_MATH_DEFINES
#include <deque>
#include <iostream>
#include <math.h>
#include <set>
using namespace std;
typedef long long ll;
#define rep(i, a, b) for (auto i = a; i < b; i++)
#define all(_x) _x.begin(), _x.end()
#define r_sort(_x) sort(_x.begin(), _x.end(), std::greater<int>())
#define vec_cnt(_a, _n) (upper_bound(all(_a), _n) - lower_bound(all(_a), _n))
#define INF 1 << 30
#define MAX 1000000000
#define SIZE 1000000000
int main() {
int n, a, b, c, d, f, t;
scanf("%d%d%d%d%d", &n, &a, &b, &c, &d);
char str[200000];
scanf("%s", str);
a--, b--, c--, d--;
if (a < b) {
swap(a, b);
swap(c, d);
} // a > bにする
// printf("%d-%d %d-%d\n", a, c, b, d);
if (c > d) {
f = 1;
rep(i, b, c) {
if (str[i] == '#' && str[i] == str[i + 1]) {
f = 0;
break;
}
}
puts(f ? "Yes" : "No");
} else { // c < d
f = 0;
rep(i, a - 1, c) {
if (str[i] == '.' && str[i + 1] == '.' && str[i + 2] == '.') {
f++;
}
}
rep(i, b, d) {
if (str[i] == '#' && str[i] == str[i + 1]) {
f = 0;
break;
}
}
puts(f ? "Yes" : "No");
}
return 0;
} | [
"expression.operation.binary.remove"
] | 829,981 | 829,982 | u128572736 | cpp |
p03017 | #define _CRT_SECURE_NO_WARNINGS
#include <algorithm>
#include <functional>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <vector>
#define _USE_MATH_DEFINES
#include <deque>
#include <iostream>
#include <math.h>
#include <set>
using namespace std;
typedef long long ll;
#define rep(i, a, b) for (auto i = a; i < b; i++)
#define all(_x) _x.begin(), _x.end()
#define r_sort(_x) sort(_x.begin(), _x.end(), std::greater<int>())
#define vec_cnt(_a, _n) (upper_bound(all(_a), _n) - lower_bound(all(_a), _n))
#define INF 1 << 30
#define MAX 1000000000
#define SIZE 1000000000
int main() {
int n, a, b, c, d, f, t;
scanf("%d%d%d%d%d", &n, &a, &b, &c, &d);
char str[200000];
scanf("%s", str);
a--, b--, c--, d--;
if (a < b) {
swap(a, b);
swap(c, d);
} // a > bにする
// printf("%d-%d %d-%d\n", a, c, b, d);
if (c > d) {
f = 1;
rep(i, b, c) {
if (str[i] == '#' && str[i] == str[i + 1]) {
f = 0;
break;
}
}
puts(f ? "Yes" : "No");
} else {
f = 0;
rep(i, a, d - 1) {
if (str[i] == '.' && str[i + 1] == '.' && str[i + 2] == '.') {
f++;
}
}
rep(i, b, c) {
if (str[i] == '#' && str[i] == str[i + 1]) {
f = 0;
break;
}
}
puts(f ? "Yes" : "No");
}
return 0;
} | #define _CRT_SECURE_NO_WARNINGS
#include <algorithm>
#include <functional>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <vector>
#define _USE_MATH_DEFINES
#include <deque>
#include <iostream>
#include <math.h>
#include <set>
using namespace std;
typedef long long ll;
#define rep(i, a, b) for (auto i = a; i < b; i++)
#define all(_x) _x.begin(), _x.end()
#define r_sort(_x) sort(_x.begin(), _x.end(), std::greater<int>())
#define vec_cnt(_a, _n) (upper_bound(all(_a), _n) - lower_bound(all(_a), _n))
#define INF 1 << 30
#define MAX 1000000000
#define SIZE 1000000000
int main() {
int n, a, b, c, d, f, t;
scanf("%d%d%d%d%d", &n, &a, &b, &c, &d);
char str[200000];
scanf("%s", str);
a--, b--, c--, d--;
if (a < b) {
swap(a, b);
swap(c, d);
} // a > bにする
// printf("%d-%d %d-%d\n", a, c, b, d);
if (c > d) {
f = 1;
rep(i, b, c) {
if (str[i] == '#' && str[i] == str[i + 1]) {
f = 0;
break;
}
}
puts(f ? "Yes" : "No");
} else { // c < d
f = 0;
rep(i, a - 1, c) {
if (str[i] == '.' && str[i + 1] == '.' && str[i + 2] == '.') {
f++;
}
}
rep(i, b, d) {
if (str[i] == '#' && str[i] == str[i + 1]) {
f = 0;
break;
}
}
puts(f ? "Yes" : "No");
}
return 0;
} | [
"call.arguments.change",
"call.arguments.add"
] | 829,984 | 829,982 | u128572736 | cpp |
p03017 | #define _CRT_SECURE_NO_WARNINGS
#include <algorithm>
#include <functional>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <vector>
#define _USE_MATH_DEFINES
#include <deque>
#include <iostream>
#include <math.h>
#include <set>
using namespace std;
typedef long long ll;
#define rep(i, a, b) for (auto i = a; i < b; i++)
#define all(_x) _x.begin(), _x.end()
#define r_sort(_x) sort(_x.begin(), _x.end(), std::greater<int>())
#define vec_cnt(_a, _n) (upper_bound(all(_a), _n) - lower_bound(all(_a), _n))
#define INF 1 << 30
#define MAX 1000000000
#define SIZE 1000000000
int main() {
int n, a, b, c, d, f, t;
scanf("%d%d%d%d%d", &n, &a, &b, &c, &d);
char str[200000];
scanf("%s", str);
a--, b--, c--, d--;
if (a < b) {
swap(a, b);
swap(c, d);
} // a > bにする
// printf("%d-%d %d-%d\n", a, c, b, d);
if (c > d) {
f = 1;
rep(i, b, c) {
if (str[i] == '#' && str[i] == str[i + 1]) {
f = 0;
break;
}
}
puts(f ? "Yes" : "No");
} else {
f = 0;
rep(i, a - 1, d - 1) {
if (str[i] == '.' && str[i + 1] == '.' && str[i + 2] == '.') {
f++;
}
}
rep(i, b, c) {
if (str[i] == '#' && str[i] == str[i + 1]) {
f = 0;
break;
}
}
puts(f ? "Yes" : "No");
}
return 0;
} | #define _CRT_SECURE_NO_WARNINGS
#include <algorithm>
#include <functional>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <vector>
#define _USE_MATH_DEFINES
#include <deque>
#include <iostream>
#include <math.h>
#include <set>
using namespace std;
typedef long long ll;
#define rep(i, a, b) for (auto i = a; i < b; i++)
#define all(_x) _x.begin(), _x.end()
#define r_sort(_x) sort(_x.begin(), _x.end(), std::greater<int>())
#define vec_cnt(_a, _n) (upper_bound(all(_a), _n) - lower_bound(all(_a), _n))
#define INF 1 << 30
#define MAX 1000000000
#define SIZE 1000000000
int main() {
int n, a, b, c, d, f, t;
scanf("%d%d%d%d%d", &n, &a, &b, &c, &d);
char str[200000];
scanf("%s", str);
a--, b--, c--, d--;
if (a < b) {
swap(a, b);
swap(c, d);
} // a > bにする
// printf("%d-%d %d-%d\n", a, c, b, d);
if (c > d) {
f = 1;
rep(i, b, c) {
if (str[i] == '#' && str[i] == str[i + 1]) {
f = 0;
break;
}
}
puts(f ? "Yes" : "No");
} else { // c < d
f = 0;
rep(i, a - 1, c) {
if (str[i] == '.' && str[i + 1] == '.' && str[i + 2] == '.') {
f++;
}
}
rep(i, b, d) {
if (str[i] == '#' && str[i] == str[i + 1]) {
f = 0;
break;
}
}
puts(f ? "Yes" : "No");
}
return 0;
} | [
"call.arguments.change",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 829,985 | 829,982 | u128572736 | cpp |
p03017 | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main() {
int n, a, b, c, d;
string s;
cin >> n >> a >> b >> c >> d >> s;
int mx = max(c, d);
for (int i = a; i < mx; i++) {
if (s[i - 1] == '#' && s[i - 1] == s[i]) {
cout << "No" << endl;
return 0;
}
}
if (c < d) {
cout << "Yes" << endl;
} else {
for (int i = b - 1; i < d - 2; i++) {
if (s[i] == '.' && s[i] == s[i + 1] && s[i] == s[i + 2]) {
cout << "Yes" << endl;
return 0;
}
}
cout << "No" << endl;
}
return 0;
} | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main() {
int n, a, b, c, d;
string s;
cin >> n >> a >> b >> c >> d >> s;
int mx = max(c, d);
for (int i = a; i < mx; i++) {
if (s[i - 1] == '#' && s[i - 1] == s[i]) {
cout << "No" << endl;
return 0;
}
}
if (c < d) {
cout << "Yes" << endl;
} else {
for (int i = b - 2; i < d - 1; i++) {
if (s[i] == '.' && s[i] == s[i + 1] && s[i] == s[i + 2]) {
cout << "Yes" << endl;
return 0;
}
}
cout << "No" << endl;
}
return 0;
} | [
"literal.number.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"expression.operation.binary.change",
"control_flow.branch.if.condition.change"
] | 829,986 | 829,987 | u955202970 | cpp |
p03017 | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main() {
int n, a, b, c, d;
string s;
cin >> n >> a >> b >> c >> d >> s;
int mx = max(c, d);
for (int i = a; i < mx; i++) {
if (s[i - 1] == '#' && s[i - 1] == s[i]) {
cout << "No" << endl;
return 0;
}
}
if (c < d) {
cout << "Yes" << endl;
} else {
for (int i = a - 1; i < d - 2; i++) {
if (s[i] == '.' && s[i] == s[i + 1] && s[i] == s[i + 2]) {
cout << "Yes" << endl;
return 0;
}
}
cout << "No" << endl;
}
return 0;
} | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main() {
int n, a, b, c, d;
string s;
cin >> n >> a >> b >> c >> d >> s;
int mx = max(c, d);
for (int i = a; i < mx; i++) {
if (s[i - 1] == '#' && s[i - 1] == s[i]) {
cout << "No" << endl;
return 0;
}
}
if (c < d) {
cout << "Yes" << endl;
} else {
for (int i = b - 2; i < d - 1; i++) {
if (s[i] == '.' && s[i] == s[i + 1] && s[i] == s[i + 2]) {
cout << "Yes" << endl;
return 0;
}
}
cout << "No" << endl;
}
return 0;
} | [
"identifier.change",
"control_flow.loop.for.initializer.change",
"expression.operation.binary.change",
"literal.number.change",
"expression.off_by_one",
"control_flow.branch.if.condition.change"
] | 829,988 | 829,987 | u955202970 | cpp |
p03017 | #include <algorithm>
#include <array>
#include <bitset>
#include <cmath>
#include <complex>
#include <cstdio>
#include <deque>
#include <float.h>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <string.h>
#include <string>
#include <tuple>
#include <unordered_map>
#include <vector>
using namespace std;
#define int long long
#define I32_MAX 2147483647
#define I64_MAX 9223372036854775807LL
#define I64_MAX2 1223372036854775807LL
#define INF I64_MAX2
#define MOD 1000000007
#define MEM_SIZE 10000
#define DEBUG_OUT true
#define ALL(x) (x).begin(), (x).end()
template <typename T> void DEBUG(T e) {
if (DEBUG_OUT == false)
return;
std::cout << e << " ";
}
template <typename T> void DEBUG(const std::vector<T> &v) {
if (DEBUG_OUT == false)
return;
for (const auto &e : v) {
std::cout << e << " ";
}
std::cout << std::endl;
}
template <typename T> void DEBUG(const std::vector<std::vector<T>> &vv) {
if (DEBUG_OUT == false)
return;
for (const auto &v : vv) {
DEBUG(v);
}
}
template <class T, class... Ts> void DEBUG(T d, Ts... e) {
if (DEBUG_OUT == false)
return;
DEBUG(d);
DEBUG(e...);
}
template <class T> void corner(bool flg, T hoge) {
if (flg) {
cout << hoge << endl;
exit(0);
}
}
template <typename T1, typename T2> inline bool chmax(T1 &a, T2 b) {
return a < b && (a = b, true);
}
template <typename T1, typename T2> inline bool chmin(T1 &a, T2 b) {
return a > b && (a = b, true);
}
// solve
// int D
void solve(void) {
int N;
cin >> N;
int A, B;
cin >> A;
cin >> B;
int C, D;
cin >> C;
cin >> D;
string str;
cin >> str;
bool pass = 0;
str += "#";
bool ok = 1;
for (int i = A - 1; i < C - 1; i++) {
if (str[i] == '#' && str[i + 1] == '#')
ok = 0;
}
for (int i = B - 1; i < D - 1; i++) {
if (str[i] == '#' && str[i + 1] == '#')
ok = 0;
}
int check = 0;
for (int i = B - 2; i < D - 2; i++) {
if (str[i] == '.' && str[i + 1] == '.' && str[i + 2] == '.')
check = 1;
}
if (C > D)
ok &= check;
cout << (ok ? "Yes" : "No") << endl;
return;
}
int32_t main(int32_t argc, const char *argv[]) {
std::ios::sync_with_stdio(false);
std::cin.tie(0);
std::cout << std::fixed;
std::cout << std::setprecision(9);
solve();
return 0;
}
| #include <algorithm>
#include <array>
#include <bitset>
#include <cmath>
#include <complex>
#include <cstdio>
#include <deque>
#include <float.h>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <string.h>
#include <string>
#include <tuple>
#include <unordered_map>
#include <vector>
using namespace std;
#define int long long
#define I32_MAX 2147483647
#define I64_MAX 9223372036854775807LL
#define I64_MAX2 1223372036854775807LL
#define INF I64_MAX2
#define MOD 1000000007
#define MEM_SIZE 10000
#define DEBUG_OUT true
#define ALL(x) (x).begin(), (x).end()
template <typename T> void DEBUG(T e) {
if (DEBUG_OUT == false)
return;
std::cout << e << " ";
}
template <typename T> void DEBUG(const std::vector<T> &v) {
if (DEBUG_OUT == false)
return;
for (const auto &e : v) {
std::cout << e << " ";
}
std::cout << std::endl;
}
template <typename T> void DEBUG(const std::vector<std::vector<T>> &vv) {
if (DEBUG_OUT == false)
return;
for (const auto &v : vv) {
DEBUG(v);
}
}
template <class T, class... Ts> void DEBUG(T d, Ts... e) {
if (DEBUG_OUT == false)
return;
DEBUG(d);
DEBUG(e...);
}
template <class T> void corner(bool flg, T hoge) {
if (flg) {
cout << hoge << endl;
exit(0);
}
}
template <typename T1, typename T2> inline bool chmax(T1 &a, T2 b) {
return a < b && (a = b, true);
}
template <typename T1, typename T2> inline bool chmin(T1 &a, T2 b) {
return a > b && (a = b, true);
}
// solve
// int D
void solve(void) {
int N;
cin >> N;
int A, B;
cin >> A;
cin >> B;
int C, D;
cin >> C;
cin >> D;
string str;
cin >> str;
bool pass = 0;
str += "#";
bool ok = 1;
for (int i = A - 1; i < C - 1; i++) {
if (str[i] == '#' && str[i + 1] == '#')
ok = 0;
}
for (int i = B - 1; i < D - 1; i++) {
if (str[i] == '#' && str[i + 1] == '#')
ok = 0;
}
int check = 0;
for (int i = B - 2; i <= D - 2; i++) {
if (str[i] == '.' && str[i + 1] == '.' && str[i + 2] == '.')
check = 1;
}
if (C > D)
ok &= check;
cout << (ok ? "Yes" : "No") << endl;
return;
}
int32_t main(int32_t argc, const char *argv[]) {
std::ios::sync_with_stdio(false);
std::cin.tie(0);
std::cout << std::fixed;
std::cout << std::setprecision(9);
solve();
return 0;
}
| [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 829,998 | 829,999 | u221285045 | cpp |
p03017 | #include <algorithm>
#include <array>
#include <bitset>
#include <cmath>
#include <complex>
#include <cstdio>
#include <deque>
#include <float.h>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <string.h>
#include <string>
#include <tuple>
#include <unordered_map>
#include <vector>
using namespace std;
#define int long long
#define I32_MAX 2147483647
#define I64_MAX 9223372036854775807LL
#define I64_MAX2 1223372036854775807LL
#define INF I64_MAX2
#define MOD 1000000007
#define MEM_SIZE 10000
#define DEBUG_OUT true
#define ALL(x) (x).begin(), (x).end()
template <typename T> void DEBUG(T e) {
if (DEBUG_OUT == false)
return;
std::cout << e << " ";
}
template <typename T> void DEBUG(const std::vector<T> &v) {
if (DEBUG_OUT == false)
return;
for (const auto &e : v) {
std::cout << e << " ";
}
std::cout << std::endl;
}
template <typename T> void DEBUG(const std::vector<std::vector<T>> &vv) {
if (DEBUG_OUT == false)
return;
for (const auto &v : vv) {
DEBUG(v);
}
}
template <class T, class... Ts> void DEBUG(T d, Ts... e) {
if (DEBUG_OUT == false)
return;
DEBUG(d);
DEBUG(e...);
}
template <class T> void corner(bool flg, T hoge) {
if (flg) {
cout << hoge << endl;
exit(0);
}
}
template <typename T1, typename T2> inline bool chmax(T1 &a, T2 b) {
return a < b && (a = b, true);
}
template <typename T1, typename T2> inline bool chmin(T1 &a, T2 b) {
return a > b && (a = b, true);
}
// solve
// int D
void solve(void) {
int N;
cin >> N;
int A, B;
cin >> A;
cin >> B;
int C, D;
cin >> C;
cin >> D;
string str;
cin >> str;
bool pass = 0;
str += "#";
bool ok = 1;
for (int i = A - 1; i < C - 2; i++) {
if (str[i] == '#' && str[i + 1] == '#')
ok = 0;
}
for (int i = B - 1; i < D - 2; i++) {
if (str[i] == '#' && str[i + 1] == '#')
ok = 0;
}
int check = 0;
for (int i = B - 2; i < D - 2; i++) {
if (str[i] == '.' && str[i + 1] == '.' && str[i + 2] == '.')
check = 1;
}
if (C > D)
ok &= check;
cout << (ok ? "Yes" : "No") << endl;
return;
}
int32_t main(int32_t argc, const char *argv[]) {
std::ios::sync_with_stdio(false);
std::cin.tie(0);
std::cout << std::fixed;
std::cout << std::setprecision(9);
solve();
return 0;
}
| #include <algorithm>
#include <array>
#include <bitset>
#include <cmath>
#include <complex>
#include <cstdio>
#include <deque>
#include <float.h>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <string.h>
#include <string>
#include <tuple>
#include <unordered_map>
#include <vector>
using namespace std;
#define int long long
#define I32_MAX 2147483647
#define I64_MAX 9223372036854775807LL
#define I64_MAX2 1223372036854775807LL
#define INF I64_MAX2
#define MOD 1000000007
#define MEM_SIZE 10000
#define DEBUG_OUT true
#define ALL(x) (x).begin(), (x).end()
template <typename T> void DEBUG(T e) {
if (DEBUG_OUT == false)
return;
std::cout << e << " ";
}
template <typename T> void DEBUG(const std::vector<T> &v) {
if (DEBUG_OUT == false)
return;
for (const auto &e : v) {
std::cout << e << " ";
}
std::cout << std::endl;
}
template <typename T> void DEBUG(const std::vector<std::vector<T>> &vv) {
if (DEBUG_OUT == false)
return;
for (const auto &v : vv) {
DEBUG(v);
}
}
template <class T, class... Ts> void DEBUG(T d, Ts... e) {
if (DEBUG_OUT == false)
return;
DEBUG(d);
DEBUG(e...);
}
template <class T> void corner(bool flg, T hoge) {
if (flg) {
cout << hoge << endl;
exit(0);
}
}
template <typename T1, typename T2> inline bool chmax(T1 &a, T2 b) {
return a < b && (a = b, true);
}
template <typename T1, typename T2> inline bool chmin(T1 &a, T2 b) {
return a > b && (a = b, true);
}
// solve
// int D
void solve(void) {
int N;
cin >> N;
int A, B;
cin >> A;
cin >> B;
int C, D;
cin >> C;
cin >> D;
string str;
cin >> str;
bool pass = 0;
str += "#";
bool ok = 1;
for (int i = A - 1; i < C - 1; i++) {
if (str[i] == '#' && str[i + 1] == '#')
ok = 0;
}
for (int i = B - 1; i < D - 1; i++) {
if (str[i] == '#' && str[i + 1] == '#')
ok = 0;
}
int check = 0;
for (int i = B - 2; i <= D - 2; i++) {
if (str[i] == '.' && str[i + 1] == '.' && str[i + 2] == '.')
check = 1;
}
if (C > D)
ok &= check;
cout << (ok ? "Yes" : "No") << endl;
return;
}
int32_t main(int32_t argc, const char *argv[]) {
std::ios::sync_with_stdio(false);
std::cin.tie(0);
std::cout << std::fixed;
std::cout << std::setprecision(9);
solve();
return 0;
}
| [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"expression.operator.compare.change"
] | 830,000 | 829,999 | u221285045 | cpp |
p03017 | #include <iostream>
#include <string>
using namespace std;
int main() {
int n, a, b, c, d;
cin >> n >> a >> b >> c >> d;
string s;
cin >> s;
bool ok = true;
for (size_t i = (a - 1); i < (c - 1); i++) {
if (s[i] == '#' && s[i + 1] == '#') {
ok = false;
}
}
for (size_t i = (b - 1); i < (d - 1); i++) {
if (s[i] == '#' && s[i + 1] == '#') {
ok = false;
}
}
if (c > d) {
bool snuke = false;
for (size_t i = (b - 2); i < (d - 2); i++) {
if (s.substr(i, 3) == "...") {
snuke = true;
}
}
cout << (snuke && ok ? "Yes" : "No") << endl;
} else {
cout << (ok ? "Yes" : "No") << endl;
}
} | #include <iostream>
#include <string>
using namespace std;
int main() {
int n, a, b, c, d;
cin >> n >> a >> b >> c >> d;
string s;
cin >> s;
bool ok = true;
for (size_t i = (a - 1); i < (c - 1); i++) {
if (s[i] == '#' && s[i + 1] == '#') {
ok = false;
}
}
for (size_t i = (b - 1); i < (d - 1); i++) {
if (s[i] == '#' && s[i + 1] == '#') {
ok = false;
}
}
if (c > d) {
bool snuke = false;
for (size_t i = (b - 2); i < (d - 1); i++) {
if (s.substr(i, 3) == "...") {
snuke = true;
}
}
cout << (snuke && ok ? "Yes" : "No") << endl;
} else {
cout << (ok ? "Yes" : "No") << endl;
}
} | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 830,016 | 830,017 | u789199225 | cpp |
p03017 | #include <iostream>
#include <string>
using namespace std;
int main() {
int n, a, b, c, d;
cin >> n >> a >> b >> c >> d;
string s;
cin >> s;
bool ok = true;
for (size_t i = (a - 1); i < (c - 1); i++) {
if (s[i] == '#' && s[i + 1] == '#') {
ok = false;
}
}
for (size_t i = (b - 1); i < (d - 1); i++) {
if (s[i] == '#' && s[i + 1] == '#') {
ok = false;
}
}
if (c > d) {
bool snuke = false;
for (size_t i = (b - 1); i < (d - 2); i++) {
if (s.substr(i, 3) == "...") {
snuke = true;
}
}
cout << (snuke && ok ? "Yes" : "No") << endl;
} else {
cout << (ok ? "Yes" : "No") << endl;
}
} | #include <iostream>
#include <string>
using namespace std;
int main() {
int n, a, b, c, d;
cin >> n >> a >> b >> c >> d;
string s;
cin >> s;
bool ok = true;
for (size_t i = (a - 1); i < (c - 1); i++) {
if (s[i] == '#' && s[i + 1] == '#') {
ok = false;
}
}
for (size_t i = (b - 1); i < (d - 1); i++) {
if (s[i] == '#' && s[i + 1] == '#') {
ok = false;
}
}
if (c > d) {
bool snuke = false;
for (size_t i = (b - 2); i < (d - 1); i++) {
if (s.substr(i, 3) == "...") {
snuke = true;
}
}
cout << (snuke && ok ? "Yes" : "No") << endl;
} else {
cout << (ok ? "Yes" : "No") << endl;
}
} | [
"literal.number.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"expression.operation.binary.change",
"control_flow.branch.if.condition.change"
] | 830,018 | 830,017 | u789199225 | cpp |
p03017 | #include <iostream>
#include <string>
using namespace std;
int main() {
int n, a, b, c, d;
cin >> n >> a >> b >> c >> d;
string s;
cin >> s;
bool ok = true;
for (size_t i = (a - 1); i < (c - 1); i++) {
if (s[i] == '#' && s[i + 1] == '#') {
ok = false;
}
}
for (size_t i = (b - 1); i < (d - 1); i++) {
if (s[i] == '#' && s[i + 1] == '#') {
ok = false;
}
}
if (c > d) {
bool snuke = false;
for (size_t i = (b - 1); i < (c - 2); i++) {
if (s.substr(i, 3) == "...") {
snuke = true;
}
}
cout << (snuke && ok ? "Yes" : "No") << endl;
} else {
cout << (ok ? "Yes" : "No") << endl;
}
} | #include <iostream>
#include <string>
using namespace std;
int main() {
int n, a, b, c, d;
cin >> n >> a >> b >> c >> d;
string s;
cin >> s;
bool ok = true;
for (size_t i = (a - 1); i < (c - 1); i++) {
if (s[i] == '#' && s[i + 1] == '#') {
ok = false;
}
}
for (size_t i = (b - 1); i < (d - 1); i++) {
if (s[i] == '#' && s[i + 1] == '#') {
ok = false;
}
}
if (c > d) {
bool snuke = false;
for (size_t i = (b - 2); i < (d - 1); i++) {
if (s.substr(i, 3) == "...") {
snuke = true;
}
}
cout << (snuke && ok ? "Yes" : "No") << endl;
} else {
cout << (ok ? "Yes" : "No") << endl;
}
} | [
"literal.number.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"expression.operation.binary.change",
"identifier.change",
"control_flow.branch.if.condition.change"
] | 830,019 | 830,017 | u789199225 | cpp |
p03017 | #include <iostream>
#include <string>
using namespace std;
int main() {
int n, a, b, c, d;
cin >> n >> a >> b >> c >> d;
string s;
cin >> s;
bool ok = true;
for (size_t i = (a - 1); i < (c - 1); i++) {
if (s[i] == '#' && s[i + 1] == '#') {
ok = false;
}
}
for (size_t i = (b - 1); i < (d - 1); i++) {
if (s[i] == '#' && s[i + 1] == '#') {
ok = false;
}
}
if (c > d) {
bool snuke = false;
for (size_t i = (a - 1); i < (c - 2); i++) {
if (s.substr(i, 3) == "...") {
snuke = true;
}
}
cout << (snuke && ok ? "Yes" : "No") << endl;
} else {
cout << (ok ? "Yes" : "No") << endl;
}
} | #include <iostream>
#include <string>
using namespace std;
int main() {
int n, a, b, c, d;
cin >> n >> a >> b >> c >> d;
string s;
cin >> s;
bool ok = true;
for (size_t i = (a - 1); i < (c - 1); i++) {
if (s[i] == '#' && s[i + 1] == '#') {
ok = false;
}
}
for (size_t i = (b - 1); i < (d - 1); i++) {
if (s[i] == '#' && s[i + 1] == '#') {
ok = false;
}
}
if (c > d) {
bool snuke = false;
for (size_t i = (b - 2); i < (d - 1); i++) {
if (s.substr(i, 3) == "...") {
snuke = true;
}
}
cout << (snuke && ok ? "Yes" : "No") << endl;
} else {
cout << (ok ? "Yes" : "No") << endl;
}
} | [
"identifier.change",
"control_flow.loop.for.initializer.change",
"expression.operation.binary.change",
"literal.number.change",
"expression.off_by_one",
"control_flow.branch.if.condition.change"
] | 830,020 | 830,017 | u789199225 | cpp |
p03017 | #include <iostream>
#include <string>
using namespace std;
int main() {
int n, a, b, c, d;
cin >> n >> a >> b >> c >> d;
string s;
cin >> s;
bool ok = true;
for (size_t i = (a - 1); i < (c - 1); i++) {
if (s[i] == '#' && s[i + 1] == '#') {
ok = false;
}
}
for (size_t i = (b - 1); i < (d - 1); i++) {
if (s[i] == '#' && s[i + 1] == '#') {
ok = false;
}
}
if (c >= d) {
bool snuke = false;
for (size_t i = (a - 1); i < (c - 1); i++) {
if (s.substr(i, 3) == "...") {
snuke = true;
}
}
cout << (snuke && ok ? "Yes" : "No") << endl;
} else {
cout << (ok ? "Yes" : "No") << endl;
}
} | #include <iostream>
#include <string>
using namespace std;
int main() {
int n, a, b, c, d;
cin >> n >> a >> b >> c >> d;
string s;
cin >> s;
bool ok = true;
for (size_t i = (a - 1); i < (c - 1); i++) {
if (s[i] == '#' && s[i + 1] == '#') {
ok = false;
}
}
for (size_t i = (b - 1); i < (d - 1); i++) {
if (s[i] == '#' && s[i + 1] == '#') {
ok = false;
}
}
if (c > d) {
bool snuke = false;
for (size_t i = (b - 2); i < (d - 1); i++) {
if (s.substr(i, 3) == "...") {
snuke = true;
}
}
cout << (snuke && ok ? "Yes" : "No") << endl;
} else {
cout << (ok ? "Yes" : "No") << endl;
}
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"identifier.change",
"control_flow.loop.for.initializer.change",
"expression.operation.binary.change",
"literal.number.change",
"expression.off_by_one"
] | 830,021 | 830,017 | u789199225 | cpp |
p03017 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define pb push_back
using namespace std;
typedef long long ll;
int main() {
int n, a, b, c, d;
cin >> n >> a >> b >> c >> d;
a--;
b--;
c--;
d--;
string s;
cin >> s;
if (c < d) {
for (int i = a + 1; i < d - 1; i++) {
if (s[i] == s[i + 1] && s[i] == '#') {
cout << "No" << endl;
return 0;
}
}
cout << "Yes" << endl;
return 0;
} else {
for (int i = a + 1; i < c - 1; i++) {
if (s[i] == s[i + 1] && s[i] == '#') {
cout << "No" << endl;
return 0;
}
}
bool ok = true;
for (int i = b; i <= d + 1; i++) {
if (s[i - 1] == s[i] && s[i] == s[i + 1] && s[i] == '.')
ok = false;
}
if (ok) {
cout << "No" << endl;
return 0;
} else {
cout << "Yes" << endl;
return 0;
}
}
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define pb push_back
using namespace std;
typedef long long ll;
int main() {
int n, a, b, c, d;
cin >> n >> a >> b >> c >> d;
a--;
b--;
c--;
d--;
string s;
cin >> s;
if (c < d) {
for (int i = a + 1; i < d - 1; i++) {
if (s[i] == s[i + 1] && s[i] == '#') {
cout << "No" << endl;
return 0;
}
}
cout << "Yes" << endl;
return 0;
} else {
for (int i = a + 1; i < c - 1; i++) {
if (s[i] == s[i + 1] && s[i] == '#') {
cout << "No" << endl;
return 0;
}
}
bool ok = true;
for (int i = b; i <= d; i++) {
if (s[i - 1] == s[i] && s[i] == s[i + 1] && s[i] == '.')
ok = false;
}
if (ok) {
cout << "No" << endl;
return 0;
} else {
cout << "Yes" << endl;
return 0;
}
}
} | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 830,022 | 830,023 | u314917898 | cpp |
p03017 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define pb push_back
using namespace std;
typedef long long ll;
int main() {
int n, a, b, c, d;
cin >> n >> a >> b >> c >> d;
a--;
b--;
c--;
d--;
string s;
cin >> s;
if (c < d) {
for (int i = a + 1; i < d - 1; i++) {
if (s[i] == s[i + 1] && s[i] == '#') {
cout << "No" << endl;
return 0;
}
}
cout << "Yes" << endl;
return 0;
} else {
for (int i = a + 1; i < c - 1; i++) {
if (s[i] == s[i + 1] && s[i] == '#') {
cout << "No" << endl;
return 0;
}
}
bool ok = true;
for (int i = b + 1; i < d; i++) {
if (s[i - 1] == s[i] && s[i] == s[i + 1] && s[i] == '.')
ok = false;
}
if (ok) {
cout << "No" << endl;
return 0;
} else {
cout << "Yes" << endl;
return 0;
}
}
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define pb push_back
using namespace std;
typedef long long ll;
int main() {
int n, a, b, c, d;
cin >> n >> a >> b >> c >> d;
a--;
b--;
c--;
d--;
string s;
cin >> s;
if (c < d) {
for (int i = a + 1; i < d - 1; i++) {
if (s[i] == s[i + 1] && s[i] == '#') {
cout << "No" << endl;
return 0;
}
}
cout << "Yes" << endl;
return 0;
} else {
for (int i = a + 1; i < c - 1; i++) {
if (s[i] == s[i + 1] && s[i] == '#') {
cout << "No" << endl;
return 0;
}
}
bool ok = true;
for (int i = b; i <= d; i++) {
if (s[i - 1] == s[i] && s[i] == s[i + 1] && s[i] == '.')
ok = false;
}
if (ok) {
cout << "No" << endl;
return 0;
} else {
cout << "Yes" << endl;
return 0;
}
}
} | [
"control_flow.loop.for.initializer.change",
"expression.operation.binary.remove",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 830,024 | 830,023 | u314917898 | cpp |
p03017 | #include <bits/stdc++.h>
using namespace std;
using int64 = long long;
#define int int64
#define rep(i, n) for (int i = 0; i < n; i++)
#define FOR(i, a, b) for (int i = a; i < b; i++)
#define SORT(x) sort(x.begin(), x.end())
#define GSORT(x) sort(x.begin(), x.end(), greater<int>())
#define mk make_pair
#define fi first
#define se second
#define pb push_back
#define ALL(x) x.begin(), x.end()
#define V(T) vector<T>
typedef pair<int, int> P;
typedef pair<P, P> PP;
typedef vector<int> vi;
typedef vector<vi> vvi;
int max(int a, int b) {
if (b > a)
return b;
else
return a;
}
int min(int a, int b) {
if (b < a)
return b;
else
return a;
}
signed main() {
int N, A, B, C, D;
string S;
cin >> N >> A >> B >> C >> D >> S;
bool acan = true, bcan = true;
FOR(i, A, C - 2) {
if (S[i] == '#' && S[i + 1] == '#')
acan = false;
}
FOR(i, B, D - 2) {
if (S[i] == '#' && S[i + 1] == '#')
bcan = false;
}
if (!acan || !bcan) {
cout << "No" << endl;
return 0;
}
if (C < D) {
cout << "Yes" << endl;
} else {
bool can = false;
FOR(i, B - 1, D) {
if (S[i] == '.' && S[i + 1] == '.' && S[i + 2] == '.') {
can = true;
break;
}
}
if (can)
cout << "Yes" << endl;
else
cout << "No" << endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using int64 = long long;
#define int int64
#define rep(i, n) for (int i = 0; i < n; i++)
#define FOR(i, a, b) for (int i = a; i < b; i++)
#define SORT(x) sort(x.begin(), x.end())
#define GSORT(x) sort(x.begin(), x.end(), greater<int>())
#define mk make_pair
#define fi first
#define se second
#define pb push_back
#define ALL(x) x.begin(), x.end()
#define V(T) vector<T>
typedef pair<int, int> P;
typedef pair<P, P> PP;
typedef vector<int> vi;
typedef vector<vi> vvi;
int max(int a, int b) {
if (b > a)
return b;
else
return a;
}
int min(int a, int b) {
if (b < a)
return b;
else
return a;
}
signed main() {
int N, A, B, C, D;
string S;
cin >> N >> A >> B >> C >> D >> S;
bool acan = true, bcan = true;
FOR(i, A, C - 2) {
if (S[i] == '#' && S[i + 1] == '#')
acan = false;
}
FOR(i, B, D - 2) {
if (S[i] == '#' && S[i + 1] == '#')
bcan = false;
}
if (!acan || !bcan) {
cout << "No" << endl;
return 0;
}
if (C < D) {
cout << "Yes" << endl;
} else {
bool can = false;
FOR(i, B - 2, D - 1) {
if (S[i] == '.' && S[i + 1] == '.' && S[i + 2] == '.') {
can = true;
break;
}
}
if (can)
cout << "Yes" << endl;
else
cout << "No" << endl;
}
return 0;
} | [
"literal.number.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 830,029 | 830,030 | u703503553 | cpp |
p03017 | #include <bits/stdc++.h>
using namespace std;
using int64 = long long;
#define int int64
#define rep(i, n) for (int i = 0; i < n; i++)
#define FOR(i, a, b) for (int i = a; i < b; i++)
#define SORT(x) sort(x.begin(), x.end())
#define GSORT(x) sort(x.begin(), x.end(), greater<int>())
#define mk make_pair
#define fi first
#define se second
#define pb push_back
#define ALL(x) x.begin(), x.end()
#define V(T) vector<T>
typedef pair<int, int> P;
typedef pair<P, P> PP;
typedef vector<int> vi;
typedef vector<vi> vvi;
int max(int a, int b) {
if (b > a)
return b;
else
return a;
}
int min(int a, int b) {
if (b < a)
return b;
else
return a;
}
signed main() {
int N, A, B, C, D;
string S;
cin >> N >> A >> B >> C >> D >> S;
bool acan = true, bcan = true;
FOR(i, A, C - 2) {
if (S[i] == '#' && S[i + 1] == '#')
acan = false;
}
FOR(i, B, D - 2) {
if (S[i] == '#' && S[i + 1] == '#')
bcan = false;
}
if (!acan || !bcan) {
cout << "No" << endl;
return 0;
}
if (C < D) {
cout << "Yes" << endl;
} else {
bool can = false;
FOR(i, B - 1, D - 1) {
if (S[i] == '.' && S[i + 1] == '.' && S[i + 2] == '.') {
can = true;
break;
}
}
if (can)
cout << "Yes" << endl;
else
cout << "No" << endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using int64 = long long;
#define int int64
#define rep(i, n) for (int i = 0; i < n; i++)
#define FOR(i, a, b) for (int i = a; i < b; i++)
#define SORT(x) sort(x.begin(), x.end())
#define GSORT(x) sort(x.begin(), x.end(), greater<int>())
#define mk make_pair
#define fi first
#define se second
#define pb push_back
#define ALL(x) x.begin(), x.end()
#define V(T) vector<T>
typedef pair<int, int> P;
typedef pair<P, P> PP;
typedef vector<int> vi;
typedef vector<vi> vvi;
int max(int a, int b) {
if (b > a)
return b;
else
return a;
}
int min(int a, int b) {
if (b < a)
return b;
else
return a;
}
signed main() {
int N, A, B, C, D;
string S;
cin >> N >> A >> B >> C >> D >> S;
bool acan = true, bcan = true;
FOR(i, A, C - 2) {
if (S[i] == '#' && S[i + 1] == '#')
acan = false;
}
FOR(i, B, D - 2) {
if (S[i] == '#' && S[i + 1] == '#')
bcan = false;
}
if (!acan || !bcan) {
cout << "No" << endl;
return 0;
}
if (C < D) {
cout << "Yes" << endl;
} else {
bool can = false;
FOR(i, B - 2, D - 1) {
if (S[i] == '.' && S[i + 1] == '.' && S[i + 2] == '.') {
can = true;
break;
}
}
if (can)
cout << "Yes" << endl;
else
cout << "No" << endl;
}
return 0;
} | [
"literal.number.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 830,031 | 830,030 | u703503553 | cpp |
p03017 | #include <bits/stdc++.h>
using namespace std;
using int64 = long long;
#define int int64
#define rep(i, n) for (int i = 0; i < n; i++)
#define FOR(i, a, b) for (int i = a; i < b; i++)
#define SORT(x) sort(x.begin(), x.end())
#define GSORT(x) sort(x.begin(), x.end(), greater<int>())
#define mk make_pair
#define fi first
#define se second
#define pb push_back
#define ALL(x) x.begin(), x.end()
#define V(T) vector<T>
typedef pair<int, int> P;
typedef pair<P, P> PP;
typedef vector<int> vi;
typedef vector<vi> vvi;
int max(int a, int b) {
if (b > a)
return b;
else
return a;
}
int min(int a, int b) {
if (b < a)
return b;
else
return a;
}
signed main() {
int N, A, B, C, D;
string S;
cin >> N >> A >> B >> C >> D >> S;
bool acan = true, bcan = true;
FOR(i, A, C - 2) {
if (S[i] == '#' && S[i + 1] == '#')
acan = false;
}
FOR(i, B, D - 2) {
if (S[i] == '#' && S[i + 1] == '#')
bcan = false;
}
if (!acan || !bcan) {
cout << "No" << endl;
return 0;
}
if (C < D) {
cout << "Yes" << endl;
} else {
bool can = false;
FOR(i, B - 1, D - 2) {
if (S[i] == '.' && S[i + 1] == '.' && S[i + 2] == '.') {
can = true;
break;
}
}
if (can)
cout << "Yes" << endl;
else
cout << "No" << endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using int64 = long long;
#define int int64
#define rep(i, n) for (int i = 0; i < n; i++)
#define FOR(i, a, b) for (int i = a; i < b; i++)
#define SORT(x) sort(x.begin(), x.end())
#define GSORT(x) sort(x.begin(), x.end(), greater<int>())
#define mk make_pair
#define fi first
#define se second
#define pb push_back
#define ALL(x) x.begin(), x.end()
#define V(T) vector<T>
typedef pair<int, int> P;
typedef pair<P, P> PP;
typedef vector<int> vi;
typedef vector<vi> vvi;
int max(int a, int b) {
if (b > a)
return b;
else
return a;
}
int min(int a, int b) {
if (b < a)
return b;
else
return a;
}
signed main() {
int N, A, B, C, D;
string S;
cin >> N >> A >> B >> C >> D >> S;
bool acan = true, bcan = true;
FOR(i, A, C - 2) {
if (S[i] == '#' && S[i + 1] == '#')
acan = false;
}
FOR(i, B, D - 2) {
if (S[i] == '#' && S[i + 1] == '#')
bcan = false;
}
if (!acan || !bcan) {
cout << "No" << endl;
return 0;
}
if (C < D) {
cout << "Yes" << endl;
} else {
bool can = false;
FOR(i, B - 2, D - 1) {
if (S[i] == '.' && S[i + 1] == '.' && S[i + 2] == '.') {
can = true;
break;
}
}
if (can)
cout << "Yes" << endl;
else
cout << "No" << endl;
}
return 0;
} | [
"literal.number.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 830,032 | 830,030 | u703503553 | cpp |
p03017 | #include <bits/stdc++.h>
using namespace std;
using int64 = long long;
#define int int64
#define rep(i, n) for (int i = 0; i < n; i++)
#define FOR(i, a, b) for (int i = a; i < b; i++)
#define SORT(x) sort(x.begin(), x.end())
#define GSORT(x) sort(x.begin(), x.end(), greater<int>())
#define mk make_pair
#define fi first
#define se second
#define pb push_back
#define ALL(x) x.begin(), x.end()
#define V(T) vector<T>
typedef pair<int, int> P;
typedef pair<P, P> PP;
typedef vector<int> vi;
typedef vector<vi> vvi;
int max(int a, int b) {
if (b > a)
return b;
else
return a;
}
int min(int a, int b) {
if (b < a)
return b;
else
return a;
}
signed main() {
int N, A, B, C, D;
string S;
cin >> N >> A >> B >> C >> D >> S;
bool acan = true, bcan = true;
FOR(i, A, C - 2) {
if (S[i] == '#' && S[i + 1] == '#')
acan = false;
}
FOR(i, B, D - 2) {
if (S[i] == '#' && S[i + 1] == '#')
bcan = false;
}
if (!acan || !bcan) {
cout << "No" << endl;
return 0;
}
if (C < D) {
cout << "Yes" << endl;
} else {
bool can = false;
FOR(i, B, D - 3) {
if (S[i] == '.' && S[i + 1] == '.' && S[i + 2] == '.') {
can = true;
break;
}
}
if (can)
cout << "Yes" << endl;
else
cout << "No" << endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using int64 = long long;
#define int int64
#define rep(i, n) for (int i = 0; i < n; i++)
#define FOR(i, a, b) for (int i = a; i < b; i++)
#define SORT(x) sort(x.begin(), x.end())
#define GSORT(x) sort(x.begin(), x.end(), greater<int>())
#define mk make_pair
#define fi first
#define se second
#define pb push_back
#define ALL(x) x.begin(), x.end()
#define V(T) vector<T>
typedef pair<int, int> P;
typedef pair<P, P> PP;
typedef vector<int> vi;
typedef vector<vi> vvi;
int max(int a, int b) {
if (b > a)
return b;
else
return a;
}
int min(int a, int b) {
if (b < a)
return b;
else
return a;
}
signed main() {
int N, A, B, C, D;
string S;
cin >> N >> A >> B >> C >> D >> S;
bool acan = true, bcan = true;
FOR(i, A, C - 2) {
if (S[i] == '#' && S[i + 1] == '#')
acan = false;
}
FOR(i, B, D - 2) {
if (S[i] == '#' && S[i + 1] == '#')
bcan = false;
}
if (!acan || !bcan) {
cout << "No" << endl;
return 0;
}
if (C < D) {
cout << "Yes" << endl;
} else {
bool can = false;
FOR(i, B - 2, D - 1) {
if (S[i] == '.' && S[i + 1] == '.' && S[i + 2] == '.') {
can = true;
break;
}
}
if (can)
cout << "Yes" << endl;
else
cout << "No" << endl;
}
return 0;
} | [
"literal.number.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 830,033 | 830,030 | u703503553 | cpp |
p03017 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
constexpr ll INF = 1e18;
constexpr double PI = 3.14159265358979;
int main() {
cin.tie(0);
cout.tie(0);
ios::sync_with_stdio(false);
long long n, a, b, c, d;
string s;
cin >> n >> a >> b >> c >> d >> s;
for (int i = a; i < c - 2; i++) {
if (s[i] == '#' and s[i + 1] == '#') {
cout << "No\n";
return 0;
}
}
for (int i = b; i < d - 2; i++) {
if (s[i] == '#' and s[i + 1] == '#') {
cout << "No\n";
return 0;
}
}
if (c > d) {
bool judge = false;
for (int i = b - 1; i < d - 1; i++) {
if (s[i - 1] == '.' and s[i] == '.' and s[i + 1] == '.') {
judge = true;
}
}
if (!judge) {
cout << "No\n";
return 0;
}
}
cout << "Yes\n";
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
constexpr ll INF = 1e18;
constexpr double PI = 3.14159265358979;
int main() {
cin.tie(0);
cout.tie(0);
ios::sync_with_stdio(false);
long long n, a, b, c, d;
string s;
cin >> n >> a >> b >> c >> d >> s;
for (int i = a; i < c - 2; i++) {
if (s[i] == '#' and s[i + 1] == '#') {
cout << "No\n";
return 0;
}
}
for (int i = b; i < d - 2; i++) {
if (s[i] == '#' and s[i + 1] == '#') {
cout << "No\n";
return 0;
}
}
if (c > d) {
bool judge = false;
for (int i = b - 1; i <= d - 1; i++) {
if (s[i - 1] == '.' and s[i] == '.' and s[i + 1] == '.') {
judge = true;
}
}
if (!judge) {
cout << "No\n";
return 0;
}
}
cout << "Yes\n";
return 0;
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 830,038 | 830,039 | u710232726 | cpp |
p03017 | #include <algorithm>
#include <array>
#include <cmath>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <vector>
using namespace std;
long long PRIME = 1000000007;
bool check(string &s, int start, int end) {
int count = 0;
for (int i = start; i <= end; ++i) {
if (s[i - 1] == '#') {
++count;
if (count == 2) {
return false;
}
} else {
count = 0;
}
}
return true;
}
int main(int argc, char *argv[]) {
int N, A, B, C, D;
cin >> N >> A >> B >> C >> D;
string S;
cin >> S;
if (!check(S, B, D) || !(S, A, C)) {
cout << "No";
return 0;
}
if (C < D) {
cout << "Yes";
} else {
int count = 0;
for (int i = B - 1; i <= D + 1; ++i) {
if (S[i - 1] == '.') {
++count;
if (count == 3) {
cout << "Yes";
return 0;
}
} else {
count = 0;
}
}
cout << "No";
}
}
| #include <algorithm>
#include <array>
#include <cmath>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <vector>
using namespace std;
long long PRIME = 1000000007;
bool check(string &s, int start, int end) {
int count = 0;
for (int i = start; i <= end; ++i) {
if (s[i - 1] == '#') {
++count;
if (count == 2) {
return false;
}
} else {
count = 0;
}
}
return true;
}
int main(int argc, char *argv[]) {
int N, A, B, C, D;
cin >> N >> A >> B >> C >> D;
string S;
cin >> S;
if (!check(S, B, D) || !check(S, A, C)) {
cout << "No";
return 0;
}
if (C < D) {
cout << "Yes";
} else {
int count = 0;
for (int i = B - 1; i <= D + 1; ++i) {
if (S[i - 1] == '.') {
++count;
if (count == 3) {
cout << "Yes";
return 0;
}
} else {
count = 0;
}
}
cout << "No";
}
}
| [
"call.add",
"control_flow.branch.if.condition.change"
] | 830,046 | 830,047 | u514299623 | cpp |
p03017 | #include <algorithm>
#include <array>
#include <cmath>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <vector>
using namespace std;
long long PRIME = 1000000007;
bool check(string &s, int start, int end) {
int count = 0;
for (int i = start; i <= end; ++i) {
if (s[i - 1] == '#') {
++count;
if (count == 2) {
return false;
}
} else {
count = 0;
}
}
return true;
}
int main(int argc, char *argv[]) {
int N, A, B, C, D;
cin >> N >> A >> B >> C >> D;
string S;
cin >> S;
if (!check(S, B, D) || !(S, A, C)) {
cout << "No";
return 0;
}
if (C < D) {
cout << "Yes";
} else {
int count = 0;
for (int i = B; i <= D + 1; ++i) {
if (S[i - 1] == '.') {
++count;
if (count == 3) {
cout << "Yes";
return 0;
}
} else {
count = 0;
}
}
cout << "No";
}
}
| #include <algorithm>
#include <array>
#include <cmath>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <vector>
using namespace std;
long long PRIME = 1000000007;
bool check(string &s, int start, int end) {
int count = 0;
for (int i = start; i <= end; ++i) {
if (s[i - 1] == '#') {
++count;
if (count == 2) {
return false;
}
} else {
count = 0;
}
}
return true;
}
int main(int argc, char *argv[]) {
int N, A, B, C, D;
cin >> N >> A >> B >> C >> D;
string S;
cin >> S;
if (!check(S, B, D) || !check(S, A, C)) {
cout << "No";
return 0;
}
if (C < D) {
cout << "Yes";
} else {
int count = 0;
for (int i = B - 1; i <= D + 1; ++i) {
if (S[i - 1] == '.') {
++count;
if (count == 3) {
cout << "Yes";
return 0;
}
} else {
count = 0;
}
}
cout << "No";
}
}
| [
"call.add",
"control_flow.branch.if.condition.change",
"control_flow.loop.for.initializer.change",
"assignment.change"
] | 830,048 | 830,047 | u514299623 | cpp |
p03017 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const long long MOD = 1000000007;
long long modpow(long long a, long long n, long long m) {
long long ans = 1;
while (n) {
if (n & 1) {
ans = (ans * a) % m;
}
a = (a * a) % m;
n >>= 1;
}
return ans;
}
long long combi(long long n, long long a) {
long long ans = 1, ans1 = 1;
for (long long i = n - a + 1; i <= n; i++) {
ans *= i % MOD;
ans %= MOD;
}
for (long long i = 2; i <= a; i++)
ans1 = (ans1 * i) % MOD;
ans1 = modpow(ans1, MOD - 2, MOD);
return ((ans % MOD) * ans1) % MOD;
}
void dfs(string s, char mx, ll N) {
if (s.length() == N) {
cout << s.c_str() << endl;
} else {
for (char c = 'a'; c <= mx; c++) {
dfs(s + c, ((c == mx) ? (char)(mx) : mx), N);
}
}
}
int bfs(int a, int b, int h, int w, char tmp[][101]) {
int ans[101][101] = {0};
char c[101][101] = {0};
queue<pair<int, int>> s;
for (int i = 0; i <= h; i++) {
for (int j = 0; j <= w; j++) {
c[i][j] = tmp[i][j];
}
}
s.push(make_pair(a, b));
while (s.size() > 0) {
pair<int, int> tmp = s.front();
s.pop();
c[tmp.first][tmp.second] = '#';
for (int i = -1; i <= 1; i++) {
for (int j = -1; j <= 1; j++) {
if (tmp.first + i < 1 || tmp.first + i > h) {
continue;
}
if (tmp.second + j < 1 || tmp.second + j > w) {
continue;
}
if (i != 0 && j != 0) {
continue;
}
if (i == 0 && j == 0) {
continue;
}
if (c[tmp.first + i][tmp.second + j] == '#') {
continue;
}
c[tmp.first + i][tmp.second + j] = '#';
if (ans[tmp.first + i][tmp.second + j] == 0) {
ans[tmp.first + i][tmp.second + j] = ans[tmp.first][tmp.second] + 1;
} else {
ans[tmp.first + i][tmp.second + j] =
min(ans[tmp.first + i][tmp.second + j],
ans[tmp.first][tmp.second] + 1);
}
s.push(make_pair(tmp.first + i, tmp.second + j));
}
}
}
int asd = 0;
for (int i = 1; i <= h; i++) {
for (int j = 1; j <= w; j++) {
asd = max(a, ans[i][j]);
}
}
return asd;
}
ll gcd(ll a, ll b) {
if (a % b == 0) {
return (b);
} else {
return (gcd(b, a % b));
}
}
ll lcm(ll a, ll b) { return a * b / gcd(a, b); }
int main() {
ll n, a, b, c, d;
cin >> n >> a >> b >> c >> d;
char s[n];
for (int i = 0; i < n; i++)
cin >> s[i];
bool f = true;
char prev = s[a - 1];
for (int i = a; i < c; i++) {
if (prev == '#' && s[i] == '#') {
f = false;
break;
}
prev = s[i];
}
if (!f) {
cout << "No" << endl;
return 0;
}
prev = s[b - 1];
for (int i = b; i < d; i++) {
if (prev == '#' && s[i] == '#') {
f = false;
break;
}
prev = s[i];
}
if (!f) {
cout << "No" << endl;
return 0;
}
if (c > d) {
f = false;
for (int i = b; i < d; i++) {
if (s[i - 1] == '.' && s[i] == '.' && s[i + 1] == '.') {
f = true;
break;
}
}
if (!f) {
cout << "No" << endl;
return 0;
}
}
cout << "Yes" << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const long long MOD = 1000000007;
long long modpow(long long a, long long n, long long m) {
long long ans = 1;
while (n) {
if (n & 1) {
ans = (ans * a) % m;
}
a = (a * a) % m;
n >>= 1;
}
return ans;
}
long long combi(long long n, long long a) {
long long ans = 1, ans1 = 1;
for (long long i = n - a + 1; i <= n; i++) {
ans *= i % MOD;
ans %= MOD;
}
for (long long i = 2; i <= a; i++)
ans1 = (ans1 * i) % MOD;
ans1 = modpow(ans1, MOD - 2, MOD);
return ((ans % MOD) * ans1) % MOD;
}
void dfs(string s, char mx, ll N) {
if (s.length() == N) {
cout << s.c_str() << endl;
} else {
for (char c = 'a'; c <= mx; c++) {
dfs(s + c, ((c == mx) ? (char)(mx) : mx), N);
}
}
}
int bfs(int a, int b, int h, int w, char tmp[][101]) {
int ans[101][101] = {0};
char c[101][101] = {0};
queue<pair<int, int>> s;
for (int i = 0; i <= h; i++) {
for (int j = 0; j <= w; j++) {
c[i][j] = tmp[i][j];
}
}
s.push(make_pair(a, b));
while (s.size() > 0) {
pair<int, int> tmp = s.front();
s.pop();
c[tmp.first][tmp.second] = '#';
for (int i = -1; i <= 1; i++) {
for (int j = -1; j <= 1; j++) {
if (tmp.first + i < 1 || tmp.first + i > h) {
continue;
}
if (tmp.second + j < 1 || tmp.second + j > w) {
continue;
}
if (i != 0 && j != 0) {
continue;
}
if (i == 0 && j == 0) {
continue;
}
if (c[tmp.first + i][tmp.second + j] == '#') {
continue;
}
c[tmp.first + i][tmp.second + j] = '#';
if (ans[tmp.first + i][tmp.second + j] == 0) {
ans[tmp.first + i][tmp.second + j] = ans[tmp.first][tmp.second] + 1;
} else {
ans[tmp.first + i][tmp.second + j] =
min(ans[tmp.first + i][tmp.second + j],
ans[tmp.first][tmp.second] + 1);
}
s.push(make_pair(tmp.first + i, tmp.second + j));
}
}
}
int asd = 0;
for (int i = 1; i <= h; i++) {
for (int j = 1; j <= w; j++) {
asd = max(a, ans[i][j]);
}
}
return asd;
}
ll gcd(ll a, ll b) {
if (a % b == 0) {
return (b);
} else {
return (gcd(b, a % b));
}
}
ll lcm(ll a, ll b) { return a * b / gcd(a, b); }
int main() {
ll n, a, b, c, d;
cin >> n >> a >> b >> c >> d;
char s[n];
for (int i = 0; i < n; i++)
cin >> s[i];
bool f = true;
char prev = s[a - 1];
for (int i = a; i < c; i++) {
if (prev == '#' && s[i] == '#') {
f = false;
break;
}
prev = s[i];
}
if (!f) {
cout << "No" << endl;
return 0;
}
prev = s[b - 1];
for (int i = b; i < d; i++) {
if (prev == '#' && s[i] == '#') {
f = false;
break;
}
prev = s[i];
}
if (!f) {
cout << "No" << endl;
return 0;
}
if (c > d) {
f = false;
for (int i = b - 1; i < d; i++) {
if (s[i - 1] == '.' && s[i] == '.' && s[i + 1] == '.') {
f = true;
break;
}
}
if (!f) {
cout << "No" << endl;
return 0;
}
}
cout << "Yes" << endl;
return 0;
} | [
"control_flow.loop.for.initializer.change"
] | 830,051 | 830,052 | u303297838 | cpp |
p03017 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const long long MOD = 1000000007;
long long modpow(long long a, long long n, long long m) {
long long ans = 1;
while (n) {
if (n & 1) {
ans = (ans * a) % m;
}
a = (a * a) % m;
n >>= 1;
}
return ans;
}
long long combi(long long n, long long a) {
long long ans = 1, ans1 = 1;
for (long long i = n - a + 1; i <= n; i++) {
ans *= i % MOD;
ans %= MOD;
}
for (long long i = 2; i <= a; i++)
ans1 = (ans1 * i) % MOD;
ans1 = modpow(ans1, MOD - 2, MOD);
return ((ans % MOD) * ans1) % MOD;
}
void dfs(string s, char mx, ll N) {
if (s.length() == N) {
cout << s.c_str() << endl;
} else {
for (char c = 'a'; c <= mx; c++) {
dfs(s + c, ((c == mx) ? (char)(mx) : mx), N);
}
}
}
int bfs(int a, int b, int h, int w, char tmp[][101]) {
int ans[101][101] = {0};
char c[101][101] = {0};
queue<pair<int, int>> s;
for (int i = 0; i <= h; i++) {
for (int j = 0; j <= w; j++) {
c[i][j] = tmp[i][j];
}
}
s.push(make_pair(a, b));
while (s.size() > 0) {
pair<int, int> tmp = s.front();
s.pop();
c[tmp.first][tmp.second] = '#';
for (int i = -1; i <= 1; i++) {
for (int j = -1; j <= 1; j++) {
if (tmp.first + i < 1 || tmp.first + i > h) {
continue;
}
if (tmp.second + j < 1 || tmp.second + j > w) {
continue;
}
if (i != 0 && j != 0) {
continue;
}
if (i == 0 && j == 0) {
continue;
}
if (c[tmp.first + i][tmp.second + j] == '#') {
continue;
}
c[tmp.first + i][tmp.second + j] = '#';
if (ans[tmp.first + i][tmp.second + j] == 0) {
ans[tmp.first + i][tmp.second + j] = ans[tmp.first][tmp.second] + 1;
} else {
ans[tmp.first + i][tmp.second + j] =
min(ans[tmp.first + i][tmp.second + j],
ans[tmp.first][tmp.second] + 1);
}
s.push(make_pair(tmp.first + i, tmp.second + j));
}
}
}
int asd = 0;
for (int i = 1; i <= h; i++) {
for (int j = 1; j <= w; j++) {
asd = max(a, ans[i][j]);
}
}
return asd;
}
ll gcd(ll a, ll b) {
if (a % b == 0) {
return (b);
} else {
return (gcd(b, a % b));
}
}
ll lcm(ll a, ll b) { return a * b / gcd(a, b); }
int main() {
ll n, a, b, c, d;
cin >> n >> a >> b >> c >> d;
char s[n];
for (int i = 0; i < n; i++)
cin >> s[i];
bool f = true;
char prev = s[a - 1];
for (int i = a; i < c; i++) {
if (prev == '#' && s[i] == '#') {
f = false;
break;
}
prev = s[i];
}
if (!f) {
cout << "No" << endl;
return 0;
}
prev = s[b - 1];
for (int i = b; i < d; i++) {
if (prev == '#' && s[i] == '#') {
f = false;
break;
}
prev = s[i];
}
if (!f) {
cout << "No" << endl;
return 0;
}
if (c > d) {
f = false;
for (int i = b; i <= d; i++) {
if (s[i - 1] == '.' && s[i] == '.' && s[i + 1] == '.') {
f = true;
break;
}
}
if (!f) {
cout << "No" << endl;
return 0;
}
}
cout << "Yes" << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const long long MOD = 1000000007;
long long modpow(long long a, long long n, long long m) {
long long ans = 1;
while (n) {
if (n & 1) {
ans = (ans * a) % m;
}
a = (a * a) % m;
n >>= 1;
}
return ans;
}
long long combi(long long n, long long a) {
long long ans = 1, ans1 = 1;
for (long long i = n - a + 1; i <= n; i++) {
ans *= i % MOD;
ans %= MOD;
}
for (long long i = 2; i <= a; i++)
ans1 = (ans1 * i) % MOD;
ans1 = modpow(ans1, MOD - 2, MOD);
return ((ans % MOD) * ans1) % MOD;
}
void dfs(string s, char mx, ll N) {
if (s.length() == N) {
cout << s.c_str() << endl;
} else {
for (char c = 'a'; c <= mx; c++) {
dfs(s + c, ((c == mx) ? (char)(mx) : mx), N);
}
}
}
int bfs(int a, int b, int h, int w, char tmp[][101]) {
int ans[101][101] = {0};
char c[101][101] = {0};
queue<pair<int, int>> s;
for (int i = 0; i <= h; i++) {
for (int j = 0; j <= w; j++) {
c[i][j] = tmp[i][j];
}
}
s.push(make_pair(a, b));
while (s.size() > 0) {
pair<int, int> tmp = s.front();
s.pop();
c[tmp.first][tmp.second] = '#';
for (int i = -1; i <= 1; i++) {
for (int j = -1; j <= 1; j++) {
if (tmp.first + i < 1 || tmp.first + i > h) {
continue;
}
if (tmp.second + j < 1 || tmp.second + j > w) {
continue;
}
if (i != 0 && j != 0) {
continue;
}
if (i == 0 && j == 0) {
continue;
}
if (c[tmp.first + i][tmp.second + j] == '#') {
continue;
}
c[tmp.first + i][tmp.second + j] = '#';
if (ans[tmp.first + i][tmp.second + j] == 0) {
ans[tmp.first + i][tmp.second + j] = ans[tmp.first][tmp.second] + 1;
} else {
ans[tmp.first + i][tmp.second + j] =
min(ans[tmp.first + i][tmp.second + j],
ans[tmp.first][tmp.second] + 1);
}
s.push(make_pair(tmp.first + i, tmp.second + j));
}
}
}
int asd = 0;
for (int i = 1; i <= h; i++) {
for (int j = 1; j <= w; j++) {
asd = max(a, ans[i][j]);
}
}
return asd;
}
ll gcd(ll a, ll b) {
if (a % b == 0) {
return (b);
} else {
return (gcd(b, a % b));
}
}
ll lcm(ll a, ll b) { return a * b / gcd(a, b); }
int main() {
ll n, a, b, c, d;
cin >> n >> a >> b >> c >> d;
char s[n];
for (int i = 0; i < n; i++)
cin >> s[i];
bool f = true;
char prev = s[a - 1];
for (int i = a; i < c; i++) {
if (prev == '#' && s[i] == '#') {
f = false;
break;
}
prev = s[i];
}
if (!f) {
cout << "No" << endl;
return 0;
}
prev = s[b - 1];
for (int i = b; i < d; i++) {
if (prev == '#' && s[i] == '#') {
f = false;
break;
}
prev = s[i];
}
if (!f) {
cout << "No" << endl;
return 0;
}
if (c > d) {
f = false;
for (int i = b - 1; i < d; i++) {
if (s[i - 1] == '.' && s[i] == '.' && s[i + 1] == '.') {
f = true;
break;
}
}
if (!f) {
cout << "No" << endl;
return 0;
}
}
cout << "Yes" << endl;
return 0;
} | [
"control_flow.loop.for.initializer.change",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 830,053 | 830,052 | u303297838 | cpp |
p03017 | #include <iostream>
#include <vector>
using namespace std;
int main() {
int N, A, B, C, D;
cin >> N >> A >> B >> C >> D;
string S;
cin >> S;
for (int i = A; i < C; i++) {
if (S[i - 1] == '#' && S[i] == '#') {
cout << "No" << endl;
return 0;
}
}
for (int i = B; i < D; i++) {
if (S[i - 1] == '#' && S[i] == '#') {
cout << "No" << endl;
return 0;
}
}
if (C < D) {
cout << "Yes" << endl;
} else {
for (int i = A; i < D; i++) {
if (S[i - 1] == '.' && S[i] == '.' && S[i + 1] == '.') {
cout << "Yes" << endl;
return 0;
}
}
cout << "No" << endl;
}
} | #include <iostream>
#include <vector>
using namespace std;
int main() {
int N, A, B, C, D;
cin >> N >> A >> B >> C >> D;
string S;
cin >> S;
for (int i = A; i < C; i++) {
if (S[i - 1] == '#' && S[i] == '#') {
cout << "No" << endl;
return 0;
}
}
for (int i = B; i < D; i++) {
if (S[i - 1] == '#' && S[i] == '#') {
cout << "No" << endl;
return 0;
}
}
if (C < D) {
cout << "Yes" << endl;
} else {
for (int i = B - 1; i < D; i++) {
if (S[i - 1] == '.' && S[i] == '.' && S[i + 1] == '.') {
cout << "Yes" << endl;
return 0;
}
}
cout << "No" << endl;
}
} | [
"control_flow.loop.for.initializer.change"
] | 830,061 | 830,062 | u868132236 | cpp |
p03017 | #include <iostream>
#include <vector>
using namespace std;
int main() {
int N, A, B, C, D;
cin >> N >> A >> B >> C >> D;
string S;
cin >> S;
for (int i = A; i < C; i++) {
if (S[i - 1] == '#' && S[i] == '#') {
cout << "No" << endl;
return 0;
}
}
for (int i = B; i < D; i++) {
if (S[i - 1] == '#' && S[i] == '#') {
cout << "No" << endl;
return 0;
}
}
if (C < D) {
cout << "Yes" << endl;
} else {
for (int i = A; i < D - 1; i++) {
if (S[i - 1] == '.' && S[i] == '.' && S[i + 1] == '.') {
cout << "Yes" << endl;
return 0;
}
}
cout << "No" << endl;
}
} | #include <iostream>
#include <vector>
using namespace std;
int main() {
int N, A, B, C, D;
cin >> N >> A >> B >> C >> D;
string S;
cin >> S;
for (int i = A; i < C; i++) {
if (S[i - 1] == '#' && S[i] == '#') {
cout << "No" << endl;
return 0;
}
}
for (int i = B; i < D; i++) {
if (S[i - 1] == '#' && S[i] == '#') {
cout << "No" << endl;
return 0;
}
}
if (C < D) {
cout << "Yes" << endl;
} else {
for (int i = B - 1; i < D; i++) {
if (S[i - 1] == '.' && S[i] == '.' && S[i + 1] == '.') {
cout << "Yes" << endl;
return 0;
}
}
cout << "No" << endl;
}
} | [
"control_flow.loop.for.initializer.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 830,063 | 830,062 | u868132236 | cpp |
p03017 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define REP(i, n) for (int i = 1; i < n; i++)
#define repll(i, n) for (ll i = 0; i < n; i++)
#define REPll(i, n) for (ll i = 1; i < n; i++)
#define sz(x) int(x.size())
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define yesorno(a) printf(a ? "yes\n" : "no\n")
#define YesorNo(a) printf(a ? "Yes\n" : "No\n")
#define YESorNO(a) printf(a ? "YES\n" : "NO\n")
#define endl "\n"
using ll = long long;
using P = pair<int, int>;
using Pl = pair<ll, ll>;
using vi = vector<int>;
using vii = vector<vi>;
using vl = vector<ll>;
using vll = vector<vl>;
const int dx[] = {0, 1, 0, -1, 1, 1, -1, -1};
const int dy[] = {1, 0, -1, 0, 1, -1, -1, 1};
const int inf = (1 << 30) - 1;
const ll infll = (1LL << 62) - 1;
ll ceil(const ll a, const ll b) { return ((a) + (b)-1) / b; }
string way;
bool can(int s, int g) {
bool ok = true;
for (int i = s; i < g; i++) {
if (way[i] == '#' && way[i + 1] == '#')
ok = false;
}
return ok;
}
signed main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
int n, a, b, c, d;
cin >> n >> a >> b >> c >> d;
a--;
b--;
c--;
d--;
cin >> way;
if (c > d) {
bool ok = false;
for (int i = b; i < d; i++) {
if (way[i] == '.' && way[i + 1] == '.' && way[i + 2] == '.')
ok = true;
}
if (!ok) {
cout << "No" << endl;
return 0;
}
}
YesorNo(can(a, c) && can(b, d));
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define REP(i, n) for (int i = 1; i < n; i++)
#define repll(i, n) for (ll i = 0; i < n; i++)
#define REPll(i, n) for (ll i = 1; i < n; i++)
#define sz(x) int(x.size())
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define yesorno(a) printf(a ? "yes\n" : "no\n")
#define YesorNo(a) printf(a ? "Yes\n" : "No\n")
#define YESorNO(a) printf(a ? "YES\n" : "NO\n")
#define endl "\n"
using ll = long long;
using P = pair<int, int>;
using Pl = pair<ll, ll>;
using vi = vector<int>;
using vii = vector<vi>;
using vl = vector<ll>;
using vll = vector<vl>;
const int dx[] = {0, 1, 0, -1, 1, 1, -1, -1};
const int dy[] = {1, 0, -1, 0, 1, -1, -1, 1};
const int inf = (1 << 30) - 1;
const ll infll = (1LL << 62) - 1;
ll ceil(const ll a, const ll b) { return ((a) + (b)-1) / b; }
string way;
bool can(int s, int g) {
bool ok = true;
for (int i = s; i < g; i++) {
if (way[i] == '#' && way[i + 1] == '#')
ok = false;
}
return ok;
}
signed main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
int n, a, b, c, d;
cin >> n >> a >> b >> c >> d;
a--;
b--;
c--;
d--;
cin >> way;
if (c > d) {
bool ok = false;
for (int i = b - 1; i < d; i++) {
if (way[i] == '.' && way[i + 1] == '.' && way[i + 2] == '.')
ok = true;
}
if (!ok) {
cout << "No" << endl;
return 0;
}
}
YesorNo(can(a, c) && can(b, d));
} | [
"control_flow.loop.for.initializer.change"
] | 830,066 | 830,067 | u363936720 | cpp |
p03017 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef vector<vector<int>> Graph;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
int n, a, b, c, d;
string s;
bool solve(int f, int t) {
int now = f;
while (now != t) {
if (s[now + 1] != '#')
now++;
else if (s[now + 2] != '#')
now += 2;
else
return false;
}
return true;
}
int main() {
cin >> n >> a >> b >> c >> d;
a--;
b--;
c--;
d--;
cin >> s;
bool ans = false;
//追い抜きなしのパターン
if (solve(b, d)) {
s[d] = '#';
if (solve(a, c))
ans = true;
s[d] = '.';
}
//追い抜きありのパターン
if (solve(b, d)) {
bool nx = false;
for (int i = b; i < d - 1; i++) {
if (s[i] == '.' && s[i + 1] == '.' && s[i + 2] == '.')
nx = true;
}
if (nx) {
solve(a, c);
s[c] = '#';
if (solve(b, d))
ans = true;
}
}
if (ans)
cout << "Yes" << endl;
else
cout << "No" << endl;
return 0;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef vector<vector<int>> Graph;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
int n, a, b, c, d;
string s;
bool solve(int f, int t) {
int now = f;
while (now != t) {
if (s[now + 1] != '#')
now++;
else if (s[now + 2] != '#')
now += 2;
else
return false;
}
return true;
}
int main() {
cin >> n >> a >> b >> c >> d;
a--;
b--;
c--;
d--;
cin >> s;
bool ans = false;
//追い抜きなしのパターン
if (solve(b, d)) {
s[d] = '#';
if (solve(a, c))
ans = true;
s[d] = '.';
}
//追い抜きありのパターン
if (solve(b, d)) {
bool nx = false;
for (int i = b - 1; i < d - 1; i++) {
if (s[i] == '.' && s[i + 1] == '.' && s[i + 2] == '.')
nx = true;
}
if (nx) {
solve(a, c);
s[c] = '#';
if (solve(b, d))
ans = true;
}
}
if (ans)
cout << "Yes" << endl;
else
cout << "No" << endl;
return 0;
}
| [
"control_flow.loop.for.initializer.change"
] | 830,068 | 830,069 | u045408189 | cpp |
p03017 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef vector<vector<int>> Graph;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
int n, a, b, c, d;
string s;
bool solve(int f, int t) {
int now = f;
while (now != t) {
if (s[now + 1] != '#')
now++;
else if (s[now + 2] != '#')
now += 2;
else
return false;
}
return true;
}
int main() {
cin >> n >> a >> b >> c >> d;
a--;
b--;
c--;
d--;
cin >> s;
bool ans = false;
if (solve(b, d)) {
s[d] = '#';
if (solve(a, c))
ans = true;
s[d] = '.';
}
if (solve(b, d)) {
bool nx = false;
for (int i = b; i < c - 1; i++) {
if (s[i] == '.' && s[i + 1] == '.' && s[i + 2] == '.')
nx = true;
}
if (nx) {
solve(a, c);
s[c] = '#';
if (solve(b, d))
ans = true;
}
}
if (ans)
cout << "Yes" << endl;
else
cout << "No" << endl;
return 0;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef vector<vector<int>> Graph;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
int n, a, b, c, d;
string s;
bool solve(int f, int t) {
int now = f;
while (now != t) {
if (s[now + 1] != '#')
now++;
else if (s[now + 2] != '#')
now += 2;
else
return false;
}
return true;
}
int main() {
cin >> n >> a >> b >> c >> d;
a--;
b--;
c--;
d--;
cin >> s;
bool ans = false;
//追い抜きなしのパターン
if (solve(b, d)) {
s[d] = '#';
if (solve(a, c))
ans = true;
s[d] = '.';
}
//追い抜きありのパターン
if (solve(b, d)) {
bool nx = false;
for (int i = b - 1; i < d - 1; i++) {
if (s[i] == '.' && s[i + 1] == '.' && s[i + 2] == '.')
nx = true;
}
if (nx) {
solve(a, c);
s[c] = '#';
if (solve(b, d))
ans = true;
}
}
if (ans)
cout << "Yes" << endl;
else
cout << "No" << endl;
return 0;
}
| [
"control_flow.loop.for.initializer.change",
"identifier.change",
"control_flow.branch.if.condition.change"
] | 830,070 | 830,069 | u045408189 | cpp |
p03017 | //#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#define PI 3.14159265359
using namespace std;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
const long long INF = 1e+18 + 1;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vector<ll>> vvl;
typedef pair<ll, ll> P;
typedef tuple<ll, ll, ll> T;
const ll MOD = 1000000007LL;
string abc = "abcdefghijklmnopqrstuvwxyz";
string ABC = "ABCDEFGHIJKLMNOPQRSTUVWXYZ";
int main() {
ll n, a, b, c, d;
cin >> n >> a >> b >> c >> d;
a--;
b--;
c--;
d--;
string s;
cin >> s;
bool ans = true;
rep(i, n - 1) {
if ((i > a || i > b) && (i + 1 < c || i + 1 < d)) {
if (s[i] == '#' && s[i + 1] == '#')
ans = false;
}
}
if (c > d) {
bool reverse = false;
rep(i, n - 2) {
if ((i >= a && i >= b) && (i + 1 <= d)) {
if (s[i] == '.' && s[i + 1] == '.' && s[i + 2] == '.')
reverse = true;
}
}
if (reverse == false)
ans = false;
}
if (ans)
cout << "Yes" << endl;
else
cout << "No" << endl;
}
| //#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#define PI 3.14159265359
using namespace std;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
const long long INF = 1e+18 + 1;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vector<ll>> vvl;
typedef pair<ll, ll> P;
typedef tuple<ll, ll, ll> T;
const ll MOD = 1000000007LL;
string abc = "abcdefghijklmnopqrstuvwxyz";
string ABC = "ABCDEFGHIJKLMNOPQRSTUVWXYZ";
int main() {
ll n, a, b, c, d;
cin >> n >> a >> b >> c >> d;
a--;
b--;
c--;
d--;
string s;
cin >> s;
bool ans = true;
rep(i, n - 1) {
if ((i > a || i > b) && (i + 1 < c || i + 1 < d)) {
if (s[i] == '#' && s[i + 1] == '#')
ans = false;
}
}
if (c > d) {
bool reverse = false;
rep(i, n - 2) {
if ((i >= a && i + 1 >= b) && (i + 1 <= d)) {
if (s[i] == '.' && s[i + 1] == '.' && s[i + 2] == '.')
reverse = true;
}
}
if (reverse == false)
ans = false;
}
if (ans)
cout << "Yes" << endl;
else
cout << "No" << endl;
}
| [
"control_flow.branch.if.condition.change"
] | 830,071 | 830,072 | u614128939 | cpp |
p03017 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
int main() {
int n, a, b, c, d;
cin >> n >> a >> b >> c >> d;
string s;
cin >> s;
s += '.';
s += '.';
if (c < d) {
for (int i = a - 1; i < d - 1; i++) {
if (s[i] == s[i + 1] && s[i] == s[i + 2] && s[i] == '#') {
cout << "No\n";
return 0;
}
}
cout << "Yes\n";
} else {
for (int i = a - 1; i < c - 1; i++) {
if (s[i] == s[i + 1] && s[i] == s[i + 2] && s[i] == '#') {
cout << "No\n";
return 0;
}
}
bool ok = false;
for (int i = b - 1; i < d; i++) {
if (s[i] == s[i + 1] && s[i] == s[i + 2] && s[i] == '.') {
ok = true;
}
}
if (ok) {
cout << "Yes\n";
} else {
cout << "No\n";
}
}
return 0;
} | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
int main() {
int n, a, b, c, d;
cin >> n >> a >> b >> c >> d;
string s;
cin >> s;
s += '.';
s += '.';
if (c < d) {
for (int i = a - 1; i < d - 1; i++) {
if (s[i] == s[i + 1] && s[i] == s[i + 2] && s[i] == '#') {
cout << "No\n";
return 0;
}
}
cout << "Yes\n";
} else {
for (int i = a - 1; i < c - 1; i++) {
if (s[i] == s[i + 1] && s[i] == s[i + 2] && s[i] == '#') {
cout << "No\n";
return 0;
}
}
bool ok = false;
for (int i = b - 2; i < d - 1; i++) {
if (s[i] == s[i + 1] && s[i] == s[i + 2] && s[i] == '.') {
ok = true;
}
}
if (ok) {
cout << "Yes\n";
} else {
cout << "No\n";
}
}
return 0;
} | [
"literal.number.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"expression.operation.binary.change",
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 830,073 | 830,074 | u199184624 | cpp |
p03017 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
int main() {
int n, a, b, c, d;
cin >> n >> a >> b >> c >> d;
string s;
cin >> s;
s += '.';
s += '.';
if (c < d) {
for (int i = a - 1; i < d - 1; i++) {
if (s[i] == s[i + 1] && s[i] == s[i + 2] && s[i] == '#') {
cout << "No\n";
return 0;
}
}
cout << "Yes\n";
} else {
for (int i = a - 1; i < c - 1; i++) {
if (s[i] == s[i + 1] && s[i] == s[i + 2] && s[i] == '#') {
cout << "No\n";
return 0;
}
}
bool ok = false;
for (int i = b - 1; i < d - 1; i++) {
if (s[i] == s[i + 1] && s[i] == s[i + 2] && s[i] == '.') {
ok = true;
}
}
if (ok) {
cout << "Yes\n";
} else {
cout << "No\n";
}
}
return 0;
} | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
int main() {
int n, a, b, c, d;
cin >> n >> a >> b >> c >> d;
string s;
cin >> s;
s += '.';
s += '.';
if (c < d) {
for (int i = a - 1; i < d - 1; i++) {
if (s[i] == s[i + 1] && s[i] == s[i + 2] && s[i] == '#') {
cout << "No\n";
return 0;
}
}
cout << "Yes\n";
} else {
for (int i = a - 1; i < c - 1; i++) {
if (s[i] == s[i + 1] && s[i] == s[i + 2] && s[i] == '#') {
cout << "No\n";
return 0;
}
}
bool ok = false;
for (int i = b - 2; i < d - 1; i++) {
if (s[i] == s[i + 1] && s[i] == s[i + 2] && s[i] == '.') {
ok = true;
}
}
if (ok) {
cout << "Yes\n";
} else {
cout << "No\n";
}
}
return 0;
} | [
"literal.number.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 830,075 | 830,074 | u199184624 | cpp |
p03017 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
int main() {
int n, a, b, c, d;
cin >> n >> a >> b >> c >> d;
string s;
cin >> s;
s += '.';
s += '.';
if (c < d) {
for (int i = a - 1; i < d - 1; i++) {
if (s[i] == s[i + 1] && s[i] == s[i + 2] && s[i] == '#') {
cout << "No\n";
return 0;
}
}
cout << "Yes\n";
} else {
for (int i = a - 1; i < c - 1; i++) {
if (s[i] == s[i + 1] && s[i] == s[i + 2] && s[i] == '#') {
cout << "No\n";
return 0;
}
}
bool ok = false;
for (int i = a - 1; i < d - 1; i++) {
if (s[i] == s[i + 1] && s[i] == s[i + 2] && s[i] == '.') {
ok = true;
}
}
if (ok) {
cout << "Yes\n";
} else {
cout << "No\n";
}
}
return 0;
} | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
int main() {
int n, a, b, c, d;
cin >> n >> a >> b >> c >> d;
string s;
cin >> s;
s += '.';
s += '.';
if (c < d) {
for (int i = a - 1; i < d - 1; i++) {
if (s[i] == s[i + 1] && s[i] == s[i + 2] && s[i] == '#') {
cout << "No\n";
return 0;
}
}
cout << "Yes\n";
} else {
for (int i = a - 1; i < c - 1; i++) {
if (s[i] == s[i + 1] && s[i] == s[i + 2] && s[i] == '#') {
cout << "No\n";
return 0;
}
}
bool ok = false;
for (int i = b - 2; i < d - 1; i++) {
if (s[i] == s[i + 1] && s[i] == s[i + 2] && s[i] == '.') {
ok = true;
}
}
if (ok) {
cout << "Yes\n";
} else {
cout << "No\n";
}
}
return 0;
} | [
"identifier.change",
"control_flow.loop.for.initializer.change",
"expression.operation.binary.change",
"literal.number.change",
"expression.off_by_one"
] | 830,076 | 830,074 | u199184624 | cpp |
p03017 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, srt, end) for (long long i = (srt); i < (long long)(end); i++)
#define VL vector<ll>
#define VS vector<string>
#define VB vector<bool>
#define VP vector<pair<ll, ll>>
#define VVL vector<vector<ll>>
#define VVP vector<vector<pair<ll, ll>>>
#define PL pair<ll, ll>
#define ALL(v) (v).begin(), (v).end()
ll d1[4] = {1, -1, 0, 0};
ll d2[4] = {0, 0, 1, -1};
int main() {
ll N, A, B, C, D;
cin >> N >> A >> B >> C >> D;
A--;
B--;
C--;
D--;
string S;
cin >> S;
rep(i, A + 1, max(C - 1, D - 1)) {
if (S[i] == '#' && S[i + 1] == '#') {
cout << "No" << endl;
return 0;
}
}
if (D > C) {
cout << "Yes" << endl;
return 0;
}
bool f = false;
rep(i, B - 1, C - 1) {
if (S[i] == '.' && S[i + 1] == '.' && S[i + 2] == '.') {
f = true;
}
}
if (f)
cout << "Yes" << endl;
else
cout << "No" << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, srt, end) for (long long i = (srt); i < (long long)(end); i++)
#define VL vector<ll>
#define VS vector<string>
#define VB vector<bool>
#define VP vector<pair<ll, ll>>
#define VVL vector<vector<ll>>
#define VVP vector<vector<pair<ll, ll>>>
#define PL pair<ll, ll>
#define ALL(v) (v).begin(), (v).end()
ll d1[4] = {1, -1, 0, 0};
ll d2[4] = {0, 0, 1, -1};
int main() {
ll N, A, B, C, D;
cin >> N >> A >> B >> C >> D;
A--;
B--;
C--;
D--;
string S;
cin >> S;
rep(i, A + 1, max(C - 1, D - 1)) {
if (S[i] == '#' && S[i + 1] == '#') {
cout << "No" << endl;
return 0;
}
}
if (D > C) {
cout << "Yes" << endl;
return 0;
}
bool f = false;
rep(i, B - 1, min(D, C - 1)) {
if (S[i] == '.' && S[i + 1] == '.' && S[i + 2] == '.') {
f = true;
}
}
if (f)
cout << "Yes" << endl;
else
cout << "No" << endl;
return 0;
} | [
"call.add",
"call.arguments.change"
] | 830,084 | 830,085 | u893584578 | cpp |
p03017 | #include <algorithm>
#include <cmath>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define ll long long
const int mod = 1000000007;
const ll INF = 1000000000000000000;
int main() {
int N, A, B, C, D;
string S;
cin >> N >> A >> B >> C >> D >> S;
bool cross = false;
for (int i = A - 1; i < max(C, D) - 2; i++) {
if (S[i] == '#' && S[i + 1] == '#') {
cout << "No" << endl;
return 0;
}
}
if (D < C) {
for (int i = B - 2; i <= D - 1; i++) {
if (S[i] == '.' && S[i + 1] == '.' && S[i + 2] == '.') {
cout << "Yes" << endl;
return 0;
}
}
cout << "No" << endl;
} else
cout << "Yes" << endl;
} | #include <algorithm>
#include <cmath>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define ll long long
const int mod = 1000000007;
const ll INF = 1000000000000000000;
int main() {
int N, A, B, C, D;
string S;
cin >> N >> A >> B >> C >> D >> S;
bool cross = false;
for (int i = A - 1; i < max(C, D) - 1; i++) {
if (S[i] == '#' && S[i + 1] == '#') {
cout << "No" << endl;
return 0;
}
}
if (D < C) {
for (int i = B - 2; i <= D - 2; i++) {
if (S[i] == '.' && S[i + 1] == '.' && S[i + 2] == '.') {
cout << "Yes" << endl;
return 0;
}
}
cout << "No" << endl;
} else
cout << "Yes" << endl;
} | [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"control_flow.branch.if.condition.change"
] | 830,093 | 830,094 | u475843109 | cpp |
p03017 | #include <algorithm>
#include <cmath>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define ll long long
const int mod = 1000000007;
const ll INF = 1000000000000000000;
int main() {
int N, A, B, C, D;
string S;
cin >> N >> A >> B >> C >> D >> S;
bool cross = false;
for (int i = A - 1; i < max(C, D) - 2; i++) {
if (S[i] == '#' && S[i + 1] == '#') {
cout << "No" << endl;
return 0;
}
}
if (D < C) {
for (int i = B - 2; i <= D - 3; i++) {
if (S[i] == '.' && S[i + 1] == '.' && S[i + 2] == '.') {
cout << "Yes" << endl;
return 0;
}
}
cout << "No" << endl;
} else
cout << "Yes" << endl;
} | #include <algorithm>
#include <cmath>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define ll long long
const int mod = 1000000007;
const ll INF = 1000000000000000000;
int main() {
int N, A, B, C, D;
string S;
cin >> N >> A >> B >> C >> D >> S;
bool cross = false;
for (int i = A - 1; i < max(C, D) - 1; i++) {
if (S[i] == '#' && S[i + 1] == '#') {
cout << "No" << endl;
return 0;
}
}
if (D < C) {
for (int i = B - 2; i <= D - 2; i++) {
if (S[i] == '.' && S[i + 1] == '.' && S[i + 2] == '.') {
cout << "Yes" << endl;
return 0;
}
}
cout << "No" << endl;
} else
cout << "Yes" << endl;
} | [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"control_flow.branch.if.condition.change"
] | 830,095 | 830,094 | u475843109 | cpp |
p03017 | #include <iostream>
#include <string>
using namespace std;
int N, A, B, C, D;
string S;
int main() {
cin >> N >> A >> B >> C >> D;
cin >> S;
bool ans = true;
for (int i = A; i < C; i++) {
if (S[i] == '#' && S[i + 1] == '#') {
ans = false;
}
}
for (int i = B; i < D; i++) {
if (S[i] == '#' && S[i + 1] == '#') {
ans = false;
}
}
if (ans && C > D) {
ans = false;
for (int i = B - 2; i < C - 2; i++) {
if (S[i] == '.' && S[i + 1] == '.' && S[i + 2] == '.' && i + 1 <= D) {
ans = true;
break;
}
}
}
if (ans)
cout << "Yes";
else
cout << "No";
cout << endl;
} | #include <iostream>
#include <string>
using namespace std;
int N, A, B, C, D;
string S;
int main() {
cin >> N >> A >> B >> C >> D;
cin >> S;
bool ans = true;
for (int i = A; i < C; i++) {
if (S[i] == '#' && S[i + 1] == '#') {
ans = false;
}
}
for (int i = B; i < D; i++) {
if (S[i] == '#' && S[i + 1] == '#') {
ans = false;
}
}
if (ans && C > D) {
ans = false;
for (int i = B - 2; i < C - 2; i++) {
if (S[i] == '.' && S[i + 1] == '.' && S[i + 2] == '.' && i + 1 < D) {
ans = true;
break;
}
}
}
if (ans)
cout << "Yes";
else
cout << "No";
cout << endl;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 830,098 | 830,099 | u992875223 | cpp |
p03017 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define REP(i, n) for (int i = 1; i <= n; i++)
typedef long long ll;
int main() {
int n, a, b, c, d;
cin >> n >> a >> b >> c >> d;
a--;
b--;
c--;
d--;
string s;
cin >> s;
if (d > c) {
bool ok = true;
for (int i = b; i <= d - 1; ++i) {
if (s[i] == '#' && s[i + 1] == '#')
ok = false;
}
for (int i = a; i <= c - 1; ++i) {
if (s[i] == '#' && s[i + 1] == '#')
ok = false;
}
if (ok) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
} else {
bool ok = true;
bool flag = false;
for (int i = b; i <= d - 1; ++i) {
if (s[i] == '.' && s[i + 1] == '.' && s[i + 2] == '.')
flag = true;
}
for (int i = a; i <= c - 1; ++i) {
if (s[i] == '#' && s[i + 1] == '#')
ok = false;
}
if (ok == true && flag == true) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define REP(i, n) for (int i = 1; i <= n; i++)
typedef long long ll;
int main() {
int n, a, b, c, d;
cin >> n >> a >> b >> c >> d;
a--;
b--;
c--;
d--;
string s;
cin >> s;
if (d > c) {
bool ok = true;
for (int i = b; i <= d - 1; ++i) {
if (s[i] == '#' && s[i + 1] == '#')
ok = false;
}
for (int i = a; i <= c - 1; ++i) {
if (s[i] == '#' && s[i + 1] == '#')
ok = false;
}
if (ok) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
} else {
bool ok = true;
bool flag = false;
for (int i = b - 1; i <= d - 1; ++i) {
if (s[i] == '.' && s[i + 1] == '.' && s[i + 2] == '.')
flag = true;
}
for (int i = a; i <= c - 1; ++i) {
if (s[i] == '#' && s[i + 1] == '#')
ok = false;
}
if (ok == true && flag == true) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
}
return 0;
}
| [
"control_flow.loop.for.initializer.change"
] | 830,124 | 830,125 | u024191315 | cpp |
p03017 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define REP(i, n) for (int i = 1; i <= n; i++)
typedef long long ll;
int main() {
int n, a, b, c, d;
cin >> n >> a >> b >> c >> d;
a--;
b--;
c--;
d--;
string s;
cin >> s;
if (d > c) {
bool ok = true;
for (int i = b; i <= d - 1; ++i) {
if (s[i] == '#' && s[i + 1] == '#')
ok = false;
}
for (int i = a; i <= c - 1; ++i) {
if (s[i] == '#' && s[i + 1] == '#')
ok = false;
}
if (ok) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
} else {
bool ok = true;
bool flag = false;
for (int i = b; i <= d - 2; ++i) {
if (s[i] == '.' && s[i + 1] == '.' && s[i + 2] == '.')
flag = true;
}
for (int i = a; i <= c - 1; ++i) {
if (s[i] == '#' && s[i + 1] == '#')
ok = false;
}
if (ok == true && flag == true) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define REP(i, n) for (int i = 1; i <= n; i++)
typedef long long ll;
int main() {
int n, a, b, c, d;
cin >> n >> a >> b >> c >> d;
a--;
b--;
c--;
d--;
string s;
cin >> s;
if (d > c) {
bool ok = true;
for (int i = b; i <= d - 1; ++i) {
if (s[i] == '#' && s[i + 1] == '#')
ok = false;
}
for (int i = a; i <= c - 1; ++i) {
if (s[i] == '#' && s[i + 1] == '#')
ok = false;
}
if (ok) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
} else {
bool ok = true;
bool flag = false;
for (int i = b - 1; i <= d - 1; ++i) {
if (s[i] == '.' && s[i + 1] == '.' && s[i + 2] == '.')
flag = true;
}
for (int i = a; i <= c - 1; ++i) {
if (s[i] == '#' && s[i + 1] == '#')
ok = false;
}
if (ok == true && flag == true) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
}
return 0;
}
| [
"control_flow.loop.for.initializer.change",
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 830,126 | 830,125 | u024191315 | cpp |
p03017 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define REP(i, n) for (int i = 1; i <= n; i++)
typedef long long ll;
int main() {
int n, a, b, c, d;
cin >> n >> a >> b >> c >> d;
a--;
b--;
c--;
d--;
string s;
cin >> s;
if (d > c) {
bool ok = true;
for (int i = b; i <= d - 1; ++i) {
if (s[i] == '#' && s[i + 1] == '#')
ok = false;
}
for (int i = a; i <= c - 1; ++i) {
if (s[i] == '#' && s[i + 1] == '#')
ok = false;
}
if (ok) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
} else {
bool ok = true;
bool flag = false;
for (int i = b; i <= d; ++i) {
if (s[i] == '.' && s[i + 1] == '.' && s[i + 2] == '.')
flag = true;
}
for (int i = a; i <= c - 1; ++i) {
if (s[i] == '#' && s[i + 1] == '#')
ok = false;
}
if (ok == true && flag == true) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define REP(i, n) for (int i = 1; i <= n; i++)
typedef long long ll;
int main() {
int n, a, b, c, d;
cin >> n >> a >> b >> c >> d;
a--;
b--;
c--;
d--;
string s;
cin >> s;
if (d > c) {
bool ok = true;
for (int i = b; i <= d - 1; ++i) {
if (s[i] == '#' && s[i + 1] == '#')
ok = false;
}
for (int i = a; i <= c - 1; ++i) {
if (s[i] == '#' && s[i + 1] == '#')
ok = false;
}
if (ok) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
} else {
bool ok = true;
bool flag = false;
for (int i = b - 1; i <= d - 1; ++i) {
if (s[i] == '.' && s[i + 1] == '.' && s[i + 2] == '.')
flag = true;
}
for (int i = a; i <= c - 1; ++i) {
if (s[i] == '#' && s[i + 1] == '#')
ok = false;
}
if (ok == true && flag == true) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
}
return 0;
}
| [
"control_flow.loop.for.initializer.change",
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 830,127 | 830,125 | u024191315 | cpp |
p03017 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define REP(i, n) for (int i = 1; i <= n; i++)
typedef long long ll;
int main() {
int n, a, b, c, d;
cin >> n >> a >> b >> c >> d;
a--;
b--;
c--;
d--;
string s;
cin >> s;
if (d > c) {
bool ok = true;
for (int i = b; i <= d - 1; ++i) {
if (s[i] == '#' && s[i + 1] == '#')
ok = false;
}
for (int i = a; i <= c - 1; ++i) {
if (s[i] == '#' && s[i + 1] == '#')
ok = false;
}
if (ok) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
} else {
bool ok = true;
bool flag = false;
for (int i = a; i <= d; ++i) {
if (s[i] == '.' && s[i + 1] == '.' && s[i + 2] == '.')
flag = true;
}
for (int i = a; i <= c - 1; ++i) {
if (s[i] == '#' && s[i + 1] == '#')
ok = false;
}
if (ok == true && flag == true) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define REP(i, n) for (int i = 1; i <= n; i++)
typedef long long ll;
int main() {
int n, a, b, c, d;
cin >> n >> a >> b >> c >> d;
a--;
b--;
c--;
d--;
string s;
cin >> s;
if (d > c) {
bool ok = true;
for (int i = b; i <= d - 1; ++i) {
if (s[i] == '#' && s[i + 1] == '#')
ok = false;
}
for (int i = a; i <= c - 1; ++i) {
if (s[i] == '#' && s[i + 1] == '#')
ok = false;
}
if (ok) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
} else {
bool ok = true;
bool flag = false;
for (int i = b - 1; i <= d - 1; ++i) {
if (s[i] == '.' && s[i + 1] == '.' && s[i + 2] == '.')
flag = true;
}
for (int i = a; i <= c - 1; ++i) {
if (s[i] == '#' && s[i + 1] == '#')
ok = false;
}
if (ok == true && flag == true) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
}
return 0;
}
| [
"control_flow.loop.for.initializer.change",
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 830,128 | 830,125 | u024191315 | cpp |
p03017 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define REP(i, n) for (int i = 1; i <= n; i++)
typedef long long ll;
int main() {
int n, a, b, c, d;
cin >> n >> a >> b >> c >> d;
a--;
b--;
c--;
d--;
string s;
cin >> s;
if (d > c) {
bool ok = true;
for (int i = b; i <= d - 1; ++i) {
if (s[i] == '#' && s[i + 1] == '#')
ok = false;
}
for (int i = a; i <= c - 1; ++i) {
if (s[i] == '#' && s[i + 1] == '#')
ok = false;
}
if (ok) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
} else {
bool ok = true;
bool flag = false;
for (int i = a; i <= c - 2; ++i) {
if (s[i] == '.' && s[i + 1] == '.' && s[i + 2] == '.')
flag = true;
}
for (int i = a; i <= c - 1; ++i) {
if (s[i] == '#' && s[i + 1] == '#')
ok = false;
}
if (ok == true && flag == true) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define REP(i, n) for (int i = 1; i <= n; i++)
typedef long long ll;
int main() {
int n, a, b, c, d;
cin >> n >> a >> b >> c >> d;
a--;
b--;
c--;
d--;
string s;
cin >> s;
if (d > c) {
bool ok = true;
for (int i = b; i <= d - 1; ++i) {
if (s[i] == '#' && s[i + 1] == '#')
ok = false;
}
for (int i = a; i <= c - 1; ++i) {
if (s[i] == '#' && s[i + 1] == '#')
ok = false;
}
if (ok) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
} else {
bool ok = true;
bool flag = false;
for (int i = b - 1; i <= d - 1; ++i) {
if (s[i] == '.' && s[i + 1] == '.' && s[i + 2] == '.')
flag = true;
}
for (int i = a; i <= c - 1; ++i) {
if (s[i] == '#' && s[i + 1] == '#')
ok = false;
}
if (ok == true && flag == true) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
}
return 0;
}
| [
"control_flow.loop.for.initializer.change",
"identifier.change",
"control_flow.branch.if.condition.change",
"literal.number.change"
] | 830,129 | 830,125 | u024191315 | cpp |
p03017 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <queue>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
#define int long long
#define rep(i, n) for (int i = 0; i < n; ++i)
#define rep1(i, n) for (int i = 1; i <= n; ++i)
#define ALL(x) x.begin(), x.end()
#define ll long long
typedef pair<int, int> P;
const int inf = 1000000007;
const int MOD = 1000000007;
signed main() {
int n, a, b, c, d;
cin >> n >> a >> b >> c >> d;
bool flag = true;
string s;
cin >> s;
bool tag = true;
for (int i = b; i < d; i++) {
if (s[i - 1] == '.' && s[i] == '.') {
if (s[i + 1] == '.') {
tag = false;
}
}
if (s[i] == '#' && s[i - 1] == '#') {
flag = false;
}
}
if (tag)
s[d - 1] = '#';
for (int i = a; i < c; i++) {
if (s[i] == '#' && s[i - 1] == '#') {
flag = false;
}
}
if (flag) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
return 0;
}
| #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <queue>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
#define int long long
#define rep(i, n) for (int i = 0; i < n; ++i)
#define rep1(i, n) for (int i = 1; i <= n; ++i)
#define ALL(x) x.begin(), x.end()
#define ll long long
typedef pair<int, int> P;
const int inf = 1000000007;
const int MOD = 1000000007;
signed main() {
int n, a, b, c, d;
cin >> n >> a >> b >> c >> d;
bool flag = true;
string s;
cin >> s;
bool tag = true;
for (int i = b; i < d; i++) {
if (s[i - 1] == '.' && s[i] == '.') {
if (s[i - 2] == '.') {
tag = false;
}
}
if (s[i] == '#' && s[i - 1] == '#') {
flag = false;
}
}
if (tag)
s[d - 1] = '#';
for (int i = a; i < c; i++) {
if (s[i] == '#' && s[i - 1] == '#') {
flag = false;
}
}
if (flag) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
return 0;
}
| [
"control_flow.loop.for.condition.change"
] | 830,130 | 830,131 | u313043608 | cpp |
p03017 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep2(i, x, n) for (int i = x; i < (n); i++)
#define all(n) begin(n), end(n)
struct cww {
cww() {
ios::sync_with_stdio(false);
cin.tie(0);
}
} star;
const long long INF = numeric_limits<long long>::max();
typedef long long ll;
typedef vector<int> vint;
typedef vector<char> vchar;
typedef vector<vector<int>> vvint;
typedef vector<ll> vll;
typedef vector<vector<ll>> vvll;
typedef unsigned long long ull;
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
template <typename T> vector<T> make_v(size_t a) { return vector<T>(a); }
template <typename T, typename... Ts> auto make_v(size_t a, Ts... ts) {
return vector<decltype(make_v<T>(ts...))>(a, make_v<T>(ts...));
}
template <typename T, typename V>
typename enable_if<is_class<T>::value == 0>::type fill_v(T &t, const V &v) {
t = v;
}
template <typename T, typename V>
typename enable_if<is_class<T>::value != 0>::type fill_v(T &t, const V &v) {
for (auto &e : t)
fill_v(e, v);
}
vector<pair<char, int>> run_length_compress(string S) {
vector<pair<char, int>> res;
int n = S.size(), cnt = 1;
for (int i = 0; i < n - 1; i++) {
if (S[i] == S[i + 1]) {
cnt++;
} else {
res.push_back({S[i], cnt});
cnt = 1;
}
}
res.push_back({S.back(), cnt});
return res;
}
int main() {
ll N, A, B, C, D;
cin >> N >> A >> B >> C >> D;
A--;
B--;
C--;
D--;
string S;
cin >> S;
for (int i = A; i + 1 < max(C, D); i++) {
if (S[i] == S[i + 1] and S[i] == '#') {
cout << "No";
return 0;
}
}
if (C < D) {
cout << "Yes";
return 0;
} else {
for (int i = B; i + 1 < D; i++) {
if (S[i - 1] == S[i] and S[i - 1] == S[i + 1] and S[i] == '.') {
cout << "Yes";
return 0;
}
}
}
cout << "No" << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep2(i, x, n) for (int i = x; i < (n); i++)
#define all(n) begin(n), end(n)
struct cww {
cww() {
ios::sync_with_stdio(false);
cin.tie(0);
}
} star;
const long long INF = numeric_limits<long long>::max();
typedef long long ll;
typedef vector<int> vint;
typedef vector<char> vchar;
typedef vector<vector<int>> vvint;
typedef vector<ll> vll;
typedef vector<vector<ll>> vvll;
typedef unsigned long long ull;
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
template <typename T> vector<T> make_v(size_t a) { return vector<T>(a); }
template <typename T, typename... Ts> auto make_v(size_t a, Ts... ts) {
return vector<decltype(make_v<T>(ts...))>(a, make_v<T>(ts...));
}
template <typename T, typename V>
typename enable_if<is_class<T>::value == 0>::type fill_v(T &t, const V &v) {
t = v;
}
template <typename T, typename V>
typename enable_if<is_class<T>::value != 0>::type fill_v(T &t, const V &v) {
for (auto &e : t)
fill_v(e, v);
}
vector<pair<char, int>> run_length_compress(string S) {
vector<pair<char, int>> res;
int n = S.size(), cnt = 1;
for (int i = 0; i < n - 1; i++) {
if (S[i] == S[i + 1]) {
cnt++;
} else {
res.push_back({S[i], cnt});
cnt = 1;
}
}
res.push_back({S.back(), cnt});
return res;
}
int main() {
ll N, A, B, C, D;
cin >> N >> A >> B >> C >> D;
A--;
B--;
C--;
D--;
string S;
cin >> S;
for (int i = A; i + 1 < max(C, D); i++) {
if (S[i] == S[i + 1] and S[i] == '#') {
cout << "No";
return 0;
}
}
if (C < D) {
cout << "Yes";
return 0;
} else {
for (int i = B; i <= D; i++) {
if (S[i - 1] == S[i] and S[i - 1] == S[i + 1] and S[i] == '.') {
cout << "Yes";
return 0;
}
}
}
cout << "No" << endl;
return 0;
} | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 830,142 | 830,143 | u987913144 | cpp |
p03017 | #include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int N, A, B, C, D;
cin >> N >> A >> B >> C >> D;
string S;
cin >> S;
int mxCD = max(C, D);
for (int i = A; i < mxCD - 1; i++) {
if (S[i] == '#' && S[i + 1] == '#') {
cout << "No" << endl;
return 0;
}
}
if (C > D) {
for (int i = B - 2; i < D - 2; i++) {
if (S[i] == '.' && S[i + 1] == '.' && S[i + 2] == '.') {
cout << "Yes" << endl;
return 0;
}
}
cout << "No" << endl;
} else {
cout << "Yes" << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int N, A, B, C, D;
cin >> N >> A >> B >> C >> D;
string S;
cin >> S;
int mxCD = max(C, D);
for (int i = A; i < mxCD - 1; i++) {
if (S[i] == '#' && S[i + 1] == '#') {
cout << "No" << endl;
return 0;
}
}
if (C > D) {
for (int i = B - 2; i < D - 1; i++) {
if (S[i] == '.' && S[i + 1] == '.' && S[i + 2] == '.') {
cout << "Yes" << endl;
return 0;
}
}
cout << "No" << endl;
} else {
cout << "Yes" << endl;
}
} | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 830,159 | 830,160 | u158583803 | cpp |
p03017 | #include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int N, A, B, C, D;
cin >> N >> A >> B >> C >> D;
string S;
cin >> S;
int mxCD = max(C, D);
for (int i = A; i < mxCD - 1; i++) {
if (S[i] == '#' && S[i + 1] == '#') {
cout << "No" << endl;
return 0;
}
}
if (C > D) {
for (int i = B + 1; i < D - 2; i++) {
if (S[i] == '.' && S[i + 1] == '.' && S[i + 2] == '.') {
cout << "Yes" << endl;
return 0;
}
}
cout << "No" << endl;
} else {
cout << "Yes" << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int N, A, B, C, D;
cin >> N >> A >> B >> C >> D;
string S;
cin >> S;
int mxCD = max(C, D);
for (int i = A; i < mxCD - 1; i++) {
if (S[i] == '#' && S[i + 1] == '#') {
cout << "No" << endl;
return 0;
}
}
if (C > D) {
for (int i = B - 2; i < D - 1; i++) {
if (S[i] == '.' && S[i + 1] == '.' && S[i + 2] == '.') {
cout << "Yes" << endl;
return 0;
}
}
cout << "No" << endl;
} else {
cout << "Yes" << endl;
}
} | [
"control_flow.loop.for.initializer.change",
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 830,161 | 830,160 | u158583803 | cpp |
p03017 | #include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int N, A, B, C, D;
cin >> N >> A >> B >> C >> D;
string S;
cin >> S;
int mxCD = max(C, D);
for (int i = A; i < mxCD - 1; i++) {
if (S[i] == '#' && S[i + 1] == '#') {
cout << "No" << endl;
return 0;
}
}
if (C > D) {
for (int i = B; i < D - 2; i++) {
if (S[i] == '.' && S[i + 1] == '.' && S[i + 2] == '.') {
cout << "Yes" << endl;
return 0;
}
}
cout << "No" << endl;
} else {
cout << "Yes" << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int N, A, B, C, D;
cin >> N >> A >> B >> C >> D;
string S;
cin >> S;
int mxCD = max(C, D);
for (int i = A; i < mxCD - 1; i++) {
if (S[i] == '#' && S[i + 1] == '#') {
cout << "No" << endl;
return 0;
}
}
if (C > D) {
for (int i = B - 2; i < D - 1; i++) {
if (S[i] == '.' && S[i + 1] == '.' && S[i + 2] == '.') {
cout << "Yes" << endl;
return 0;
}
}
cout << "No" << endl;
} else {
cout << "Yes" << endl;
}
} | [
"control_flow.loop.for.initializer.change",
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 830,162 | 830,160 | u158583803 | cpp |
p03017 | #include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iterator>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#pragma warning(disable : 4996)
typedef long long ll;
#define MIN(a, b) ((a) > (b) ? (b) : (a))
#define MAX(a, b) ((a) < (b) ? (b) : (a))
#define LINF 9223300000000000000
#define LINF2 1223300000000000000
#define INF 2140000000
const long long MOD = 1000000007;
// const long long MOD = 998244353;
using namespace std;
char str[200005];
void solve() {
int n, a, b, c, d;
scanf("%d%d%d%d%d%s", &n, &a, &b, &c, &d, str);
a--;
b--;
c--;
d--;
int i;
if (c > d) {
for (i = a + 1; i < b; i++) {
if (str[i] == '#' && str[i - 1] == '#') {
printf("No\n");
return;
}
}
for (i = d + 1; i < c; i++) {
if (str[i] == '#' && str[i - 1] == '#') {
printf("No\n");
return;
}
}
int bad = 1;
for (i = b + 1; i <= d - 1; i++) {
if (str[i + 1] == '.' && str[i] == '.' && str[i - 1] == '.') {
bad = 0;
}
}
if (bad) {
printf("No\n");
return;
}
} else {
for (i = a + 1; i < c; i++) {
if (str[i] == '#' && str[i - 1] == '#') {
printf("No\n");
return;
}
}
for (i = b + 1; i < d; i++) {
if (str[i] == '#' && str[i - 1] == '#') {
printf("No\n");
return;
}
}
}
printf("Yes\n");
return;
}
int main(int argc, char *argv[]) {
#if 1
solve();
#else
int T;
scanf("%d", &T);
while (T--) {
solve();
}
#endif
return 0;
}
| #include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iterator>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#pragma warning(disable : 4996)
typedef long long ll;
#define MIN(a, b) ((a) > (b) ? (b) : (a))
#define MAX(a, b) ((a) < (b) ? (b) : (a))
#define LINF 9223300000000000000
#define LINF2 1223300000000000000
#define INF 2140000000
const long long MOD = 1000000007;
// const long long MOD = 998244353;
using namespace std;
char str[200005];
void solve() {
int n, a, b, c, d;
scanf("%d%d%d%d%d%s", &n, &a, &b, &c, &d, str);
a--;
b--;
c--;
d--;
int i;
if (c > d) {
for (i = a + 1; i < b; i++) {
if (str[i] == '#' && str[i - 1] == '#') {
printf("No\n");
return;
}
}
for (i = d + 1; i < c; i++) {
if (str[i] == '#' && str[i - 1] == '#') {
printf("No\n");
return;
}
}
int bad = 1;
for (i = b; i <= d; i++) {
if (str[i + 1] == '.' && str[i] == '.' && str[i - 1] == '.') {
bad = 0;
}
}
if (bad) {
printf("No\n");
return;
}
} else {
for (i = a + 1; i < c; i++) {
if (str[i] == '#' && str[i - 1] == '#') {
printf("No\n");
return;
}
}
for (i = b + 1; i < d; i++) {
if (str[i] == '#' && str[i - 1] == '#') {
printf("No\n");
return;
}
}
}
printf("Yes\n");
return;
}
int main(int argc, char *argv[]) {
#if 1
solve();
#else
int T;
scanf("%d", &T);
while (T--) {
solve();
}
#endif
return 0;
}
| [
"control_flow.loop.for.initializer.change",
"expression.operation.binary.remove",
"control_flow.loop.for.condition.change"
] | 830,167 | 830,168 | u209713918 | cpp |
p03017 | #include <bits/stdc++.h>
#define ALL(obj) begin(obj), end(obj)
#define debug(x) cerr << #x << ": " << x << '\n'
using namespace std;
template <class T> vector<T> make_vec(size_t a) { return vector<T>(a); }
template <class T, class... Ts> auto make_vec(size_t a, Ts... ts) {
return vector<decltype(make_vec<T>(ts...))>(a, make_vec<T>(ts...));
}
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
using ll = long long;
using ull = unsigned long long;
const int INF = 2100100100;
// const int MOD = 1e9 + 7;
int main() {
int N, A, B, C, D;
cin >> N >> A >> B >> C >> D;
A--, B--, C--, D--;
string S;
cin >> S;
for (int i = B; i < D - 1; i++) {
if (S[i] == '#' && S[i + 1] == '#') {
cout << "No\n";
return 0;
}
}
for (int i = A; i < C - 1; i++) {
if (S[i] == '#' && S[i + 1] == '#') {
cout << "No\n";
return 0;
}
}
bool flag = true;
if (C > D) { // 追い越す必要があるとき
flag = false;
for (int i = B; i < D; i++) {
if (S[i - 1] == '.' && S[i] == '.' && S[i + 1] == '.') {
flag = true;
}
}
}
if (flag) {
cout << "Yes\n";
} else {
cout << "No\n";
}
}
| #include <bits/stdc++.h>
#define ALL(obj) begin(obj), end(obj)
#define debug(x) cerr << #x << ": " << x << '\n'
using namespace std;
template <class T> vector<T> make_vec(size_t a) { return vector<T>(a); }
template <class T, class... Ts> auto make_vec(size_t a, Ts... ts) {
return vector<decltype(make_vec<T>(ts...))>(a, make_vec<T>(ts...));
}
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
using ll = long long;
using ull = unsigned long long;
const int INF = 2100100100;
// const int MOD = 1e9 + 7;
int main() {
int N, A, B, C, D;
cin >> N >> A >> B >> C >> D;
A--, B--, C--, D--;
string S;
cin >> S;
for (int i = B; i < D; i++) {
if (S[i] == '#' && S[i + 1] == '#') {
cout << "No\n";
return 0;
}
}
for (int i = A; i < C; i++) {
if (S[i] == '#' && S[i + 1] == '#') {
cout << "No\n";
return 0;
}
}
bool flag = true;
if (C > D) { // 追い越す必要があるとき
flag = false;
for (int i = B; i <= D; i++) {
if (S[i - 1] == '.' && S[i] == '.' && S[i + 1] == '.') {
flag = true;
}
}
}
if (flag) {
cout << "Yes\n";
} else {
cout << "No\n";
}
}
| [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 830,169 | 830,170 | u571173211 | cpp |
p03017 | #include <bits/stdc++.h>
using namespace std;
void err() {
cout << "No" << endl;
exit(0);
}
int main() {
cin.tie(0);
cin.sync_with_stdio(false);
int n, a, b, c, d;
string s;
cin >> n >> a >> b >> c >> d >> s;
a--;
b--;
c--;
d--;
for (int t = 0; t < 2; t++) {
for (int i = a + 1; i < c - 1; i++) {
if (s[i] == '#' && s[i + 1] == '#')
err();
}
swap(a, b);
swap(c, d);
}
if (d < c) {
bool flg = false;
for (int i = b - 1; i < d - 1; i++) {
if (s[i] == '.' && s[i + 1] == '.' && s[i + 2] == '.')
flg = true;
}
if (!flg)
err();
}
cout << "Yes" << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
void err() {
cout << "No" << endl;
exit(0);
}
int main() {
cin.tie(0);
cin.sync_with_stdio(false);
int n, a, b, c, d;
string s;
cin >> n >> a >> b >> c >> d >> s;
a--;
b--;
c--;
d--;
for (int t = 0; t < 2; t++) {
for (int i = a + 1; i < c - 1; i++) {
if (s[i] == '#' && s[i + 1] == '#')
err();
}
swap(a, b);
swap(c, d);
}
if (d < c) {
bool flg = false;
for (int i = b - 1; i <= d - 1; i++) {
if (s[i] == '.' && s[i + 1] == '.' && s[i + 2] == '.')
flg = true;
}
if (!flg)
err();
}
cout << "Yes" << endl;
return 0;
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 830,171 | 830,172 | u846041485 | cpp |
p03017 | #include <bits/stdc++.h>
using namespace std;
void err() {
cout << "No" << endl;
exit(0);
}
int main() {
cin.tie(0);
cin.sync_with_stdio(false);
int n, a, b, c, d;
string s;
cin >> n >> a >> b >> c >> d >> s;
a--;
b--;
c--;
d--;
for (int t = 0; t < 2; t++) {
for (int i = a + 1; i < c - 1; i++) {
if (s[i] == '#' && s[i + 1] == '#')
err();
}
swap(a, b);
swap(c, d);
}
if (d < c) {
bool flg = false;
for (int i = b + 1; i < d - 3; i++) {
if (s[i] == '.' && s[i + 1] == '.' && s[i + 2] == '.')
flg = true;
}
if (!flg)
err();
}
cout << "Yes" << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
void err() {
cout << "No" << endl;
exit(0);
}
int main() {
cin.tie(0);
cin.sync_with_stdio(false);
int n, a, b, c, d;
string s;
cin >> n >> a >> b >> c >> d >> s;
a--;
b--;
c--;
d--;
for (int t = 0; t < 2; t++) {
for (int i = a + 1; i < c - 1; i++) {
if (s[i] == '#' && s[i + 1] == '#')
err();
}
swap(a, b);
swap(c, d);
}
if (d < c) {
bool flg = false;
for (int i = b - 1; i <= d - 1; i++) {
if (s[i] == '.' && s[i + 1] == '.' && s[i + 2] == '.')
flg = true;
}
if (!flg)
err();
}
cout << "Yes" << endl;
return 0;
}
| [
"misc.opposites",
"expression.operator.arithmetic.change",
"control_flow.loop.for.initializer.change",
"expression.operation.binary.change",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"literal.number.change"
] | 830,173 | 830,172 | u846041485 | cpp |
p03017 | #include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define countof(array) (sizeof(array) / sizeof(array[0]))
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rrep(i, n) for (int i = (n)-1; i >= 0; --i)
#define rep2(i, n) for (int i = 1; i <= (n); ++i)
#define rrep2(i, n) for (int i = (n); i > 0; --i)
#define srep(i, s, n) for (int i = s; i < (n); ++i)
#define rsrep(i, s, n) for (int i = (n)-1; i >= s; --i)
#define all(a) (a).begin(), (a).end()
#define rall(a) (a).rbegin(), (a).rend()
#define aall(a) (a), (a) + countof(a) // for array sorting
#define raall(a) (a), (a) + countof(a), greater<>()
#define show(x) cout << #x << " = " << (x) << endl;
#define vfind(v, a) find(all(v), a) != v.end()
#define yn(f) \
{ \
if (f) \
puts("YES"); \
else \
puts("NO"); \
}
#define yns(f) \
{ \
if (f) \
puts("Yes"); \
else \
puts("No"); \
}
#define show_ary(...) \
{ \
cout << #__VA_ARGS__ << " = "; \
for (const auto &x : (__VA_ARGS__)) { \
cout << x << " "; \
} \
cout << endl; \
}
#define show_pair(...) \
cout << #__VA_ARGS__ << " = " << endl; \
for (const auto &x : (__VA_ARGS__)) { \
cout << " " << x.fi << " : " << x.se << endl; \
}
#define out_ary(...) \
{ \
int n = (__VA_ARGS__).size(); \
rep(i, n) printf("%d%s", (__VA_ARGS__)[i], i != n - 1 ? " " : "\n"); \
}
#define argmax(v) distance((v).begin(), max_element(all(v)))
#define argmin(v) distance((v).begin(), min_element(all(v)))
#define vmax(v) *max_element(all(v))
#define vmin(v) *min_element(all(v))
typedef long long int ll;
typedef pair<int, int> P;
typedef vector<P> vpair;
typedef vector<int> vint;
typedef vector<ll> vll;
typedef vector<double> vdouble;
typedef vector<string> vstr;
typedef vector<bool> vbool;
typedef vector<vint> vvint;
typedef vector<vll> vvll;
typedef vector<vstr> vvstr;
typedef vector<vbool> vvbool;
const ll LINF = 2000000000000000000ll;
const int INF = 1000000100;
const ll MOD = 1e9 + 7;
int main() {
int n, a, b, c, d;
cin >> n >> a >> b >> c >> d;
string s;
cin >> s;
--a;
--b;
--c;
--d;
if (c < d) {
srep(i, b + 1, d - 1) {
if (s[i] == '#' && s[i + 1] == '#') {
puts("No");
return 0;
}
}
s[d] = '#';
srep(i, a + 1, c - 1) {
if (s[i] == '#' && s[i + 1] == '#') {
puts("No");
return 0;
}
}
} else {
bool c = false;
srep(i, b, d) {
if (s[i] == '.' && s[i + 1] == '.' && s[i + 2] == '.')
c = true;
}
if (!c) {
puts("No");
return 0;
}
srep(i, a + 1, c - 1) {
if (s[i] == '#' && s[i + 1] == '#') {
puts("No");
return 0;
}
}
s[c] = '#';
srep(i, b + 1, d - 1) {
if (s[i] == '#' && s[i + 1] == '#') {
puts("No");
return 0;
}
}
}
puts("Yes");
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define countof(array) (sizeof(array) / sizeof(array[0]))
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rrep(i, n) for (int i = (n)-1; i >= 0; --i)
#define rep2(i, n) for (int i = 1; i <= (n); ++i)
#define rrep2(i, n) for (int i = (n); i > 0; --i)
#define srep(i, s, n) for (int i = s; i < (n); ++i)
#define rsrep(i, s, n) for (int i = (n)-1; i >= s; --i)
#define all(a) (a).begin(), (a).end()
#define rall(a) (a).rbegin(), (a).rend()
#define aall(a) (a), (a) + countof(a) // for array sorting
#define raall(a) (a), (a) + countof(a), greater<>()
#define show(x) cout << #x << " = " << (x) << endl;
#define vfind(v, a) find(all(v), a) != v.end()
#define yn(f) \
{ \
if (f) \
puts("YES"); \
else \
puts("NO"); \
}
#define yns(f) \
{ \
if (f) \
puts("Yes"); \
else \
puts("No"); \
}
#define show_ary(...) \
{ \
cout << #__VA_ARGS__ << " = "; \
for (const auto &x : (__VA_ARGS__)) { \
cout << x << " "; \
} \
cout << endl; \
}
#define show_pair(...) \
cout << #__VA_ARGS__ << " = " << endl; \
for (const auto &x : (__VA_ARGS__)) { \
cout << " " << x.fi << " : " << x.se << endl; \
}
#define out_ary(...) \
{ \
int n = (__VA_ARGS__).size(); \
rep(i, n) printf("%d%s", (__VA_ARGS__)[i], i != n - 1 ? " " : "\n"); \
}
#define argmax(v) distance((v).begin(), max_element(all(v)))
#define argmin(v) distance((v).begin(), min_element(all(v)))
#define vmax(v) *max_element(all(v))
#define vmin(v) *min_element(all(v))
typedef long long int ll;
typedef pair<int, int> P;
typedef vector<P> vpair;
typedef vector<int> vint;
typedef vector<ll> vll;
typedef vector<double> vdouble;
typedef vector<string> vstr;
typedef vector<bool> vbool;
typedef vector<vint> vvint;
typedef vector<vll> vvll;
typedef vector<vstr> vvstr;
typedef vector<vbool> vvbool;
const ll LINF = 2000000000000000000ll;
const int INF = 1000000100;
const ll MOD = 1e9 + 7;
int main() {
int n, a, b, c, d;
cin >> n >> a >> b >> c >> d;
string s;
cin >> s;
--a;
--b;
--c;
--d;
if (c < d) {
srep(i, b + 1, d - 1) {
if (s[i] == '#' && s[i + 1] == '#') {
puts("No");
return 0;
}
}
s[d] = '#';
srep(i, a + 1, c - 1) {
if (s[i] == '#' && s[i + 1] == '#') {
puts("No");
return 0;
}
}
} else {
bool c = false;
srep(i, b - 1, d) {
if (s[i] == '.' && s[i + 1] == '.' && s[i + 2] == '.')
c = true;
}
if (!c) {
puts("No");
return 0;
}
srep(i, a + 1, c - 1) {
if (s[i] == '#' && s[i + 1] == '#') {
puts("No");
return 0;
}
}
s[c] = '#';
srep(i, b + 1, d - 1) {
if (s[i] == '#' && s[i + 1] == '#') {
puts("No");
return 0;
}
}
}
puts("Yes");
return 0;
} | [
"expression.operation.binary.add"
] | 830,176 | 830,177 | u365512540 | cpp |
p03017 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <utility>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
const ll mod = 1000000007;
int main() {
int n, a, b, c, d;
string s;
cin >> n >> a >> b >> c >> d >> s;
if (c < d) {
for (int i = a; i <= d - 2; i++) {
if (s[i] == '#' && s[i + 1] == '#') {
cout << "No" << endl;
return 0;
}
}
cout << "Yes" << endl;
return 0;
}
for (int i = b - 1; i <= d - 2; i++) {
if (s[i] == '.' && s[i + 1] == '.' && s[i + 2] == '.') {
cout << "Yes" << endl;
return 0;
}
}
cout << "No" << endl;
return 0;
} | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <utility>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
const ll mod = 1000000007;
int main() {
int n, a, b, c, d;
string s;
cin >> n >> a >> b >> c >> d >> s;
if (c < d) {
for (int i = a; i <= d - 2; i++) {
if (s[i] == '#' && s[i + 1] == '#') {
cout << "No" << endl;
return 0;
}
}
cout << "Yes" << endl;
return 0;
}
for (int i = b - 2; i <= d - 2; i++) {
if (s[i] == '.' && s[i + 1] == '.' && s[i + 2] == '.') {
cout << "Yes" << endl;
return 0;
}
}
cout << "No" << endl;
return 0;
} | [
"literal.number.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 830,178 | 830,179 | u828388155 | cpp |
p03017 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
//#include <boost/multiprecision/cpp_ll.hpp>
// typedef boost::multiprecision::cpp_ll ll;
typedef long double dd;
#define i_7 (ll)(1E9 + 7)
//#define i_7 998244353
#define i_5 i_7 - 2
ll mod(ll a) {
ll c = a % i_7;
if (c >= 0)
return c;
return c + i_7;
}
typedef pair<ll, ll> l_l;
ll inf = (ll)1E16;
#define rep(i, l, r) for (ll i = l; i <= r; i++)
#define pb push_back
ll max(ll a, ll b) {
if (a < b)
return b;
else
return a;
}
ll min(ll a, ll b) {
if (a > b)
return b;
else
return a;
}
void Max(ll &pos, ll val) { pos = max(pos, val); } // Max(dp[n],dp[n-1]);
void Min(ll &pos, ll val) { pos = min(pos, val); }
void Add(ll &pos, ll val) { pos = mod(pos + val); }
dd EPS = 1E-9;
string alp = "abcdefghijklmnopqrstuvwxyz";
#define endl "\n"
#define fastio \
ios::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0);
int main() {
ll n, a, b, c, d;
cin >> n >> a >> b >> c >> d;
string s;
cin >> s;
if (c < d) {
if (b != d) {
rep(i, b - 1, d - 2) {
if (s[i] == s[i + 1] && s[i] == '#') {
cout << "No" << endl;
return 0;
}
}
}
if (a != c) {
rep(i, a - 1, c - 2) {
if (s[i] == s[i + 1] && s[i] == '#') {
cout << "No" << endl;
return 0;
}
}
}
cout << "Yes" << endl;
} else {
if (b != d) {
rep(i, b - 1, d - 2) {
if (s[i] == s[i + 1] && s[i] == '#') {
cout << "No" << endl;
return 0;
}
}
}
if (a != c) {
rep(i, a - 1, c - 2) {
if (s[i] == s[i + 1] && s[i] == '#') {
cout << "No" << endl;
return 0;
}
}
}
bool b = false;
rep(i, b - 1, d - 1) {
if (s[i] == s[i + 1] && s[i] == s[i - 1] && s[i] == '.') {
b = true;
}
}
if (!b) {
cout << "No" << endl;
return 0;
}
cout << "Yes" << endl;
return 0;
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
//#include <boost/multiprecision/cpp_ll.hpp>
// typedef boost::multiprecision::cpp_ll ll;
typedef long double dd;
#define i_7 (ll)(1E9 + 7)
//#define i_7 998244353
#define i_5 i_7 - 2
ll mod(ll a) {
ll c = a % i_7;
if (c >= 0)
return c;
return c + i_7;
}
typedef pair<ll, ll> l_l;
ll inf = (ll)1E16;
#define rep(i, l, r) for (ll i = l; i <= r; i++)
#define pb push_back
ll max(ll a, ll b) {
if (a < b)
return b;
else
return a;
}
ll min(ll a, ll b) {
if (a > b)
return b;
else
return a;
}
void Max(ll &pos, ll val) { pos = max(pos, val); } // Max(dp[n],dp[n-1]);
void Min(ll &pos, ll val) { pos = min(pos, val); }
void Add(ll &pos, ll val) { pos = mod(pos + val); }
dd EPS = 1E-9;
string alp = "abcdefghijklmnopqrstuvwxyz";
#define endl "\n"
#define fastio \
ios::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0);
int main() {
ll n, a, b, c, d;
cin >> n >> a >> b >> c >> d;
string s;
cin >> s;
if (c < d) {
if (b != d) {
rep(i, b - 1, d - 2) {
if (s[i] == s[i + 1] && s[i] == '#') {
cout << "No" << endl;
return 0;
}
}
}
if (a != c) {
rep(i, a - 1, c - 2) {
if (s[i] == s[i + 1] && s[i] == '#') {
cout << "No" << endl;
return 0;
}
}
}
cout << "Yes" << endl;
} else {
if (b != d) {
rep(i, b - 1, d - 2) {
if (s[i] == s[i + 1] && s[i] == '#') {
cout << "No" << endl;
return 0;
}
}
}
if (a != c) {
rep(i, a - 1, c - 2) {
if (s[i] == s[i + 1] && s[i] == '#') {
cout << "No" << endl;
return 0;
}
}
}
bool bol = false;
rep(i, b - 1, d - 1) {
if (s[i] == s[i + 1] && s[i] == s[i - 1] && s[i] == '.') {
bol = true;
}
}
if (!bol) {
cout << "No" << endl;
return 0;
}
cout << "Yes" << endl;
return 0;
}
return 0;
}
| [
"variable_declaration.name.change",
"identifier.change",
"assignment.variable.change",
"control_flow.branch.if.condition.change"
] | 830,183 | 830,184 | u541784678 | cpp |
p03017 | #include <algorithm>
#include <bitset>
#include <cctype>
#include <climits>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long double ld;
typedef long long int ll;
typedef unsigned long long int ull;
typedef vector<int> vi;
typedef vector<char> vc;
typedef vector<string> vs;
typedef vector<ll> vll;
typedef vector<pair<int, int>> vpii;
typedef vector<vector<int>> vvi;
typedef vector<vector<char>> vvc;
typedef vector<vector<string>> vvs;
typedef vector<vector<ll>> vvll;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rrep(i, n) for (int i = 1; i <= (n); ++i)
#define drep(i, n) for (int i = (n)-1; i >= 0; --i)
#define fin(ans) cout << (ans) << endl
#define STI(s) atoi(s.c_str())
#define mp(p, q) make_pair(p, q)
#define pb(n) push_back(n)
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define Sort(a) sort(a.begin(), a.end())
#define Rort(a) sort(a.rbegin(), a.rend())
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
const int P = 1000000007;
const int INF = INT_MAX;
const ll LLINF = 1LL << 60;
int main(void) {
ios::sync_with_stdio(false);
cin.tie(0);
//////////////////////////////////////////////////////
int n, a, b, c, d;
string s;
cin >> n >> a >> b >> c >> d >> s;
a--;
b--;
c--;
d--;
if (c > d) {
bool ch = false;
for (int i = b - 1; i < min(n - 3, d - 1); i++) {
if (i >= c)
break;
if (s[i] == '.' && s[i + 1] == '.' && s[i + 2] == '.') {
ch = true;
break;
}
}
if (!ch) {
fin("No");
return 0;
}
}
for (int i = a + 1; i < c - 1; i++) {
if (s[i] == '#' && s[i + 1] == '#') {
fin("No");
return 0;
}
}
for (int i = b; i < d - 1; i++) {
if (s[i] == '#' && s[i + 1] == '#') {
fin("No");
return 0;
}
}
fin("Yes");
//////////////////////////////////////////////////////
return 0;
} | #include <algorithm>
#include <bitset>
#include <cctype>
#include <climits>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long double ld;
typedef long long int ll;
typedef unsigned long long int ull;
typedef vector<int> vi;
typedef vector<char> vc;
typedef vector<string> vs;
typedef vector<ll> vll;
typedef vector<pair<int, int>> vpii;
typedef vector<vector<int>> vvi;
typedef vector<vector<char>> vvc;
typedef vector<vector<string>> vvs;
typedef vector<vector<ll>> vvll;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rrep(i, n) for (int i = 1; i <= (n); ++i)
#define drep(i, n) for (int i = (n)-1; i >= 0; --i)
#define fin(ans) cout << (ans) << endl
#define STI(s) atoi(s.c_str())
#define mp(p, q) make_pair(p, q)
#define pb(n) push_back(n)
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define Sort(a) sort(a.begin(), a.end())
#define Rort(a) sort(a.rbegin(), a.rend())
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
const int P = 1000000007;
const int INF = INT_MAX;
const ll LLINF = 1LL << 60;
int main(void) {
ios::sync_with_stdio(false);
cin.tie(0);
//////////////////////////////////////////////////////
int n, a, b, c, d;
string s;
cin >> n >> a >> b >> c >> d >> s;
a--;
b--;
c--;
d--;
if (c > d) {
bool ch = false;
for (int i = b - 1; i < min(n - 3, d); i++) {
if (i >= c)
break;
if (s[i] == '.' && s[i + 1] == '.' && s[i + 2] == '.') {
ch = true;
break;
}
}
if (!ch) {
fin("No");
return 0;
}
}
for (int i = a + 1; i < c - 1; i++) {
if (s[i] == '#' && s[i + 1] == '#') {
fin("No");
return 0;
}
}
for (int i = b; i < d - 1; i++) {
if (s[i] == '#' && s[i + 1] == '#') {
fin("No");
return 0;
}
}
fin("Yes");
//////////////////////////////////////////////////////
return 0;
} | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 830,190 | 830,191 | u903311413 | cpp |
p03017 | #include <algorithm>
#include <bitset>
#include <cctype>
#include <climits>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long double ld;
typedef long long int ll;
typedef unsigned long long int ull;
typedef vector<int> vi;
typedef vector<char> vc;
typedef vector<string> vs;
typedef vector<ll> vll;
typedef vector<pair<int, int>> vpii;
typedef vector<vector<int>> vvi;
typedef vector<vector<char>> vvc;
typedef vector<vector<string>> vvs;
typedef vector<vector<ll>> vvll;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rrep(i, n) for (int i = 1; i <= (n); ++i)
#define drep(i, n) for (int i = (n)-1; i >= 0; --i)
#define fin(ans) cout << (ans) << endl
#define STI(s) atoi(s.c_str())
#define mp(p, q) make_pair(p, q)
#define pb(n) push_back(n)
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define Sort(a) sort(a.begin(), a.end())
#define Rort(a) sort(a.rbegin(), a.rend())
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
const int P = 1000000007;
const int INF = INT_MAX;
const ll LLINF = 1LL << 60;
int main(void) {
ios::sync_with_stdio(false);
cin.tie(0);
//////////////////////////////////////////////////////
int n, a, b, c, d;
string s;
cin >> n >> a >> b >> c >> d >> s;
a--;
b--;
c--;
d--;
if (c > d) {
bool ch = false;
for (int i = a; i < min(n - 3, d - 1); i++) {
if (i >= c)
break;
if (s[i] == '.' && s[i + 1] == '.' && s[i + 2] == '.') {
ch = true;
break;
}
}
if (!ch) {
fin("No");
return 0;
}
}
for (int i = a + 1; i < c - 1; i++) {
if (s[i] == '#' && s[i + 1] == '#') {
fin("No");
return 0;
}
}
for (int i = b; i < d - 1; i++) {
if (s[i] == '#' && s[i + 1] == '#') {
fin("No");
return 0;
}
}
fin("Yes");
//////////////////////////////////////////////////////
return 0;
} | #include <algorithm>
#include <bitset>
#include <cctype>
#include <climits>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long double ld;
typedef long long int ll;
typedef unsigned long long int ull;
typedef vector<int> vi;
typedef vector<char> vc;
typedef vector<string> vs;
typedef vector<ll> vll;
typedef vector<pair<int, int>> vpii;
typedef vector<vector<int>> vvi;
typedef vector<vector<char>> vvc;
typedef vector<vector<string>> vvs;
typedef vector<vector<ll>> vvll;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rrep(i, n) for (int i = 1; i <= (n); ++i)
#define drep(i, n) for (int i = (n)-1; i >= 0; --i)
#define fin(ans) cout << (ans) << endl
#define STI(s) atoi(s.c_str())
#define mp(p, q) make_pair(p, q)
#define pb(n) push_back(n)
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define Sort(a) sort(a.begin(), a.end())
#define Rort(a) sort(a.rbegin(), a.rend())
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
const int P = 1000000007;
const int INF = INT_MAX;
const ll LLINF = 1LL << 60;
int main(void) {
ios::sync_with_stdio(false);
cin.tie(0);
//////////////////////////////////////////////////////
int n, a, b, c, d;
string s;
cin >> n >> a >> b >> c >> d >> s;
a--;
b--;
c--;
d--;
if (c > d) {
bool ch = false;
for (int i = b - 1; i < min(n - 3, d); i++) {
if (i >= c)
break;
if (s[i] == '.' && s[i + 1] == '.' && s[i + 2] == '.') {
ch = true;
break;
}
}
if (!ch) {
fin("No");
return 0;
}
}
for (int i = a + 1; i < c - 1; i++) {
if (s[i] == '#' && s[i + 1] == '#') {
fin("No");
return 0;
}
}
for (int i = b; i < d - 1; i++) {
if (s[i] == '#' && s[i + 1] == '#') {
fin("No");
return 0;
}
}
fin("Yes");
//////////////////////////////////////////////////////
return 0;
} | [
"control_flow.loop.for.initializer.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 830,192 | 830,191 | u903311413 | cpp |
p03017 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using Graph = vector<vector<int>>;
#define rep(i, m, n) for (int i = (int)(m); i < (int)(n); ++i)
#define rREP(i, m, n) for (int(i) = (n)-1; (i) >= (m); --(i))
#define all(x) (x).begin(), (x).end()
#define out(y, x, h, w) (y) < 0 || (x) < 0 || (y) >= (h) || (x) >= (w)
constexpr int INF = 1000000001;
constexpr ll mod = 1000000007;
constexpr double PI = 3.1415926535897932;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
inline void init() {
cin.tie(nullptr);
cout.tie(nullptr);
ios::sync_with_stdio(false);
cout << fixed << setprecision(15);
}
int main() {
init();
int N, A, B, C, D;
cin >> N >> A >> B >> C >> D;
string s;
cin >> s;
bool ok = true;
rep(i, A - 1, D - 1) {
if (s[i] == '#' && s[i + 1] == '#')
ok = false;
}
if (ok && C > D) {
ok = false;
rep(i, B - 2, D) {
if (s[i] == '.' && s[i + 1] == '.' && s[i + 2] == '.')
ok = true;
}
}
cout << (ok ? "Yes" : "No") << "\n";
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using Graph = vector<vector<int>>;
#define rep(i, m, n) for (int i = (int)(m); i < (int)(n); ++i)
#define rREP(i, m, n) for (int(i) = (n)-1; (i) >= (m); --(i))
#define all(x) (x).begin(), (x).end()
#define out(y, x, h, w) (y) < 0 || (x) < 0 || (y) >= (h) || (x) >= (w)
constexpr int INF = 1000000001;
constexpr ll mod = 1000000007;
constexpr double PI = 3.1415926535897932;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
inline void init() {
cin.tie(nullptr);
cout.tie(nullptr);
ios::sync_with_stdio(false);
cout << fixed << setprecision(15);
}
int main() {
init();
int N, A, B, C, D;
cin >> N >> A >> B >> C >> D;
string s;
cin >> s;
bool ok = true;
rep(i, A - 1, D - 1) {
if (s[i] == '#' && s[i + 1] == '#')
ok = false;
}
if (ok && C > D) {
ok = false;
rep(i, B - 2, D - 1) {
if (s[i] == '.' && s[i + 1] == '.' && s[i + 2] == '.')
ok = true;
}
}
cout << (ok ? "Yes" : "No") << "\n";
return 0;
} | [
"expression.operation.binary.add"
] | 830,219 | 830,220 | u813559924 | cpp |
p03017 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using Graph = vector<vector<int>>;
#define rep(i, m, n) for (int i = (int)(m); i < (int)(n); ++i)
#define rREP(i, m, n) for (int(i) = (n)-1; (i) >= (m); --(i))
#define all(x) (x).begin(), (x).end()
#define out(y, x, h, w) (y) < 0 || (x) < 0 || (y) >= (h) || (x) >= (w)
constexpr int INF = 1000000001;
constexpr ll mod = 1000000007;
constexpr double PI = 3.1415926535897932;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
inline void init() {
cin.tie(nullptr);
cout.tie(nullptr);
ios::sync_with_stdio(false);
cout << fixed << setprecision(15);
}
int main() {
init();
int N, A, B, C, D;
cin >> N >> A >> B >> C >> D;
string s;
cin >> s;
bool ok = true;
rep(i, A - 1, D - 1) {
if (s[i] == '#' && s[i + 1] == '#')
ok = false;
}
if (ok && C > D) {
ok = false;
rep(i, B - 2, C - 2) {
if (s[i] == '.' && s[i + 1] == '.' && s[i + 2] == '.')
ok = true;
}
}
cout << (ok ? "Yes" : "No") << "\n";
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using Graph = vector<vector<int>>;
#define rep(i, m, n) for (int i = (int)(m); i < (int)(n); ++i)
#define rREP(i, m, n) for (int(i) = (n)-1; (i) >= (m); --(i))
#define all(x) (x).begin(), (x).end()
#define out(y, x, h, w) (y) < 0 || (x) < 0 || (y) >= (h) || (x) >= (w)
constexpr int INF = 1000000001;
constexpr ll mod = 1000000007;
constexpr double PI = 3.1415926535897932;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
inline void init() {
cin.tie(nullptr);
cout.tie(nullptr);
ios::sync_with_stdio(false);
cout << fixed << setprecision(15);
}
int main() {
init();
int N, A, B, C, D;
cin >> N >> A >> B >> C >> D;
string s;
cin >> s;
bool ok = true;
rep(i, A - 1, D - 1) {
if (s[i] == '#' && s[i + 1] == '#')
ok = false;
}
if (ok && C > D) {
ok = false;
rep(i, B - 2, D - 1) {
if (s[i] == '.' && s[i + 1] == '.' && s[i + 2] == '.')
ok = true;
}
}
cout << (ok ? "Yes" : "No") << "\n";
return 0;
} | [
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change",
"literal.number.change"
] | 830,222 | 830,220 | u813559924 | cpp |
p03017 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using Graph = vector<vector<int>>;
#define rep(i, m, n) for (int i = (int)(m); i < (int)(n); ++i)
#define rREP(i, m, n) for (int(i) = (n)-1; (i) >= (m); --(i))
#define all(x) (x).begin(), (x).end()
#define out(y, x, h, w) (y) < 0 || (x) < 0 || (y) >= (h) || (x) >= (w)
constexpr int INF = 1000000001;
constexpr ll mod = 1000000007;
constexpr double PI = 3.1415926535897932;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
inline void init() {
cin.tie(nullptr);
cout.tie(nullptr);
ios::sync_with_stdio(false);
cout << fixed << setprecision(15);
}
int main() {
init();
int N, A, B, C, D;
cin >> N >> A >> B >> C >> D;
string s;
cin >> s;
bool ok = true;
rep(i, A - 1, D) {
if (s[i] == '#' && s[i + 1] == '#')
ok = false;
}
if (ok && C > D) {
ok = false;
rep(i, B - 2, C) {
if (s[i] == '.' && s[i + 1] == '.' && s[i + 2] == '.')
ok = true;
}
}
cout << (ok ? "Yes" : "No") << "\n";
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using Graph = vector<vector<int>>;
#define rep(i, m, n) for (int i = (int)(m); i < (int)(n); ++i)
#define rREP(i, m, n) for (int(i) = (n)-1; (i) >= (m); --(i))
#define all(x) (x).begin(), (x).end()
#define out(y, x, h, w) (y) < 0 || (x) < 0 || (y) >= (h) || (x) >= (w)
constexpr int INF = 1000000001;
constexpr ll mod = 1000000007;
constexpr double PI = 3.1415926535897932;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
inline void init() {
cin.tie(nullptr);
cout.tie(nullptr);
ios::sync_with_stdio(false);
cout << fixed << setprecision(15);
}
int main() {
init();
int N, A, B, C, D;
cin >> N >> A >> B >> C >> D;
string s;
cin >> s;
bool ok = true;
rep(i, A - 1, D - 1) {
if (s[i] == '#' && s[i + 1] == '#')
ok = false;
}
if (ok && C > D) {
ok = false;
rep(i, B - 2, D - 1) {
if (s[i] == '.' && s[i + 1] == '.' && s[i + 2] == '.')
ok = true;
}
}
cout << (ok ? "Yes" : "No") << "\n";
return 0;
} | [
"call.arguments.change"
] | 830,223 | 830,220 | u813559924 | cpp |
p03017 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using Graph = vector<vector<int>>;
#define rep(i, m, n) for (int i = (int)(m); i < (int)(n); ++i)
#define rREP(i, m, n) for (int(i) = (n)-1; (i) >= (m); --(i))
#define all(x) (x).begin(), (x).end()
#define out(y, x, h, w) (y) < 0 || (x) < 0 || (y) >= (h) || (x) >= (w)
constexpr int INF = 1000000001;
constexpr ll mod = 1000000007;
constexpr double PI = 3.1415926535897932;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
inline void init() {
cin.tie(nullptr);
cout.tie(nullptr);
ios::sync_with_stdio(false);
cout << fixed << setprecision(15);
}
int main() {
init();
int N, A, B, C, D;
cin >> N >> A >> B >> C >> D;
string s;
cin >> s;
bool ok = true;
rep(i, A - 1, N - 1) {
if (s[i] == '#' && s[i + 1] == '#')
ok = false;
}
if (ok && C > D) {
ok = false;
rep(i, B - 2, N - 2) {
if (s[i] == '.' && s[i + 1] == '.' && s[i + 2] == '.')
ok = true;
}
}
cout << (ok ? "Yes" : "No") << "\n";
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using Graph = vector<vector<int>>;
#define rep(i, m, n) for (int i = (int)(m); i < (int)(n); ++i)
#define rREP(i, m, n) for (int(i) = (n)-1; (i) >= (m); --(i))
#define all(x) (x).begin(), (x).end()
#define out(y, x, h, w) (y) < 0 || (x) < 0 || (y) >= (h) || (x) >= (w)
constexpr int INF = 1000000001;
constexpr ll mod = 1000000007;
constexpr double PI = 3.1415926535897932;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
inline void init() {
cin.tie(nullptr);
cout.tie(nullptr);
ios::sync_with_stdio(false);
cout << fixed << setprecision(15);
}
int main() {
init();
int N, A, B, C, D;
cin >> N >> A >> B >> C >> D;
string s;
cin >> s;
bool ok = true;
rep(i, A - 1, D - 1) {
if (s[i] == '#' && s[i + 1] == '#')
ok = false;
}
if (ok && C > D) {
ok = false;
rep(i, B - 2, D - 1) {
if (s[i] == '.' && s[i + 1] == '.' && s[i + 2] == '.')
ok = true;
}
}
cout << (ok ? "Yes" : "No") << "\n";
return 0;
} | [
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change",
"literal.number.change"
] | 830,224 | 830,220 | u813559924 | cpp |
p03017 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define repp(i, m, n) for (int(i) = (m); (i) < (n); (i)++)
#define repm(i, n) for (int(i) = (n - 1); (i) >= 0; (i)--)
#define INF (1ll << 60)
#define all(x) (x).begin(), (x).end()
typedef long long lint;
const lint MOD = 1000000007;
const lint MAX = 10000000;
using Graph = vector<vector<lint>>;
typedef pair<lint, lint> P;
lint fac[MAX], finv[MAX], inv[MAX];
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (lint i = 2; i < MAX; i++) {
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
long long COM(lint n, lint k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
lint primary(lint num) {
if (num < 2)
return 0;
else if (num == 2)
return 1;
else if (num % 2 == 0)
return 0;
double sqrtNum = sqrt(num);
for (int i = 3; i <= sqrtNum; i += 2) {
if (num % i == 0) {
return 0;
}
}
return 1;
}
long long modpow(long long a, long long n, long long mod) {
long long res = 1;
while (n > 0) {
if (n & 1)
res = res * a % mod;
a = a * a % mod;
n >>= 1;
}
return res;
}
lint lcm(lint a, lint b) { return a / __gcd(a, b) * b; }
int main() {
lint n, a, b, c, d;
cin >> n >> a >> b >> c >> d;
--a;
--b;
--c;
--d;
string s;
cin >> s;
if (c < d) {
lint count = 0;
repp(i, b, d) {
if (s[i] == '#')
count++;
else
count = 0;
if (count == 2) {
cout << "No";
return 0;
}
}
count = 0;
repp(i, a, c) {
if (s[i] == '#')
count++;
else
count = 0;
if (count == 2) {
cout << "No";
return 0;
}
}
} else {
lint count2 = 0;
lint countmax = -INF;
lint count3 = 0;
repp(i, b, d + 1) {
if (s[i] == '.')
count2++;
else
count2 = 0;
countmax = max(countmax, count2);
}
if (countmax < 3) {
cout << "No";
return 0;
}
repp(i, a, c) {
if (s[i] == '#')
count3++;
else
count3 = 0;
if (count3 == 2) {
cout << "No";
return 0;
}
}
}
cout << "Yes";
}
| #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define repp(i, m, n) for (int(i) = (m); (i) < (n); (i)++)
#define repm(i, n) for (int(i) = (n - 1); (i) >= 0; (i)--)
#define INF (1ll << 60)
#define all(x) (x).begin(), (x).end()
typedef long long lint;
const lint MOD = 1000000007;
const lint MAX = 10000000;
using Graph = vector<vector<lint>>;
typedef pair<lint, lint> P;
lint fac[MAX], finv[MAX], inv[MAX];
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (lint i = 2; i < MAX; i++) {
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
long long COM(lint n, lint k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
lint primary(lint num) {
if (num < 2)
return 0;
else if (num == 2)
return 1;
else if (num % 2 == 0)
return 0;
double sqrtNum = sqrt(num);
for (int i = 3; i <= sqrtNum; i += 2) {
if (num % i == 0) {
return 0;
}
}
return 1;
}
long long modpow(long long a, long long n, long long mod) {
long long res = 1;
while (n > 0) {
if (n & 1)
res = res * a % mod;
a = a * a % mod;
n >>= 1;
}
return res;
}
lint lcm(lint a, lint b) { return a / __gcd(a, b) * b; }
int main() {
lint n, a, b, c, d;
cin >> n >> a >> b >> c >> d;
--a;
--b;
--c;
--d;
string s;
cin >> s;
if (c < d) {
lint count = 0;
repp(i, b, d) {
if (s[i] == '#')
count++;
else
count = 0;
if (count == 2) {
cout << "No";
return 0;
}
}
count = 0;
repp(i, a, c) {
if (s[i] == '#')
count++;
else
count = 0;
if (count == 2) {
cout << "No";
return 0;
}
}
} else {
lint count2 = 0;
lint countmax = -INF;
lint count3 = 0;
repp(i, b - 1, d + 2) {
if (s[i] == '.')
count2++;
else
count2 = 0;
countmax = max(countmax, count2);
}
if (countmax < 3) {
cout << "No";
return 0;
}
repp(i, a, c) {
if (s[i] == '#')
count3++;
else
count3 = 0;
if (count3 == 2) {
cout << "No";
return 0;
}
}
}
cout << "Yes";
}
| [
"literal.number.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 830,247 | 830,248 | u768204022 | cpp |
p03017 | #include <bits/stdc++.h>
using namespace std;
int n, a, b, c, d, i;
char s[200200];
bool check(int x, int y) {
for (int i = x + 1; i <= y; i++)
if (s[i] == '#' && s[i - 1] == '#')
return false;
return true;
}
int main() {
scanf("%d%d%d%d%d", &n, &a, &b, &c, &d);
a--;
b--;
c--;
d--;
scanf("%s", s);
if (!check(a, c) || !check(b, d)) {
puts("No");
return 0;
}
if (c < d) {
puts("Yes");
return 0;
}
for (i = b; i <= c; i++)
if (s[i] == '.' && s[i - 1] == '.' && s[i + 1] == '.') {
puts("Yes");
return 0;
}
puts("No");
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int n, a, b, c, d, i;
char s[200200];
bool check(int x, int y) {
for (int i = x + 1; i <= y; i++)
if (s[i] == '#' && s[i - 1] == '#')
return false;
return true;
}
int main() {
scanf("%d%d%d%d%d", &n, &a, &b, &c, &d);
a--;
b--;
c--;
d--;
scanf("%s", s);
if (!check(a, c) || !check(b, d)) {
puts("No");
return 0;
}
if (c < d) {
puts("Yes");
return 0;
}
for (i = b; i <= d; i++)
if (s[i] == '.' && s[i - 1] == '.' && s[i + 1] == '.') {
puts("Yes");
return 0;
}
puts("No");
return 0;
}
| [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 830,253 | 830,254 | u412253974 | cpp |
p03017 | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define N 666666
char str[N], st[N];
signed main() {
int n, a, b, c, d;
cin >> n >> a >> b >> c >> d;
cin >> (str + 1);
int len = strlen(str + 1);
int sum = 0;
int F = 0;
for (int i = b; i <= d; i++) {
if (str[i] == '.')
sum++;
else
sum = 0;
// cout<<sum<<'\n';
if (sum >= 3) {
F = 1;
break;
}
}
// cout<<F<<'\n';
int add = 0;
for (int i = a + 1; i <= c; i++) {
if (str[i] == '#')
add++;
else
add = 0;
if (add > 1) {
cout << "No";
return 0;
}
}
add = 0;
for (int i = b + 1; i <= d; i++) {
if (str[i] == '#')
add++;
else
add = 0;
if (add > 1) {
cout << "No";
return 0;
}
}
if (d > c) {
cout << "Yes";
return 0;
}
str[d] = '#';
add = 0;
int f = 1;
for (int i = a + 1; i <= c; i++) {
if (str[i] == '#')
add++;
else
add = 0;
if (add > 1) {
f = 0;
break;
}
}
if (f) {
cout << "Yes";
} else if (!f && F) {
cout << "Yes";
} else {
cout << "No";
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define N 666666
char str[N], st[N];
signed main() {
int n, a, b, c, d;
cin >> n >> a >> b >> c >> d;
cin >> (str + 1);
int len = strlen(str + 1);
int sum = 0;
int F = 0;
for (int i = b - 1; i <= d + 1; i++) {
if (str[i] == '.')
sum++;
else
sum = 0;
// cout<<sum<<'\n';
if (sum >= 3) {
F = 1;
break;
}
}
// cout<<F<<'\n';
int add = 0;
for (int i = a + 1; i <= c; i++) {
if (str[i] == '#')
add++;
else
add = 0;
if (add > 1) {
cout << "No";
return 0;
}
}
add = 0;
for (int i = b + 1; i <= d; i++) {
if (str[i] == '#')
add++;
else
add = 0;
if (add > 1) {
cout << "No";
return 0;
}
}
if (d > c) {
cout << "Yes";
return 0;
}
str[d] = '#';
add = 0;
int f = 1;
for (int i = a + 1; i <= c; i++) {
if (str[i] == '#')
add++;
else
add = 0;
if (add > 1) {
f = 0;
break;
}
}
if (f) {
cout << "Yes";
} else if (!f && F) {
cout << "Yes";
} else {
cout << "No";
}
return 0;
} | [
"control_flow.loop.for.initializer.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 830,255 | 830,256 | u545770260 | cpp |
p03017 | #include <bits/stdc++.h>
using namespace std;
using Graph = vector<vector<int>>;
int main() {
int n, a, b, c, d;
cin >> n >> a >> b >> c >> d;
a--;
b--;
c--;
d--;
string s;
cin >> s;
int mx = max(c, d), mn = min(c, d);
int flag = 1, flag2 = 0;
for (int i = a; i < mx - 1; ++i) {
if (s[i] == '#' && s[i + 1] == '#') {
flag = 0;
break;
}
}
for (int i = b; i < mn; ++i) {
if (s[i] == '.' && s[i + 1] == '.' && s[i + 2] == '.') {
flag2 = 1;
break;
}
}
if (c > d && flag2 == 0) {
flag = 0;
}
if (flag) {
cout << "Yes";
} else
cout << "No";
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
using Graph = vector<vector<int>>;
int main() {
int n, a, b, c, d;
cin >> n >> a >> b >> c >> d;
a--;
b--;
c--;
d--;
string s;
cin >> s;
int mx = max(c, d), mn = min(c, d);
int flag = 1, flag2 = 0;
for (int i = a; i < mx - 1; ++i) {
if (s[i] == '#' && s[i + 1] == '#') {
flag = 0;
break;
}
}
for (int i = b - 1; i < mn; ++i) {
if (s[i] == '.' && s[i + 1] == '.' && s[i + 2] == '.') {
flag2 = 1;
break;
}
}
if (c > d && flag2 == 0) {
flag = 0;
}
if (flag) {
cout << "Yes";
} else
cout << "No";
return 0;
}
| [
"control_flow.loop.for.initializer.change"
] | 830,257 | 830,258 | u055231161 | cpp |
p03017 | #include <bits/stdc++.h>
using namespace std;
using Graph = vector<vector<int>>;
int main() {
int n, a, b, c, d;
cin >> n >> a >> b >> c >> d;
a--;
b--;
c--;
d--;
string s;
cin >> s;
int mx = max(c, d), mn = min(c, d);
int flag = 1, flag2 = 0;
for (int i = 0; i < mx - 1; ++i) {
if (s[i] == '#' && s[i + 1] == '#') {
flag = 0;
break;
}
}
for (int i = 0; i < mn; ++i) {
if (s[i] == '.' && s[i + 1] == '.' && s[i + 2] == '.') {
flag2 = 1;
break;
}
}
if (c > d && flag2 == 0) {
flag = 0;
}
if (flag) {
cout << "Yes";
} else
cout << "No";
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
using Graph = vector<vector<int>>;
int main() {
int n, a, b, c, d;
cin >> n >> a >> b >> c >> d;
a--;
b--;
c--;
d--;
string s;
cin >> s;
int mx = max(c, d), mn = min(c, d);
int flag = 1, flag2 = 0;
for (int i = a; i < mx - 1; ++i) {
if (s[i] == '#' && s[i + 1] == '#') {
flag = 0;
break;
}
}
for (int i = b - 1; i < mn; ++i) {
if (s[i] == '.' && s[i + 1] == '.' && s[i + 2] == '.') {
flag2 = 1;
break;
}
}
if (c > d && flag2 == 0) {
flag = 0;
}
if (flag) {
cout << "Yes";
} else
cout << "No";
return 0;
}
| [
"variable_declaration.value.change",
"identifier.replace.add",
"literal.replace.remove",
"control_flow.loop.for.initializer.change"
] | 830,259 | 830,258 | u055231161 | cpp |
p03017 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <queue>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
int main() {
int kazu = 0;
int as, bs, ag, bg;
cin >> kazu >> as >> bs >> ag >> bg;
string masu;
cin >> masu;
int kotae = 0;
int iwa = 0;
for (int i = as - 1; i <= max(ag, bg) - 1; i++) {
if (masu[i] == '#') {
iwa++;
} else {
iwa = 0;
}
if (iwa >= 2) {
kotae = 1;
i = max(ag, bg);
}
}
if (kotae == 0 && ag > bg) {
int ikeru = 0;
int nukeruka = 0;
for (int i = bs - 1; i <= ag - 1; i++) {
if (masu[i] == '.') {
ikeru++;
} else {
ikeru = 0;
}
if (ikeru >= 3) {
nukeruka = 1;
i = ag;
}
}
if (nukeruka == 0) {
kotae = 1;
}
}
if (kotae == 0) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
return 0;
} | #include <algorithm>
#include <cmath>
#include <iostream>
#include <queue>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
int main() {
int kazu = 0;
int as, bs, ag, bg;
cin >> kazu >> as >> bs >> ag >> bg;
string masu;
cin >> masu;
int kotae = 0;
int iwa = 0;
for (int i = as - 1; i <= max(ag, bg) - 1; i++) {
if (masu[i] == '#') {
iwa++;
} else {
iwa = 0;
}
if (iwa >= 2) {
kotae = 1;
i = max(ag, bg);
}
}
if (kotae == 0 && ag > bg) {
int ikeru = 0;
int nukeruka = 0;
for (int i = bs - 2; i <= bg; i++) {
if (masu[i] == '.') {
ikeru++;
} else {
ikeru = 0;
}
if (ikeru >= 3) {
nukeruka = 1;
i = ag;
}
}
if (nukeruka == 0) {
kotae = 1;
}
}
if (kotae == 0) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
return 0;
} | [
"literal.number.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"expression.operation.binary.change",
"identifier.change",
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 830,277 | 830,278 | u567906952 | cpp |
p03017 | #include <bits/stdc++.h>
#define ll long long int
#define MOD 1000000007
#define INF 1e18
#define PI 3.14159265358979
using namespace std;
int main(void) {
ll n, a, b, c, d;
cin >> n >> a >> b >> c >> d;
a--;
b--;
c--;
d--;
string s;
cin >> s;
if (c < d) {
int ok = 1;
for (int i = a; i < c; i++) {
if (s[i] == '#' && s[i + 1] == '#')
ok = 0;
}
for (int i = b; i < d; i++) {
if (s[i] == '#' && s[i + 1] == '#')
ok = 0;
}
if (ok)
cout << "Yes" << endl;
else
cout << "No" << endl;
} else {
int ok = 1;
for (int i = a; i < c; i++) {
if (s[i] == '#' && s[i + 1] == '#')
ok = 0;
}
for (int i = b; i < d; i++) {
if (s[i] == '#' && s[i + 1] == '#')
ok = 0;
}
if (ok) {
ok = 0;
for (int i = b - 1; i < c - 1; i++) {
if (s[i] == '.' && s[i + 1] == '.' && s[i + 2] == '.')
ok = 1;
}
if (ok)
cout << "Yes" << endl;
else
cout << "No" << endl;
} else
cout << "No" << endl;
}
return 0;
}
| #include <bits/stdc++.h>
#define ll long long int
#define MOD 1000000007
#define INF 1e18
#define PI 3.14159265358979
using namespace std;
int main(void) {
ll n, a, b, c, d;
cin >> n >> a >> b >> c >> d;
a--;
b--;
c--;
d--;
string s;
cin >> s;
if (c < d) {
int ok = 1;
for (int i = a; i < c; i++) {
if (s[i] == '#' && s[i + 1] == '#')
ok = 0;
}
for (int i = b; i < d; i++) {
if (s[i] == '#' && s[i + 1] == '#')
ok = 0;
}
if (ok)
cout << "Yes" << endl;
else
cout << "No" << endl;
} else {
int ok = 1;
for (int i = a; i < c; i++) {
if (s[i] == '#' && s[i + 1] == '#')
ok = 0;
}
for (int i = b; i < d; i++) {
if (s[i] == '#' && s[i + 1] == '#')
ok = 0;
}
if (ok) {
ok = 0;
for (int i = b - 1; i < d; i++) {
if (s[i] == '.' && s[i + 1] == '.' && s[i + 2] == '.')
ok = 1;
}
if (ok)
cout << "Yes" << endl;
else
cout << "No" << endl;
} else
cout << "No" << endl;
}
return 0;
}
| [
"identifier.change",
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 830,288 | 830,287 | u755121033 | cpp |
p03017 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <string>
#include <vector>
using namespace std;
int main() {
int n, a, b, c, d;
string s;
cin >> n >> a >> b >> c >> d >> s;
int cnt = 0;
int wall = 0;
for (int i = a - 1; i < max(c, d); i++) {
if (s[i] == '#') {
cnt++;
} else {
if (wall < cnt) {
wall = cnt;
}
cnt = 0;
}
}
if (c < d) {
if (wall < 2) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
return (0);
}
for (int i = b - 1; i < d - 1; i++) {
if (s[i - 1] == s[i] && s[i] == s[i + 1] && s[i] == '.') {
cout << "Yes" << endl;
return (0);
}
}
cout << "No" << endl;
}
| #include <algorithm>
#include <bitset>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <string>
#include <vector>
using namespace std;
int main() {
int n, a, b, c, d;
string s;
cin >> n >> a >> b >> c >> d >> s;
int cnt = 0;
int wall = 0;
for (int i = a - 1; i < max(c, d); i++) {
if (s[i] == '#') {
cnt++;
} else {
if (wall < cnt) {
wall = cnt;
}
cnt = 0;
}
}
if (c < d) {
if (wall < 2) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
return (0);
}
for (int i = b - 1; i < d; i++) {
if (s[i - 1] == s[i] && s[i] == s[i + 1] && s[i] == '.') {
cout << "Yes" << endl;
return (0);
}
}
cout << "No" << endl;
}
| [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 830,302 | 830,303 | u846686917 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.