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>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define reps(i, n) for (int i = 1; i <= (n); ++i)
#define repr(i, n) for (int i = (n); i >= 0; --i)
#define cinv(n, vec) \
VL(vec)(n); \
for (auto &v : vec) \
cin >> v;
#define int long long
#define itn int
#define pb push_back
#define m_p make_pair
#define m_t make_tuple
#define eb emplace_back
#define p_p(a, b) pb(m_p(a, b))
#define all(a) a.begin(), a.end()
#define SORT(a) sort(all(a))
#define RSORT(a) sort(all(a), greater<>())
#define UNIQUE(a) a.erase(unique(all(a)), a.end())
#define SZ(a) (ll)(a.size())
#define ENDL cout << endl
#define debg(a) cout << #a << " " << a << endl;
#define debgp(a) cout << #a << " " << a.fi << " : " << a.se << endl
#define call(a) \
for (auto i : a) \
cout << i << " "; \
cout << endl
#define show(a) \
for (cont & y : a) { \
for (cont & x : y) { \
cout << x << " "; \
} \
cout << endl; \
}
#define out(a) cout << (a) << endl
#define cont const auto
#define fi first
#define se second
#define V vector
#define P pair
#define T tuple
#define VV(type, name, y, x, a) \
vector<vector<type>> name = vector<vector<type>>(y, vector<type>(x, a))
#define PQ priority_queue
typedef long long ll;
typedef double D;
typedef long double LD;
typedef string str;
typedef vector<ll> VL;
typedef pair<ll, ll> PL;
typedef vector<pair<ll, ll>> VP;
typedef tuple<ll, ll, ll> T3;
typedef tuple<ll, ll, ll, ll> T4;
const long long INF = 1LL << 60;
const long long MOD = 1e9 + 7;
void Yes() { cout << "Yes" << endl; }
void No() { cout << "No" << endl; }
void YN(bool b) { cout << (b ? "Yes" : "No") << endl; }
template <class T> inline T gcd(T a, T b) {
if (b == 0)
return a;
return (gcd(b, a % b));
}
template <class T> inline T lcm(T a, T b) { return a / gcd(a, b) * b; }
template <class T> inline bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmin(T &a, const T &b) {
if (a > b) {
a = b;
return true;
}
return false;
}
signed main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n, a, b, c, d;
str s;
cin >> n >> a >> b >> c >> d >> s;
a--;
b--;
c--;
d--;
int e = min(a, b);
int f = max(c, d);
for (int i = e; i < f - 1; ++i) {
if (s[i] == '#' && s[i + 1] == '#') {
out("No");
return 0;
}
}
if (c < d) {
Yes();
return 0;
}
for (int i = e; i < f - 1; ++i) {
if (s[i] == '.' && s[i + 1] == '.' && s[i + 2] == '.') {
if (b < i + 2) {
Yes();
return 0;
}
}
}
No();
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define reps(i, n) for (int i = 1; i <= (n); ++i)
#define repr(i, n) for (int i = (n); i >= 0; --i)
#define cinv(n, vec) \
VL(vec)(n); \
for (auto &v : vec) \
cin >> v;
#define int long long
#define itn int
#define pb push_back
#define m_p make_pair
#define m_t make_tuple
#define eb emplace_back
#define p_p(a, b) pb(m_p(a, b))
#define all(a) a.begin(), a.end()
#define SORT(a) sort(all(a))
#define RSORT(a) sort(all(a), greater<>())
#define UNIQUE(a) a.erase(unique(all(a)), a.end())
#define SZ(a) (ll)(a.size())
#define ENDL cout << endl
#define debg(a) cout << #a << " " << a << endl;
#define debgp(a) cout << #a << " " << a.fi << " : " << a.se << endl
#define call(a) \
for (auto i : a) \
cout << i << " "; \
cout << endl
#define show(a) \
for (cont & y : a) { \
for (cont & x : y) { \
cout << x << " "; \
} \
cout << endl; \
}
#define out(a) cout << (a) << endl
#define cont const auto
#define fi first
#define se second
#define V vector
#define P pair
#define T tuple
#define VV(type, name, y, x, a) \
vector<vector<type>> name = vector<vector<type>>(y, vector<type>(x, a))
#define PQ priority_queue
typedef long long ll;
typedef double D;
typedef long double LD;
typedef string str;
typedef vector<ll> VL;
typedef pair<ll, ll> PL;
typedef vector<pair<ll, ll>> VP;
typedef tuple<ll, ll, ll> T3;
typedef tuple<ll, ll, ll, ll> T4;
const long long INF = 1LL << 60;
const long long MOD = 1e9 + 7;
void Yes() { cout << "Yes" << endl; }
void No() { cout << "No" << endl; }
void YN(bool b) { cout << (b ? "Yes" : "No") << endl; }
template <class T> inline T gcd(T a, T b) {
if (b == 0)
return a;
return (gcd(b, a % b));
}
template <class T> inline T lcm(T a, T b) { return a / gcd(a, b) * b; }
template <class T> inline bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmin(T &a, const T &b) {
if (a > b) {
a = b;
return true;
}
return false;
}
signed main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n, a, b, c, d;
str s;
cin >> n >> a >> b >> c >> d >> s;
a--;
b--;
c--;
d--;
int e = min(a, b);
int f = max(c, d);
for (int i = e; i < f - 1; ++i) {
if (s[i] == '#' && s[i + 1] == '#') {
out("No");
return 0;
}
}
if (c < d) {
Yes();
return 0;
}
for (int i = e; i < f - 1; ++i) {
if (s[i] == '.' && s[i + 1] == '.' && s[i + 2] == '.') {
if (b < i + 2 && i < d) {
Yes();
return 0;
}
}
}
No();
return 0;
}
| [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 831,829 | 831,828 | u423624748 | cpp |
p03017 | #include "bits/stdc++.h"
#define REP(i, x, y) for (int i = (x); i < (y); i++)
#define RREP(i, x, y) for (int i = (y)-1; i >= (x); i--)
#define all(x) (x).begin(), (x).end()
// #define int long long
using namespace std;
// conversion
inline int toInt(string s) {
int v;
istringstream sin(s);
sin >> v;
return v;
}
template <class T> inline string toString(T x) {
ostringstream sout;
sout << x;
return sout.str();
}
#ifdef LOCAL
#define eprintf(...) fprintf(stderr, __VA_ARGS__)
#define dump(x) cerr << #x << " = " << (x) << endl
#define debug(x) \
cerr << #x << " = " << (x) << " (L" << __LINE__ << ")" \
<< " " << __FILE__ << endl
#else
#define eprintf(...) 42
#define dump(x) 42
#define debug(x) 42
#endif
typedef long long ll;
const ll MOD = 1e9 + 7;
bool solve(int N, int A, int B, int C, int D, string &S) {
for (const auto pair : {make_pair(A, C), make_pair(B, D)}) {
int left = pair.first - 1;
int right = pair.second - 1;
for (int i = left; i < right; i++) {
if (S[i] == '#' && S[i + 1] == '#')
return false;
}
}
if (D < C) {
for (int i = B; i <= D; i++) {
if (S[i - 1] == '.' && S[i] == '.' && S[i + 1] == '.')
return true;
}
return false;
}
return true;
}
signed main() {
int N, A, B, C, D;
cin >> N >> A >> B >> C >> D;
string S;
cin >> S;
bool answer = solve(N, A, B, C, D, S);
cout << (answer ? "Yes" : "No") << '\n';
return 0;
}
| #include "bits/stdc++.h"
#define REP(i, x, y) for (int i = (x); i < (y); i++)
#define RREP(i, x, y) for (int i = (y)-1; i >= (x); i--)
#define all(x) (x).begin(), (x).end()
// #define int long long
using namespace std;
// conversion
inline int toInt(string s) {
int v;
istringstream sin(s);
sin >> v;
return v;
}
template <class T> inline string toString(T x) {
ostringstream sout;
sout << x;
return sout.str();
}
#ifdef LOCAL
#define eprintf(...) fprintf(stderr, __VA_ARGS__)
#define dump(x) cerr << #x << " = " << (x) << endl
#define debug(x) \
cerr << #x << " = " << (x) << " (L" << __LINE__ << ")" \
<< " " << __FILE__ << endl
#else
#define eprintf(...) 42
#define dump(x) 42
#define debug(x) 42
#endif
typedef long long ll;
const ll MOD = 1e9 + 7;
bool solve(int N, int A, int B, int C, int D, string &S) {
for (const auto pair : {make_pair(A, C), make_pair(B, D)}) {
int left = pair.first - 1;
int right = pair.second - 1;
for (int i = left; i < right; i++) {
if (S[i] == '#' && S[i + 1] == '#')
return false;
}
}
if (D < C) {
for (int i = B - 1; i <= D - 1; i++) {
if (S[i - 1] == '.' && S[i] == '.' && S[i + 1] == '.')
return true;
}
return false;
}
return true;
}
signed main() {
int N, A, B, C, D;
cin >> N >> A >> B >> C >> D;
string S;
cin >> S;
bool answer = solve(N, A, B, C, D, S);
cout << (answer ? "Yes" : "No") << '\n';
return 0;
}
| [
"control_flow.loop.for.initializer.change",
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 831,832 | 831,833 | u535555850 | cpp |
p03017 | #include <iomanip>
#include <iostream>
//#include<cstdio>
#include <algorithm>
#include <cassert>
#include <cmath>
#include <map>
#include <queue>
#include <vector>
using namespace std;
typedef long long ll;
int main() {
int N, A, B, C, D;
string S;
cin >> N >> A >> B >> C >> D;
cin >> S;
A--;
B--;
C--;
D--;
bool ans = true;
for (int i = A; i < max(C, D) - 1; i++) {
if (S[i] == '#' && S[i + 1] == '#')
ans = false;
}
// cout << (ans?"Yes":"No") << endl;
if (C > D) {
bool tmp = false;
for (int i = B - 1; i < D - 1; i++) {
if (S.substr(i, 3) == "...")
tmp = true;
}
ans = ans && tmp;
}
cout << (ans ? "Yes" : "No") << endl;
return 0;
} | #include <iomanip>
#include <iostream>
//#include<cstdio>
#include <algorithm>
#include <cassert>
#include <cmath>
#include <map>
#include <queue>
#include <vector>
using namespace std;
typedef long long ll;
int main() {
int N, A, B, C, D;
string S;
cin >> N >> A >> B >> C >> D;
cin >> S;
A--;
B--;
C--;
D--;
bool ans = true;
for (int i = A; i < max(C, D) - 1; i++) {
if (S[i] == '#' && S[i + 1] == '#')
ans = false;
}
// cout << (ans?"Yes":"No") << endl;
if (C > D) {
bool tmp = false;
for (int i = B - 1; i < D; i++) {
if (S.substr(i, 3) == "...")
tmp = true;
}
ans = ans && tmp;
}
cout << (ans ? "Yes" : "No") << endl;
return 0;
} | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 831,841 | 831,842 | u534998883 | cpp |
p03017 | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
bool can(int N, const string &S, int A, int C) {
for (int i = A; i < C; ++i) {
if (S[i] == '#' && S[i + 1] == '#') {
return false;
}
}
return true;
}
bool test(int N, const string &S, int B, int D) {
for (int i = B; i < D; ++i) {
if (S[i - 1] == '.' && S[i] == '.' && S[i + 1] == '.') {
return true;
}
}
return false;
}
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) {
if (can(N, S, A, C) && can(N, S, B, D)) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
} else {
if (test(N, S, B, D) && can(N, S, A, C) && can(N, S, B, D)) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
}
}
| #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
bool can(int N, const string &S, int A, int C) {
for (int i = A; i < C; ++i) {
if (S[i] == '#' && S[i + 1] == '#') {
return false;
}
}
return true;
}
bool test(int N, const string &S, int B, int D) {
for (int i = B; i <= D; ++i) {
if (S[i - 1] == '.' && S[i] == '.' && S[i + 1] == '.') {
return true;
}
}
return false;
}
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) {
if (can(N, S, A, C) && can(N, S, B, D)) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
} else {
if (test(N, S, B, D) && can(N, S, A, C) && can(N, S, B, D)) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
}
}
| [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 831,843 | 831,844 | u036411476 | cpp |
p03017 | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
bool can(int N, const string &S, int A, int C) {
for (int i = A; i < C; ++i) {
if (S[i] == '#' && S[i + 1] == '#') {
return false;
}
}
return true;
}
bool test(int N, const string &S, int B, int D) {
for (int i = B; i + 1 < D; ++i) {
if (S[i - 1] == '.' && S[i] == '.' && S[i + 1] == '.') {
return true;
}
}
return false;
}
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) {
if (can(N, S, A, C) && can(N, S, B, D)) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
} else {
if (test(N, S, B, D) && can(N, S, A, C) && can(N, S, B, D)) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
}
}
| #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
bool can(int N, const string &S, int A, int C) {
for (int i = A; i < C; ++i) {
if (S[i] == '#' && S[i + 1] == '#') {
return false;
}
}
return true;
}
bool test(int N, const string &S, int B, int D) {
for (int i = B; i <= D; ++i) {
if (S[i - 1] == '.' && S[i] == '.' && S[i + 1] == '.') {
return true;
}
}
return false;
}
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) {
if (can(N, S, A, C) && can(N, S, B, D)) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
} else {
if (test(N, S, B, D) && can(N, S, A, C) && can(N, S, B, D)) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
}
}
| [
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 831,845 | 831,844 | u036411476 | cpp |
p03017 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#define MOD 1000000007
using namespace std;
typedef pair<int, int> P;
typedef pair<long long, long long> LLP;
int main() {
int N, A, B, C, D;
cin >> N >> A >> B >> C >> D;
string S;
cin >> S;
bool hasDouble = false;
bool hasTriple = false;
for (int i = A - 1; i < max(C, D); i++) {
if (i < max(C, D) - 1 && S[i] == '#' && S[i + 1] == '#')
hasDouble = true;
if (i >= B - 1 && i < min(C, D) - 1 && S[i] == '.' && S[i + 1] == '.' &&
S[i + 2] == '.')
hasTriple = true;
}
bool result = false;
if (C < D)
result = !hasDouble;
else
result = !hasDouble && hasTriple;
cout << (result ? "Yes" : "No") << endl;
return 0;
} | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#define MOD 1000000007
using namespace std;
typedef pair<int, int> P;
typedef pair<long long, long long> LLP;
int main() {
int N, A, B, C, D;
cin >> N >> A >> B >> C >> D;
string S;
cin >> S;
bool hasDouble = false;
bool hasTriple = false;
for (int i = A - 1; i < max(C, D); i++) {
if (i < max(C, D) - 1 && S[i] == '#' && S[i + 1] == '#')
hasDouble = true;
if (i >= B - 2 && i < min(C, D) - 1 && S[i] == '.' && S[i + 1] == '.' &&
S[i + 2] == '.')
hasTriple = true;
}
bool result = false;
if (C < D)
result = !hasDouble;
else
result = !hasDouble && hasTriple;
cout << (result ? "Yes" : "No") << endl;
return 0;
} | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 831,863 | 831,864 | u997325490 | cpp |
p03017 | /**
* Dont raise your voice, improve your argument.
* --Desmond Tutu
*/
#include <bits/stdc++.h>
using namespace std;
typedef unsigned int uint;
typedef long long ll;
#define fori(n) for (ll i = 0; i < (n); i++)
#define forn(i, n) for (ll i = 0; i < (n); i++)
#define forn3(i, x, n) for (ll i = (x); i < (n); i++)
bool hasDoubleStone(string &s, int a, int c) {
for (int i = a; i < c; i++) {
if (s[i] == '#' && s[i - 1] == '#')
return true;
}
return false;
}
bool hasTripleFree(string &s, int a, int c) {
for (int i = a + 1; i < c; i++) {
if (s[i] == '.' && s[i - 1] == '.' && s[i - 2] == '.')
return true;
}
return false;
}
int main() {
cin.tie(nullptr);
std::ios::sync_with_stdio(false);
int n, a, b, c, d;
cin >> n >> a >> b >> c >> d;
string s;
cin >> s;
if (hasDoubleStone(s, a, c) || hasDoubleStone(s, b, d)) {
cout << "No" << endl;
return 0;
}
if (c < d) {
cout << "Yes" << endl;
return 0;
}
/* a must overtake b */
if (hasTripleFree(s, b - 1, d)) {
cout << "Yes" << endl;
return 0;
}
cout << "No" << endl;
return 0;
}
| /**
* Dont raise your voice, improve your argument.
* --Desmond Tutu
*/
#include <bits/stdc++.h>
using namespace std;
typedef unsigned int uint;
typedef long long ll;
#define fori(n) for (ll i = 0; i < (n); i++)
#define forn(i, n) for (ll i = 0; i < (n); i++)
#define forn3(i, x, n) for (ll i = (x); i < (n); i++)
bool hasDoubleStone(string &s, int a, int c) {
for (int i = a; i < c; i++) {
if (s[i] == '#' && s[i - 1] == '#')
return true;
}
return false;
}
bool hasTripleFree(string &s, int a, int c) {
for (int i = a + 1; i < c + 1; i++) {
if (s[i] == '.' && s[i - 1] == '.' && s[i - 2] == '.')
return true;
}
return false;
}
int main() {
cin.tie(nullptr);
std::ios::sync_with_stdio(false);
int n, a, b, c, d;
cin >> n >> a >> b >> c >> d;
string s;
cin >> s;
if (hasDoubleStone(s, a, c) || hasDoubleStone(s, b, d)) {
cout << "No" << endl;
return 0;
}
if (c < d) {
cout << "Yes" << endl;
return 0;
}
/* a must overtake b */
if (hasTripleFree(s, b - 1, d)) {
cout << "Yes" << endl;
return 0;
}
cout << "No" << endl;
return 0;
}
| [
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 831,874 | 831,875 | u014617387 | cpp |
p03017 | /**
* Dont raise your voice, improve your argument.
* --Desmond Tutu
*/
#include <bits/stdc++.h>
using namespace std;
typedef unsigned int uint;
typedef long long ll;
#define fori(n) for (ll i = 0; i < (n); i++)
#define forn(i, n) for (ll i = 0; i < (n); i++)
#define forn3(i, x, n) for (ll i = (x); i < (n); i++)
bool hasDoubleStone(string &s, int a, int c) {
for (int i = a; i < c; i++) {
if (s[i] == '#' && s[i - 1] == '#')
return true;
}
return false;
}
bool hasTripleFree(string &s, int a, int c) {
for (int i = a + 1; i < c; i++) {
if (s[i] == '.' && s[i - 1] == '.' && s[i - 2] == '.')
return true;
}
return false;
}
int main() {
cin.tie(nullptr);
std::ios::sync_with_stdio(false);
int n, a, b, c, d;
cin >> n >> a >> b >> c >> d;
string s;
cin >> s;
if (hasDoubleStone(s, a, c) || hasDoubleStone(s, b, d)) {
cout << "No" << endl;
return 0;
}
if (c < d) {
cout << "Yes" << endl;
return 0;
}
/* a must be overtake b */
if (hasTripleFree(s, b, d)) {
cout << "Yes" << endl;
return 0;
}
cout << "No" << endl;
return 0;
}
| /**
* Dont raise your voice, improve your argument.
* --Desmond Tutu
*/
#include <bits/stdc++.h>
using namespace std;
typedef unsigned int uint;
typedef long long ll;
#define fori(n) for (ll i = 0; i < (n); i++)
#define forn(i, n) for (ll i = 0; i < (n); i++)
#define forn3(i, x, n) for (ll i = (x); i < (n); i++)
bool hasDoubleStone(string &s, int a, int c) {
for (int i = a; i < c; i++) {
if (s[i] == '#' && s[i - 1] == '#')
return true;
}
return false;
}
bool hasTripleFree(string &s, int a, int c) {
for (int i = a + 1; i < c + 1; i++) {
if (s[i] == '.' && s[i - 1] == '.' && s[i - 2] == '.')
return true;
}
return false;
}
int main() {
cin.tie(nullptr);
std::ios::sync_with_stdio(false);
int n, a, b, c, d;
cin >> n >> a >> b >> c >> d;
string s;
cin >> s;
if (hasDoubleStone(s, a, c) || hasDoubleStone(s, b, d)) {
cout << "No" << endl;
return 0;
}
if (c < d) {
cout << "Yes" << endl;
return 0;
}
/* a must overtake b */
if (hasTripleFree(s, b - 1, d)) {
cout << "Yes" << endl;
return 0;
}
cout << "No" << endl;
return 0;
}
| [
"control_flow.loop.for.condition.change",
"misc.off_by_one",
"control_flow.branch.if.condition.change"
] | 831,876 | 831,875 | u014617387 | cpp |
p03017 | /**
* Dont raise your voice, improve your argument.
* --Desmond Tutu
*/
#include <bits/stdc++.h>
using namespace std;
typedef unsigned int uint;
typedef long long ll;
#define fori(n) for (ll i = 0; i < (n); i++)
#define forn(i, n) for (ll i = 0; i < (n); i++)
#define forn3(i, x, n) for (ll i = (x); i < (n); i++)
bool hasDoubleStone(string &s, int a, int c) {
for (int i = a; i < c - 1; i++) {
if (s[i] == '#' && s[i - 1] == '#')
return true;
}
return false;
}
bool hasTripleFree(string &s, int a, int c) {
for (int i = a + 1; i < c - 1; i++) {
if (s[i] == '.' && s[i - 1] == '.' && s[i - 2] == '.')
return true;
}
return false;
}
int main() {
cin.tie(nullptr);
std::ios::sync_with_stdio(false);
int n, a, b, c, d;
cin >> n >> a >> b >> c >> d;
string s;
cin >> s;
if (hasDoubleStone(s, a, c) || hasDoubleStone(s, b, d)) {
cout << "No" << endl;
return 0;
}
if (c < d) {
cout << "Yes" << endl;
return 0;
}
/* a must be overtake b */
if (hasTripleFree(s, b, d)) {
cout << "Yes" << endl;
return 0;
}
cout << "No" << endl;
return 0;
}
| /**
* Dont raise your voice, improve your argument.
* --Desmond Tutu
*/
#include <bits/stdc++.h>
using namespace std;
typedef unsigned int uint;
typedef long long ll;
#define fori(n) for (ll i = 0; i < (n); i++)
#define forn(i, n) for (ll i = 0; i < (n); i++)
#define forn3(i, x, n) for (ll i = (x); i < (n); i++)
bool hasDoubleStone(string &s, int a, int c) {
for (int i = a; i < c; i++) {
if (s[i] == '#' && s[i - 1] == '#')
return true;
}
return false;
}
bool hasTripleFree(string &s, int a, int c) {
for (int i = a + 1; i < c + 1; i++) {
if (s[i] == '.' && s[i - 1] == '.' && s[i - 2] == '.')
return true;
}
return false;
}
int main() {
cin.tie(nullptr);
std::ios::sync_with_stdio(false);
int n, a, b, c, d;
cin >> n >> a >> b >> c >> d;
string s;
cin >> s;
if (hasDoubleStone(s, a, c) || hasDoubleStone(s, b, d)) {
cout << "No" << endl;
return 0;
}
if (c < d) {
cout << "Yes" << endl;
return 0;
}
/* a must overtake b */
if (hasTripleFree(s, b - 1, d)) {
cout << "Yes" << endl;
return 0;
}
cout << "No" << endl;
return 0;
}
| [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove",
"misc.opposites",
"expression.operator.arithmetic.change",
"expression.operation.binary.change",
"control_flow.branch.if.condition.change"
] | 831,877 | 831,875 | u014617387 | cpp |
p03017 | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i, n) for (int i = 0; i < n; i++)
#define inf 1000000000000000
#define mod 1000000007
typedef pair<int, int> P;
bool prime(int n) {
for (int i = 2; i <= sqrt(n); i++) {
if (n % i == 0)
return false;
}
return n != 1;
}
int gcd(int x, int y) {
if (y == 0)
return x;
return gcd(y, x % y);
}
int lcm(int x, int y) { return x / gcd(x, y) * y; }
signed main() {
int n, a, b, c, d;
string s;
cin >> n >> a >> b >> c >> d;
a--, b--, c--, d--;
cin >> s;
if (c < d) {
for (int i = a; i <= c - 1; i++) {
if (s[i] == '#' && s[i + 1] == '#') {
cout << "No" << endl;
return 0;
}
}
for (int i = b; i <= d - 1; i++) {
if (s[i] == '#' && s[i + 1] == '#') {
cout << "No" << endl;
return 0;
}
}
cout << "Yes" << endl;
} else {
for (int i = a; i <= c - 1; i++) {
if (s[i] == '#' && s[i + 1] == '#') {
cout << "No" << endl;
return 0;
}
}
for (int i = b; i <= d - 1; i++) {
if (s[i] == '#' && s[i + 1] == '#') {
cout << "No" << endl;
return 0;
}
}
bool bou = false;
for (int i = b; i <= d - 1; i++) {
if (i + 2 < n && s[i] == '.' && s[i + 1] == '.' && s[i + 2] == '.') {
bou = true;
}
}
if (!bou)
cout << "No" << endl;
else
cout << "Yes" << endl;
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i, n) for (int i = 0; i < n; i++)
#define inf 1000000000000000
#define mod 1000000007
typedef pair<int, int> P;
bool prime(int n) {
for (int i = 2; i <= sqrt(n); i++) {
if (n % i == 0)
return false;
}
return n != 1;
}
int gcd(int x, int y) {
if (y == 0)
return x;
return gcd(y, x % y);
}
int lcm(int x, int y) { return x / gcd(x, y) * y; }
signed main() {
int n, a, b, c, d;
string s;
cin >> n >> a >> b >> c >> d;
a--, b--, c--, d--;
cin >> s;
if (c < d) {
for (int i = a; i <= c - 1; i++) {
if (s[i] == '#' && s[i + 1] == '#') {
cout << "No" << endl;
return 0;
}
}
for (int i = b; i <= d - 1; i++) {
if (s[i] == '#' && s[i + 1] == '#') {
cout << "No" << endl;
return 0;
}
}
cout << "Yes" << endl;
} else {
for (int i = a; i <= c - 1; i++) {
if (s[i] == '#' && s[i + 1] == '#') {
cout << "No" << endl;
return 0;
}
}
for (int i = b; i <= d - 1; i++) {
if (s[i] == '#' && s[i + 1] == '#') {
cout << "No" << endl;
return 0;
}
}
bool bou = false;
for (int i = b - 1; i <= d - 1; i++) {
if (i + 2 < n && s[i] == '.' && s[i + 1] == '.' && s[i + 2] == '.') {
bou = true;
}
}
if (!bou)
cout << "No" << endl;
else
cout << "Yes" << endl;
}
return 0;
}
| [
"control_flow.loop.for.initializer.change"
] | 831,878 | 831,879 | u452009494 | cpp |
p03017 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <stack>
#include <string>
#include <vector>
using namespace std;
int main() {
long long 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; i < D; ++i) {
if (s[i] == '#' && s[i - 1] == '#') {
cout << "No" << endl;
return 0;
}
}
cout << "Yes" << endl;
} else if (D < C) {
for (int i = A; i < D; ++i) {
if (s[i] == '#' && s[i - 1] == '#') {
cout << "No" << endl;
return 0;
}
}
for (int i = B + 1; i < D + 1; ++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 <iostream>
#include <map>
#include <queue>
#include <stack>
#include <string>
#include <vector>
using namespace std;
int main() {
long long 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; i < D; ++i) {
if (s[i] == '#' && s[i - 1] == '#') {
cout << "No" << endl;
return 0;
}
}
cout << "Yes" << endl;
} else if (D < C) {
for (int i = A; i < D; ++i) {
if (s[i] == '#' && s[i - 1] == '#') {
cout << "No" << endl;
return 0;
}
}
for (int i = B + 1; i <= D + 1; ++i) {
if (s[i] == '.' && s[i - 1] == '.' && s[i - 2] == '.') {
cout << "Yes" << endl;
return 0;
}
}
cout << "No" << endl;
}
return 0;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 831,880 | 831,881 | u055685044 | cpp |
p03017 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <stack>
#include <string>
#include <vector>
using namespace std;
int main() {
long long 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 = B; i < D; ++i) {
if (s[i] == '#' && s[i - 1] == '#') {
cout << "No" << endl;
return 0;
}
}
cout << "Yes" << endl;
} else if (D < C) {
for (int i = B; i < D; ++i) {
if (s[i] == '#' && s[i - 1] == '#') {
cout << "No" << endl;
return 0;
}
}
for (int i = B + 1; i < D; ++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 <iostream>
#include <map>
#include <queue>
#include <stack>
#include <string>
#include <vector>
using namespace std;
int main() {
long long 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; i < D; ++i) {
if (s[i] == '#' && s[i - 1] == '#') {
cout << "No" << endl;
return 0;
}
}
cout << "Yes" << endl;
} else if (D < C) {
for (int i = A; i < D; ++i) {
if (s[i] == '#' && s[i - 1] == '#') {
cout << "No" << endl;
return 0;
}
}
for (int i = B + 1; i <= D + 1; ++i) {
if (s[i] == '.' && s[i - 1] == '.' && s[i - 2] == '.') {
cout << "Yes" << endl;
return 0;
}
}
cout << "No" << endl;
}
return 0;
} | [
"variable_declaration.value.change",
"identifier.change",
"control_flow.loop.for.initializer.change",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 831,882 | 831,881 | u055685044 | cpp |
p03017 | /*
بسم الله الرحمن الرحیم
(; طلا یک جهانی
*/
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false), cin.tie(0), cout.tie(0);
int n, a, b, c, d;
string s;
cin >> n >> a >> b >> c >> d >> s;
a--, b--, c--, d--;
for (int i = a; i < c; i++)
if (s[i] == '#' && s[i + 1] == '#')
return cout << "No", 0;
for (int i = b; i < d; i++)
if (s[i] == '#' && s[i + 1] == '#')
return cout << "No", 0;
if (c < d)
return cout << "Yes", 0;
for (int i = b; i < d; i++)
if (s[i] == '.' && s[i + 1] == '.' && s[i + 2] == '.')
return cout << "Yes", 0;
cout << "No";
}
| /*
بسم الله الرحمن الرحیم
(; طلا یک جهانی
*/
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false), cin.tie(0), cout.tie(0);
int n, a, b, c, d;
string s;
cin >> n >> a >> b >> c >> d >> s;
a--, b--, c--, d--;
for (int i = a; i < c; i++)
if (s[i] == '#' && s[i + 1] == '#')
return cout << "No", 0;
for (int i = b; i < d; i++)
if (s[i] == '#' && s[i + 1] == '#')
return cout << "No", 0;
if (c < d)
return cout << "Yes", 0;
for (int i = b - 1; i < d; i++)
if (s[i] == '.' && s[i + 1] == '.' && s[i + 2] == '.')
return cout << "Yes", 0;
cout << "No";
}
| [
"control_flow.loop.for.initializer.change"
] | 831,885 | 831,886 | u763582125 | cpp |
p03017 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <numeric>
#include <queue>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
static const ll mod = 1000003;
int main() {
int N, A, B, C, D;
cin >> N >> A >> B >> C >> D;
string S;
cin >> S;
bool can = true;
if (S[C - 1] == '#')
can = false;
if (S[D - 1] == '#')
can = false;
for (int i = A; i < C - 1; i++) {
if (S[i] == '#' and S[i + 1] == '#') {
can = false;
break;
}
}
for (int i = B; i < D - 1; i++) {
if (S[i] == '#' and S[i + 1] == '#') {
can = false;
break;
}
}
if (C > D) {
bool can2 = false;
for (int i = B; i < D; i++) {
if (S[i - 1] == '.' and S[i] == '.' and S[i + 1] == '.') {
can2 = true;
break;
}
}
if (can and can2)
cout << "Yes" << '\n';
else
cout << "No" << '\n';
} else {
if (can)
cout << "Yes" << '\n';
else
cout << "No" << '\n';
}
}
| #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <numeric>
#include <queue>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
static const ll mod = 1000003;
int main() {
int N, A, B, C, D;
cin >> N >> A >> B >> C >> D;
string S;
cin >> S;
bool can = true;
if (S[C - 1] == '#')
can = false;
if (S[D - 1] == '#')
can = false;
for (int i = A; i < C - 1; i++) {
if (S[i] == '#' and S[i + 1] == '#') {
can = false;
break;
}
}
for (int i = B; i < D - 1; i++) {
if (S[i] == '#' and S[i + 1] == '#') {
can = false;
break;
}
}
if (C > D) {
bool can2 = false;
for (int i = B - 1; i < D; i++) {
if (S[i - 1] == '.' and S[i] == '.' and S[i + 1] == '.') {
can2 = true;
break;
}
}
if (can and can2)
cout << "Yes" << '\n';
else
cout << "No" << '\n';
} else {
if (can)
cout << "Yes" << '\n';
else
cout << "No" << '\n';
}
}
| [
"control_flow.loop.for.initializer.change"
] | 831,889 | 831,890 | u603234915 | 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;
bool flag = false;
int cnt = 0;
for (int i = a; i < max(c, d); i++) {
if (flag) {
if (s[i] == '#')
cnt++;
else {
if (cnt > 1) {
cout << "No" << endl;
exit(0);
}
flag = false;
cnt = 0;
}
} else if (s[i] == '#') {
flag = true;
cnt++;
}
}
if (cnt > 1) {
cout << "No" << endl;
exit(0);
}
if (c < d) {
cout << "Yes" << endl;
} else {
flag = false;
cnt = 0;
for (int i = b - 2; i < d; i++) {
if (flag) {
if (s[i] == '.')
cnt++;
else {
if (cnt > 2) {
cout << "Yes" << endl;
exit(0);
}
flag = false;
cnt = 0;
}
} else if (s[i] == '.') {
flag = true;
cnt++;
}
}
if (cnt > 2) {
cout << "Yes" << endl;
exit(0);
}
cout << "No" << endl;
}
} | #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;
bool flag = false;
int cnt = 0;
for (int i = a; i < max(c, d); i++) {
if (flag) {
if (s[i] == '#')
cnt++;
else {
if (cnt > 1) {
cout << "No" << endl;
exit(0);
}
flag = false;
cnt = 0;
}
} else if (s[i] == '#') {
flag = true;
cnt++;
}
}
if (cnt > 1) {
cout << "No" << endl;
exit(0);
}
if (c < d) {
cout << "Yes" << endl;
} else {
flag = false;
cnt = 0;
for (int i = b - 2; i <= d; i++) {
if (flag) {
if (s[i] == '.')
cnt++;
else {
if (cnt > 2) {
cout << "Yes" << endl;
exit(0);
}
flag = false;
cnt = 0;
}
} else if (s[i] == '.') {
flag = true;
cnt++;
}
}
if (cnt > 2) {
cout << "Yes" << endl;
exit(0);
}
cout << "No" << endl;
}
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 831,891 | 831,892 | u013408661 | 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;
bool flag = false;
int cnt = 0;
for (int i = a; i < max(c, d); i++) {
if (flag) {
if (s[i] == '#')
cnt++;
else {
if (cnt > 1) {
cout << "No" << endl;
exit(0);
}
flag = false;
cnt = 0;
}
} else if (s[i] == '#') {
flag = true;
cnt++;
}
}
if (cnt > 1) {
cout << "No" << endl;
exit(0);
}
if (c < d) {
cout << "Yes" << endl;
} else {
flag = false;
cnt = 0;
for (int i = b - 1; i < d; i++) {
if (flag) {
if (s[i] == '.')
cnt++;
else {
if (cnt > 2) {
cout << "Yes" << endl;
exit(0);
}
flag = false;
cnt = 0;
}
} else if (s[i] == '.') {
flag = true;
cnt++;
}
}
if (cnt > 2) {
cout << "Yes" << endl;
exit(0);
}
cout << "No" << endl;
}
} | #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;
bool flag = false;
int cnt = 0;
for (int i = a; i < max(c, d); i++) {
if (flag) {
if (s[i] == '#')
cnt++;
else {
if (cnt > 1) {
cout << "No" << endl;
exit(0);
}
flag = false;
cnt = 0;
}
} else if (s[i] == '#') {
flag = true;
cnt++;
}
}
if (cnt > 1) {
cout << "No" << endl;
exit(0);
}
if (c < d) {
cout << "Yes" << endl;
} else {
flag = false;
cnt = 0;
for (int i = b - 2; i <= d; i++) {
if (flag) {
if (s[i] == '.')
cnt++;
else {
if (cnt > 2) {
cout << "Yes" << endl;
exit(0);
}
flag = false;
cnt = 0;
}
} else if (s[i] == '.') {
flag = true;
cnt++;
}
}
if (cnt > 2) {
cout << "Yes" << endl;
exit(0);
}
cout << "No" << endl;
}
} | [
"literal.number.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"expression.operation.binary.change",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 831,893 | 831,892 | u013408661 | cpp |
p03017 | #define _CRT_SECURE_NO_WARNINGS
/* include ***********************/
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
/* define *************************/
// for
#define REP(i, n) for (int i = 0, i##_len = (int)(n); i < i##_len; i++)
#define REPS(i, n) for (int i = 1, i##_len = (int)(n); i <= i##_len; i++)
#define RREP(i, n) for (int i = (int)(n)-1; i >= 0; i--)
#define RREPS(i, n) for (int i = (int)(n); i > 0; i--)
#define FOR(i, s, n) \
for (int i = (int)(s), i##_len = (int)(n); i < i##_len; i++)
#define RFOR(i, s, n) \
for (int i = (int)(n)-1, i##_len = (int)(s); i >= i##_len; i--)
// printf
#define PRINTD(d) printf("%d\n", (d))
#define PRINTL(d) printf("%lld\n", (d))
// memset
#define m0(s) memset(s, 0, sizeof(s))
#define ml(s) memset(s, 63, sizeof(s))
#define fill(s, c) memset(s, c, sizeof(s))
#define INF 1e9
#define MOD 1000000007
typedef long long ll;
typedef unsigned long long ull;
int diff[4][2] = {
{0, -1},
{-1, 0},
{1, 0},
{0, 1},
};
//今回の変数
int Min(int a, int b) { return (a) < (b) ? (a) : (b); }
int Max(int a, int b) { return (a) > (b) ? (a) : (b); }
ll Minl(ll a, ll b) { return (a) < (b) ? (a) : (b); }
ll Maxl(ll a, ll b) { return (a) > (b) ? (a) : (b); }
int main() {
int n, a, b, c, d;
scanf("%d%d%d%d%d", &n, &a, &b, &c, &d);
a--;
b--;
c--;
d--;
char s[200001];
scanf("%s", s);
int ans;
if (d > c) {
ans = 1;
FOR(i, a + 1, c - 1) {
if (s[i] == '#' && s[i + 1] == '#') {
ans = 0;
}
}
FOR(i, b + 1, d - 1) {
if (s[i] == '#' && s[i + 1] == '#') {
ans = 0;
}
}
} else {
ans = 0;
FOR(i, b + 1, d) {
if (s[i] == '.' && s[i + 1] == '.' && s[i + 2] == '.') {
ans = 1;
}
}
FOR(i, a + 1, c - 1) {
if (s[i] == '#' && s[i + 1] == '#') {
ans = 0;
}
}
}
if (ans) {
puts("Yes");
} else {
puts("No");
}
}
| #define _CRT_SECURE_NO_WARNINGS
/* include ***********************/
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
/* define *************************/
// for
#define REP(i, n) for (int i = 0, i##_len = (int)(n); i < i##_len; i++)
#define REPS(i, n) for (int i = 1, i##_len = (int)(n); i <= i##_len; i++)
#define RREP(i, n) for (int i = (int)(n)-1; i >= 0; i--)
#define RREPS(i, n) for (int i = (int)(n); i > 0; i--)
#define FOR(i, s, n) \
for (int i = (int)(s), i##_len = (int)(n); i < i##_len; i++)
#define RFOR(i, s, n) \
for (int i = (int)(n)-1, i##_len = (int)(s); i >= i##_len; i--)
// printf
#define PRINTD(d) printf("%d\n", (d))
#define PRINTL(d) printf("%lld\n", (d))
// memset
#define m0(s) memset(s, 0, sizeof(s))
#define ml(s) memset(s, 63, sizeof(s))
#define fill(s, c) memset(s, c, sizeof(s))
#define INF 1e9
#define MOD 1000000007
typedef long long ll;
typedef unsigned long long ull;
int diff[4][2] = {
{0, -1},
{-1, 0},
{1, 0},
{0, 1},
};
//今回の変数
int Min(int a, int b) { return (a) < (b) ? (a) : (b); }
int Max(int a, int b) { return (a) > (b) ? (a) : (b); }
ll Minl(ll a, ll b) { return (a) < (b) ? (a) : (b); }
ll Maxl(ll a, ll b) { return (a) > (b) ? (a) : (b); }
int main() {
int n, a, b, c, d;
scanf("%d%d%d%d%d", &n, &a, &b, &c, &d);
a--;
b--;
c--;
d--;
char s[200001];
scanf("%s", s);
int ans;
if (d > c) {
ans = 1;
FOR(i, a + 1, c - 1) {
if (s[i] == '#' && s[i + 1] == '#') {
ans = 0;
}
}
FOR(i, b + 1, d - 1) {
if (s[i] == '#' && s[i + 1] == '#') {
ans = 0;
}
}
} else {
ans = 0;
FOR(i, b - 1, d) {
if (s[i] == '.' && s[i + 1] == '.' && s[i + 2] == '.') {
ans = 1;
}
}
FOR(i, a + 1, c - 1) {
if (s[i] == '#' && s[i + 1] == '#') {
ans = 0;
}
}
}
if (ans) {
puts("Yes");
} else {
puts("No");
}
}
| [
"misc.opposites",
"expression.operator.arithmetic.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 831,908 | 831,909 | u539339654 | cpp |
p03017 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, a, b, i, c, d;
string s;
cin >> n >> a >> b >> c >> d >> s;
s = "." + s + ".";
for (i = a; i < max(c, d); i++) {
if (s[i] == '#' && s[i + 1] == '#') {
cout << "No" << endl;
exit(0);
}
}
if (c < d) {
cout << "Yes" << endl;
exit(0);
}
for (i = b; i < d; i++) {
if (s[i - 1] == '.' && s[i] == '.' && s[i + 1] == '.') {
cout << "Yes" << endl;
exit(0);
}
}
cout << "No" << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n, a, b, i, c, d;
string s;
cin >> n >> a >> b >> c >> d >> s;
s = "." + s + ".";
for (i = a; i < max(c, d); i++) {
if (s[i] == '#' && s[i + 1] == '#') {
cout << "No" << endl;
exit(0);
}
}
if (c < d) {
cout << "Yes" << endl;
exit(0);
}
for (i = b; i <= d; i++) {
if (s[i - 1] == '.' && s[i] == '.' && s[i + 1] == '.') {
cout << "Yes" << endl;
exit(0);
}
}
cout << "No" << endl;
}
| [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 831,910 | 831,911 | u713421499 | cpp |
p03017 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <string>
#include <vector>
using namespace std;
int main() {
int n, a, b, c, d;
char input[200001];
string str;
int i;
int lmax;
int lvac = 0, lrk = 0, cur;
scanf("%d %d %d %d %d", &n, &a, &b, &c, &d);
a--;
b--;
c--;
d--;
scanf("%s", input);
str = input;
cur = 0;
lmax = c > d ? c : d;
for (i = a + 1; i <= c; i++) {
if (str[i] == '#') {
cur++;
}
else {
cur = 0;
}
if (cur > lrk) {
lrk = cur;
}
}
if (lrk >= 2) {
printf("No\n");
return 0;
}
cur = 0;
lrk = 0;
lmax = c > d ? c : d;
for (i = b + 1; i <= d; i++) {
if (str[i] == '#') {
cur++;
}
else {
cur = 0;
}
if (cur > lrk) {
lrk = cur;
}
}
if (lrk >= 2) {
printf("No\n");
return 0;
}
if (c < d) {
printf("Yes\n");
return 0;
}
cur = 0;
for (i = b; i <= d + 1 && i < n; i++) {
if (str[i] == '.') {
cur++;
}
else {
cur = 0;
}
if (cur > lvac) {
lvac = cur;
}
}
if (lvac >= 3) {
printf("Yes\n");
}
else {
printf("No\n");
}
return 0;
} | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <string>
#include <vector>
using namespace std;
int main() {
int n, a, b, c, d;
char input[200001];
string str;
int i;
int lmax;
int lvac = 0, lrk = 0, cur;
scanf("%d %d %d %d %d", &n, &a, &b, &c, &d);
a--;
b--;
c--;
d--;
scanf("%s", input);
str = input;
cur = 0;
lmax = c > d ? c : d;
for (i = a + 1; i <= c; i++) {
if (str[i] == '#') {
cur++;
}
else {
cur = 0;
}
if (cur > lrk) {
lrk = cur;
}
}
if (lrk >= 2) {
printf("No\n");
return 0;
}
cur = 0;
lrk = 0;
lmax = c > d ? c : d;
for (i = b + 1; i <= d; i++) {
if (str[i] == '#') {
cur++;
}
else {
cur = 0;
}
if (cur > lrk) {
lrk = cur;
}
}
if (lrk >= 2) {
printf("No\n");
return 0;
}
if (c < d) {
printf("Yes\n");
return 0;
}
cur = 0;
for (i = b - 1; i <= d + 1 && i < n; i++) {
if (str[i] == '.') {
cur++;
}
else {
cur = 0;
}
if (cur > lvac) {
lvac = cur;
}
}
if (lvac >= 3) {
printf("Yes\n");
}
else {
printf("No\n");
}
return 0;
} | [
"control_flow.loop.for.initializer.change",
"assignment.change"
] | 831,912 | 831,913 | u619248223 | cpp |
p03017 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <string>
#include <vector>
using namespace std;
int main() {
int n, a, b, c, d;
char input[200001];
string str;
int i;
int lmax;
int lvac = 0, lrk = 0, cur;
scanf("%d %d %d %d %d", &n, &a, &b, &c, &d);
a--;
b--;
c--;
d--;
scanf("%s", input);
str = input;
cur = 0;
lmax = c > d ? c : d;
for (i = a + 1; i <= c; i++) {
if (str[i] == '#') {
cur++;
}
else {
cur = 0;
}
if (cur > lrk) {
lrk = cur;
}
}
if (lrk >= 2) {
printf("No\n");
return 0;
}
cur = 0;
lmax = c > d ? c : d;
for (i = b + 1; i <= d; i++) {
if (str[i] == '#') {
cur++;
}
else {
cur = 0;
}
if (cur > lrk) {
lrk = cur;
}
}
if (lrk >= 2) {
printf("No\n");
return 0;
}
if (c < d) {
printf("Yes\n");
return 0;
}
cur = 0;
for (i = b; i <= d + 1 && i < n; i++) {
if (str[i] == '.') {
cur++;
}
else {
cur = 0;
}
if (cur > lvac) {
lvac = cur;
}
}
if (lvac >= 3) {
printf("Yes\n");
}
else {
printf("No\n");
}
return 0;
} | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <string>
#include <vector>
using namespace std;
int main() {
int n, a, b, c, d;
char input[200001];
string str;
int i;
int lmax;
int lvac = 0, lrk = 0, cur;
scanf("%d %d %d %d %d", &n, &a, &b, &c, &d);
a--;
b--;
c--;
d--;
scanf("%s", input);
str = input;
cur = 0;
lmax = c > d ? c : d;
for (i = a + 1; i <= c; i++) {
if (str[i] == '#') {
cur++;
}
else {
cur = 0;
}
if (cur > lrk) {
lrk = cur;
}
}
if (lrk >= 2) {
printf("No\n");
return 0;
}
cur = 0;
lrk = 0;
lmax = c > d ? c : d;
for (i = b + 1; i <= d; i++) {
if (str[i] == '#') {
cur++;
}
else {
cur = 0;
}
if (cur > lrk) {
lrk = cur;
}
}
if (lrk >= 2) {
printf("No\n");
return 0;
}
if (c < d) {
printf("Yes\n");
return 0;
}
cur = 0;
for (i = b - 1; i <= d + 1 && i < n; i++) {
if (str[i] == '.') {
cur++;
}
else {
cur = 0;
}
if (cur > lvac) {
lvac = cur;
}
}
if (lvac >= 3) {
printf("Yes\n");
}
else {
printf("No\n");
}
return 0;
} | [
"assignment.add",
"control_flow.loop.for.initializer.change",
"assignment.change"
] | 831,914 | 831,913 | u619248223 | cpp |
p03017 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <chrono>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <fstream>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <stdio.h>
#include <tuple>
#include <unordered_map>
#include <vector>
#define all(a) (a).begin(), (a).end()
#define sz(a) (int)(a).size()
#define pb push_back
using namespace std;
typedef long long ll;
typedef double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef unsigned int uint;
typedef unsigned long long ull;
mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());
// default_random_engine generator;
// mt19937 rnd(1);
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
// freopen("input.txt", "r", stdin);
// freopen("output.txt", "w", stdout);
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 < c; ++i) {
if (s[i] == '#' && s[i + 1] == '#') {
cout << "No" << endl;
return 0;
}
}
for (int i = b; i < d; ++i) {
if (s[i] == '#' && s[i + 1] == '#') {
cout << "No" << endl;
return 0;
}
}
if (c < d) {
cout << "Yes" << endl;
return 0;
}
for (int i = b; i <= d; ++i) {
if (s[i] == '.' && s[i - 1] == '#' && s[i + 1] == '#') {
cout << "Yes" << endl;
return 0;
}
}
cout << "No" << endl;
}
| #include <algorithm>
#include <bitset>
#include <cassert>
#include <chrono>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <fstream>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <stdio.h>
#include <tuple>
#include <unordered_map>
#include <vector>
#define all(a) (a).begin(), (a).end()
#define sz(a) (int)(a).size()
#define pb push_back
using namespace std;
typedef long long ll;
typedef double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef unsigned int uint;
typedef unsigned long long ull;
mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());
// default_random_engine generator;
// mt19937 rnd(1);
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
// freopen("input.txt", "r", stdin);
// freopen("output.txt", "w", stdout);
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 < c; ++i) {
if (s[i] == '#' && s[i + 1] == '#') {
cout << "No" << endl;
return 0;
}
}
for (int i = b; i < d; ++i) {
if (s[i] == '#' && s[i + 1] == '#') {
cout << "No" << endl;
return 0;
}
}
if (c < d) {
cout << "Yes" << endl;
return 0;
}
for (int i = b; i <= d; ++i) {
if (s[i] == '.' && s[i - 1] == '.' && s[i + 1] == '.') {
cout << "Yes" << endl;
return 0;
}
}
cout << "No" << endl;
}
| [
"literal.string.change",
"control_flow.branch.if.condition.change"
] | 831,921 | 831,922 | u035969230 | cpp |
p03017 | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, s, e) for (int(i) = (s); (i) <= (e); ++(i))
#define all(x) x.begin(), x.end()
int main() {
int n, a, b, c, d;
cin >> n >> a >> b >> c >> d;
--a, --b, --c, --d;
string s;
cin >> s;
bool ok = true;
int left = min(a, b), right = max(c, d);
rep(i, left, right - 1) {
if (s[i] == '#' && s[i + 1] == '#')
ok = false;
}
if (!ok) {
cout << "NO" << endl;
return 0;
}
if (c < d)
cout << "YES" << endl;
else {
ok = false;
rep(i, b, d) {
if (s[i - 1] == '.' && s[i] == '.' && s[i + 1] == '.')
ok = true;
}
if (ok)
cout << "YES" << endl;
else
cout << "NO" << endl;
}
} | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, s, e) for (int(i) = (s); (i) <= (e); ++(i))
#define all(x) x.begin(), x.end()
int main() {
int n, a, b, c, d;
cin >> n >> a >> b >> c >> d;
--a, --b, --c, --d;
string s;
cin >> s;
bool ok = true;
int left = min(a, b), right = max(c, d);
rep(i, left, right - 1) {
if (s[i] == '#' && s[i + 1] == '#')
ok = false;
}
if (!ok) {
cout << "No" << endl;
return 0;
}
if (c < d)
cout << "Yes" << endl;
else {
ok = false;
rep(i, b, d) {
if (s[i - 1] == '.' && s[i] == '.' && s[i + 1] == '.')
ok = true;
}
if (ok)
cout << "Yes" << endl;
else
cout << "No" << endl;
}
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 831,927 | 831,928 | u521389909 | cpp |
p03017 | #define _CRT_SECURE_NO_WARNINGS
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <functional>
#include <iostream>
#include <iterator>
#include <limits>
#include <map>
#include <memory>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
#define FOR(i, n) for (int i = 0; i < (n); i++)
#define sz(c) ((int)c.size())
#define ten(n) ((int)1e##n)
using ll = long long;
using Pii = pair<int, int>;
using Pll = pair<ll, ll>;
template <typename...> static inline int getchar_unlocked(void) {
return getchar();
}
template <typename...> static inline void putchar_unlocked(int c) {
putchar(c);
}
#define mygc(c) (c) = getchar_unlocked()
#define mypc(c) putchar_unlocked(c)
void reader(int &x) {
int k, m = 0;
x = 0;
for (;;) {
mygc(k);
if (k == '-') {
m = 1;
break;
}
if ('0' <= k && k <= '9') {
x = k - '0';
break;
}
}
for (;;) {
mygc(k);
if (k < '0' || k > '9')
break;
x = x * 10 + k - '0';
}
if (m)
x = -x;
}
void reader(ll &x) {
int k, m = 0;
x = 0;
for (;;) {
mygc(k);
if (k == '-') {
m = 1;
break;
}
if ('0' <= k && k <= '9') {
x = k - '0';
break;
}
}
for (;;) {
mygc(k);
if (k < '0' || k > '9')
break;
x = x * 10 + k - '0';
}
if (m)
x = -x;
}
int reader(char c[]) {
int i, s = 0;
for (;;) {
mygc(i);
if (i != ' ' && i != '\n' && i != '\r' && i != '\t' && i != EOF)
break;
}
c[s++] = i;
for (;;) {
mygc(i);
if (i == ' ' || i == '\n' || i == '\r' || i == '\t' || i == EOF)
break;
c[s++] = i;
}
c[s] = '\0';
return s;
}
int reader(string &c) {
int i;
for (;;) {
mygc(i);
if (i != ' ' && i != '\n' && i != '\r' && i != '\t' && i != EOF)
break;
}
c.push_back(i);
for (;;) {
mygc(i);
if (i == ' ' || i == '\n' || i == '\r' || i == '\t' || i == EOF)
break;
c.push_back(i);
};
return sz(c);
}
template <class T, class S> void reader(T &x, S &y) {
reader(x);
reader(y);
}
template <class T, class S, class U> void reader(T &x, S &y, U &z) {
reader(x);
reader(y);
reader(z);
}
template <class T, class S, class U, class V>
void reader(T &x, S &y, U &z, V &w) {
reader(x);
reader(y);
reader(z);
reader(w);
}
void writer(int x, char c) {
int s = 0, m = 0;
char f[10];
if (x < 0)
m = 1, x = -x;
while (x)
f[s++] = x % 10, x /= 10;
if (!s)
f[s++] = 0;
if (m)
mypc('-');
while (s--)
mypc(f[s] + '0');
mypc(c);
}
void writer(ll x, char c) {
int s = 0, m = 0;
char f[20];
if (x < 0)
m = 1, x = -x;
while (x)
f[s++] = x % 10, x /= 10;
if (!s)
f[s++] = 0;
if (m)
mypc('-');
while (s--)
mypc(f[s] + '0');
mypc(c);
}
void writer(const char c[]) {
int i;
for (i = 0; c[i] != '\0'; i++)
mypc(c[i]);
}
void writer(const string &x, char c) {
int i;
for (i = 0; x[i] != '\0'; i++)
mypc(x[i]);
mypc(c);
}
void writer(const char x[], char c) {
int i;
for (i = 0; x[i] != '\0'; i++)
mypc(x[i]);
mypc(c);
}
template <class T> void writerLn(T x) { writer(x, '\n'); }
template <class T, class S> void writerLn(T x, S y) {
writer(x, ' ');
writer(y, '\n');
}
template <class T, class S, class U> void writerLn(T x, S y, U z) {
writer(x, ' ');
writer(y, ' ');
writer(z, '\n');
}
template <class T, class S, class U, class V>
void writerLn(T x, S y, U z, V v) {
writer(x, ' ');
writer(y, ' ');
writer(z, ' ');
writer(v, '\n');
}
template <class T> void writerArr(T x[], int n) {
if (!n) {
mypc('\n');
return;
}
FOR(i, n - 1) writer(x[i], ' ');
writer(x[n - 1], '\n');
}
template <class T> void writerArr(vector<T> &x) {
writerArr(x.data(), (int)x.size());
}
template <class T> void chmin(T &a, const T &b) {
if (a > b)
a = b;
}
template <class T> void chmax(T &a, const T &b) {
if (a < b)
a = b;
}
template <class T> T gcd(T a, T b) { return b ? gcd(b, a % b) : a; }
template <class T> T lcm(T a, T b) { return a / gcd(a, b) * b; }
ll mod_pow(ll a, ll n, ll mod) {
ll ret = 1;
ll p = a % mod;
while (n) {
if (n & 1)
ret = ret * p % mod;
p = p * p % mod;
n >>= 1;
}
return ret;
}
template <class T> T extgcd(T a, T b, T &x, T &y) {
for (T u = y = 1, v = x = 0; a;) {
T q = b / a;
swap(x -= q * u, u);
swap(y -= q * v, v);
swap(b -= q * a, a);
}
return b;
}
ll mod_inv(ll a, ll m) {
ll x, y;
extgcd<ll>(a, m, x, y);
return (m + x % m) % m;
}
#ifdef _MSC_VER
template <typename... Args>
void debugPrintf(const char *format, Args const &...args) {
fprintf(stderr, format, args...);
fflush(stderr);
}
#else
#define debugPrintf(...)
#endif
const int MOD = ten(9) + 7;
char s[2 * ten(5) + 10];
bool f(int from, int to) {
int cnt = 0;
for (int i = from; i <= to; i++) {
if (s[i] == '#')
cnt++;
else
cnt = 0;
if (cnt == 2)
return false;
}
return true;
}
bool solve() {
int n;
reader(n);
int a, b, c, d;
reader(a, b, c, d);
a--;
b--;
c--;
d--;
reader(s);
bool ok1 = f(a, c);
bool ok2 = f(b, d);
if (!ok1 || !ok2)
return false;
if (c < d) {
return true;
}
for (int i = b; i <= d; i++) {
if (s[i] == '.' && s[i] == '.' && s[i + 1] == '.') {
return true;
}
}
return false;
}
int main() {
bool ans = solve();
puts(ans ? "Yes" : "No");
return 0;
}
| #define _CRT_SECURE_NO_WARNINGS
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <functional>
#include <iostream>
#include <iterator>
#include <limits>
#include <map>
#include <memory>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
#define FOR(i, n) for (int i = 0; i < (n); i++)
#define sz(c) ((int)c.size())
#define ten(n) ((int)1e##n)
using ll = long long;
using Pii = pair<int, int>;
using Pll = pair<ll, ll>;
template <typename...> static inline int getchar_unlocked(void) {
return getchar();
}
template <typename...> static inline void putchar_unlocked(int c) {
putchar(c);
}
#define mygc(c) (c) = getchar_unlocked()
#define mypc(c) putchar_unlocked(c)
void reader(int &x) {
int k, m = 0;
x = 0;
for (;;) {
mygc(k);
if (k == '-') {
m = 1;
break;
}
if ('0' <= k && k <= '9') {
x = k - '0';
break;
}
}
for (;;) {
mygc(k);
if (k < '0' || k > '9')
break;
x = x * 10 + k - '0';
}
if (m)
x = -x;
}
void reader(ll &x) {
int k, m = 0;
x = 0;
for (;;) {
mygc(k);
if (k == '-') {
m = 1;
break;
}
if ('0' <= k && k <= '9') {
x = k - '0';
break;
}
}
for (;;) {
mygc(k);
if (k < '0' || k > '9')
break;
x = x * 10 + k - '0';
}
if (m)
x = -x;
}
int reader(char c[]) {
int i, s = 0;
for (;;) {
mygc(i);
if (i != ' ' && i != '\n' && i != '\r' && i != '\t' && i != EOF)
break;
}
c[s++] = i;
for (;;) {
mygc(i);
if (i == ' ' || i == '\n' || i == '\r' || i == '\t' || i == EOF)
break;
c[s++] = i;
}
c[s] = '\0';
return s;
}
int reader(string &c) {
int i;
for (;;) {
mygc(i);
if (i != ' ' && i != '\n' && i != '\r' && i != '\t' && i != EOF)
break;
}
c.push_back(i);
for (;;) {
mygc(i);
if (i == ' ' || i == '\n' || i == '\r' || i == '\t' || i == EOF)
break;
c.push_back(i);
};
return sz(c);
}
template <class T, class S> void reader(T &x, S &y) {
reader(x);
reader(y);
}
template <class T, class S, class U> void reader(T &x, S &y, U &z) {
reader(x);
reader(y);
reader(z);
}
template <class T, class S, class U, class V>
void reader(T &x, S &y, U &z, V &w) {
reader(x);
reader(y);
reader(z);
reader(w);
}
void writer(int x, char c) {
int s = 0, m = 0;
char f[10];
if (x < 0)
m = 1, x = -x;
while (x)
f[s++] = x % 10, x /= 10;
if (!s)
f[s++] = 0;
if (m)
mypc('-');
while (s--)
mypc(f[s] + '0');
mypc(c);
}
void writer(ll x, char c) {
int s = 0, m = 0;
char f[20];
if (x < 0)
m = 1, x = -x;
while (x)
f[s++] = x % 10, x /= 10;
if (!s)
f[s++] = 0;
if (m)
mypc('-');
while (s--)
mypc(f[s] + '0');
mypc(c);
}
void writer(const char c[]) {
int i;
for (i = 0; c[i] != '\0'; i++)
mypc(c[i]);
}
void writer(const string &x, char c) {
int i;
for (i = 0; x[i] != '\0'; i++)
mypc(x[i]);
mypc(c);
}
void writer(const char x[], char c) {
int i;
for (i = 0; x[i] != '\0'; i++)
mypc(x[i]);
mypc(c);
}
template <class T> void writerLn(T x) { writer(x, '\n'); }
template <class T, class S> void writerLn(T x, S y) {
writer(x, ' ');
writer(y, '\n');
}
template <class T, class S, class U> void writerLn(T x, S y, U z) {
writer(x, ' ');
writer(y, ' ');
writer(z, '\n');
}
template <class T, class S, class U, class V>
void writerLn(T x, S y, U z, V v) {
writer(x, ' ');
writer(y, ' ');
writer(z, ' ');
writer(v, '\n');
}
template <class T> void writerArr(T x[], int n) {
if (!n) {
mypc('\n');
return;
}
FOR(i, n - 1) writer(x[i], ' ');
writer(x[n - 1], '\n');
}
template <class T> void writerArr(vector<T> &x) {
writerArr(x.data(), (int)x.size());
}
template <class T> void chmin(T &a, const T &b) {
if (a > b)
a = b;
}
template <class T> void chmax(T &a, const T &b) {
if (a < b)
a = b;
}
template <class T> T gcd(T a, T b) { return b ? gcd(b, a % b) : a; }
template <class T> T lcm(T a, T b) { return a / gcd(a, b) * b; }
ll mod_pow(ll a, ll n, ll mod) {
ll ret = 1;
ll p = a % mod;
while (n) {
if (n & 1)
ret = ret * p % mod;
p = p * p % mod;
n >>= 1;
}
return ret;
}
template <class T> T extgcd(T a, T b, T &x, T &y) {
for (T u = y = 1, v = x = 0; a;) {
T q = b / a;
swap(x -= q * u, u);
swap(y -= q * v, v);
swap(b -= q * a, a);
}
return b;
}
ll mod_inv(ll a, ll m) {
ll x, y;
extgcd<ll>(a, m, x, y);
return (m + x % m) % m;
}
#ifdef _MSC_VER
template <typename... Args>
void debugPrintf(const char *format, Args const &...args) {
fprintf(stderr, format, args...);
fflush(stderr);
}
#else
#define debugPrintf(...)
#endif
const int MOD = ten(9) + 7;
char s[2 * ten(5) + 10];
bool f(int from, int to) {
int cnt = 0;
for (int i = from; i <= to; i++) {
if (s[i] == '#')
cnt++;
else
cnt = 0;
if (cnt == 2)
return false;
}
return true;
}
bool solve() {
int n;
reader(n);
int a, b, c, d;
reader(a, b, c, d);
a--;
b--;
c--;
d--;
reader(s);
bool ok1 = f(a, c);
bool ok2 = f(b, d);
if (!ok1 || !ok2)
return false;
if (c < d) {
return true;
}
for (int i = b; i <= d; i++) {
if (s[i - 1] == '.' && s[i] == '.' && s[i + 1] == '.') {
return true;
}
}
return false;
}
int main() {
bool ans = solve();
puts(ans ? "Yes" : "No");
return 0;
}
| [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 831,929 | 831,930 | u279196402 | cpp |
p03017 | #include <bits/stdc++.h>
using namespace std;
#ifdef ENABLE_DEBUG
#define dump(a) cerr << #a << "=" << a << endl
#define dumparr(a, n) cerr << #a << "[" << n << "]=" << a[n] << endl
#else
#define dump(a)
#define dumparr(a, n)
#endif
#define FOR(i, a, b) for (int i = a; i < b; i++)
#define For(i, a) FOR(i, 0, a)
#define REV(i, a, b) for (int i = b - 1; i >= a; i--)
#define Rev(i, a) REV(i, 0, a)
#define REP(a) For(i, a)
typedef long long int ll;
typedef unsigned long long ull;
typedef unsigned int uint;
typedef pair<ll, ll> pll;
typedef pair<ll, pll> ppll;
typedef vector<ll> vll;
const ll INF = (1LL << 50);
template <class S, class T>
std::ostream &operator<<(std::ostream &os, pair<S, T> a) {
os << "(" << a.first << "," << a.second << ")";
return os;
}
template <class T> std::ostream &operator<<(std::ostream &os, vector<T> a) {
os << "[ ";
REP(a.size()) { os << a[i] << " "; }
os << " ]";
return os;
}
const string YES = "Yes";
const string NO = "No";
void solve(long long N, long long A, long long B, long long C, long long D,
std::string S) {
for (long long i = A - 1; i < C - 1; i++) {
if (S[i] == '#' && S[i + 1] == '#') {
goto no;
}
}
for (long long i = B - 1; i < D - 1; i++) {
if (S[i] == '#' && S[i + 1] == '#') {
goto no;
}
}
if ((A < B) == (C < D)) {
goto yes;
} else {
for (long long i = B - 1; i < D - 1; i++) {
if (S[i - 1] == '.' && S[i] == '.' && S[i + 1] == '.') {
goto yes;
}
}
goto no;
}
yes:
cout << YES << endl;
return;
no:
cout << NO << endl;
return;
}
int main() {
long long N;
scanf("%lld", &N);
long long A;
scanf("%lld", &A);
long long B;
scanf("%lld", &B);
long long C;
scanf("%lld", &C);
long long D;
scanf("%lld", &D);
std::string S;
std::cin >> S;
solve(N, A, B, C, D, S);
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#ifdef ENABLE_DEBUG
#define dump(a) cerr << #a << "=" << a << endl
#define dumparr(a, n) cerr << #a << "[" << n << "]=" << a[n] << endl
#else
#define dump(a)
#define dumparr(a, n)
#endif
#define FOR(i, a, b) for (int i = a; i < b; i++)
#define For(i, a) FOR(i, 0, a)
#define REV(i, a, b) for (int i = b - 1; i >= a; i--)
#define Rev(i, a) REV(i, 0, a)
#define REP(a) For(i, a)
typedef long long int ll;
typedef unsigned long long ull;
typedef unsigned int uint;
typedef pair<ll, ll> pll;
typedef pair<ll, pll> ppll;
typedef vector<ll> vll;
const ll INF = (1LL << 50);
template <class S, class T>
std::ostream &operator<<(std::ostream &os, pair<S, T> a) {
os << "(" << a.first << "," << a.second << ")";
return os;
}
template <class T> std::ostream &operator<<(std::ostream &os, vector<T> a) {
os << "[ ";
REP(a.size()) { os << a[i] << " "; }
os << " ]";
return os;
}
const string YES = "Yes";
const string NO = "No";
void solve(long long N, long long A, long long B, long long C, long long D,
std::string S) {
for (long long i = A - 1; i < C - 1; i++) {
if (S[i] == '#' && S[i + 1] == '#') {
goto no;
}
}
for (long long i = B - 1; i < D - 1; i++) {
if (S[i] == '#' && S[i + 1] == '#') {
goto no;
}
}
if ((A < B) == (C < D)) {
goto yes;
} else {
for (long long i = B - 1; i < D; i++) {
if (S[i - 1] == '.' && S[i] == '.' && S[i + 1] == '.') {
goto yes;
}
}
goto no;
}
yes:
cout << YES << endl;
return;
no:
cout << NO << endl;
return;
}
int main() {
long long N;
scanf("%lld", &N);
long long A;
scanf("%lld", &A);
long long B;
scanf("%lld", &B);
long long C;
scanf("%lld", &C);
long long D;
scanf("%lld", &D);
std::string S;
std::cin >> S;
solve(N, A, B, C, D, S);
return 0;
}
| [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 831,931 | 831,932 | u634743753 | cpp |
p03017 | #include <algorithm>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#define MOD (1000000007l)
#define rep(i, n) for (long i = 0; i < n; i++)
using namespace std;
int main(void) {
cout.precision(12);
long N, A, B, C, D;
cin >> N >> A >> B >> C >> D;
A--;
B--;
C--;
D--;
string S;
cin >> S;
// 追い抜きが必要かどうか
bool oinuki = (A < B and C > D) or (A > B and C < D);
bool A_can = true;
for (long i = A; i < C; i++) {
if (S[i] == '#' and S[i + 1] == '#') {
A_can = false;
break;
}
}
bool B_can = true;
for (long i = B; i < D; i++) {
if (S[i] == '#' and S[i + 1] == '#') {
B_can = false;
break;
}
}
if ((not A_can) or (not B_can)) {
cout << "No" << endl;
return 0;
}
if (not oinuki) {
cout << "Yes" << endl;
return 0;
}
long E = max(A, B);
long F = min(C, D);
long oinuki_can = false;
for (long i = E; i < F; i++) {
if (S[i - 1] == '.' and S[i] == '.' and S[i + 1] == '.') {
oinuki_can = true;
break;
}
}
if (oinuki_can) {
cout << "Yes" << endl;
return 0;
}
cout << "No" << endl;
return 0;
return 0;
}
| #include <algorithm>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#define MOD (1000000007l)
#define rep(i, n) for (long i = 0; i < n; i++)
using namespace std;
int main(void) {
cout.precision(12);
long N, A, B, C, D;
cin >> N >> A >> B >> C >> D;
A--;
B--;
C--;
D--;
string S;
cin >> S;
// 追い抜きが必要かどうか
bool oinuki = (A < B and C > D) or (A > B and C < D);
bool A_can = true;
for (long i = A; i < C; i++) {
if (S[i] == '#' and S[i + 1] == '#') {
A_can = false;
break;
}
}
bool B_can = true;
for (long i = B; i < D; i++) {
if (S[i] == '#' and S[i + 1] == '#') {
B_can = false;
break;
}
}
if ((not A_can) or (not B_can)) {
cout << "No" << endl;
return 0;
}
if (not oinuki) {
cout << "Yes" << endl;
return 0;
}
long E = max(A, B);
long F = min(C, D);
long oinuki_can = false;
for (long i = E; i <= F; i++) {
if (S[i - 1] == '.' and S[i] == '.' and S[i + 1] == '.') {
oinuki_can = true;
break;
}
}
if (oinuki_can) {
cout << "Yes" << endl;
return 0;
}
cout << "No" << endl;
return 0;
}
| [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 831,937 | 831,938 | u995792346 | cpp |
p03017 | #include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <regex>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <valarray>
#include <vector>
using namespace std;
using ll = long long;
const int INF = 1e9;
const ll MOD = 1e9 + 7;
int main() {
int n, a, b, c, d;
cin >> n >> a >> b >> c >> d;
string s;
cin >> s;
bool flag = true;
if (c < d) {
for (int i = b - 1; i < d - 1; ++i) {
if (s[i] == '#' && s[i + 1] == '#')
flag = false;
}
s[d - 1] = '#';
for (int i = a - 1; i < c - 1; ++i) {
if (s[i] == '#' && s[i + 1] == '#')
flag = false;
}
} else {
int itr = b - 1;
for (int i = b - 1; i < d - 2; ++i) {
if (s[i] == '.' && s[i + 1] == '.' && s[i + 2] == '.')
itr = i + 1;
}
s[itr] = '#';
for (int i = a - 1; i < c - 1; ++i) {
if (s[i] == '#' && s[i + 1] == '#')
flag = false;
}
s[c - 1] = '#';
s[itr] = '.';
for (int i = b - 1; i < d - 1; ++i) {
if (s[i] == '#' && s[i + 1] == '#')
flag = false;
}
}
if (flag)
cout << "Yes" << endl;
else
cout << "No" << endl;
return 0;
}
| #include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <regex>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <valarray>
#include <vector>
using namespace std;
using ll = long long;
const int INF = 1e9;
const ll MOD = 1e9 + 7;
int main() {
int n, a, b, c, d;
cin >> n >> a >> b >> c >> d;
string s;
cin >> s;
bool flag = true;
if (c < d) {
for (int i = b - 1; i < d - 1; ++i) {
if (s[i] == '#' && s[i + 1] == '#')
flag = false;
}
s[d - 1] = '#';
for (int i = a - 1; i < c - 1; ++i) {
if (s[i] == '#' && s[i + 1] == '#')
flag = false;
}
} else {
int itr = b - 1;
for (int i = b - 2; i < d - 1; ++i) {
if (s[i] == '.' && s[i + 1] == '.' && s[i + 2] == '.')
itr = i + 1;
}
s[itr] = '#';
for (int i = a - 1; i < c - 1; ++i) {
if (s[i] == '#' && s[i + 1] == '#')
flag = false;
}
s[c - 1] = '#';
s[itr] = '.';
for (int i = b - 1; i < d - 1; ++i) {
if (s[i] == '#' && s[i + 1] == '#')
flag = false;
}
}
if (flag)
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",
"control_flow.branch.if.condition.change"
] | 831,939 | 831,940 | u054652697 | cpp |
p03017 | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
#define rep(i, l, r) for (int i = (l); i <= (r); i++)
typedef long long ll;
using namespace std;
const int N = 400010;
int n, A, B, C, D;
char s[N];
int main() {
scanf("%d%d%d%d%d%s", &n, &A, &B, &C, &D, s + 1);
bool flag = 0;
rep(i, A + 1, C) if (s[i] == '#' && s[i - 1] == '#') {
puts("NO");
return 0;
}
rep(i, B + 1, D) if (s[i] == '#' && s[i - 1] == '#') {
puts("NO");
return 0;
}
if (C < D) {
puts("YES");
return 0;
}
rep(i, B, D) if (s[i - 1] == '.' && s[i] == '.' && s[i + 1] == '.') {
flag = 1;
break;
}
if (!flag)
puts("NO");
else
puts("YES");
return 0;
} | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
#define rep(i, l, r) for (int i = (l); i <= (r); i++)
typedef long long ll;
using namespace std;
const int N = 400010;
int n, A, B, C, D;
char s[N];
int main() {
scanf("%d%d%d%d%d%s", &n, &A, &B, &C, &D, s + 1);
bool flag = 0;
rep(i, A + 1, C) if (s[i] == '#' && s[i - 1] == '#') {
puts("No");
return 0;
}
rep(i, B + 1, D) if (s[i] == '#' && s[i - 1] == '#') {
puts("No");
return 0;
}
if (C < D) {
puts("Yes");
return 0;
}
rep(i, B, D) if (s[i - 1] == '.' && s[i] == '.' && s[i + 1] == '.') {
flag = 1;
break;
}
if (!flag)
puts("No");
else
puts("Yes");
return 0;
} | [
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 831,941 | 831,942 | u706008189 | cpp |
p03017 | #include <bits/stdc++.h>
#define reps(i, a, b) for (long long int i = a; i < b; i++)
#define rep(i, a) for (long long int i = 0; i < a; i++)
typedef long long int ll;
using namespace std;
ll MOD = 1000000007;
const int MAX = 510000;
struct aaa {
aaa() {
cin.tie(0);
ios::sync_with_stdio(0);
cout << fixed << setprecision(20);
};
} aaaaaaa;
int main() {
int N, A, B, C, D;
cin >> N >> A >> B >> C >> D;
string S;
cin >> S;
if (C < D) {
int yaba = 0;
for (int i = A - 1; i < D - 1; i++) {
if (S[i] == '#' && S[i + 1] == '#') {
yaba++;
}
}
if (yaba > 0) {
cout << "No" << endl;
} else {
cout << "Yes" << endl;
}
} else {
int yaba = 0;
for (int i = A - 1; i < C - 1; i++) {
if (S[i] == '#' && S[i + 1] == '#') {
yaba++;
}
}
if (yaba > 0) {
cout << "No" << endl;
} else {
int daijo = 0;
for (int i = B - 2; i < C - 1; i++) {
if (S[i] == '.' && S[i + 1] == '.' && S[i + 2] == '.') {
daijo++;
}
}
if (daijo > 0) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
}
}
return 0;
} | #include <bits/stdc++.h>
#define reps(i, a, b) for (long long int i = a; i < b; i++)
#define rep(i, a) for (long long int i = 0; i < a; i++)
typedef long long int ll;
using namespace std;
ll MOD = 1000000007;
const int MAX = 510000;
struct aaa {
aaa() {
cin.tie(0);
ios::sync_with_stdio(0);
cout << fixed << setprecision(20);
};
} aaaaaaa;
int main() {
int N, A, B, C, D;
cin >> N >> A >> B >> C >> D;
string S;
cin >> S;
if (C < D) {
int yaba = 0;
for (int i = A - 1; i < D - 1; i++) {
if (S[i] == '#' && S[i + 1] == '#') {
yaba++;
}
}
if (yaba > 0) {
cout << "No" << endl;
} else {
cout << "Yes" << endl;
}
} else {
int yaba = 0;
for (int i = A - 1; i < C - 1; i++) {
if (S[i] == '#' && S[i + 1] == '#') {
yaba++;
}
}
if (yaba > 0) {
cout << "No" << endl;
} else {
int daijo = 0;
for (int i = B - 2; i < D - 1; i++) {
if (S[i] == '.' && S[i + 1] == '.' && S[i + 2] == '.') {
daijo++;
}
}
if (daijo > 0) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
}
}
return 0;
} | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 831,943 | 831,944 | u691174149 | cpp |
p03017 | #define MM_USE_COMP_MACRO
#ifdef MM_USE_COMP_MACRO
// DO NOT READ THIS SECTION:YOU'RE WASTING YOUR TIME
#ifndef MM_USE_COMP_MACRO_DEF
#define MM_USE_COMP_MACRO_DEF
#define _USE_MATH_DEFINES
#include <cmath>
#include <cstdio>
#include <iostream>
#include <string>
#include <utility>
typedef long long signed int ll;
template <class T> using abp2 = std::pair<T, T>;
template <class T> using abp3 = std::pair<std::pair<T, T>, T>;
template <class T> using abp4 = std::pair<std::pair<T, T>, std::pair<T, T>>;
typedef abp2<ll> ln2;
typedef abp3<ll> ln3;
typedef abp4<ll> ln4;
#define mlp2_t(i, j) std::pair<i, j>
#define mlp3_t(i, j, k) std::pair<std::pair<i, j>, k>
#define mlp4_t(i, j, k, l) std::pair<std::pair<i, j>, std::pair<k, l>>
#define mkp2(i, j) make_pair(i, j)
#define mkp3(i, j, k) make_pair(make_pair(i, j), k)
#define mkp4(i, j, k, l) make_pair(make_pair(i, j), make_pair(k, l))
#define gtp2_1(a) a.first
#define gtp2_2(a) a.second
#define gtp3_1(a) a.first.fisrt
#define gtp3_2(a) a.first.second
#define gtp3_3(a) a.second
#define gtp4_1(a) a.first.fisrt
#define gtp4_2(a) a.first.second
#define gtp4_3(a) a.second.first
#define gtp4_4(a) a.second.second
#define vect_d(a) \
printf("Dump: In \"%s\" at line %d.\n", __FILE__, __LINE__); \
for (auto &e : a) \
std::cout << e << " "; \
std::cout << std::endl;
#define loop3(i, j, k) for (ll i = j; i < k; i++)
#define loop2(i, j) for (ll i = 0; i < j; i++)
#define loop(j) for (ll i = 0; i < j; i++)
/*
template<class T>
auto gst = []() { T a; std::cin >> a; return a; };
auto gsti = gst<int>;
auto gstll = gst<ll>;
auto gsts = gst<std::string>;
*/
template <class T> constexpr T mpi = (T)M_PI;
constexpr auto pi_i = mpi<int>;
constexpr auto pi_ll = mpi<ll>;
#ifndef N_MOD
#pragma message( \
"Warning!! No N_MOD macro is defined. Falling back to 1000000007.")
#define N_MOD 1000000007
#endif
#ifdef _DEBUG
#define assert_error \
{ \
printf("Error: In \"%s\" at line %d.\n", __FILE__, __LINE__); \
throw; \
}
#else
#define assert_error \
{ throw; }
#endif
#endif
#endif
#include <algorithm>
#include <iostream>
#include <list>
#include <map>
#include <set>
#include <string>
#include <utility>
#include <vector>
using namespace std;
int main() {
ll n, a, b, c, d;
string s;
cin >> n >> a >> b >> c >> d >> s;
a--;
b--;
c--;
d--;
for (ll i = a + 1; i < c; i++) {
if (s[i] == '#' && s[i + 1] == '#')
goto res_no;
}
for (ll i = b + 1; i < d; i++) {
if (s[i] == '#' && s[i + 1] == '#')
goto res_no;
}
if (c < d)
goto res_yes;
for (ll i = b; i < d - 1; i++) {
if (s[i - 1] == '.' && s[i] == '.' && s[i + 1] == '.')
goto res_yes;
}
res_no:
cout << "No" << endl;
return 0;
res_yes:
cout << "Yes" << endl;
return 0;
} | #define MM_USE_COMP_MACRO
#ifdef MM_USE_COMP_MACRO
// DO NOT READ THIS SECTION:YOU'RE WASTING YOUR TIME
#ifndef MM_USE_COMP_MACRO_DEF
#define MM_USE_COMP_MACRO_DEF
#define _USE_MATH_DEFINES
#include <cmath>
#include <cstdio>
#include <iostream>
#include <string>
#include <utility>
typedef long long signed int ll;
template <class T> using abp2 = std::pair<T, T>;
template <class T> using abp3 = std::pair<std::pair<T, T>, T>;
template <class T> using abp4 = std::pair<std::pair<T, T>, std::pair<T, T>>;
typedef abp2<ll> ln2;
typedef abp3<ll> ln3;
typedef abp4<ll> ln4;
#define mlp2_t(i, j) std::pair<i, j>
#define mlp3_t(i, j, k) std::pair<std::pair<i, j>, k>
#define mlp4_t(i, j, k, l) std::pair<std::pair<i, j>, std::pair<k, l>>
#define mkp2(i, j) make_pair(i, j)
#define mkp3(i, j, k) make_pair(make_pair(i, j), k)
#define mkp4(i, j, k, l) make_pair(make_pair(i, j), make_pair(k, l))
#define gtp2_1(a) a.first
#define gtp2_2(a) a.second
#define gtp3_1(a) a.first.fisrt
#define gtp3_2(a) a.first.second
#define gtp3_3(a) a.second
#define gtp4_1(a) a.first.fisrt
#define gtp4_2(a) a.first.second
#define gtp4_3(a) a.second.first
#define gtp4_4(a) a.second.second
#define vect_d(a) \
printf("Dump: In \"%s\" at line %d.\n", __FILE__, __LINE__); \
for (auto &e : a) \
std::cout << e << " "; \
std::cout << std::endl;
#define loop3(i, j, k) for (ll i = j; i < k; i++)
#define loop2(i, j) for (ll i = 0; i < j; i++)
#define loop(j) for (ll i = 0; i < j; i++)
/*
template<class T>
auto gst = []() { T a; std::cin >> a; return a; };
auto gsti = gst<int>;
auto gstll = gst<ll>;
auto gsts = gst<std::string>;
*/
template <class T> constexpr T mpi = (T)M_PI;
constexpr auto pi_i = mpi<int>;
constexpr auto pi_ll = mpi<ll>;
#ifndef N_MOD
#pragma message( \
"Warning!! No N_MOD macro is defined. Falling back to 1000000007.")
#define N_MOD 1000000007
#endif
#ifdef _DEBUG
#define assert_error \
{ \
printf("Error: In \"%s\" at line %d.\n", __FILE__, __LINE__); \
throw; \
}
#else
#define assert_error \
{ throw; }
#endif
#endif
#endif
#include <algorithm>
#include <iostream>
#include <list>
#include <map>
#include <set>
#include <string>
#include <utility>
#include <vector>
using namespace std;
int main() {
ll n, a, b, c, d;
string s;
cin >> n >> a >> b >> c >> d >> s;
a--;
b--;
c--;
d--;
for (ll i = a + 1; i < c; i++) {
if (s[i] == '#' && s[i + 1] == '#')
goto res_no;
}
for (ll i = b + 1; i < d; i++) {
if (s[i] == '#' && s[i + 1] == '#')
goto res_no;
}
if (c < d)
goto res_yes;
for (ll i = b; i <= d; i++) {
if (s[i - 1] == '.' && s[i] == '.' && s[i + 1] == '.')
goto res_yes;
}
res_no:
cout << "No" << endl;
return 0;
res_yes:
cout << "Yes" << endl;
return 0;
} | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 831,954 | 831,955 | u751537640 | cpp |
p03017 | #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
int main() {
int n, a, b, c, d;
cin >> n >> a >> b >> c >> d;
a--;
b--;
c--;
d--;
string s;
cin >> s;
bool flag = false;
for (int i = a; i <= c; i++) {
if (s[i] == '#') {
if (flag == false)
flag = true;
else {
cout << "No" << endl;
return 0;
}
}
if (s[i] == '.')
flag = false;
}
for (int i = b; i <= d; i++) {
if (s[i] == '#') {
if (flag == false)
flag = true;
else {
cout << "No" << endl;
return 0;
}
}
if (s[i] == '.')
flag = false;
}
if (c > d) {
int cnt = 0;
for (int i = b; i <= d + 1; i++) {
if (s[i] == '.') {
cnt++;
if (cnt >= 3) {
cout << "Yes" << endl;
return 0;
}
} else
cnt = 0;
}
cout << "No" << endl;
return 0;
}
cout << "Yes" << endl;
return 0;
}
| #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
int main() {
int n, a, b, c, d;
cin >> n >> a >> b >> c >> d;
a--;
b--;
c--;
d--;
string s;
cin >> s;
bool flag = false;
for (int i = a; i <= c; i++) {
if (s[i] == '#') {
if (flag == false)
flag = true;
else {
cout << "No" << endl;
return 0;
}
}
if (s[i] == '.')
flag = false;
}
for (int i = b; i <= d; i++) {
if (s[i] == '#') {
if (flag == false)
flag = true;
else {
cout << "No" << endl;
return 0;
}
}
if (s[i] == '.')
flag = false;
}
if (c > d) {
int cnt = 0;
for (int i = b - 1; i <= d + 1; i++) {
if (s[i] == '.') {
cnt++;
if (cnt >= 3) {
cout << "Yes" << endl;
return 0;
}
} else
cnt = 0;
}
cout << "No" << endl;
return 0;
}
cout << "Yes" << endl;
return 0;
}
| [
"control_flow.loop.for.initializer.change"
] | 831,960 | 831,961 | u620735210 | cpp |
p03017 | #include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstdlib>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <vector>
using namespace std;
#define ll long long int
ll const MOD = 1000000007;
ll const INF = (long long int)1 << 61;
ll mypow(ll x, ll n) {
ll ret = 1;
while (n > 0) {
if (n & 1) {
ret = (ret * x) % MOD;
}
x = (x * x) % MOD;
n >>= 1;
}
return ret;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll n, a, b, c, d;
cin >> n >> a >> b >> c >> d;
string str;
cin >> str;
bool aflag = true;
for (int i = a - 1; i < c - 1; i++) {
if (str[i] == '#' && str[i + 1] == '#') {
aflag = false;
}
}
bool bflag = true;
for (int i = b - 1; i < d - 1; i++) {
if (str[i] == '#' && str[i + 1] == '#') {
bflag = false;
}
}
if (aflag && bflag) {
if (c < d) {
cout << "Yes" << endl;
} else {
bool triple = false;
for (int i = b - 2; i < d - 2; i++) {
if (str[i] == '.' && str[i + 1] == '.' && str[i + 2] == '.') {
triple = true;
}
}
if (triple) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
}
} else {
cout << "No" << endl;
}
return 0;
} | #include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstdlib>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <vector>
using namespace std;
#define ll long long int
ll const MOD = 1000000007;
ll const INF = (long long int)1 << 61;
ll mypow(ll x, ll n) {
ll ret = 1;
while (n > 0) {
if (n & 1) {
ret = (ret * x) % MOD;
}
x = (x * x) % MOD;
n >>= 1;
}
return ret;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll n, a, b, c, d;
cin >> n >> a >> b >> c >> d;
string str;
cin >> str;
bool aflag = true;
for (int i = a - 1; i < c - 1; i++) {
if (str[i] == '#' && str[i + 1] == '#') {
aflag = false;
}
}
bool bflag = true;
for (int i = b - 1; i < d - 1; i++) {
if (str[i] == '#' && str[i + 1] == '#') {
bflag = false;
}
}
if (aflag && bflag) {
if (c < d) {
cout << "Yes" << endl;
} else {
bool triple = false;
for (int i = b - 2; i < d - 1; i++) {
if (str[i] == '.' && str[i + 1] == '.' && str[i + 2] == '.') {
triple = true;
}
}
if (triple) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
}
} else {
cout << "No" << endl;
}
return 0;
} | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 831,962 | 831,963 | u369508054 | cpp |
p03017 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> Pii;
typedef vector<ll> Vi;
typedef vector<Vi> VVi;
const double EPS = (1e-7);
const ll INF = (1e13);
const double PI = (acos(-1));
const ll MOD = ll(1e9) + 7;
#define REP(i, n) for (ll i = 0; i < (ll)(n); i++)
#define REPR(i, n) for (ll i = n; i > -1; i--)
#define FOR(i, a, b) for (ll i = (ll)(a); i < (ll)(b); i++)
#define ALL(x) (x).begin(), (x).end()
#define SORT(x) sort((x).begin(), (x).end())
#define RSORT(x) sort((x).rbegin(), (x).rend())
#define REVERSE(x) reverse((x).begin(), (x).end())
#define SZ(x) ((ll)(x).size())
#define pb push_back
#define mp make_pair
// chmax(a, b): a>bならaをbで更新 更新したときにtrueを返す
// chmin(a, b): a<bならaをbで更新 更新したときにtrueを返す
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;
}
#define dump(x) cerr << #x << "= " << (x) << endl;
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
ll pow(ll a, ll b) {
if (b == 0)
return 1;
else if (b % 2 == 0)
return pow(a * a, b / 2);
else
return pow(a * a, b / 2) * a;
}
ll pow(ll a, ll b, ll m) {
if (b == 0)
return 1;
else if (a == 0)
return 0;
else if (b % 2 == 0)
return (pow((a * a) % m, b / 2, m) % m);
else
return (pow((a * a) % m, b / 2, m) * a) % m;
}
ll residue(ll a, ll m) { return ((a % m) + m) % m; };
ll dx[4] = {1, 0, -1, 0};
ll dy[4] = {0, 1, 0, -1};
ll n, a, b, c, d;
string s;
bool hantei(ll start, ll goal) {
for (ll i = start; i < goal; i++) {
if (s[i] == '#' && s[i + 1] == '#')
return false;
}
return true;
}
int main() {
cin >> n >> a >> b >> c >> d;
cin >> s;
a--;
b--;
c--;
d--;
bool ans = hantei(a, c) && hantei(b, d);
if (d < c) {
bool tmp = false;
for (ll i = b; i < d; i++) {
if (s[i - 1] == '.' && s[i] == '.' && s[i + 1] == '.') {
tmp = true;
break;
}
}
ans = ans && tmp;
}
cout << ((ans) ? "Yes" : "No") << endl;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> Pii;
typedef vector<ll> Vi;
typedef vector<Vi> VVi;
const double EPS = (1e-7);
const ll INF = (1e13);
const double PI = (acos(-1));
const ll MOD = ll(1e9) + 7;
#define REP(i, n) for (ll i = 0; i < (ll)(n); i++)
#define REPR(i, n) for (ll i = n; i > -1; i--)
#define FOR(i, a, b) for (ll i = (ll)(a); i < (ll)(b); i++)
#define ALL(x) (x).begin(), (x).end()
#define SORT(x) sort((x).begin(), (x).end())
#define RSORT(x) sort((x).rbegin(), (x).rend())
#define REVERSE(x) reverse((x).begin(), (x).end())
#define SZ(x) ((ll)(x).size())
#define pb push_back
#define mp make_pair
// chmax(a, b): a>bならaをbで更新 更新したときにtrueを返す
// chmin(a, b): a<bならaをbで更新 更新したときにtrueを返す
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;
}
#define dump(x) cerr << #x << "= " << (x) << endl;
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
ll pow(ll a, ll b) {
if (b == 0)
return 1;
else if (b % 2 == 0)
return pow(a * a, b / 2);
else
return pow(a * a, b / 2) * a;
}
ll pow(ll a, ll b, ll m) {
if (b == 0)
return 1;
else if (a == 0)
return 0;
else if (b % 2 == 0)
return (pow((a * a) % m, b / 2, m) % m);
else
return (pow((a * a) % m, b / 2, m) * a) % m;
}
ll residue(ll a, ll m) { return ((a % m) + m) % m; };
ll dx[4] = {1, 0, -1, 0};
ll dy[4] = {0, 1, 0, -1};
ll n, a, b, c, d;
string s;
bool hantei(ll start, ll goal) {
for (ll i = start; i < goal; i++) {
if (s[i] == '#' && s[i + 1] == '#')
return false;
}
return true;
}
int main() {
cin >> n >> a >> b >> c >> d;
cin >> s;
a--;
b--;
c--;
d--;
bool ans = hantei(a, c) && hantei(b, d);
if (d < c) {
bool tmp = false;
for (ll i = b; i <= d; i++) {
if (s[i - 1] == '.' && s[i] == '.' && s[i + 1] == '.') {
tmp = true;
break;
}
}
ans = ans && tmp;
}
cout << ((ans) ? "Yes" : "No") << endl;
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 831,966 | 831,967 | u820560680 | 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;
bool flg = true;
if (D > C) {
for (int i = A - 1; i < C - 1; i++) {
if (!flg)
break;
if (s[i] == '#' && s[i + 1] == '#')
flg = false;
}
for (int i = B - 1; i < D - 1; i++) {
if (!flg)
break;
if (s[i] == '#' && s[i + 1] == '#')
flg = false;
}
}
if (D < C) {
flg = false;
for (int i = B - 2; i < C + 1; i++) {
if (flg)
break;
if (s[i] == '.' && s[i + 1] == '.' && s[i + 2] == '.')
flg = true;
}
for (int i = A - 1; i < C - 1; i++) {
if (!flg)
break;
if (s[i] == '#' && s[i + 1] == '#')
flg = false;
}
for (int i = B - 1; i < D - 1; i++) {
if (!flg)
break;
if (s[i] == '#' && s[i + 1] == '#')
flg = false;
}
}
if (flg)
cout << "Yes"
<< "\n";
else
cout << "No"
<< "\n";
} | #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;
bool flg = true;
if (D > C) {
for (int i = A - 1; i < C - 1; i++) {
if (!flg)
break;
if (s[i] == '#' && s[i + 1] == '#')
flg = false;
}
for (int i = B - 1; i < D - 1; i++) {
if (!flg)
break;
if (s[i] == '#' && s[i + 1] == '#')
flg = false;
}
}
if (D < C) {
flg = false;
for (int i = B - 2; i < D - 1; i++) {
if (flg)
break;
if (s[i] == '.' && s[i + 1] == '.' && s[i + 2] == '.')
flg = true;
}
for (int i = A - 1; i < C - 1; i++) {
if (!flg)
break;
if (s[i] == '#' && s[i + 1] == '#')
flg = false;
}
for (int i = B - 1; i < D - 1; i++) {
if (!flg)
break;
if (s[i] == '#' && s[i + 1] == '#')
flg = false;
}
}
if (flg)
cout << "Yes"
<< "\n";
else
cout << "No"
<< "\n";
} | [
"control_flow.loop.for.condition.change"
] | 831,968 | 831,969 | u501643136 | cpp |
p03017 | #include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
int N, A, B, C, D;
cin >> N >> A >> B >> C >> D;
string S;
cin >> S;
A--, B--, C--, D--;
auto is_good = [&](int l, int r) -> bool {
for (int i = l; i <= r - 1; i++) {
if (S[i] == '#' && S[i + 1] == '#') {
return false;
}
}
return true;
};
auto is_good2 = [&](int l, int r) -> bool {
int cnt = 0;
for (int i = l; i <= r; i++) {
if (S[i] == '.') {
cnt++;
if (cnt >= 3) {
return true;
}
} else {
cnt = 0;
}
}
return false;
};
bool ans;
if (C > D) {
ans = is_good(A, C) && is_good2(A, D + 1);
} else {
ans = is_good(A, C) && is_good(B, D);
}
if (ans) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
int N, A, B, C, D;
cin >> N >> A >> B >> C >> D;
string S;
cin >> S;
A--, B--, C--, D--;
auto is_good = [&](int l, int r) -> bool {
for (int i = l; i <= r - 1; i++) {
if (S[i] == '#' && S[i + 1] == '#') {
return false;
}
}
return true;
};
auto is_good2 = [&](int l, int r) -> bool {
int cnt = 0;
for (int i = l; i <= r; i++) {
if (S[i] == '.') {
cnt++;
if (cnt >= 3) {
return true;
}
} else {
cnt = 0;
}
}
return false;
};
bool ans;
if (C > D) {
ans = is_good(A, C) && is_good2(B - 1, D + 1);
} else {
ans = is_good(A, C) && is_good(B, D);
}
if (ans) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
return 0;
}
| [
"assignment.value.change",
"call.arguments.change",
"expression.operation.binary.change",
"assignment.change"
] | 831,973 | 831,974 | u242534780 | cpp |
p03017 | #include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
int N, A, B, C, D;
cin >> N >> A >> B >> C >> D;
string S;
cin >> S;
A--, B--, C--, D--;
auto is_good = [&](int l, int r) -> bool {
for (int i = l; i <= r - 1; i++) {
if (S[i] == '#' && S[i + 1] == '#') {
return false;
}
}
return true;
};
auto is_good2 = [&](int l, int r) -> bool {
int cnt = 0;
for (int i = l; i <= r; i++) {
if (S[i] == '.') {
cnt++;
if (cnt >= 3) {
return true;
}
} else {
cnt = 0;
}
}
return false;
};
bool ans;
if (C > D) {
ans = is_good(A, C) && is_good2(B, D + 1);
} else {
ans = is_good(A, C) && is_good(B, D);
}
if (ans) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
int N, A, B, C, D;
cin >> N >> A >> B >> C >> D;
string S;
cin >> S;
A--, B--, C--, D--;
auto is_good = [&](int l, int r) -> bool {
for (int i = l; i <= r - 1; i++) {
if (S[i] == '#' && S[i + 1] == '#') {
return false;
}
}
return true;
};
auto is_good2 = [&](int l, int r) -> bool {
int cnt = 0;
for (int i = l; i <= r; i++) {
if (S[i] == '.') {
cnt++;
if (cnt >= 3) {
return true;
}
} else {
cnt = 0;
}
}
return false;
};
bool ans;
if (C > D) {
ans = is_good(A, C) && is_good2(B - 1, D + 1);
} else {
ans = is_good(A, C) && is_good(B, D);
}
if (ans) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
return 0;
}
| [
"assignment.change"
] | 831,975 | 831,974 | u242534780 | cpp |
p03017 | #include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
int N, A, B, C, D;
cin >> N >> A >> B >> C >> D;
string S;
cin >> S;
A--, B--, C--, D--;
auto is_good = [&](int l, int r) -> bool {
for (int i = l; i <= r - 1; i++) {
if (S[i] == '#' && S[i + 1] == '#') {
return false;
}
}
return true;
};
auto is_good2 = [&](int l, int r) -> bool {
int cnt = 0;
for (int i = l; i <= r; i++) {
if (S[i] == '.') {
cnt++;
if (cnt >= 3) {
return true;
}
} else {
cnt = 0;
}
}
return false;
};
bool ans;
if (C > D) {
ans = is_good(A, C) && is_good2(B, D);
} else {
ans = is_good(A, C) && is_good(B, D);
}
if (ans) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
int N, A, B, C, D;
cin >> N >> A >> B >> C >> D;
string S;
cin >> S;
A--, B--, C--, D--;
auto is_good = [&](int l, int r) -> bool {
for (int i = l; i <= r - 1; i++) {
if (S[i] == '#' && S[i + 1] == '#') {
return false;
}
}
return true;
};
auto is_good2 = [&](int l, int r) -> bool {
int cnt = 0;
for (int i = l; i <= r; i++) {
if (S[i] == '.') {
cnt++;
if (cnt >= 3) {
return true;
}
} else {
cnt = 0;
}
}
return false;
};
bool ans;
if (C > D) {
ans = is_good(A, C) && is_good2(B - 1, D + 1);
} else {
ans = is_good(A, C) && is_good(B, D);
}
if (ans) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
return 0;
}
| [
"assignment.change"
] | 831,976 | 831,974 | u242534780 | 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;
cin >> S;
int count = 0;
bool flag = false;
bool ans = true;
// 3
for (int i = B - 2; i < D; i++) {
if (S[i] == '.')
count++;
else
count = 0;
if (count == 3) {
flag = true;
break;
}
}
if (C > D && flag == false)
ans = false;
//##
count = 0;
for (int i = A; i < C; i++) {
if (S[i] == '#')
count++;
else
count = 0;
if (count == 2) {
ans = false;
break;
}
}
count = 0;
for (int i = B; i < D; i++) {
if (S[i] == '#')
count++;
else
count = 0;
if (count == 2) {
ans = false;
break;
}
}
if (ans)
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;
cin >> S;
int count = 0;
bool flag = false;
bool ans = true;
// 3
for (int i = B - 2; i < D + 1; i++) {
if (S[i] == '.')
count++;
else
count = 0;
if (count == 3) {
flag = true;
break;
}
}
if (C > D && flag == false)
ans = false;
//##
count = 0;
for (int i = A; i < C; i++) {
if (S[i] == '#')
count++;
else
count = 0;
if (count == 2) {
ans = false;
break;
}
}
count = 0;
for (int i = B; i < D; i++) {
if (S[i] == '#')
count++;
else
count = 0;
if (count == 2) {
ans = false;
break;
}
}
if (ans)
cout << "Yes" << endl;
else
cout << "No" << endl;
}
| [
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 831,977 | 831,978 | u074306398 | 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;
cin >> S;
int count = 0;
bool flag = false;
bool ans = true;
for (int i = B; i < D; i++) {
if (S[i] == '.')
count++;
else
count = 0;
if (count == 3) {
flag = true;
break;
}
}
if (C > D && flag == false)
ans = false;
count = 0;
for (int i = A; i < C; i++) {
if (S[i] == '#')
count++;
else
count = 0;
if (count == 2) {
ans = false;
break;
}
}
count = 0;
for (int i = B; i < D; i++) {
if (S[i] == '#')
count++;
else
count = 0;
if (count == 2) {
ans = false;
break;
}
}
if (ans)
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;
cin >> S;
int count = 0;
bool flag = false;
bool ans = true;
// 3
for (int i = B - 2; i < D + 1; i++) {
if (S[i] == '.')
count++;
else
count = 0;
if (count == 3) {
flag = true;
break;
}
}
if (C > D && flag == false)
ans = false;
//##
count = 0;
for (int i = A; i < C; i++) {
if (S[i] == '#')
count++;
else
count = 0;
if (count == 2) {
ans = false;
break;
}
}
count = 0;
for (int i = B; i < D; i++) {
if (S[i] == '#')
count++;
else
count = 0;
if (count == 2) {
ans = false;
break;
}
}
if (ans)
cout << "Yes" << endl;
else
cout << "No" << endl;
}
| [
"control_flow.loop.for.initializer.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 831,979 | 831,978 | u074306398 | cpp |
p03017 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define endl '\n'
#define pii pair<ll int, ll int>
#define vi vector<ll int>
#define all(a) (a).begin(), (a).end()
#define F first
#define S second
#define sz(x) (ll int)x.size()
#define hell 1000000007
#define rep(i, a, b) for (ll int i = a; i < b; i++)
#define lbnd lower_bound
#define ubnd upper_bound
#define bs binary_search
#define mp make_pair
#define fastio \
iostream::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
ll power(ll x, ll y, ll p) {
ll res = 1;
x = x % p;
while (y > 0) {
if (y & 1)
res = (res * x) % p;
y = y >> 1;
x = (x * x) % p;
}
return res;
}
struct compare {
bool operator()(const std::string &first, const std::string &second) {
return first.size() > second.size();
}
};
ll find(ll x, ll y, ll t) {
ll n = ((t - x) / y) + 1;
n = max((ll)1, n);
return (x + (n - 1) * y);
}
int main() {
fastio;
ll n, a, b, c, d;
cin >> n >> a >> b >> c >> d;
string s;
cin >> s;
for (int i = min(a, b) - 1; i <= max(c, d) - 1 && i < n - 1; ++i) {
if (s[i] == s[i + 1] && s[i + 1] == '#')
cout << "No", exit(0);
}
if ((a < b && c > d) || (b < a && d > c)) {
bool flag = true;
for (int i = max(a, b) - 1; i <= min(c, d) - 2 && i < n - 2; ++i) {
// cout<<i<<" ";
if (s[i] == s[i + 1] && s[i + 1] == s[i + 2] && s[i + 2] == '.')
flag = false;
if (!flag) {
break;
}
}
if (flag)
cout << "No", exit(0);
}
cout << "Yes";
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define endl '\n'
#define pii pair<ll int, ll int>
#define vi vector<ll int>
#define all(a) (a).begin(), (a).end()
#define F first
#define S second
#define sz(x) (ll int)x.size()
#define hell 1000000007
#define rep(i, a, b) for (ll int i = a; i < b; i++)
#define lbnd lower_bound
#define ubnd upper_bound
#define bs binary_search
#define mp make_pair
#define fastio \
iostream::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
ll power(ll x, ll y, ll p) {
ll res = 1;
x = x % p;
while (y > 0) {
if (y & 1)
res = (res * x) % p;
y = y >> 1;
x = (x * x) % p;
}
return res;
}
struct compare {
bool operator()(const std::string &first, const std::string &second) {
return first.size() > second.size();
}
};
ll find(ll x, ll y, ll t) {
ll n = ((t - x) / y) + 1;
n = max((ll)1, n);
return (x + (n - 1) * y);
}
int main() {
fastio;
ll n, a, b, c, d;
cin >> n >> a >> b >> c >> d;
string s;
cin >> s;
for (int i = min(a, b) - 1; i <= max(c, d) - 1 && i < n - 1; ++i) {
if (s[i] == s[i + 1] && s[i + 1] == '#')
cout << "No", exit(0);
}
if ((a < b && c > d) || (b < a && d > c)) {
bool flag = true;
for (int i = max(a, b) - 2; i <= min(c, d) - 2 && i < n - 2; ++i) {
// cout<<i<<" ";
if (s[i] == s[i + 1] && s[i + 1] == s[i + 2] && s[i + 2] == '.')
flag = false;
if (!flag) {
break;
}
}
if (flag)
cout << "No", exit(0);
}
cout << "Yes";
return 0;
} | [
"literal.number.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 831,982 | 831,983 | u672343646 | cpp |
p03017 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define endl '\n'
#define pii pair<ll int, ll int>
#define vi vector<ll int>
#define all(a) (a).begin(), (a).end()
#define F first
#define S second
#define sz(x) (ll int)x.size()
#define hell 1000000007
#define rep(i, a, b) for (ll int i = a; i < b; i++)
#define lbnd lower_bound
#define ubnd upper_bound
#define bs binary_search
#define mp make_pair
#define fastio \
iostream::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
ll power(ll x, ll y, ll p) {
ll res = 1;
x = x % p;
while (y > 0) {
if (y & 1)
res = (res * x) % p;
y = y >> 1;
x = (x * x) % p;
}
return res;
}
struct compare {
bool operator()(const std::string &first, const std::string &second) {
return first.size() > second.size();
}
};
ll find(ll x, ll y, ll t) {
ll n = ((t - x) / y) + 1;
n = max((ll)1, n);
return (x + (n - 1) * y);
}
int main() {
fastio;
ll n, a, b, c, d;
cin >> n >> a >> b >> c >> d;
string s;
cin >> s;
for (int i = min(a, b) - 1; i <= max(c, d) - 1 && i < n - 1; ++i) {
if (s[i] == s[i + 1] && s[i + 1] == '#')
cout << "No", exit(0);
}
if ((a < b && c > d) || (b < a && d > c)) {
bool flag = true;
for (int i = max(a, b) - 1; i <= min(c, d) - 1 && i < n - 2; ++i) {
// cout<<i<<" ";
if (s[i] == s[i + 1] && s[i + 1] == s[i + 2] && s[i + 2] == '.')
flag = false;
if (!flag) {
break;
}
}
if (flag)
cout << "No", exit(0);
}
cout << "Yes";
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define endl '\n'
#define pii pair<ll int, ll int>
#define vi vector<ll int>
#define all(a) (a).begin(), (a).end()
#define F first
#define S second
#define sz(x) (ll int)x.size()
#define hell 1000000007
#define rep(i, a, b) for (ll int i = a; i < b; i++)
#define lbnd lower_bound
#define ubnd upper_bound
#define bs binary_search
#define mp make_pair
#define fastio \
iostream::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
ll power(ll x, ll y, ll p) {
ll res = 1;
x = x % p;
while (y > 0) {
if (y & 1)
res = (res * x) % p;
y = y >> 1;
x = (x * x) % p;
}
return res;
}
struct compare {
bool operator()(const std::string &first, const std::string &second) {
return first.size() > second.size();
}
};
ll find(ll x, ll y, ll t) {
ll n = ((t - x) / y) + 1;
n = max((ll)1, n);
return (x + (n - 1) * y);
}
int main() {
fastio;
ll n, a, b, c, d;
cin >> n >> a >> b >> c >> d;
string s;
cin >> s;
for (int i = min(a, b) - 1; i <= max(c, d) - 1 && i < n - 1; ++i) {
if (s[i] == s[i + 1] && s[i + 1] == '#')
cout << "No", exit(0);
}
if ((a < b && c > d) || (b < a && d > c)) {
bool flag = true;
for (int i = max(a, b) - 2; i <= min(c, d) - 2 && i < n - 2; ++i) {
// cout<<i<<" ";
if (s[i] == s[i + 1] && s[i + 1] == s[i + 2] && s[i + 2] == '.')
flag = false;
if (!flag) {
break;
}
}
if (flag)
cout << "No", exit(0);
}
cout << "Yes";
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"
] | 831,984 | 831,983 | u672343646 | cpp |
p03017 | #include <bits/stdc++.h>
const int INF = 1e9;
const int MOD = 1e9 + 7;
const long long LINF = 1e18;
#define dump(x) cout << 'x' << ' = ' << (x) << ` `;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOREACH(x, a) for (auto &(x) : (a))
typedef long long ll;
using namespace std;
typedef pair<ll, ll> P;
int main(int argc, char const *argv[]) {
int n, a, b, c, d;
cin >> n >> a >> b >> c >> d;
string s;
cin >> s;
--a, --b, --c, --d;
int cnt = 0;
bool ok = true;
if (c < d) {
for (int i = b; i < d; ++i) {
if (s[i] == '#' && s[i + 1] == '#') {
cout << "No" << endl;
return 0;
}
}
s[d] = '#';
for (int i = a; i < c; ++i) {
if (s[i] == '#' && s[i + 1] == '#') {
cout << "No" << endl;
return 0;
}
}
cout << "Yes" << endl;
} else {
bool x = false;
for (int i = b; i <= d - 1; ++i) {
if (s[i - 1] == '.' and s[i] == '.' and s[i + 1] == '.') {
x = true;
break;
}
}
if (!x)
s[b] = '#';
for (int i = a; i < c; ++i) {
if (s[i] == '#' && s[i + 1] == '#') {
cout << "No" << endl;
return 0;
}
}
s[c] = '#';
s[b] = '.';
for (int i = b; i <= d - 1; ++i) {
if (s[i] == '#' && s[i + 1] == '#') {
cout << "No" << endl;
return 0;
}
}
cout << "Yes" << endl;
}
return 0;
}
| #include <bits/stdc++.h>
const int INF = 1e9;
const int MOD = 1e9 + 7;
const long long LINF = 1e18;
#define dump(x) cout << 'x' << ' = ' << (x) << ` `;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOREACH(x, a) for (auto &(x) : (a))
typedef long long ll;
using namespace std;
typedef pair<ll, ll> P;
int main(int argc, char const *argv[]) {
int n, a, b, c, d;
cin >> n >> a >> b >> c >> d;
string s;
cin >> s;
--a, --b, --c, --d;
int cnt = 0;
bool ok = true;
if (c < d) {
for (int i = b; i < d; ++i) {
if (s[i] == '#' && s[i + 1] == '#') {
cout << "No" << endl;
return 0;
}
}
s[d] = '#';
for (int i = a; i < c; ++i) {
if (s[i] == '#' && s[i + 1] == '#') {
cout << "No" << endl;
return 0;
}
}
cout << "Yes" << endl;
} else {
bool x = false;
for (int i = b; i <= d; ++i) {
if (s[i - 1] == '.' and s[i] == '.' and s[i + 1] == '.') {
x = true;
break;
}
}
if (!x)
s[b] = '#';
for (int i = a; i < c; ++i) {
if (s[i] == '#' && s[i + 1] == '#') {
cout << "No" << endl;
return 0;
}
}
s[c] = '#';
s[b] = '.';
for (int i = b; i <= d - 1; ++i) {
if (s[i] == '#' && s[i + 1] == '#') {
cout << "No" << endl;
return 0;
}
}
cout << "Yes" << endl;
}
return 0;
}
| [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 831,991 | 831,992 | u102602414 | cpp |
p03017 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c, d, n;
string s;
cin >> n >> a >> b >> c >> d >> s;
bool can = true;
bool can1 = false;
if (c < d) {
for (int i = a; i < c - 2; i++) {
if (s[i] == '#' && s[i + 1] == '#')
can = false;
}
for (int i = b; i < d - 2; i++) {
if (s[i] == '#' && s[i + 1] == '#')
can = false;
}
} else {
for (int i = b - 2; i < d - 1; i++) {
if (s[i] == '.' && s[i + 1] == '.' && s[i + 2] == '.')
can1 = true;
}
if (can1) {
for (int i = a; i < c - 2; i++) {
if (s[i] == '#' && s[i + 1] == '#')
can = false;
}
} else {
can = false;
}
}
if (can && can1)
cout << "Yes" << endl;
else
cout << "No" << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c, d, n;
string s;
cin >> n >> a >> b >> c >> d >> s;
bool can = true;
bool can1 = false;
if (c < d) {
for (int i = a; i < c - 2; i++) {
if (s[i] == '#' && s[i + 1] == '#')
can = false;
}
for (int i = b; i < d - 2; i++) {
if (s[i] == '#' && s[i + 1] == '#')
can = false;
}
} else {
for (int i = b - 2; i < d - 1; i++) {
if (s[i] == '.' && s[i + 1] == '.' && s[i + 2] == '.')
can1 = true;
}
if (can1) {
for (int i = a; i < c - 2; i++) {
if (s[i] == '#' && s[i + 1] == '#')
can = false;
}
} else {
can = false;
}
}
if (can)
cout << "Yes" << endl;
else
cout << "No" << endl;
return 0;
} | [
"expression.operation.binary.remove"
] | 832,000 | 832,001 | u534417782 | cpp |
p03017 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c, d, n;
string s;
cin >> n >> a >> b >> c >> d >> s;
bool can = true;
bool can1 = false;
if (c < d) {
for (int i = a; i < c - 2; i++) {
if (s[i] == '#' && s[i + 1] == '#')
can = false;
}
for (int i = b; i < d - 2; i++) {
if (s[i] == '#' && s[i + 1] == '#')
can = false;
}
} else {
for (int i = b - 2; i < d; i++) {
if (s[i] == '.' && s[i + 1] == '.' && s[i + 2] == '.')
can1 = true;
}
if (can1) {
for (int i = a; i < c - 2; i++) {
if (s[i] == '#' && s[i + 1] == '#')
can = false;
}
} else {
can = false;
}
}
if (can && can1)
cout << "Yes" << endl;
else
cout << "No" << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c, d, n;
string s;
cin >> n >> a >> b >> c >> d >> s;
bool can = true;
bool can1 = false;
if (c < d) {
for (int i = a; i < c - 2; i++) {
if (s[i] == '#' && s[i + 1] == '#')
can = false;
}
for (int i = b; i < d - 2; i++) {
if (s[i] == '#' && s[i + 1] == '#')
can = false;
}
} else {
for (int i = b - 2; i < d - 1; i++) {
if (s[i] == '.' && s[i + 1] == '.' && s[i + 2] == '.')
can1 = true;
}
if (can1) {
for (int i = a; i < c - 2; i++) {
if (s[i] == '#' && s[i + 1] == '#')
can = false;
}
} else {
can = false;
}
}
if (can)
cout << "Yes" << endl;
else
cout << "No" << endl;
return 0;
} | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one",
"expression.operation.binary.remove"
] | 832,002 | 832,001 | u534417782 | cpp |
p03017 | #include <iomanip>
#include <ios>
#include <iostream>
#include <string>
using namespace std;
int main(void) {
int N, A, B, C, D;
cin >> N >> A >> B >> C >> D;
string s;
cin >> s;
bool reach_b = true;
for (int i = B; i < D - 1; i++) {
if (s[i] == '#' && s[i + 1] == '#')
reach_b = false;
}
bool reach_a = true;
if (C < D) {
for (int i = A; i < C - 1; i++) {
if (s[i] == '#' && s[i + 1] == '#')
reach_a = false;
}
}
else {
reach_a = false;
for (int i = B - 2; i < C - 2; i++) {
if (s[i] == '.' && s[i + 1] == '.' && s[i + 2] == '.')
reach_a = true;
}
for (int i = A; i < C - 1; i++) {
if (s[i] == '#' && s[i + 1] == '#')
reach_a = false;
}
}
if (reach_a && reach_b)
cout << "Yes" << endl;
else
cout << "No" << endl;
return 0;
}
| #include <iomanip>
#include <ios>
#include <iostream>
#include <string>
using namespace std;
int main(void) {
int N, A, B, C, D;
cin >> N >> A >> B >> C >> D;
string s;
cin >> s;
bool reach_b = true;
for (int i = B; i < D - 2; i++) {
if (s[i] == '#' && s[i + 1] == '#')
reach_b = false;
}
bool reach_a = true;
if (C < D) {
for (int i = A; i < C - 2; i++) {
if (s[i] == '#' && s[i + 1] == '#')
reach_a = false;
}
}
else {
reach_a = false;
for (int i = B - 2; i < D - 1; i++) {
if (s[i] == '.' && s[i + 1] == '.' && s[i + 2] == '.')
reach_a = true;
}
for (int i = A; i < C - 2; i++) {
if (s[i] == '#' && s[i + 1] == '#')
reach_a = false;
}
}
if (reach_a && reach_b)
cout << "Yes" << endl;
else
cout << "No" << endl;
return 0;
} | [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"control_flow.branch.if.condition.change",
"identifier.change"
] | 832,003 | 832,004 | u407416173 | cpp |
p03017 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < n; i++)
int main() {
int n, a, b, c, d;
cin >> n >> a >> b >> c >> d;
a--;
b--;
c--;
d--;
string s;
cin >> s;
int judge = 1;
int cnt = 0;
//マスaからmax(c,d)までで岩が二つ並んだらダメ
for (int i = a; i < max(c, d); i++) {
if (s[i] == '#' && s[i + 1] == '#') {
judge = 0;
break;
}
}
if (c < b) {
judge = 1;
for (int i = a; i < c; i++) {
if (s[i] == '#' && s[i + 1] == '#') {
judge = 0;
break;
}
}
for (int i = b; i < d; i++) {
if (s[i] == '#' && s[i + 1] == '#') {
judge = 0;
break;
}
}
}
//空きマスが3つ並んでいれば追い越せる
for (int i = a; i <= min(d - 1, n - 3); i++) {
if (s[i] == '.' && s[i + 1] == '.' && s[i + 2] == '.') {
cnt = 1;
break;
}
}
if (c < d && judge == 1) {
cout << "Yes" << endl;
} else if (d < c && cnt == 1 && judge == 1) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < n; i++)
int main() {
int n, a, b, c, d;
cin >> n >> a >> b >> c >> d;
a--;
b--;
c--;
d--;
string s;
cin >> s;
int judge = 1; //岩が二つ並んだでいないか？
int cnt = 0; // AがBを追い抜くことは可能か？
//マスaからmax(c,d)までで岩が二つ並んだらダメ
for (int i = a; i < max(c, d); i++) {
if (s[i] == '#' && s[i + 1] == '#') {
judge = 0;
break;
}
}
// c < bの場合、再判定
if (c < b) {
judge = 1;
for (int i = a; i < c; i++) {
if (s[i] == '#' && s[i + 1] == '#') {
judge = 0;
break;
}
}
for (int i = b; i < d; i++) {
if (s[i] == '#' && s[i + 1] == '#') {
judge = 0;
break;
}
}
}
//空きマスが3つ並んでいれば追い越せる
for (int i = b - 1; i <= min(d - 1, n - 3); i++) {
if (s[i] == '.' && s[i + 1] == '.' && s[i + 2] == '.') {
cnt = 1;
break;
}
}
if (c < d && judge == 1) { // c < dなら岩が二つ並ばなければ良い
cout << "Yes" << endl;
} else if (d < c && cnt == 1 && judge == 1) { // d < cの時追い抜く必要
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
} | [
"control_flow.loop.for.initializer.change"
] | 832,013 | 832,014 | u083190434 | cpp |
p03017 | #include <bits/stdc++.h>
#define fastio \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
#include <ext/pb_ds/assoc_container.hpp>
#pragma comment(linker, "/stack:200000000")
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
using namespace __gnu_pbds;
#define lli long long int
#define ulli unsigned long long int
#define ff first
#define ss second
#define mp make_pair
#define pb push_back
#define pf pop_front()
#define lb lower_bound
#define ub upper_bound
#define bs binary_search
#define loopl(i, a, b) for (lli i = a; i < b; i++)
#define loop(i, a, b) for (int i = a; i < b; i++)
#define mod 1000000007
#define mo 998244353
#define inf 1000000000000000
#define lld long double
#define pll pair<long long int, long long int>
#define vll vector<lli>
#define eps 0.000001
#define ms 16
#define endl '\n'
using namespace std;
#define N 400005
typedef tree<lli, null_type, less<lli>, rb_tree_tag,
tree_order_statistics_node_update>
indexed_set;
int main() {
///////////////////////////////////////////
fastio;
lli n, a, b, c, d;
cin >> n >> a >> b >> c >> d;
string s;
cin >> s;
lli f1 = 1;
loopl(i, a - 1, c - 1) {
if (s[i] == '#' && s[i + 1] == '#') {
f1 = 0;
break;
}
}
if (!f1) {
cout << "No";
return 0;
}
f1 = 1;
loopl(i, b - 1, d - 1) {
if (s[i] == '#' && s[i + 1] == '#') {
f1 = 0;
break;
}
}
if (!f1) {
cout << "No";
return 0;
}
if (c < b) {
cout << "Yes";
return 0;
}
if (d > c) {
cout << "Yes";
return 0;
}
f1 = 0;
for (lli i = b; i <= d - 1; i++) {
if (s[i] == '#')
continue;
if (s[i - 1] != '#' && s[i + 1] != '#') {
f1 = 1;
// cout<<i<<endl;
break;
}
}
if (f1) {
cout << "Yes";
return 0;
}
cout << "No";
} | #include <bits/stdc++.h>
#define fastio \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
#include <ext/pb_ds/assoc_container.hpp>
#pragma comment(linker, "/stack:200000000")
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
using namespace __gnu_pbds;
#define lli long long int
#define ulli unsigned long long int
#define ff first
#define ss second
#define mp make_pair
#define pb push_back
#define pf pop_front()
#define lb lower_bound
#define ub upper_bound
#define bs binary_search
#define loopl(i, a, b) for (lli i = a; i < b; i++)
#define loop(i, a, b) for (int i = a; i < b; i++)
#define mod 1000000007
#define mo 998244353
#define inf 1000000000000000
#define lld long double
#define pll pair<long long int, long long int>
#define vll vector<lli>
#define eps 0.000001
#define ms 16
#define endl '\n'
using namespace std;
#define N 400005
typedef tree<lli, null_type, less<lli>, rb_tree_tag,
tree_order_statistics_node_update>
indexed_set;
int main() {
///////////////////////////////////////////
fastio;
lli n, a, b, c, d;
cin >> n >> a >> b >> c >> d;
string s;
cin >> s;
lli f1 = 1;
loopl(i, a - 1, c - 1) {
if (s[i] == '#' && s[i + 1] == '#') {
f1 = 0;
break;
}
}
if (!f1) {
cout << "No";
return 0;
}
f1 = 1;
loopl(i, b - 1, d - 1) {
if (s[i] == '#' && s[i + 1] == '#') {
f1 = 0;
break;
}
}
if (!f1) {
cout << "No";
return 0;
}
if (c < b) {
cout << "Yes";
return 0;
}
if (d > c) {
cout << "Yes";
return 0;
}
f1 = 0;
for (lli i = b - 1; i <= d - 1; i++) {
if (s[i] == '#')
continue;
if (s[i - 1] != '#' && s[i + 1] != '#') {
f1 = 1;
// cout<<i<<endl;
break;
}
}
if (f1) {
cout << "Yes";
return 0;
}
cout << "No";
} | [
"control_flow.loop.for.initializer.change"
] | 832,020 | 832,021 | u508862376 | cpp |
p03017 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, A, B, C, D;
cin >> N >> A >> B >> C >> D;
A--, B--, C--, D--;
string S;
cin >> S;
bool ans_check = true;
int double_count = 0;
bool double_check = false;
for (int i = A; i < max(C, D); i++) {
if (S[i] == '#') {
double_count++;
if (double_count == 2) {
double_check = true;
break;
}
continue;
}
double_count = 0;
}
if (double_check)
ans_check = false;
if (C < D) {
if (ans_check) {
cout << "Yes" << endl;
return 0;
} else {
cout << "No" << endl;
return 0;
}
} else {
int triple_count = 0;
bool triple_check = false;
for (int i = B; i <= D + 1; i++) {
if (S[i] == '.') {
triple_count++;
if (triple_count == 3) {
triple_check = true;
break;
}
continue;
}
triple_count = 0;
}
if (!triple_check)
ans_check = false;
if (ans_check) {
cout << "Yes" << endl;
return 0;
} else {
cout << "No" << endl;
return 0;
}
}
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int N, A, B, C, D;
cin >> N >> A >> B >> C >> D;
A--, B--, C--, D--;
string S;
cin >> S;
bool ans_check = true;
int double_count = 0;
bool double_check = false;
for (int i = A; i < max(C, D); i++) {
if (S[i] == '#') {
double_count++;
if (double_count == 2) {
double_check = true;
break;
}
continue;
}
double_count = 0;
}
if (double_check)
ans_check = false;
if (C < D) {
if (ans_check) {
cout << "Yes" << endl;
return 0;
} else {
cout << "No" << endl;
return 0;
}
} else {
int triple_count = 0;
bool triple_check = false;
for (int i = B - 1; i <= D + 1; i++) {
if (S[i] == '.') {
triple_count++;
if (triple_count == 3) {
triple_check = true;
break;
}
continue;
}
triple_count = 0;
}
if (!triple_check)
ans_check = false;
if (ans_check) {
cout << "Yes" << endl;
return 0;
} else {
cout << "No" << endl;
return 0;
}
}
}
| [
"control_flow.loop.for.initializer.change"
] | 832,022 | 832,023 | u689245321 | cpp |
p03017 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define eee(a) (cerr << (#a) << ": " << (a) << endl);
using ll = long long;
using pint = pair<int, int>;
using pll = pair<ll, ll>;
using mint = map<int, int>;
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
const char sp = ' ';
const char cmm = ',';
const int MOD = 1e9 + 7;
const int INF = 1e9;
const ll LINF = 1e18;
ll mod(ll a, ll b) { return (a % b + b) % b; }
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
ll lcm(ll a, ll b) { return a * b / gcd(a, b); }
void Yes() { cout << "Yes" << endl; }
void No() { cout << "No" << endl; }
void Judge(bool b) { b ? Yes() : No(); }
void YES() { cout << "YES" << endl; }
void NO() { cout << "NO" << endl; }
void JUDGE(bool b) { b ? YES() : NO(); }
ll powMod(ll b, ll e, ll m) {
ll r = 1;
while (e > 0) {
if (e & 1)
r = (r % m) * (b % m) % m;
b = (b % m) * (b % m) % m;
e >>= 1;
}
return r;
}
double distance(ll x1, ll y1, ll x2, ll y2) {
return sqrt((x1 - x2) * (x1 - x2) + (y1 - y2) * (y1 - y2));
}
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> void ppp(T n) { cout << n << endl; }
template <typename T1, typename T2>
ostream &operator<<(ostream &s, const pair<T1, T2> &p) {
return s << "(" << p.first << ", " << p.second << ")";
}
template <typename T> ostream &operator<<(ostream &s, const vector<T> &v) {
int len = v.size();
s << '[';
for (int i = 0; i < len; ++i) {
s << v[i];
if (i < len - 1)
s << ", ";
}
s << ']';
return s;
}
struct aaa {
aaa() {
cin.tie(0);
ios::sync_with_stdio(0);
cout << fixed << setprecision(15);
};
} fastio;
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 = b + 1; i < d - 1; ++i) {
if (s[i] == '#' and s[i + 1] == '#') {
No();
return 0;
}
}
for (int i = a + 1; i < c - 1; ++i) {
if (s[i] == '#' and s[i + 1] == '#') {
No();
return 0;
}
}
}
else {
int idx = -1;
for (int i = b - 1; i < d - 1; ++i) {
if (s.substr(i, 3) == "...")
idx = i + 1;
}
if (idx >= 0) {
s[idx] = '#';
for (int i = a + 1; i < c - 1; ++i) {
if (s[i] == '#' and s[i + 1] == '#') {
No();
return 0;
}
}
for (int i = b + 1; i < d - 1; ++i) {
if (s[i] == '#' and s[i + 1] == '#') {
No();
return 0;
}
}
} else {
s[b] = '#';
for (int i = a + 1; i < c - 1; ++i) {
if (s[i] == '#' and s[i + 1] == '#') {
No();
return 0;
}
}
s[b] = '.';
for (int i = b + 1; i < d - 1; ++i) {
if (s[i] == '#' and s[i + 1] == '#') {
No();
return 0;
}
}
}
}
Yes();
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define eee(a) (cerr << (#a) << ": " << (a) << endl);
using ll = long long;
using pint = pair<int, int>;
using pll = pair<ll, ll>;
using mint = map<int, int>;
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
const char sp = ' ';
const char cmm = ',';
const int MOD = 1e9 + 7;
const int INF = 1e9;
const ll LINF = 1e18;
ll mod(ll a, ll b) { return (a % b + b) % b; }
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
ll lcm(ll a, ll b) { return a * b / gcd(a, b); }
void Yes() { cout << "Yes" << endl; }
void No() { cout << "No" << endl; }
void Judge(bool b) { b ? Yes() : No(); }
void YES() { cout << "YES" << endl; }
void NO() { cout << "NO" << endl; }
void JUDGE(bool b) { b ? YES() : NO(); }
ll powMod(ll b, ll e, ll m) {
ll r = 1;
while (e > 0) {
if (e & 1)
r = (r % m) * (b % m) % m;
b = (b % m) * (b % m) % m;
e >>= 1;
}
return r;
}
double distance(ll x1, ll y1, ll x2, ll y2) {
return sqrt((x1 - x2) * (x1 - x2) + (y1 - y2) * (y1 - y2));
}
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> void ppp(T n) { cout << n << endl; }
template <typename T1, typename T2>
ostream &operator<<(ostream &s, const pair<T1, T2> &p) {
return s << "(" << p.first << ", " << p.second << ")";
}
template <typename T> ostream &operator<<(ostream &s, const vector<T> &v) {
int len = v.size();
s << '[';
for (int i = 0; i < len; ++i) {
s << v[i];
if (i < len - 1)
s << ", ";
}
s << ']';
return s;
}
struct aaa {
aaa() {
cin.tie(0);
ios::sync_with_stdio(0);
cout << fixed << setprecision(15);
};
} fastio;
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 = b + 1; i < d - 1; ++i) {
if (s[i] == '#' and s[i + 1] == '#') {
No();
return 0;
}
}
for (int i = a + 1; i < c - 1; ++i) {
if (s[i] == '#' and s[i + 1] == '#') {
No();
return 0;
}
}
}
else {
int idx = -1;
for (int i = b - 1; i < d; ++i) {
if (s.substr(i, 3) == "...")
idx = i + 1;
}
if (idx >= 0) {
s[idx] = '#';
for (int i = a + 1; i < c - 1; ++i) {
if (s[i] == '#' and s[i + 1] == '#') {
No();
return 0;
}
}
for (int i = b + 1; i < d - 1; ++i) {
if (s[i] == '#' and s[i + 1] == '#') {
No();
return 0;
}
}
} else {
s[b] = '#';
for (int i = a + 1; i < c - 1; ++i) {
if (s[i] == '#' and s[i + 1] == '#') {
No();
return 0;
}
}
s[b] = '.';
for (int i = b + 1; i < d - 1; ++i) {
if (s[i] == '#' and s[i + 1] == '#') {
No();
return 0;
}
}
}
}
Yes();
return 0;
}
| [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 832,032 | 832,033 | u306142032 | cpp |
p03017 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define eee(a) (cerr << (#a) << ": " << (a) << endl);
using ll = long long;
using pint = pair<int, int>;
using pll = pair<ll, ll>;
using mint = map<int, int>;
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
const char sp = ' ';
const char cmm = ',';
const int MOD = 1e9 + 7;
const int INF = 1e9;
const ll LINF = 1e18;
ll mod(ll a, ll b) { return (a % b + b) % b; }
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
ll lcm(ll a, ll b) { return a * b / gcd(a, b); }
void Yes() { cout << "Yes" << endl; }
void No() { cout << "No" << endl; }
void Judge(bool b) { b ? Yes() : No(); }
void YES() { cout << "YES" << endl; }
void NO() { cout << "NO" << endl; }
void JUDGE(bool b) { b ? YES() : NO(); }
ll powMod(ll b, ll e, ll m) {
ll r = 1;
while (e > 0) {
if (e & 1)
r = (r % m) * (b % m) % m;
b = (b % m) * (b % m) % m;
e >>= 1;
}
return r;
}
double distance(ll x1, ll y1, ll x2, ll y2) {
return sqrt((x1 - x2) * (x1 - x2) + (y1 - y2) * (y1 - y2));
}
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> void ppp(T n) { cout << n << endl; }
template <typename T1, typename T2>
ostream &operator<<(ostream &s, const pair<T1, T2> &p) {
return s << "(" << p.first << ", " << p.second << ")";
}
template <typename T> ostream &operator<<(ostream &s, const vector<T> &v) {
int len = v.size();
s << '[';
for (int i = 0; i < len; ++i) {
s << v[i];
if (i < len - 1)
s << ", ";
}
s << ']';
return s;
}
struct aaa {
aaa() {
cin.tie(0);
ios::sync_with_stdio(0);
cout << fixed << setprecision(15);
};
} fastio;
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 = b + 1; i < d - 1; ++i) {
if (s[i] == '#' and s[i + 1] == '#') {
No();
return 0;
}
}
for (int i = a + 1; i < c - 1; ++i) {
if (s[i] == '#' and s[i + 1] == '#') {
No();
return 0;
}
}
}
else {
int idx = -1;
for (int i = b - 1; i < d + 1; ++i) {
if (s.substr(i, 3) == "...")
idx = i + 1;
}
if (idx >= 0) {
s[idx] = '#';
for (int i = a + 1; i < c - 1; ++i) {
if (s[i] == '#' and s[i + 1] == '#') {
No();
return 0;
}
}
for (int i = b + 1; i < d - 1; ++i) {
if (s[i] == '#' and s[i + 1] == '#') {
No();
return 0;
}
}
} else {
s[b] = '#';
for (int i = a + 1; i < c - 1; ++i) {
if (s[i] == '#' and s[i + 1] == '#') {
No();
return 0;
}
}
s[b] = '.';
for (int i = b + 1; i < d - 1; ++i) {
if (s[i] == '#' and s[i + 1] == '#') {
No();
return 0;
}
}
}
}
Yes();
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define eee(a) (cerr << (#a) << ": " << (a) << endl);
using ll = long long;
using pint = pair<int, int>;
using pll = pair<ll, ll>;
using mint = map<int, int>;
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
const char sp = ' ';
const char cmm = ',';
const int MOD = 1e9 + 7;
const int INF = 1e9;
const ll LINF = 1e18;
ll mod(ll a, ll b) { return (a % b + b) % b; }
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
ll lcm(ll a, ll b) { return a * b / gcd(a, b); }
void Yes() { cout << "Yes" << endl; }
void No() { cout << "No" << endl; }
void Judge(bool b) { b ? Yes() : No(); }
void YES() { cout << "YES" << endl; }
void NO() { cout << "NO" << endl; }
void JUDGE(bool b) { b ? YES() : NO(); }
ll powMod(ll b, ll e, ll m) {
ll r = 1;
while (e > 0) {
if (e & 1)
r = (r % m) * (b % m) % m;
b = (b % m) * (b % m) % m;
e >>= 1;
}
return r;
}
double distance(ll x1, ll y1, ll x2, ll y2) {
return sqrt((x1 - x2) * (x1 - x2) + (y1 - y2) * (y1 - y2));
}
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> void ppp(T n) { cout << n << endl; }
template <typename T1, typename T2>
ostream &operator<<(ostream &s, const pair<T1, T2> &p) {
return s << "(" << p.first << ", " << p.second << ")";
}
template <typename T> ostream &operator<<(ostream &s, const vector<T> &v) {
int len = v.size();
s << '[';
for (int i = 0; i < len; ++i) {
s << v[i];
if (i < len - 1)
s << ", ";
}
s << ']';
return s;
}
struct aaa {
aaa() {
cin.tie(0);
ios::sync_with_stdio(0);
cout << fixed << setprecision(15);
};
} fastio;
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 = b + 1; i < d - 1; ++i) {
if (s[i] == '#' and s[i + 1] == '#') {
No();
return 0;
}
}
for (int i = a + 1; i < c - 1; ++i) {
if (s[i] == '#' and s[i + 1] == '#') {
No();
return 0;
}
}
}
else {
int idx = -1;
for (int i = b - 1; i < d; ++i) {
if (s.substr(i, 3) == "...")
idx = i + 1;
}
if (idx >= 0) {
s[idx] = '#';
for (int i = a + 1; i < c - 1; ++i) {
if (s[i] == '#' and s[i + 1] == '#') {
No();
return 0;
}
}
for (int i = b + 1; i < d - 1; ++i) {
if (s[i] == '#' and s[i + 1] == '#') {
No();
return 0;
}
}
} else {
s[b] = '#';
for (int i = a + 1; i < c - 1; ++i) {
if (s[i] == '#' and s[i + 1] == '#') {
No();
return 0;
}
}
s[b] = '.';
for (int i = b + 1; i < d - 1; ++i) {
if (s[i] == '#' and s[i + 1] == '#') {
No();
return 0;
}
}
}
}
Yes();
return 0;
}
| [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 832,034 | 832,033 | u306142032 | cpp |
p03017 | #include <bits/stdc++.h>
using namespace std;
string S;
int main() {
cin >> S;
int A, B, C, D;
int ans = 0;
cin >> A >> B >> C >> D;
cin >> S;
A -= 1;
B -= 1;
C -= 1;
D -= 1;
if (C > D) {
auto two_rock = S.find("##", B);
if (two_rock < D) {
cout << "No" << endl;
return 0;
} else {
string S_ = S;
auto three_space = S.find("...", B);
auto two_rock = S.find("##", A);
if (three_space >= D) {
cout << "No" << endl;
return 0;
} else if (two_rock < C) {
cout << "No" << endl;
return 0;
}
}
} else {
auto two_rock = S.find("##", B);
if (two_rock < D) {
cout << "No" << endl;
return 0;
} else {
auto two_rock = S.find("##", A);
if (two_rock < C) {
cout << "No" << endl;
return 0;
}
}
}
cout << "Yes" << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
string S;
int main() {
cin >> S;
int A, B, C, D;
int ans = 0;
cin >> A >> B >> C >> D;
cin >> S;
A -= 1;
B -= 1;
C -= 1;
D -= 1;
if (C > D) {
auto two_rock = S.find("##", B);
if (two_rock < D) {
cout << "No" << endl;
return 0;
} else {
string S_ = S;
auto three_space = S.find("...", B - 1);
auto two_rock = S.find("##", A);
if (three_space >= D) {
cout << "No" << endl;
return 0;
} else if (two_rock < C) {
cout << "No" << endl;
return 0;
}
}
} else {
auto two_rock = S.find("##", B);
if (two_rock < D) {
cout << "No" << endl;
return 0;
} else {
auto two_rock = S.find("##", A);
if (two_rock < C) {
cout << "No" << endl;
return 0;
}
}
}
cout << "Yes" << endl;
return 0;
}
| [
"assignment.change"
] | 832,039 | 832,040 | u428520665 | cpp |
p03017 | #include <bits/stdc++.h>
typedef long long LL;
using namespace std;
int main() {
LL n, a, b, c, d;
cin >> n >> a >> b >> c >> d;
a--, b--, c--, d--;
string s;
cin >> s;
bool sunuke = true, funuke = true;
if (c < d) {
for (int i = b + 1; i <= d; i++) {
if (s[i] == '#' && s[i - 1] == '#') {
funuke = false;
break;
}
}
for (int i = a + 1; i <= c; i++) {
if (s[i] == '#' && s[i - 1] == '#') {
sunuke = false;
break;
}
}
} else {
for (int i = b + 1; i <= d; i++) {
if (s[i] == '#' && s[i - 1] == '#') {
funuke = false;
break;
}
}
bool check = false;
for (int i = a + 1; i <= c; i++) {
if (s[i] == '.' && s[i - 1] == '.' && s[i - 2] == '.' && i - 1 >= b &&
i <= d)
check = true;
if (s[i] == '#' && s[i - 1] == '#') {
sunuke = false;
break;
}
}
if (!check)
sunuke = false;
}
string ans;
if (sunuke && funuke)
ans = "Yes";
else
ans = "No";
cout << ans << endl;
} | #include <bits/stdc++.h>
typedef long long LL;
using namespace std;
int main() {
LL n, a, b, c, d;
cin >> n >> a >> b >> c >> d;
a--, b--, c--, d--;
string s;
cin >> s;
bool sunuke = true, funuke = true;
if (c < d) {
for (int i = b + 1; i <= d; i++) {
if (s[i] == '#' && s[i - 1] == '#') {
funuke = false;
break;
}
}
for (int i = a + 1; i <= c; i++) {
if (s[i] == '#' && s[i - 1] == '#') {
sunuke = false;
break;
}
}
} else {
for (int i = b + 1; i <= d; i++) {
if (s[i] == '#' && s[i - 1] == '#') {
funuke = false;
break;
}
}
bool check = false;
for (int i = a + 1; i <= c; i++) {
if (s[i] == '.' && s[i - 1] == '.' && s[i - 2] == '.' && i - 1 >= b &&
i <= d + 1)
check = true;
if (s[i] == '#' && s[i - 1] == '#') {
sunuke = false;
break;
}
}
if (!check)
sunuke = false;
}
string ans;
if (sunuke && funuke)
ans = "Yes";
else
ans = "No";
cout << ans << endl;
} | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 832,045 | 832,046 | u392423112 | cpp |
p03017 | #include <algorithm>
#include <array>
#include <bitset>
#include <cmath>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
typedef long long int ll;
typedef vector<int> VI;
typedef vector<ll> VL;
typedef vector<VI> VVI;
typedef vector<VL> VVL;
typedef pair<int, int> P;
typedef pair<ll, ll> PL;
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define REP(i, n) for (int i = 0; i < (n); i++)
#define fst first
#define snd second
#define pb push_back
#define ALL(obj) (obj).begin(), (obj).end()
#define debug(x) cout << #x << ": " << x << endl
//#define int long long int
const int MOD = 1000000007;
const int INF = 1001001000;
const double EPS = 0.000000001;
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
bool pairCompare(const P &pair1, const P &pair2) {
return pair1.second > pair2.second;
}
signed main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n, a, b, c, d;
string s;
cin >> n >> a >> b >> c >> d;
cin >> s;
bool ans = true;
if (c < d) {
bool flag = false;
for (int i = a; i < c; i++) {
if (s[i] == '#') {
if (flag) {
ans = false;
break;
} else
flag = true;
} else
flag = false;
}
flag = false;
for (int i = b; i < d; i++) {
if (s[i] == '#') {
if (flag) {
ans = false;
break;
} else
flag = true;
} else
flag = false;
}
} else if (c > d) {
bool flag = false;
int flag2 = 0;
bool ansflag = false;
for (int i = b - 1; i < d + 1; i++) {
if (s[i] == '#') {
flag2 = 0;
if (flag) {
ans = false;
break;
} else
flag = true;
} else if (s[i] == '.') {
flag = false;
if (flag2 >= 2) {
ansflag = true;
} else
flag2++;
}
}
if ((a + 1 == b) && d == b) {
s[b - 1] = '#';
ansflag = false;
}
if (s[b - 2] == '.' && s[b] == '.')
ansflag = false;
if (!ansflag)
ans = false;
flag = false;
for (int i = a; i < c; i++) {
if (s[i] == '#') {
if (flag) {
ans = false;
break;
} else
flag = true;
} else
flag = false;
}
} else
ans = false;
if (ans)
cout << "Yes" << endl;
else
cout << "No" << endl;
return 0;
}
| #include <algorithm>
#include <array>
#include <bitset>
#include <cmath>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
typedef long long int ll;
typedef vector<int> VI;
typedef vector<ll> VL;
typedef vector<VI> VVI;
typedef vector<VL> VVL;
typedef pair<int, int> P;
typedef pair<ll, ll> PL;
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define REP(i, n) for (int i = 0; i < (n); i++)
#define fst first
#define snd second
#define pb push_back
#define ALL(obj) (obj).begin(), (obj).end()
#define debug(x) cout << #x << ": " << x << endl
//#define int long long int
const int MOD = 1000000007;
const int INF = 1001001000;
const double EPS = 0.000000001;
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
bool pairCompare(const P &pair1, const P &pair2) {
return pair1.second > pair2.second;
}
signed main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n, a, b, c, d;
string s;
cin >> n >> a >> b >> c >> d;
cin >> s;
bool ans = true;
if (c < d) {
bool flag = false;
for (int i = a; i < c; i++) {
if (s[i] == '#') {
if (flag) {
ans = false;
break;
} else
flag = true;
} else
flag = false;
}
flag = false;
for (int i = b; i < d; i++) {
if (s[i] == '#') {
if (flag) {
ans = false;
break;
} else
flag = true;
} else
flag = false;
}
} else if (c > d) {
bool flag = false;
int flag2 = 0;
bool ansflag = false;
for (int i = b - 1; i < d + 1; i++) {
if (s[i] == '#') {
flag2 = 0;
if (flag) {
ans = false;
break;
} else
flag = true;
} else if (s[i] == '.') {
flag = false;
if (flag2 >= 2) {
ansflag = true;
} else
flag2++;
}
}
if ((a + 1 == b) && d == b) {
s[b - 1] = '#';
ansflag = true;
}
if (s[b - 2] == '.' && s[b] == '.')
ansflag = true;
if (!ansflag)
ans = false;
flag = false;
for (int i = a; i < c; i++) {
if (s[i] == '#') {
if (flag) {
ans = false;
break;
} else
flag = true;
} else
flag = false;
}
} else
ans = false;
if (ans)
cout << "Yes" << endl;
else
cout << "No" << endl;
return 0;
}
| [
"misc.opposites",
"assignment.value.change"
] | 832,047 | 832,048 | u019780057 | cpp |
p03017 | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
char s[200005];
bool checkRock(int start, int end) {
while (start + 1 < end) {
if (s[start] == '#' && s[start + 1] == '#') {
return false;
}
++start;
}
return true;
}
bool checkEmpty(int start, int end) {
while (start + 2 <= end) {
if (s[start] == '.' && s[start + 1] == '.' && s[start + 2] == '.') {
return true;
}
++start;
}
return false;
}
int main() {
int N, A, B, C, D;
scanf("%d %d %d %d %d", &N, &A, &B, &C, &D);
--A;
--B;
--C;
--D;
scanf("%s", s);
bool result = false;
if (checkRock(A, C) && checkRock(B, D)) {
result = true;
}
if (result) {
if (C > D) {
result = false;
if (checkEmpty(A, D + 1)) {
result = true;
}
}
}
printf("%s\n", result ? "Yes" : "No");
return 0;
}
| #include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
char s[200005];
bool checkRock(int start, int end) {
while (start + 1 < end) {
if (s[start] == '#' && s[start + 1] == '#') {
return false;
}
++start;
}
return true;
}
bool checkEmpty(int start, int end) {
while (start + 2 <= end) {
if (s[start] == '.' && s[start + 1] == '.' && s[start + 2] == '.') {
return true;
}
++start;
}
return false;
}
int main() {
int N, A, B, C, D;
scanf("%d %d %d %d %d", &N, &A, &B, &C, &D);
--A;
--B;
--C;
--D;
scanf("%s", s);
bool result = false;
if (checkRock(A, C) && checkRock(B, D)) {
result = true;
}
if (result) {
if (C > D) {
result = false;
if (checkEmpty(B - 1, D + 1)) {
result = true;
}
}
}
printf("%s\n", result ? "Yes" : "No");
return 0;
}
| [
"control_flow.branch.if.condition.change"
] | 832,051 | 832,052 | u591075912 | cpp |
p03017 | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
char s[200005];
bool checkRock(int start, int end) {
while (start + 1 < end) {
if (s[start] == '#' && s[start + 1] == '#') {
return false;
}
++start;
}
return true;
}
bool checkEmpty(int start, int end) {
while (start + 2 <= end) {
if (s[start] == '.' && s[start + 1] == '.' && s[start + 2] == '.') {
return true;
}
++start;
}
return false;
}
int main() {
int N, A, B, C, D;
scanf("%d %d %d %d %d", &N, &A, &B, &C, &D);
--A;
--B;
--C;
--D;
scanf("%s", s);
bool result = false;
if (checkRock(A, C) && checkRock(B, D)) {
result = true;
}
if (result) {
if (C > D) {
result = false;
if (checkEmpty(A, C)) {
result = true;
}
}
}
printf("%s\n", result ? "Yes" : "No");
return 0;
}
| #include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
char s[200005];
bool checkRock(int start, int end) {
while (start + 1 < end) {
if (s[start] == '#' && s[start + 1] == '#') {
return false;
}
++start;
}
return true;
}
bool checkEmpty(int start, int end) {
while (start + 2 <= end) {
if (s[start] == '.' && s[start + 1] == '.' && s[start + 2] == '.') {
return true;
}
++start;
}
return false;
}
int main() {
int N, A, B, C, D;
scanf("%d %d %d %d %d", &N, &A, &B, &C, &D);
--A;
--B;
--C;
--D;
scanf("%s", s);
bool result = false;
if (checkRock(A, C) && checkRock(B, D)) {
result = true;
}
if (result) {
if (C > D) {
result = false;
if (checkEmpty(B - 1, D + 1)) {
result = true;
}
}
}
printf("%s\n", result ? "Yes" : "No");
return 0;
}
| [
"control_flow.branch.if.condition.change"
] | 832,053 | 832,052 | u591075912 | cpp |
p03017 | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define INF 999999999
#define ll long long
using namespace std;
typedef pair<int, int> P;
typedef pair<ll, ll> LP;
typedef pair<int, P> PP;
typedef pair<ll, LP> LPP;
int main() {
int n, a, b, c, d;
cin >> n >> a >> b >> c >> d;
a--;
b--;
c--;
d--;
string s;
cin >> s;
int o_n;
int x_n;
if (c == d) {
cout << "No" << endl;
return 0;
}
x_n = 0;
REP(i, n) {
if ((a <= i) && (i <= c)) {
if (s[i] == '.')
x_n = 0;
else
x_n++;
if (x_n >= 2) {
cout << "No" << endl;
return 0;
}
}
}
x_n = 0;
REP(i, n) {
if ((b <= i) && (i <= d)) {
if (s[i] == '.')
x_n = 0;
else
x_n++;
if (x_n >= 2) {
cout << "No" << endl;
return 0;
}
}
}
if (c < d) {
cout << "Yes" << endl;
return 0;
}
if (c > d) {
REP(i, n) {
if ((b - 1 <= i) && (i <= d + 1)) {
if (s[i] == '.')
o_n++;
else
o_n = 0;
if (o_n >= 3) {
cout << "Yes" << endl;
return 0;
}
}
}
}
cout << "No" << endl;
return 0;
} | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define INF 999999999
#define ll long long
using namespace std;
typedef pair<int, int> P;
typedef pair<ll, ll> LP;
typedef pair<int, P> PP;
typedef pair<ll, LP> LPP;
int main() {
int n, a, b, c, d;
cin >> n >> a >> b >> c >> d;
a--;
b--;
c--;
d--;
string s;
cin >> s;
int o_n;
int x_n;
if (c == d) {
cout << "No" << endl;
return 0;
}
x_n = 0;
REP(i, n) {
if ((a <= i) && (i <= c)) {
if (s[i] == '.')
x_n = 0;
else
x_n++;
if (x_n >= 2) {
cout << "No" << endl;
return 0;
}
}
}
x_n = 0;
REP(i, n) {
if ((b <= i) && (i <= d)) {
if (s[i] == '.')
x_n = 0;
else
x_n++;
if (x_n >= 2) {
cout << "No" << endl;
return 0;
}
}
}
if (c < d) {
cout << "Yes" << endl;
return 0;
}
o_n = 0;
if (c > d) {
REP(i, n) {
if ((b - 1 <= i) && (i <= d + 1)) {
if (s[i] == '.')
o_n++;
else
o_n = 0;
if (o_n >= 3) {
cout << "Yes" << endl;
return 0;
}
}
}
}
cout << "No" << endl;
return 0;
} | [
"assignment.add"
] | 832,056 | 832,057 | u477561431 | cpp |
p03017 | #include <bits/stdc++.h>
#define REP(i, e) for (int(i) = 0; (i) < (e); ++(i))
#define FOR(i, b, e) for (int(i) = (b); (i) < (e); ++(i))
#define ALL(c) (c).begin(), (c).end()
#define SIZE(x) ((int)(x).size())
#define MIN(c) (*min_element(ALL(c)))
#define MAX(c) (*max_element(ALL(c)))
#define ACC(c) (accumulate(ALL(c), 0))
#define SLL(x, n) ((x) << (n))
#define SRL(x, n) ((x) >> (n))
#define MIN2(a, b) ((a) < (b)) ? (a) : (b)
#define MAX2(a, b) ((a) > (b)) ? (a) : (b)
#define MP(a, b) (make_pair((a), (b)))
#define ENDL "\n"
#define PRINT(x) cout << (x) << ENDL
using namespace std;
using ll = long long;
using pint = pair<int, int>;
inline int in(int &a) { return scanf("%d", &a); }
inline void out(int n) { printf("%d\n", n); }
auto pint_compare = [](pint x, pint y) -> bool { return (x.first < y.first); };
int N, A, B, C, D;
string S;
bool reachable() {
int l = 0, r = N - 1;
int E = MAX2(C, D);
for (int i = A; i <= E - 1; i++) {
if (S[i] == '#' && S[i + 1] == '#')
return false;
}
if (C < D)
return true;
for (int i = B; i <= D - 1; i++) {
if (S[i] == '.' && S[i + 1] == '.' && S[i + 2] == '.')
return true;
}
return false;
}
signed main() {
cin >> N >> A >> B >> C >> D;
cin >> S;
A--;
B--;
C--;
D--;
if (reachable())
PRINT("Yes");
else
PRINT("No");
return 0;
} | #include <bits/stdc++.h>
#define REP(i, e) for (int(i) = 0; (i) < (e); ++(i))
#define FOR(i, b, e) for (int(i) = (b); (i) < (e); ++(i))
#define ALL(c) (c).begin(), (c).end()
#define SIZE(x) ((int)(x).size())
#define MIN(c) (*min_element(ALL(c)))
#define MAX(c) (*max_element(ALL(c)))
#define ACC(c) (accumulate(ALL(c), 0))
#define SLL(x, n) ((x) << (n))
#define SRL(x, n) ((x) >> (n))
#define MIN2(a, b) ((a) < (b)) ? (a) : (b)
#define MAX2(a, b) ((a) > (b)) ? (a) : (b)
#define MP(a, b) (make_pair((a), (b)))
#define ENDL "\n"
#define PRINT(x) cout << (x) << ENDL
using namespace std;
using ll = long long;
using pint = pair<int, int>;
inline int in(int &a) { return scanf("%d", &a); }
inline void out(int n) { printf("%d\n", n); }
auto pint_compare = [](pint x, pint y) -> bool { return (x.first < y.first); };
int N, A, B, C, D;
string S;
bool reachable() {
int l = 0, r = N - 1;
int E = MAX2(C, D);
for (int i = A; i <= E - 1; i++) {
if (S[i] == '#' && S[i + 1] == '#')
return false;
}
if (C < D)
return true;
for (int i = B - 1; i <= D - 1; i++) {
if (S[i] == '.' && S[i + 1] == '.' && S[i + 2] == '.')
return true;
}
return false;
}
signed main() {
cin >> N >> A >> B >> C >> D;
cin >> S;
A--;
B--;
C--;
D--;
if (reachable())
PRINT("Yes");
else
PRINT("No");
return 0;
} | [
"control_flow.loop.for.initializer.change"
] | 832,071 | 832,072 | u569690172 | cpp |
p03017 | #include <bits/stdc++.h>
#define REP(i, e) for (int(i) = 0; (i) < (e); ++(i))
#define FOR(i, b, e) for (int(i) = (b); (i) < (e); ++(i))
#define ALL(c) (c).begin(), (c).end()
#define SIZE(x) ((int)(x).size())
#define MIN(c) (*min_element(ALL(c)))
#define MAX(c) (*max_element(ALL(c)))
#define ACC(c) (accumulate(ALL(c), 0))
#define SLL(x, n) ((x) << (n))
#define SRL(x, n) ((x) >> (n))
#define MIN2(a, b) ((a) < (b)) ? (a) : (b)
#define MAX2(a, b) ((a) > (b)) ? (a) : (b)
#define MP(a, b) (make_pair((a), (b)))
#define ENDL "\n"
#define PRINT(x) cout << (x) << ENDL
using namespace std;
using ll = long long;
using pint = pair<int, int>;
inline int in(int &a) { return scanf("%d", &a); }
inline void out(int n) { printf("%d\n", n); }
auto pint_compare = [](pint x, pint y) -> bool { return (x.first < y.first); };
int N, A, B, C, D;
string S;
bool reachable() {
int l = 0, r = N - 1;
int E = MAX2(C, D);
for (int i = A; i <= E - 1; i++) {
if (S[i] == '#' && S[i + 1] == '#')
return false;
}
if (C < D)
return true;
for (int i = l; i <= D - 1; i++) {
if (S[i] == '.' && S[i + 1] == '.' && S[i + 2] == '.')
return true;
}
return false;
}
signed main() {
cin >> N >> A >> B >> C >> D;
cin >> S;
A--;
B--;
C--;
D--;
if (reachable())
PRINT("Yes");
else
PRINT("No");
return 0;
} | #include <bits/stdc++.h>
#define REP(i, e) for (int(i) = 0; (i) < (e); ++(i))
#define FOR(i, b, e) for (int(i) = (b); (i) < (e); ++(i))
#define ALL(c) (c).begin(), (c).end()
#define SIZE(x) ((int)(x).size())
#define MIN(c) (*min_element(ALL(c)))
#define MAX(c) (*max_element(ALL(c)))
#define ACC(c) (accumulate(ALL(c), 0))
#define SLL(x, n) ((x) << (n))
#define SRL(x, n) ((x) >> (n))
#define MIN2(a, b) ((a) < (b)) ? (a) : (b)
#define MAX2(a, b) ((a) > (b)) ? (a) : (b)
#define MP(a, b) (make_pair((a), (b)))
#define ENDL "\n"
#define PRINT(x) cout << (x) << ENDL
using namespace std;
using ll = long long;
using pint = pair<int, int>;
inline int in(int &a) { return scanf("%d", &a); }
inline void out(int n) { printf("%d\n", n); }
auto pint_compare = [](pint x, pint y) -> bool { return (x.first < y.first); };
int N, A, B, C, D;
string S;
bool reachable() {
int l = 0, r = N - 1;
int E = MAX2(C, D);
for (int i = A; i <= E - 1; i++) {
if (S[i] == '#' && S[i + 1] == '#')
return false;
}
if (C < D)
return true;
for (int i = B - 1; i <= D - 1; i++) {
if (S[i] == '.' && S[i + 1] == '.' && S[i + 2] == '.')
return true;
}
return false;
}
signed main() {
cin >> N >> A >> B >> C >> D;
cin >> S;
A--;
B--;
C--;
D--;
if (reachable())
PRINT("Yes");
else
PRINT("No");
return 0;
} | [
"control_flow.loop.for.initializer.change"
] | 832,073 | 832,072 | u569690172 | cpp |
p03017 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <vector>
int main() {
int N, A, B, C, D;
std::string S;
std::cin >> N >> A >> B >> C >> D;
std::cin >> S;
// for(int i=B; i<D; ++i){
int maxstone = 0;
for (int i = B; i < D; ++i) {
if (S[i] == '#') {
maxstone++;
} else {
maxstone = 0;
}
if (maxstone >= 2) {
std::cout << "No" << std::endl;
return 0;
}
}
maxstone = 0;
for (int i = A; i < C; ++i) {
if (S[i] == '#') {
maxstone++;
} else {
maxstone = 0;
}
if (maxstone >= 2) {
std::cout << "No" << std::endl;
return 0;
}
}
int maxdot = 0, tmpdot = 0;
if (C > D) {
for (int i = B - 2; i <= C; ++i) {
if (S[i] == '.') {
tmpdot++;
} else {
tmpdot = 0;
}
if (maxdot < tmpdot)
maxdot = tmpdot;
}
if (maxdot <= 2) {
std::cout << "No" << std::endl;
return 0;
}
}
std::cout << "Yes" << std::endl;
return 0;
} | #include <algorithm>
#include <cmath>
#include <iostream>
#include <vector>
int main() {
int N, A, B, C, D;
std::string S;
std::cin >> N >> A >> B >> C >> D;
std::cin >> S;
// for(int i=B; i<D; ++i){
int maxstone = 0;
for (int i = B; i < D; ++i) {
if (S[i] == '#') {
maxstone++;
} else {
maxstone = 0;
}
if (maxstone >= 2) {
std::cout << "No" << std::endl;
return 0;
}
}
maxstone = 0;
for (int i = A; i < C; ++i) {
if (S[i] == '#') {
maxstone++;
} else {
maxstone = 0;
}
if (maxstone >= 2) {
std::cout << "No" << std::endl;
return 0;
}
}
int maxdot = 0, tmpdot = 0;
if (C > D) {
for (int i = B - 2; i < D + 1; ++i) {
if (S[i] == '.') {
tmpdot++;
} else {
tmpdot = 0;
}
if (maxdot < tmpdot)
maxdot = tmpdot;
}
if (maxdot <= 2) {
std::cout << "No" << std::endl;
return 0;
}
}
std::cout << "Yes" << std::endl;
return 0;
} | [
"control_flow.loop.for.condition.change",
"control_flow.branch.if.condition.change",
"misc.off_by_one"
] | 832,076 | 832,077 | u936600428 | cpp |
p03017 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <vector>
int main() {
int N, A, B, C, D;
std::string S;
std::cin >> N >> A >> B >> C >> D;
std::cin >> S;
// for(int i=B; i<D; ++i){
int maxstone = 0;
for (int i = B; i < D; ++i) {
if (S[i] == '#') {
maxstone++;
} else {
maxstone = 0;
}
if (maxstone >= 2) {
std::cout << "No" << std::endl;
return 0;
}
}
maxstone = 0;
for (int i = A; i < C; ++i) {
if (S[i] == '#') {
maxstone++;
} else {
maxstone = 0;
}
if (maxstone >= 2) {
std::cout << "No" << std::endl;
return 0;
}
}
int maxdot = 0, tmpdot = 0;
if (C > D) {
for (int i = B - 2; i < C; ++i) {
if (S[i] == '.') {
tmpdot++;
} else {
tmpdot = 0;
}
if (maxdot < tmpdot)
maxdot = tmpdot;
}
if (maxdot <= 2) {
std::cout << "No" << std::endl;
return 0;
}
}
std::cout << "Yes" << std::endl;
return 0;
} | #include <algorithm>
#include <cmath>
#include <iostream>
#include <vector>
int main() {
int N, A, B, C, D;
std::string S;
std::cin >> N >> A >> B >> C >> D;
std::cin >> S;
// for(int i=B; i<D; ++i){
int maxstone = 0;
for (int i = B; i < D; ++i) {
if (S[i] == '#') {
maxstone++;
} else {
maxstone = 0;
}
if (maxstone >= 2) {
std::cout << "No" << std::endl;
return 0;
}
}
maxstone = 0;
for (int i = A; i < C; ++i) {
if (S[i] == '#') {
maxstone++;
} else {
maxstone = 0;
}
if (maxstone >= 2) {
std::cout << "No" << std::endl;
return 0;
}
}
int maxdot = 0, tmpdot = 0;
if (C > D) {
for (int i = B - 2; i < D + 1; ++i) {
if (S[i] == '.') {
tmpdot++;
} else {
tmpdot = 0;
}
if (maxdot < tmpdot)
maxdot = tmpdot;
}
if (maxdot <= 2) {
std::cout << "No" << std::endl;
return 0;
}
}
std::cout << "Yes" << std::endl;
return 0;
} | [
"identifier.change",
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 832,078 | 832,077 | u936600428 | cpp |
p03017 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <vector>
int main() {
int N, A, B, C, D;
std::string S;
std::cin >> N >> A >> B >> C >> D;
std::cin >> S;
// for(int i=B; i<D; ++i){
int maxstone = 0;
for (int i = B; i < D; ++i) {
if (S[i] == '#') {
maxstone++;
} else {
maxstone = 0;
}
if (maxstone >= 2) {
std::cout << "No" << std::endl;
return 0;
}
}
maxstone = 0;
for (int i = A; i < C; ++i) {
if (S[i] == '#') {
maxstone++;
} else {
maxstone = 0;
}
if (maxstone >= 2) {
std::cout << "No" << std::endl;
return 0;
}
}
int maxdot = 0, tmpdot = 0;
if (C > D) {
for (int i = B - 1; i < C; ++i) {
if (S[i] == '.') {
tmpdot++;
} else {
tmpdot = 0;
}
if (maxdot < tmpdot)
maxdot = tmpdot;
}
if (maxdot <= 2) {
std::cout << "No" << std::endl;
return 0;
}
}
std::cout << "Yes" << std::endl;
return 0;
} | #include <algorithm>
#include <cmath>
#include <iostream>
#include <vector>
int main() {
int N, A, B, C, D;
std::string S;
std::cin >> N >> A >> B >> C >> D;
std::cin >> S;
// for(int i=B; i<D; ++i){
int maxstone = 0;
for (int i = B; i < D; ++i) {
if (S[i] == '#') {
maxstone++;
} else {
maxstone = 0;
}
if (maxstone >= 2) {
std::cout << "No" << std::endl;
return 0;
}
}
maxstone = 0;
for (int i = A; i < C; ++i) {
if (S[i] == '#') {
maxstone++;
} else {
maxstone = 0;
}
if (maxstone >= 2) {
std::cout << "No" << std::endl;
return 0;
}
}
int maxdot = 0, tmpdot = 0;
if (C > D) {
for (int i = B - 2; i < D + 1; ++i) {
if (S[i] == '.') {
tmpdot++;
} else {
tmpdot = 0;
}
if (maxdot < tmpdot)
maxdot = tmpdot;
}
if (maxdot <= 2) {
std::cout << "No" << std::endl;
return 0;
}
}
std::cout << "Yes" << std::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",
"misc.off_by_one"
] | 832,079 | 832,077 | u936600428 | cpp |
p03017 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <vector>
int main() {
int N, A, B, C, D;
std::string S;
std::cin >> N >> A >> B >> C >> D;
std::cin >> S;
// for(int i=B; i<D; ++i){
int maxstone = 0;
for (int i = B; i < D; ++i) {
if (S[i] == '#') {
maxstone++;
} else {
maxstone = 0;
}
if (maxstone >= 2) {
std::cout << "No" << std::endl;
return 0;
}
}
maxstone = 0;
for (int i = A; i < C; ++i) {
if (S[i] == '#') {
maxstone++;
} else {
maxstone = 0;
}
if (maxstone >= 2) {
std::cout << "No" << std::endl;
return 0;
}
}
int maxdot = 0, tmpdot = 0;
if (C > D) {
for (int i = A; i < C; ++i) {
if (S[i] == '.') {
tmpdot++;
} else {
tmpdot = 0;
}
if (maxdot < tmpdot)
maxdot = tmpdot;
}
if (maxdot <= 2) {
std::cout << "No" << std::endl;
return 0;
}
}
std::cout << "Yes" << std::endl;
return 0;
} | #include <algorithm>
#include <cmath>
#include <iostream>
#include <vector>
int main() {
int N, A, B, C, D;
std::string S;
std::cin >> N >> A >> B >> C >> D;
std::cin >> S;
// for(int i=B; i<D; ++i){
int maxstone = 0;
for (int i = B; i < D; ++i) {
if (S[i] == '#') {
maxstone++;
} else {
maxstone = 0;
}
if (maxstone >= 2) {
std::cout << "No" << std::endl;
return 0;
}
}
maxstone = 0;
for (int i = A; i < C; ++i) {
if (S[i] == '#') {
maxstone++;
} else {
maxstone = 0;
}
if (maxstone >= 2) {
std::cout << "No" << std::endl;
return 0;
}
}
int maxdot = 0, tmpdot = 0;
if (C > D) {
for (int i = B - 2; i < D + 1; ++i) {
if (S[i] == '.') {
tmpdot++;
} else {
tmpdot = 0;
}
if (maxdot < tmpdot)
maxdot = tmpdot;
}
if (maxdot <= 2) {
std::cout << "No" << std::endl;
return 0;
}
}
std::cout << "Yes" << std::endl;
return 0;
} | [
"control_flow.loop.for.initializer.change",
"identifier.change",
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 832,080 | 832,077 | u936600428 | cpp |
p03017 | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <utility>
#include <vector>
#define INF 1e9 + 7
#define rep(i, n) for (int i = 0; i < n; i++)
#define NO cout << "NO" << endl;
#define YES cout << "YES" << endl;
#define No cout << "No" << endl;
#define Yes cout << "Yes" << endl;
#define all(a) a.begin(), a.end()
#define P pair<int, int>
using namespace std;
typedef long long int ll;
typedef unsigned long long int ull;
//(int)'a'は97 (int)'A'は65 (int)'1'は49
//おまじない
// UnionFind
const int maxn = 100000;
int main() {
int n, a, b, c, d;
int macnt = 0, cnt = 0;
string s;
cin >> n >> a >> b >> c >> d;
cin >> s;
a--;
b--;
c--;
d--;
for (int i = a; i <= max(c, d); i++) {
if (s[i] == '#') {
cnt++;
macnt = max(macnt, cnt);
} else {
cnt = 0;
}
}
// macnt=max(macnt,cnt);
if (macnt >= 2) {
No;
} else if (d < c) {
bool key = false;
for (int i = a; i <= d; i++) {
if (s[i] != '#' && s[i - 1] != '#' && s[i + 1] != '#')
key = true;
}
if (key) {
Yes;
} else {
No;
}
} else {
Yes;
}
return 0;
}
| #include <algorithm>
#include <cstdio>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <utility>
#include <vector>
#define INF 1e9 + 7
#define rep(i, n) for (int i = 0; i < n; i++)
#define NO cout << "NO" << endl;
#define YES cout << "YES" << endl;
#define No cout << "No" << endl;
#define Yes cout << "Yes" << endl;
#define all(a) a.begin(), a.end()
#define P pair<int, int>
using namespace std;
typedef long long int ll;
typedef unsigned long long int ull;
//(int)'a'は97 (int)'A'は65 (int)'1'は49
//おまじない
// UnionFind
const int maxn = 100000;
int main() {
int n, a, b, c, d;
int macnt = 0, cnt = 0;
string s;
cin >> n >> a >> b >> c >> d;
cin >> s;
a--;
b--;
c--;
d--;
for (int i = a; i <= max(c, d); i++) {
if (s[i] == '#') {
cnt++;
macnt = max(macnt, cnt);
} else {
cnt = 0;
}
}
// macnt=max(macnt,cnt);
if (macnt >= 2) {
No;
} else if (d < c) {
bool key = false;
for (int i = b; i <= d; i++) {
if (s[i] != '#' && s[i - 1] != '#' && s[i + 1] != '#')
key = true;
}
if (key) {
Yes;
} else {
No;
}
} else {
Yes;
}
return 0;
}
| [
"variable_declaration.value.change",
"identifier.change",
"control_flow.loop.for.initializer.change"
] | 832,083 | 832,084 | u297203024 | cpp |
p03017 | #include <iostream>
using namespace std;
int main() {
ios::sync_with_stdio(false);
int n, a, b, c, d;
cin >> n >> a >> b >> c >> d;
string s;
cin >> s;
s = '?' + s;
for (int i = a; i < c; i++) {
if (s[i] == '#' && s[i + 1] == '#')
return cout << "No\n", 0;
}
for (int i = b; i < d; i++) {
if (s[i] == '#' && s[i + 1] == '#')
return cout << "No\n", 0;
}
if (c < d)
return cout << "Yes\n", 0;
for (int i = b - 1; i < c; i++) {
if (s[i] == '.' && s[i + 1] == '.' && s[i + 2] == '.')
return cout << "Yes\n", 0;
}
return cout << "No\n", 0;
} | #include <iostream>
using namespace std;
int main() {
ios::sync_with_stdio(false);
int n, a, b, c, d;
cin >> n >> a >> b >> c >> d;
string s;
cin >> s;
s = '?' + s;
for (int i = a; i < c; i++) {
if (s[i] == '#' && s[i + 1] == '#')
return cout << "No\n", 0;
}
for (int i = b; i < d; i++) {
if (s[i] == '#' && s[i + 1] == '#')
return cout << "No\n", 0;
}
if (c < d)
return cout << "Yes\n", 0;
for (int i = b - 1; i < d; i++) {
if (s[i] == '.' && s[i + 1] == '.' && s[i + 2] == '.')
return cout << "Yes\n", 0;
}
return cout << "No\n", 0;
} | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 832,089 | 832,090 | u707303246 | cpp |
p03017 | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using namespace std;
typedef tree<pair<int, int>, null_type, less<pair<int, int>>, rb_tree_tag,
tree_order_statistics_node_update>
ordered_set;
#define int long long
#define ld long double
#define fi first
#define se second
#define pb push_back
#define pii pair<int, int>
#define all(x) (x).begin(), (x).end()
#define forn(i, n) for (int i = 0; i < (n); i++)
#define for1(i, n) for (int i = 1; i < (n); i++)
const int MOD = 1e9 + 7;
int mpow(int a, int b, int p = MOD) {
a = a % p;
int res = 1;
while (b > 0) {
if (b & 1)
res = (res * a) % p;
a = (a * a) % p;
b = b >> 1;
}
return res % p;
}
const int N = 300002;
int32_t main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
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 <= c; i++) {
if (s[i] == '#') {
if (i != 0) {
if (s[i - 1] == '#') {
cout << "No\n";
return 0;
}
}
}
}
for (int i = b; i <= d; i++) {
if (s[i] == '#') {
if (i != 0) {
if (s[i - 1] == '#') {
cout << "No\n";
return 0;
}
}
}
}
if (d <= c) {
for (int i = a; i <= c; i++) {
if (s[i] == '.') {
if (i != 0) {
if (s[i - 1] == '.') {
if (i + 1 < n) {
if (s[i + 1] == '.') {
cout << "Yes\n";
return 0;
}
}
}
}
}
}
} else {
cout << "Yes\n";
return 0;
}
cout << "No\n";
} | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using namespace std;
typedef tree<pair<int, int>, null_type, less<pair<int, int>>, rb_tree_tag,
tree_order_statistics_node_update>
ordered_set;
#define int long long
#define ld long double
#define fi first
#define se second
#define pb push_back
#define pii pair<int, int>
#define all(x) (x).begin(), (x).end()
#define forn(i, n) for (int i = 0; i < (n); i++)
#define for1(i, n) for (int i = 1; i < (n); i++)
const int MOD = 1e9 + 7;
int mpow(int a, int b, int p = MOD) {
a = a % p;
int res = 1;
while (b > 0) {
if (b & 1)
res = (res * a) % p;
a = (a * a) % p;
b = b >> 1;
}
return res % p;
}
const int N = 300002;
int32_t main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
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 <= c; i++) {
if (s[i] == '#') {
if (i != 0) {
if (s[i - 1] == '#') {
cout << "No\n";
return 0;
}
}
}
}
for (int i = b; i <= d; i++) {
if (s[i] == '#') {
if (i != 0) {
if (s[i - 1] == '#') {
cout << "No\n";
return 0;
}
}
}
}
if (d <= c) {
for (int i = b; i <= d; i++) {
if (s[i] == '.') {
if (i != 0) {
if (s[i - 1] == '.') {
if (i + 1 < n) {
if (s[i + 1] == '.') {
cout << "Yes\n";
return 0;
}
}
}
}
}
}
} else {
cout << "Yes\n";
return 0;
}
cout << "No\n";
}
| [
"variable_declaration.value.change",
"identifier.change",
"control_flow.loop.for.initializer.change",
"control_flow.branch.if.condition.change"
] | 832,097 | 832,098 | u862316882 | cpp |
p03017 | #include <bits/stdc++.h>
#define ll long long
#define dl double
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define all(v) v.begin(), v.end()
#define allr(v) v.rbegin(), v.rend()
using namespace std;
int main() {
ll t, n, m, i, j, k, x, y, u, v, l, r, ta, tb, count1 = 0, count2 = 0;
ll N, A, B, C, D;
cin >> N >> A >> B >> C >> D;
string s;
cin >> s;
ll E_cont = 0, T_cont = 0;
for (i = min(A, B); i < max(C, D) - 1; i++) {
if (s[i] == '#' && s[i + 1] == '#') {
T_cont = 1;
break;
}
}
for (i = max(A, B) - 2; i < min(C, D) - 2; i++) {
if (s[i] == '.' && s[i + 1] == '.' && s[i + 2] == '.') {
E_cont = 1;
break;
}
}
if (max(A, B) > min(C, D))
E_cont = 1;
ll flag = 1;
if (T_cont == 1) {
flag = 0;
} else {
if ((A < B && C < D) || (A > B && C > D)) {
} else {
if (E_cont == 0) {
flag = 0;
}
}
}
if (flag == 0)
cout << "No";
else
cout << "Yes";
return 0;
}
| #include <bits/stdc++.h>
#define ll long long
#define dl double
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define all(v) v.begin(), v.end()
#define allr(v) v.rbegin(), v.rend()
using namespace std;
int main() {
ll t, n, m, i, j, k, x, y, u, v, l, r, ta, tb, count1 = 0, count2 = 0;
ll N, A, B, C, D;
cin >> N >> A >> B >> C >> D;
string s;
cin >> s;
ll E_cont = 0, T_cont = 0;
for (i = min(A, B); i < max(C, D) - 1; i++) {
if (s[i] == '#' && s[i + 1] == '#') {
T_cont = 1;
break;
}
}
for (i = max(A, B) - 2; i < min(C, D) - 1; i++) {
if (s[i] == '.' && s[i + 1] == '.' && s[i + 2] == '.') {
E_cont = 1;
break;
}
}
if (max(A, B) > min(C, D))
E_cont = 1;
ll flag = 1;
if (T_cont == 1) {
flag = 0;
} else {
if ((A < B && C < D) || (A > B && C > D)) {
} else {
if (E_cont == 0) {
flag = 0;
}
}
}
if (flag == 0)
cout << "No";
else
cout << "Yes";
return 0;
}
| [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 832,104 | 832,105 | u121266738 | cpp |
p03017 | #include <bits/stdc++.h>
#define ll long long
#define dl double
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define all(v) v.begin(), v.end()
#define allr(v) v.rbegin(), v.rend()
using namespace std;
int main() {
ll t, n, m, i, j, k, x, y, u, v, l, r, ta, tb, count1 = 0, count2 = 0;
ll N, A, B, C, D;
cin >> N >> A >> B >> C >> D;
string s;
cin >> s;
ll E_cont = 0, T_cont = 0;
for (i = min(A, B); i < max(C, D); i++) {
if (s[i] == '#' && s[i + 1] == '#') {
T_cont = 1;
break;
}
}
for (i = max(A, B); i < min(C, D) - 2; i++) {
if (s[i] == '.' && s[i + 1] == '.' && s[i + 1] == '.') {
E_cont = 1;
break;
}
}
if (max(A, B) > min(C, D))
E_cont = 1;
ll flag = 1;
if (T_cont == 1) {
flag = 0;
} else {
if ((A < B && C < D) || (A > B && C > D)) {
} else {
if (E_cont == 0) {
flag = 0;
}
}
}
if (flag == 0)
cout << "No";
else
cout << "Yes";
return 0;
}
| #include <bits/stdc++.h>
#define ll long long
#define dl double
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define all(v) v.begin(), v.end()
#define allr(v) v.rbegin(), v.rend()
using namespace std;
int main() {
ll t, n, m, i, j, k, x, y, u, v, l, r, ta, tb, count1 = 0, count2 = 0;
ll N, A, B, C, D;
cin >> N >> A >> B >> C >> D;
string s;
cin >> s;
ll E_cont = 0, T_cont = 0;
for (i = min(A, B); i < max(C, D) - 1; i++) {
if (s[i] == '#' && s[i + 1] == '#') {
T_cont = 1;
break;
}
}
for (i = max(A, B) - 2; i < min(C, D) - 1; i++) {
if (s[i] == '.' && s[i + 1] == '.' && s[i + 2] == '.') {
E_cont = 1;
break;
}
}
if (max(A, B) > min(C, D))
E_cont = 1;
ll flag = 1;
if (T_cont == 1) {
flag = 0;
} else {
if ((A < B && C < D) || (A > B && C > D)) {
} else {
if (E_cont == 0) {
flag = 0;
}
}
}
if (flag == 0)
cout << "No";
else
cout << "Yes";
return 0;
}
| [
"control_flow.loop.for.condition.change",
"misc.off_by_one",
"control_flow.loop.for.initializer.change",
"assignment.change",
"literal.number.change",
"expression.off_by_one",
"expression.operation.binary.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 832,107 | 832,105 | u121266738 | cpp |
p03017 | #include <iostream>
using namespace std;
int main() {
int n, a, b, c, d;
string s;
cin >> n >> a >> b >> c >> d >> s;
bool f = true;
for (int i = a - 1; i < c - 2; i++)
if (s[i] == '#' && s[i + 1] == '#')
f = false;
for (int i = b - 1; i < d - 2; i++)
if (s[i] == '#' && s[i + 1] == '#')
f = false;
if (d < c) {
f = false;
for (int i = b - 1; i < d - 1; i++)
if (s[i] == '.' && s[i + 1] == '.' && s[i + 2] == '.')
f = true;
}
cout << (f ? "Yes" : "No") << endl;
return 0;
} | #include <iostream>
using namespace std;
int main() {
int n, a, b, c, d;
string s;
cin >> n >> a >> b >> c >> d >> s;
bool f = true;
for (int i = a - 1; i < c - 2; i++)
if (s[i] == '#' && s[i + 1] == '#')
f = false;
for (int i = b - 1; i < d - 2; i++)
if (s[i] == '#' && s[i + 1] == '#')
f = false;
if (d < c) {
f = false;
for (int i = b - 2; i < d - 1; i++)
if (s[i] == '.' && s[i + 1] == '.' && s[i + 2] == '.')
f = true;
}
cout << (f ? "Yes" : "No") << endl;
return 0;
} | [
"literal.number.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 832,120 | 832,121 | u612175324 | cpp |
p03017 | #include <algorithm>
#include <array>
#include <cstdint>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <set>
#include <vector>
using namespace std;
int main() {
int n, a, b, c, d;
cin >> n >> a >> b >> c >> d;
a--;
b--;
c--;
d--;
string line;
cin >> line;
bool has_two_rock = false;
for (int i = a; i <= max(c, d) - 1; i++) {
if (line[i] == '#' && line[i + 1] == '#') {
has_two_rock = true;
}
}
bool has_three_empty = false;
for (int i = b; i <= d - 2; i++) {
if (line[i] == '.' && line[i + 1] == '.' && line[i + 2] == '.') {
has_three_empty = true;
}
}
if (!has_two_rock && (c < d || has_three_empty)) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
} | #include <algorithm>
#include <array>
#include <cstdint>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <set>
#include <vector>
using namespace std;
int main() {
int n, a, b, c, d;
cin >> n >> a >> b >> c >> d;
a--;
b--;
c--;
d--;
string line;
cin >> line;
bool has_two_rock = false;
for (int i = a; i <= max(c, d) - 1; i++) {
if (line[i] == '#' && line[i + 1] == '#') {
has_two_rock = true;
}
}
bool has_three_empty = false;
for (int i = b - 1; i <= d - 1; i++) {
if (line[i] == '.' && line[i + 1] == '.' && line[i + 2] == '.') {
has_three_empty = true;
}
}
if (!has_two_rock && (c < d || has_three_empty)) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
} | [
"control_flow.loop.for.initializer.change",
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 832,124 | 832,125 | u537234062 | cpp |
p03017 | #include <algorithm>
#include <array>
#include <cstdint>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <set>
#include <vector>
using namespace std;
int main() {
int n, a, b, c, d;
cin >> n >> a >> b >> c >> d;
a--;
b--;
c--;
d--;
string line;
cin >> line;
bool has_two_rock = false;
for (int i = a; i <= max(c, d) - 1; i++) {
if (line[i] == '#' && line[i + 1] == '#') {
has_two_rock = true;
}
}
bool has_three_empty = false;
for (int i = b; i <= c - 2; i++) {
if (line[i] == '.' && line[i + 1] == '.' && line[i + 2] == '.') {
has_three_empty = true;
}
}
if (!has_two_rock && (c < d || has_three_empty)) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
} | #include <algorithm>
#include <array>
#include <cstdint>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <set>
#include <vector>
using namespace std;
int main() {
int n, a, b, c, d;
cin >> n >> a >> b >> c >> d;
a--;
b--;
c--;
d--;
string line;
cin >> line;
bool has_two_rock = false;
for (int i = a; i <= max(c, d) - 1; i++) {
if (line[i] == '#' && line[i + 1] == '#') {
has_two_rock = true;
}
}
bool has_three_empty = false;
for (int i = b - 1; i <= d - 1; i++) {
if (line[i] == '.' && line[i + 1] == '.' && line[i + 2] == '.') {
has_three_empty = true;
}
}
if (!has_two_rock && (c < d || has_three_empty)) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
} | [
"control_flow.loop.for.initializer.change",
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"literal.number.change",
"expression.off_by_one"
] | 832,126 | 832,125 | u537234062 | cpp |
p03017 | #include <algorithm>
#include <array>
#include <cstdint>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <set>
#include <vector>
using namespace std;
int main() {
int n, a, b, c, d;
cin >> n >> a >> b >> c >> d;
a--;
b--;
c--;
d--;
string line;
cin >> line;
bool has_two_rock = false;
for (int i = a; i <= max(c, d) - 1; i++) {
if (line[i] == '#' && line[i + 1] == '#') {
has_two_rock = true;
}
}
bool has_three_empty = false;
for (int i = a; i <= c - 2; i++) {
if (line[i] == '.' && line[i + 1] == '.' && line[i + 2] == '.') {
has_three_empty = true;
}
}
if (!has_two_rock && (c < d || has_three_empty)) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
} | #include <algorithm>
#include <array>
#include <cstdint>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <set>
#include <vector>
using namespace std;
int main() {
int n, a, b, c, d;
cin >> n >> a >> b >> c >> d;
a--;
b--;
c--;
d--;
string line;
cin >> line;
bool has_two_rock = false;
for (int i = a; i <= max(c, d) - 1; i++) {
if (line[i] == '#' && line[i + 1] == '#') {
has_two_rock = true;
}
}
bool has_three_empty = false;
for (int i = b - 1; i <= d - 1; i++) {
if (line[i] == '.' && line[i + 1] == '.' && line[i + 2] == '.') {
has_three_empty = true;
}
}
if (!has_two_rock && (c < d || has_three_empty)) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
} | [
"control_flow.loop.for.initializer.change",
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"literal.number.change",
"expression.off_by_one"
] | 832,127 | 832,125 | u537234062 | cpp |
p03017 | /*
ID: thanhvq1
LANG: C++14
PROB: namenum
*/
#pragma GCC optimize("O2")
#include <bits/stdc++.h>
#include <unistd.h>
using namespace std;
//#define int long long
#define double long double
#define vec vector
#define vi vector<int>
#define FZ(n) memset((n), 0, sizeof(n))
#define FMO(n) memset((n), -1, sizeof(n))
#define unset unordered_set
#define ii pair<int, int>
#define vii vector<ii>
#define F first
#define S second
#define PB push_back
#define ALL(x) begin(x), end(x)
#define SZ(x) ((int)(x).size())
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define FORE(i, a, b) for (int i = (a); i <= (b); i++)
#define FORD(i, a, b) for (int i = (a); i >= (b); i--)
#define bitcount(n) __builtin_popcountll(n)
template <typename T, typename U>
std::pair<T, U> operator+(const std::pair<T, U> &l, const std::pair<T, U> &r) {
return {l.first + r.first, l.second + r.second};
}
typedef void (*callback_function)(void); // type for conciseness
const long long ZERO = 0LL;
const long long INF64 = 1e18;
const int INF32 = 1e9;
const int MOD = 1e9 + 7;
const double PI = acos(-1.0L);
const double EPS = static_cast<double>(1e-9);
typedef long long ll;
void FILEIO() {
freopen("in.txt", "r", stdin);
freopen("out.txt", "w", stdout);
}
// void FILEIO() { freopen("namenum.in", "r", stdin); freopen("namenum.out",
// "w", stdout); }
int n, a, b, c, d;
string s;
bool check(int a, int b) { // di duoc tu a den b, khong tinh co nguoi o giua
FOR(i, a, b) {
char c1 = s[i], c2 = s[i + 1];
if (c1 == '#' and c2 == '#')
return false;
}
return true;
}
void solve() {
cin >> n >> a >> b >> c >> d;
a--, b--, c--, d--;
cin >> s;
if (!check(a, c) or !check(b, d)) {
cout << "No" << endl;
return;
}
if (c < d) {
cout << "Yes" << endl;
return;
}
// now d < c, can go from a to c, from b to d
FOR(i, b, d) {
if (s[i] == '.' and s[i + 1] == '.' and s[i + 2] == '.') {
cout << "Yes" << endl;
return;
}
}
cout << "No" << endl;
}
//#undef int
signed main() {
//#define int long long
ios_base::sync_with_stdio(false);
cin.tie();
// FILEIO();
// auto beginProgram = chrono::steady_clock::now();
// int t; cin >> t;
// while (t--)
{ solve(); }
// auto endProgram = chrono::steady_clock::now();
return 0;
}
| /*
ID: thanhvq1
LANG: C++14
PROB: namenum
*/
#pragma GCC optimize("O2")
#include <bits/stdc++.h>
#include <unistd.h>
using namespace std;
//#define int long long
#define double long double
#define vec vector
#define vi vector<int>
#define FZ(n) memset((n), 0, sizeof(n))
#define FMO(n) memset((n), -1, sizeof(n))
#define unset unordered_set
#define ii pair<int, int>
#define vii vector<ii>
#define F first
#define S second
#define PB push_back
#define ALL(x) begin(x), end(x)
#define SZ(x) ((int)(x).size())
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define FORE(i, a, b) for (int i = (a); i <= (b); i++)
#define FORD(i, a, b) for (int i = (a); i >= (b); i--)
#define bitcount(n) __builtin_popcountll(n)
template <typename T, typename U>
std::pair<T, U> operator+(const std::pair<T, U> &l, const std::pair<T, U> &r) {
return {l.first + r.first, l.second + r.second};
}
typedef void (*callback_function)(void); // type for conciseness
const long long ZERO = 0LL;
const long long INF64 = 1e18;
const int INF32 = 1e9;
const int MOD = 1e9 + 7;
const double PI = acos(-1.0L);
const double EPS = static_cast<double>(1e-9);
typedef long long ll;
void FILEIO() {
freopen("in.txt", "r", stdin);
freopen("out.txt", "w", stdout);
}
// void FILEIO() { freopen("namenum.in", "r", stdin); freopen("namenum.out",
// "w", stdout); }
int n, a, b, c, d;
string s;
bool check(int a, int b) { // di duoc tu a den b, khong tinh co nguoi o giua
FOR(i, a, b) {
char c1 = s[i], c2 = s[i + 1];
if (c1 == '#' and c2 == '#')
return false;
}
return true;
}
void solve() {
cin >> n >> a >> b >> c >> d;
a--, b--, c--, d--;
cin >> s;
if (!check(a, c) or !check(b, d)) {
cout << "No" << endl;
return;
}
// now we can go from a to c, from b to d
if (c < d) {
cout << "Yes" << endl;
return;
} // lets b goes to d fisrt
// now d < c
FOR(i, b - 1, d) {
if (s[i] == '.' and s[i + 1] == '.' and s[i + 2] == '.') {
cout << "Yes" << endl;
return;
}
}
cout << "No" << endl;
}
//#undef int
signed main() {
//#define int long long
ios_base::sync_with_stdio(false);
cin.tie();
// FILEIO();
// auto beginProgram = chrono::steady_clock::now();
// int t; cin >> t;
// while (t--)
{ solve(); }
// auto endProgram = chrono::steady_clock::now();
return 0;
}
| [
"expression.operation.binary.add"
] | 832,135 | 832,136 | u210484769 | cpp |
p03017 | #include <bits/stdc++.h>
using namespace std;
// Shortcut
#define int long long
#define endl '\n'
#define eb emplace_back
#define pb push_back
#define pob pop_back
#define mp make_pair
#define upb upper_bound
#define lwb lower_bound
#define fi first
#define se second
#define For(i, l, r) for (int i = l; i < r; i++)
#define ForE(i, l, r) for (int i = l; i <= r; i++)
#define Ford(i, r, l) for (int i = r; i > l; i--)
#define FordE(i, r, l) for (int i = r; i >= l; i--)
#define Fora(i, a) for (auto i : a)
// I/O & Debug
#define PrintV(a) \
for (int iiii = 0; iiii < a.size(); iiii++) \
cout << a[iiii] << ' ';
#define PrintVl(a) \
for (int iiii = 0; iiii < a.size(); iiii++) \
cout << a[iiii] << endl;
#define PrintA(a, n) \
for (int iiii = 0; iiii < n; iiii++) \
cout << a[iiii] << ' ';
#define PrintAl(a, n) \
for (int iiii = 0; iiii < n; iiii++) \
cout << a[iiii] << endl;
#define Ptest(x) return cout << x, 0;
#define gl(s) getline(cin, s);
#define setpre(x) fixed << setprecision(x)
/*
#define debug(args...){ string _sDEB = #args; replace(_sDEB.begin(),
_sDEB.end(), ',', ' '); stringstream _ssDEB(_sDEB); istream_iterator<string>
_itDEB(_ssDEB); DEB(_itDEB, args); } void DEB(istream_iterator<string> it) {}
template<typename T, typename... Args>
void DEB(istream_iterator<string> it, T a, Args... args){
cout << *it << " = " << a << endl;
DEB(++it, args...);
}
*/
// Functions
#define isvowel(a) (a == 'a' || a == 'e' || a == 'i' || a == 'o' || a == 'u')
#define bend(a) a.begin(), a.end()
#define rbend(a) a.rbegin(), a.rend()
#define mset(a) memset(a, 0, sizeof(a));
#define mmset(a) memset(a, 0x3f, sizeof(a));
// mt19937 rando(chrono::steady_clock::now().time_since_epoch().count());
// Data Structure
#define pque priority_queue
#define mts multiset
typedef long long ll;
typedef long double ld;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<ld> vld;
typedef vector<string> vs;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<vi> vvi;
typedef vector<vll> vvll;
typedef vector<pii> vpii;
typedef vector<pll> vpll;
const int N = 1e5 + 5, mod = 1e9 + 7, inf = 1e9 + 7;
int n, a, b, c, d;
string s;
signed main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cin >> n >> a >> b >> c >> d >> s;
a--;
b--;
c--;
d--;
ForE(i, a + 1, c) {
if (s[i] == '#' && s[i - 1] == '#')
Ptest("No");
}
ForE(i, b + 1, d) {
if (s[i] == '#' && s[i - 1] == '#')
Ptest("No");
}
if (d < c) {
bool ck = 1;
ForE(i, max(2ll, b), min((int)s.length() - 1, d + 1)) {
if (s[i] == '.' && s[i - 1] == '.' && s[i - 2] == '.')
ck = 0;
}
if (ck)
Ptest("No");
}
cout << "Yes";
}
/*
==================================+
INPUT: |
------------------------------ |
------------------------------ |
==================================+
OUTPUT: |
------------------------------ |
------------------------------ |
==================================+
*/ | #include <bits/stdc++.h>
using namespace std;
// Shortcut
#define int long long
#define endl '\n'
#define eb emplace_back
#define pb push_back
#define pob pop_back
#define mp make_pair
#define upb upper_bound
#define lwb lower_bound
#define fi first
#define se second
#define For(i, l, r) for (int i = l; i < r; i++)
#define ForE(i, l, r) for (int i = l; i <= r; i++)
#define Ford(i, r, l) for (int i = r; i > l; i--)
#define FordE(i, r, l) for (int i = r; i >= l; i--)
#define Fora(i, a) for (auto i : a)
// I/O & Debug
#define PrintV(a) \
for (int iiii = 0; iiii < a.size(); iiii++) \
cout << a[iiii] << ' ';
#define PrintVl(a) \
for (int iiii = 0; iiii < a.size(); iiii++) \
cout << a[iiii] << endl;
#define PrintA(a, n) \
for (int iiii = 0; iiii < n; iiii++) \
cout << a[iiii] << ' ';
#define PrintAl(a, n) \
for (int iiii = 0; iiii < n; iiii++) \
cout << a[iiii] << endl;
#define Ptest(x) return cout << x, 0;
#define gl(s) getline(cin, s);
#define setpre(x) fixed << setprecision(x)
/*
#define debug(args...){ string _sDEB = #args; replace(_sDEB.begin(),
_sDEB.end(), ',', ' '); stringstream _ssDEB(_sDEB); istream_iterator<string>
_itDEB(_ssDEB); DEB(_itDEB, args); } void DEB(istream_iterator<string> it) {}
template<typename T, typename... Args>
void DEB(istream_iterator<string> it, T a, Args... args){
cout << *it << " = " << a << endl;
DEB(++it, args...);
}
*/
// Functions
#define isvowel(a) (a == 'a' || a == 'e' || a == 'i' || a == 'o' || a == 'u')
#define bend(a) a.begin(), a.end()
#define rbend(a) a.rbegin(), a.rend()
#define mset(a) memset(a, 0, sizeof(a));
#define mmset(a) memset(a, 0x3f, sizeof(a));
// mt19937 rando(chrono::steady_clock::now().time_since_epoch().count());
// Data Structure
#define pque priority_queue
#define mts multiset
typedef long long ll;
typedef long double ld;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<ld> vld;
typedef vector<string> vs;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<vi> vvi;
typedef vector<vll> vvll;
typedef vector<pii> vpii;
typedef vector<pll> vpll;
const int N = 1e5 + 5, mod = 1e9 + 7, inf = 1e9 + 7;
int n, a, b, c, d;
string s;
signed main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cin >> n >> a >> b >> c >> d >> s;
a--;
b--;
c--;
d--;
ForE(i, a + 1, c) {
if (s[i] == '#' && s[i - 1] == '#')
Ptest("No");
}
ForE(i, b + 1, d) {
if (s[i] == '#' && s[i - 1] == '#')
Ptest("No");
}
if (d < c) {
bool ck = 1;
ForE(i, max(2ll, b + 1), min((int)s.length() - 1, d + 1)) {
if (s[i] == '.' && s[i - 1] == '.' && s[i - 2] == '.')
ck = 0;
}
if (ck)
Ptest("No");
}
cout << "Yes";
}
/*
==================================+
INPUT: |
------------------------------ |
------------------------------ |
==================================+
OUTPUT: |
------------------------------ |
------------------------------ |
==================================+
*/ | [
"expression.operation.binary.add"
] | 832,140 | 832,141 | u430870052 | 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;
if (c > d) {
// 抜かす。O*3
for (size_t i = b; i < d; i++) {
if (s[i] == '#' && s[i + 1] == '#') {
cout << "No" << endl;
return 0;
}
}
for (size_t i = a; i < c; i++) {
if (s[i] == '#' && s[i + 1] == '#') {
cout << "No" << endl;
return 0;
}
}
// if(d+1 != c) {
for (size_t 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 {
// for (size_t i = b-2; i < c-2; i++)
// {
// if(s[i] == '.' && s[i+1] == '.' && s[i+2] == '.') {
// cout << "Yes" << endl;
// return 0;
// }
// }
// cout << "No" << endl;
// }
} else {
for (size_t i = b; i < d; i++) {
if (s[i] == '#' && s[i + 1] == '#') {
cout << "No" << endl;
return 0;
}
}
for (size_t i = a; i < c; i++) {
if (s[i] == '#' && s[i + 1] == '#') {
cout << "No" << endl;
return 0;
}
}
cout << "Yes" << 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;
if (c > d) {
// 抜かす。O*3
for (size_t i = b; i < d; i++) {
if (s[i] == '#' && s[i + 1] == '#') {
cout << "No" << endl;
return 0;
}
}
for (size_t i = a; i < c; i++) {
if (s[i] == '#' && s[i + 1] == '#') {
cout << "No" << endl;
return 0;
}
}
// if(d+1 != c) {
for (size_t 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 {
// for (size_t i = b-2; i < c-2; i++)
// {
// if(s[i] == '.' && s[i+1] == '.' && s[i+2] == '.') {
// cout << "Yes" << endl;
// return 0;
// }
// }
// cout << "No" << endl;
// }
} else {
for (size_t i = b; i < d; i++) {
if (s[i] == '#' && s[i + 1] == '#') {
cout << "No" << endl;
return 0;
}
}
for (size_t i = a; i < c; i++) {
if (s[i] == '#' && s[i + 1] == '#') {
cout << "No" << endl;
return 0;
}
}
cout << "Yes" << endl;
}
}
| [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 832,152 | 832,153 | u432551953 | cpp |
p03017 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
int n, a, b, c, d;
string s;
cin >> n >> a >> b >> c >> d >> s;
a--;
b--;
c--;
d--;
// ##があるかチェック
int breaker = 0;
for (int x = a; x <= c; x++) {
if (breaker >= 2)
break;
else if (s[x] == '#')
breaker++;
else
breaker = 0;
}
for (int x = b; x <= d; x++) {
if (breaker >= 2)
break;
else if (s[x] == '#')
breaker++;
else
breaker = 0;
}
if (c < d) {
if (breaker >= 2)
cout << "No" << endl;
else
cout << "Yes" << endl;
} else {
int dots = 0; // ...があるかチェック
for (int x = b; x <= d; x++) {
if (dots >= 3)
break;
else if (s[x] == '.')
dots++;
else
dots = 0;
}
if (breaker >= 2)
cout << "No" << endl;
else {
if (dots >= 3)
cout << "Yes" << endl;
else
cout << "No" << endl;
}
}
}
| #include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
int n, a, b, c, d;
string s;
cin >> n >> a >> b >> c >> d >> s;
a--;
b--;
c--;
d--;
// ##があるかチェック
int breaker = 0;
for (int x = a; x <= c; x++) {
if (breaker >= 2)
break;
else if (s[x] == '#')
breaker++;
else
breaker = 0;
}
for (int x = b; x <= d; x++) {
if (breaker >= 2)
break;
else if (s[x] == '#')
breaker++;
else
breaker = 0;
}
if (c < d) {
if (breaker >= 2)
cout << "No" << endl;
else
cout << "Yes" << endl;
} else {
int dots = 0;
for (int x = b - 1; x <= d + 1; x++) {
if (dots >= 3)
break;
else if (s[x] == '.')
dots++;
else
dots = 0;
}
if (breaker >= 2)
cout << "No" << endl;
else {
if (dots >= 3)
cout << "Yes" << endl;
else
cout << "No" << endl;
}
}
}
| [
"control_flow.loop.for.initializer.change",
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 832,176 | 832,177 | u798086274 | cpp |
p03017 | #include <bits/stdc++.h>
#include <iomanip>
using namespace std;
int main() {
int N, A, B, C, D;
cin >> N >> A >> B >> C >> D;
string S;
cin >> S;
bool ans = 1;
if (B < C && C < D) {
for (int i = A - 1; i < D - 1; i++) {
if (S[i] == '#' && S[i + 1] == '#')
ans = 0;
}
// Aマス目からDマス目まで2連の岩があればNo
if (ans)
cout << "Yes" << endl;
else
cout << "No" << endl;
} else if (B < D && D < C) {
ans = 0;
for (int j = B - 1; j < D - 1; j++) {
if (S[j] == '.' && S[j + 1] == '.' && S[j + 2] == '.')
ans = 1;
}
// Bマス目からDマス目まで3連の空きがなければNo
for (int k = A - 1; k < C - 1; k++) {
if (S[k] == '#' && S[k + 1] == '#')
ans = 0;
}
if (ans)
cout << "Yes" << endl;
else
cout << "No" << endl;
} else {
for (int l = A - 1; l < C - 1; l++) {
if (S[l] == '#' && S[l + 1] == '#')
ans = 0;
}
for (int m = B - 1; m < D - 1; m++) {
if (S[m] == '#' && S[m + 1] == '#')
ans = 0;
}
if (ans)
cout << "Yes" << endl;
else
cout << "No" << endl;
}
} | #include <bits/stdc++.h>
#include <iomanip>
using namespace std;
int main() {
int N, A, B, C, D;
cin >> N >> A >> B >> C >> D;
string S;
cin >> S;
bool ans = 1;
if (B < C && C < D) {
for (int i = A - 1; i < D - 1; i++) {
if (S[i] == '#' && S[i + 1] == '#')
ans = 0;
}
// Aマス目からDマス目まで2連の岩があればNo
if (ans)
cout << "Yes" << endl;
else
cout << "No" << endl;
} else if (B < D && D < C) {
ans = 0;
for (int j = B - 2; j < D - 1; j++) {
if (S[j] == '.' && S[j + 1] == '.' && S[j + 2] == '.')
ans = 1;
}
// Bマス目からDマス目まで3連の空きがなければNo
for (int k = A - 1; k < C - 1; k++) {
if (S[k] == '#' && S[k + 1] == '#')
ans = 0;
}
if (ans)
cout << "Yes" << endl;
else
cout << "No" << endl;
} else {
for (int l = A - 1; l < C - 1; l++) {
if (S[l] == '#' && S[l + 1] == '#')
ans = 0;
}
for (int m = B - 1; m < D - 1; m++) {
if (S[m] == '#' && S[m + 1] == '#')
ans = 0;
}
if (ans)
cout << "Yes" << endl;
else
cout << "No" << endl;
}
} | [
"literal.number.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 832,182 | 832,183 | u732571394 | cpp |
p03017 | #include <bits/stdc++.h>
#define rep(i, a, b) for (int i = (int)(a); i < (int)(b); ++i)
#define rrep(i, a, b) for (int i = (int)(a); i >= (int)(b); --i)
#define fore(i, a) for (auto &i : a)
#define all(a) (a).begin(), (a).end()
#define rall(a) (a).rbegin(), (a).rend()
#define isin(i, a, b) ((a) <= (i) && (i) < (b))
#define uni(a) (a).erase(unique(all(a)), (a).end())
#define fi first
#define se second
#define pb push_back
#define sz(a) (int)(a).size()
#define v(T) vector<T>
#define vv(T) v(v(T))
using namespace std;
using ll = long long;
using unit = unsigned;
using ull = unsigned long long;
using P = pair<int, int>;
using vi = vector<int>;
using vl = vector<ll>;
using vvi = vector<vi>;
using vp = vector<P>;
void _main();
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
_main();
}
template <class T> void YES(T condition) {
if (condition)
cout << "YES" << endl;
else
cout << "NO" << endl;
}
template <class T> void Yes(T condition) {
if (condition)
cout << "Yes" << endl;
else
cout << "No" << endl;
}
template <class T> void POSS(T condition) {
if (condition)
cout << "POSSIBLE" << endl;
else
cout << "IMPOSSIBLE" << endl;
}
template <class T> void Poss(T condition) {
if (condition)
cout << "Possible" << endl;
else
cout << "Impossible" << endl;
}
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 <class T> T gcd(T a, T b) {
if (b == 0) {
return a;
} else {
return gcd(b, a % b);
}
}
template <class T> T lcm(T a, T b) { return a / gcd(a, b) * b; }
constexpr double eps = 1e-10;
constexpr int inf = INT_MAX / 2;
constexpr ll infl = 1LL << 60;
bool CanCGoBeyoundD(int N, int A, int B, int C, int D, string S) {
S[B - 1] = '.';
rep(i, max(2, B), C + 1) {
if (S[i - 2] == '.' && S[i - 1] == '.' && S[i] == '.')
return true;
}
return false;
}
bool Solve(int N, int A, int B, int C, int D, string S) {
if (C > D && CanCGoBeyoundD(N, A, B, C, D, S) == false)
return false;
S[C - 1] = '.';
S[D - 1] = '.';
rep(i, max(1, A), C) {
if (S[i - 1] == '#' && S[i] == '#')
return false;
}
rep(i, max(1, B), D) {
if (S[i - 1] == '#' && S[i] == '#')
return false;
}
return true;
}
void _main() {
int N, A, B, C, D;
string S;
cin >> N >> A >> B >> C >> D >> S;
Yes(Solve(N, A, B, C, D, S));
} | #include <bits/stdc++.h>
#define rep(i, a, b) for (int i = (int)(a); i < (int)(b); ++i)
#define rrep(i, a, b) for (int i = (int)(a); i >= (int)(b); --i)
#define fore(i, a) for (auto &i : a)
#define all(a) (a).begin(), (a).end()
#define rall(a) (a).rbegin(), (a).rend()
#define isin(i, a, b) ((a) <= (i) && (i) < (b))
#define uni(a) (a).erase(unique(all(a)), (a).end())
#define fi first
#define se second
#define pb push_back
#define sz(a) (int)(a).size()
#define v(T) vector<T>
#define vv(T) v(v(T))
using namespace std;
using ll = long long;
using unit = unsigned;
using ull = unsigned long long;
using P = pair<int, int>;
using vi = vector<int>;
using vl = vector<ll>;
using vvi = vector<vi>;
using vp = vector<P>;
void _main();
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
_main();
}
template <class T> void YES(T condition) {
if (condition)
cout << "YES" << endl;
else
cout << "NO" << endl;
}
template <class T> void Yes(T condition) {
if (condition)
cout << "Yes" << endl;
else
cout << "No" << endl;
}
template <class T> void POSS(T condition) {
if (condition)
cout << "POSSIBLE" << endl;
else
cout << "IMPOSSIBLE" << endl;
}
template <class T> void Poss(T condition) {
if (condition)
cout << "Possible" << endl;
else
cout << "Impossible" << endl;
}
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 <class T> T gcd(T a, T b) {
if (b == 0) {
return a;
} else {
return gcd(b, a % b);
}
}
template <class T> T lcm(T a, T b) { return a / gcd(a, b) * b; }
constexpr double eps = 1e-10;
constexpr int inf = INT_MAX / 2;
constexpr ll infl = 1LL << 60;
bool CanSunukeGoBeyoundFunuke(int N, int A, int B, int C, int D, string S) {
S[B - 1] = '.';
rep(i, max(2, B), D + 1) {
if (S[i - 2] == '.' && S[i - 1] == '.' && S[i] == '.')
return true;
}
return false;
}
bool Solve(int N, int A, int B, int C, int D, string S) {
if (C > D && CanSunukeGoBeyoundFunuke(N, A, B, C, D, S) == false)
return false;
S[C - 1] = '.';
S[D - 1] = '.';
rep(i, max(1, A), C) {
if (S[i - 1] == '#' && S[i] == '#')
return false;
}
rep(i, max(1, B), D) {
if (S[i - 1] == '#' && S[i] == '#')
return false;
}
return true;
}
void _main() {
int N, A, B, C, D;
string S;
cin >> N >> A >> B >> C >> D >> S;
Yes(Solve(N, A, B, C, D, S));
} | [
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change",
"call.function.change",
"control_flow.branch.if.condition.change"
] | 832,192 | 832,193 | u430494842 | cpp |
p03017 | #include <algorithm>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <deque>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <memory>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#define dump(x) cerr << #x << "=" << (x) << endl;
using namespace std;
using ll = long long;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
#define IN(x) \
int(x); \
cin >> x
#define VINT(a, n) vector<int> a(n)
#define VIN(a, n) \
VINT(a, n); \
REP(i, n) { cin >> a[i]; }
#define ALL(x) (x).begin(), (x).end()
int main() {
IN(n);
IN(a);
a--;
IN(b);
b--;
IN(c);
c--;
IN(d);
d--;
string s;
cin >> s;
bool ans1 = true; // true->Yes false->No
bool ans2 = false;
if (c > b) {
FOR(i, a, max(c, d) - 1) {
if (s[i] == '#' && s[i + 1] == '#')
ans1 = false;
}
} else {
FOR(i, a, c) {
if (s[i] == '#' && s[i + 1] == '#')
ans1 = false;
}
FOR(i, b, d) {
if (s[i] == '#' && s[i + 1] == '#')
ans1 = false;
}
}
if (d > c) {
ans2 = true;
} else {
FOR(i, b, d) {
if (s[i - 1] == '.' && s[i] == '.' && s[i + 1] == '.')
ans2 = true;
}
}
cout << (ans1 && ans2 ? "Yes" : "No");
}
| #include <algorithm>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <deque>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <memory>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#define dump(x) cerr << #x << "=" << (x) << endl;
using namespace std;
using ll = long long;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
#define IN(x) \
int(x); \
cin >> x
#define VINT(a, n) vector<int> a(n)
#define VIN(a, n) \
VINT(a, n); \
REP(i, n) { cin >> a[i]; }
#define ALL(x) (x).begin(), (x).end()
int main() {
IN(n);
IN(a);
a--;
IN(b);
b--;
IN(c);
c--;
IN(d);
d--;
string s;
cin >> s;
bool ans1 = true; // true->Yes false->No
bool ans2 = false;
if (c > b) {
FOR(i, a, max(c, d)) {
if (s[i] == '#' && s[i + 1] == '#')
ans1 = false;
}
} else {
FOR(i, a, c) {
if (s[i] == '#' && s[i + 1] == '#')
ans1 = false;
}
FOR(i, b, d) {
if (s[i] == '#' && s[i + 1] == '#')
ans1 = false;
}
}
if (d > c) {
ans2 = true;
} else {
FOR(i, b, d + 1) {
if (s[i - 1] == '.' && s[i] == '.' && s[i + 1] == '.')
ans2 = true;
}
}
cout << (ans1 && ans2 ? "Yes" : "No");
}
| [
"expression.operation.binary.remove"
] | 832,197 | 832,198 | u934954661 | cpp |
p03017 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <sstream>
#include <string>
#include <vector>
#define ll long long int
#define rep(i, x, y) for (int i = x; i < y; i++)
#define rel(i, x, y) for (int i = x - 1; i >= y; i--)
#define all(x) x.begin(), x.end()
using namespace std;
int main() {
int n, a, b, c, d, count[10];
cin >> n >> a >> b >> c >> d;
string s;
cin >> s;
rep(i, 0, 10) { count[i] = 0; }
rep(i, b - 1, d - 1) {
if (s[i - 1] == '.' && s[i] == '.' && s[i + 1] == '.') {
count[0]++;
}
}
rep(i, a - 1, c - 1) {
if (s[i] == '#' && s[i + 1] == '#') {
count[1]++;
}
}
rep(i, b - 1, d - 1) {
if (s[i] == '#' && s[i + 1] == '#') {
count[1]++;
}
}
if (d < c && count[0] == 0) {
cout << "No" << endl;
} else if (count[1] > 0) {
cout << "No" << endl;
} else {
cout << "Yes" << endl;
}
} | #include <algorithm>
#include <cmath>
#include <iostream>
#include <sstream>
#include <string>
#include <vector>
#define ll long long int
#define rep(i, x, y) for (int i = x; i < y; i++)
#define rel(i, x, y) for (int i = x - 1; i >= y; i--)
#define all(x) x.begin(), x.end()
using namespace std;
int main() {
int n, a, b, c, d, count[10];
cin >> n >> a >> b >> c >> d;
string s;
cin >> s;
rep(i, 0, 10) { count[i] = 0; }
rep(i, b - 1, d) {
if (s[i - 1] == '.' && s[i] == '.' && s[i + 1] == '.') {
count[0]++;
}
}
rep(i, a - 1, c) {
if (s[i] == '#' && s[i + 1] == '#') {
count[1]++;
}
}
rep(i, b - 1, d) {
if (s[i] == '#' && s[i + 1] == '#') {
count[1]++;
}
}
if (d < c && count[0] == 0) {
cout << "No" << endl;
} else if (count[1] > 0) {
cout << "No" << endl;
} else {
cout << "Yes" << endl;
}
} | [
"expression.operation.binary.remove"
] | 832,201 | 832,202 | u629341543 | cpp |
p03017 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <sstream>
#include <string>
#include <vector>
#define ll long long int
#define rep(i, x, y) for (int i = x; i < y; i++)
#define rel(i, x, y) for (int i = x - 1; i >= y; i--)
#define all(x) x.begin(), x.end()
using namespace std;
int main() {
int n, a, b, c, d, count[10];
cin >> n >> a >> b >> c >> d;
string s;
cin >> s;
rep(i, 0, 10) { count[i] = 0; }
rep(i, b + 1, d + 1) {
if (s[i - 1] == '.' && s[i] == '.' && s[i + 1] == '.') {
count[0]++;
}
}
rep(i, a + 1, c) {
if (s[i] == '#' && s[i + 1] == '#') {
count[1]++;
}
}
rep(i, b + 1, d) {
if (s[i] == '#' && s[i + 1] == '#') {
count[1]++;
}
}
if (d < c && count[0] == 0) {
cout << "No" << endl;
} else if (count[1] > 0) {
cout << "No" << endl;
} else {
cout << "Yes" << endl;
}
} | #include <algorithm>
#include <cmath>
#include <iostream>
#include <sstream>
#include <string>
#include <vector>
#define ll long long int
#define rep(i, x, y) for (int i = x; i < y; i++)
#define rel(i, x, y) for (int i = x - 1; i >= y; i--)
#define all(x) x.begin(), x.end()
using namespace std;
int main() {
int n, a, b, c, d, count[10];
cin >> n >> a >> b >> c >> d;
string s;
cin >> s;
rep(i, 0, 10) { count[i] = 0; }
rep(i, b - 1, d) {
if (s[i - 1] == '.' && s[i] == '.' && s[i + 1] == '.') {
count[0]++;
}
}
rep(i, a - 1, c) {
if (s[i] == '#' && s[i + 1] == '#') {
count[1]++;
}
}
rep(i, b - 1, d) {
if (s[i] == '#' && s[i + 1] == '#') {
count[1]++;
}
}
if (d < c && count[0] == 0) {
cout << "No" << endl;
} else if (count[1] > 0) {
cout << "No" << endl;
} else {
cout << "Yes" << endl;
}
} | [
"misc.opposites",
"expression.operator.arithmetic.change",
"call.arguments.change",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 832,203 | 832,202 | u629341543 | cpp |
p03017 | #ifndef _GLIBCXX_NO_ASSERT
#include <cassert>
#endif
#include <cctype>
#include <cerrno>
#include <cfloat>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <csetjmp>
#include <csignal>
#include <cstdarg>
#include <cstddef>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#if __cplusplus >= 201103L
#include <ccomplex>
#include <cfenv>
#include <cinttypes>
#include <cstdalign>
#include <cstdbool>
#include <cstdint>
#include <ctgmath>
#include <cwchar>
#include <cwctype>
#endif
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <locale>
#include <map>
#include <memory>
#include <new>
#include <numeric>
#include <ostream>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdexcept>
#include <streambuf>
#include <string>
#include <typeinfo>
#include <utility>
#include <valarray>
#include <vector>
#if __cplusplus >= 201103L
#include <array>
#include <atomic>
#include <chrono>
#include <condition_variable>
#include <forward_list>
#include <future>
#include <initializer_list>
#include <mutex>
#include <random>
#include <ratio>
#include <regex>
#include <scoped_allocator>
#include <system_error>
#include <thread>
#include <tuple>
#include <type_traits>
#include <typeindex>
#include <unordered_map>
#include <unordered_set>
#endif
#define y0 qvya13579
#define y1 qvyb24680
#define j0 qvja13579
#define j1 qvjb24680
#define next qvne13579xt
#define prev qvpr13579ev
#define INF 1000000007
#define MOD 1000000007
#define PI acos(-1.0)
#define endl "\n"
#define IOS \
cin.tie(0); \
ios::sync_with_stdio(false)
#define M_P make_pair
#define PU_B push_back
#define PU_F push_front
#define PO_B pop_back
#define PO_F pop_front
#define U_B upper_bound
#define L_B lower_bound
#define B_S binary_search
#define PR_Q priority_queue
#define FIR first
#define SEC second
#if __cplusplus < 201103L
#define stoi(argument_string) atoi((argument_string).c_str())
#endif
#define REP(i, n) for (int i = 0; i < (int)(n); ++i)
#define REP_R(i, n) for (int i = ((int)(n)-1); i >= 0; --i)
#define FOR(i, m, n) for (int i = ((int)(m)); i < (int)(n); ++i)
#define FOR_R(i, m, n) for (int i = ((int)(m)-1); i >= (int)(n); --i)
#define ALL(v) (v).begin(), (v).end()
#define RALL(v) (v).rbegin(), (v).rend()
#define SIZ(x) ((int)(x).size())
#define CIN(x) cin >> (x)
#define CIN2(x, y) cin >> (x) >> (y)
#define CIN3(x, y, z) cin >> (x) >> (y) >> (z)
#define CIN4(x, y, z, w) cin >> (x) >> (y) >> (z) >> (w)
#define CIN5(x, y, z, w, u) cin >> (x) >> (y) >> (z) >> (w) >> (u)
#define SCAND(x) scanf("%d", &(x))
#define SCAND2(x, y) scanf("%d%d", &(x), &(y))
#define SCAND3(x, y, z) scanf("%d%d%d", &(x), &(y), &(z))
#define SCAND4(x, y, z, w) scanf("%d%d%d%d", &(x), &(y), &(z), &(w))
#define SCAND5(x, y, z, w, u) scanf("%d%d%d%d%d", &(x), &(y), &(z), &(w), &(u))
#define SCANLLD(x) scanf("%lld", &(x))
#define SCANLLD2(x, y) scanf("%lld%lld", &(x), &(y))
#define SCANLLD3(x, y, z) scanf("%lld%lld%lld", &(x), &(y), &(z))
#define SCANLLD4(x, y, z, w) scanf("%lld%lld%lld%lld", &(x), &(y), &(z), &(w))
#define SCANLLD5(x, y, z, w, u) \
scanf("%lld%lld%lld%lld%lld", &(x), &(y), &(z), &(w), &(u))
#define PRINTD(x) printf("%d\n", (x))
#define PRINTLLD(x) printf("%lld\n", (x))
#define DEBUG(argument) cerr << (#argument) << " : " << (argument) << "\n"
typedef long long int lli;
using namespace std;
bool compare_by_2nd(pair<int, int> a, pair<int, int> b) {
if (a.second != b.second) {
return a.second < b.second;
} else {
return a.first < b.first;
}
}
int ctoi(char c) {
if (c >= '0' and c <= '9') {
return (int)(c - '0');
}
return -1;
}
int alphabet_pos(char c) {
if (c >= 'a' and c <= 'z') {
return (int)(c - 'a');
}
return -1;
}
int alphabet_pos_capital(char c) {
if (c >= 'A' and c <= 'Z') {
return (int)(c - 'A');
}
return -1;
}
vector<string> split(string str, char ch) {
int first = 0;
int last = str.find_first_of(ch);
if (last == string::npos) {
last = SIZ(str);
}
vector<string> result;
while (first < SIZ(str)) {
string Ssubstr(str, first, last - first);
result.push_back(Ssubstr);
first = last + 1;
last = str.find_first_of(ch, first);
if (last == string::npos) {
last = SIZ(str);
}
}
return result;
}
int gcd(int a, int b) // assuming a,b >= 1
{
if (a < b) {
return gcd(b, a);
}
if (a % b == 0) {
return b;
}
return gcd(b, a % b);
}
int lcm(int a, int b) // assuming a,b >= 1
{
return a * b / gcd(a, b);
}
lli pow_fast(lli x, lli n_power, lli modulus) {
if (n_power == 0) {
return 1;
}
if (n_power % 2 == 0) {
return pow_fast(x * x % modulus, n_power / 2, modulus);
}
return x * pow_fast(x, n_power - 1, modulus) % modulus;
}
struct CombinationTable {
vector<vector<long long>> val;
CombinationTable(int size)
: val(size + 1, vector<long long>(size + 1)) // constructor
{
for (int i = 0; i <= size; ++i) // note that 0 <= i <= size
{
for (int j = 0; j <= i; ++j) {
if (j == 0 or j == i) {
val[i][j] = 1LL;
} else {
val[i][j] = val[i - 1][j - 1] + val[i - 1][j];
}
}
}
}
};
struct UnionFind // size-based
{
vector<int> parent, treesize;
UnionFind(int size)
: parent(size), treesize(size, 1) // constructor
{
for (int i = 0; i < size; ++i) {
parent[i] = i;
}
}
int root(int x) {
if (parent[x] == x) {
return x;
}
return parent[x] = root(parent[x]);
}
void unite(int x, int y) {
x = root(x);
y = root(y);
if (x == y) {
return;
}
if (treesize[x] < treesize[y]) {
parent[x] = y;
treesize[y] += treesize[x];
} else {
parent[y] = x;
treesize[x] += treesize[y];
}
}
bool sametree(int x, int y) { return root(x) == root(y); }
int gettreesize(int x) { return treesize[root(x)]; }
};
/*------------------ the end of the template -----------------------*/
signed main() {
IOS; /* making cin faster */
int N, A, B, C, D;
CIN5(N, A, B, C, D);
--A;
--B;
--C;
--D;
string S;
CIN(S);
if (C > D) {
int id = -1;
FOR(i, B, D) {
if (i + 1 < N and S[i - 1] == '.' and S[i] == '.' and S[i + 1] == '.') {
id = i;
break;
}
}
if (id == -1) {
puts("No");
return 0;
}
FOR(i, A, C) {
if (S[i] == '#' and S[i + 1] == '#') {
puts("No");
return 0;
}
}
} else {
FOR(i, B, D) {
if (S[i] == '#' and S[i + 1] == '#') {
puts("No");
return 0;
}
}
FOR(i, A, C) {
if (S[i] == '#' and S[i + 1] == '#') {
puts("No");
return 0;
}
}
}
puts("Yes");
}
| #ifndef _GLIBCXX_NO_ASSERT
#include <cassert>
#endif
#include <cctype>
#include <cerrno>
#include <cfloat>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <csetjmp>
#include <csignal>
#include <cstdarg>
#include <cstddef>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#if __cplusplus >= 201103L
#include <ccomplex>
#include <cfenv>
#include <cinttypes>
#include <cstdalign>
#include <cstdbool>
#include <cstdint>
#include <ctgmath>
#include <cwchar>
#include <cwctype>
#endif
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <locale>
#include <map>
#include <memory>
#include <new>
#include <numeric>
#include <ostream>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdexcept>
#include <streambuf>
#include <string>
#include <typeinfo>
#include <utility>
#include <valarray>
#include <vector>
#if __cplusplus >= 201103L
#include <array>
#include <atomic>
#include <chrono>
#include <condition_variable>
#include <forward_list>
#include <future>
#include <initializer_list>
#include <mutex>
#include <random>
#include <ratio>
#include <regex>
#include <scoped_allocator>
#include <system_error>
#include <thread>
#include <tuple>
#include <type_traits>
#include <typeindex>
#include <unordered_map>
#include <unordered_set>
#endif
#define y0 qvya13579
#define y1 qvyb24680
#define j0 qvja13579
#define j1 qvjb24680
#define next qvne13579xt
#define prev qvpr13579ev
#define INF 1000000007
#define MOD 1000000007
#define PI acos(-1.0)
#define endl "\n"
#define IOS \
cin.tie(0); \
ios::sync_with_stdio(false)
#define M_P make_pair
#define PU_B push_back
#define PU_F push_front
#define PO_B pop_back
#define PO_F pop_front
#define U_B upper_bound
#define L_B lower_bound
#define B_S binary_search
#define PR_Q priority_queue
#define FIR first
#define SEC second
#if __cplusplus < 201103L
#define stoi(argument_string) atoi((argument_string).c_str())
#endif
#define REP(i, n) for (int i = 0; i < (int)(n); ++i)
#define REP_R(i, n) for (int i = ((int)(n)-1); i >= 0; --i)
#define FOR(i, m, n) for (int i = ((int)(m)); i < (int)(n); ++i)
#define FOR_R(i, m, n) for (int i = ((int)(m)-1); i >= (int)(n); --i)
#define ALL(v) (v).begin(), (v).end()
#define RALL(v) (v).rbegin(), (v).rend()
#define SIZ(x) ((int)(x).size())
#define CIN(x) cin >> (x)
#define CIN2(x, y) cin >> (x) >> (y)
#define CIN3(x, y, z) cin >> (x) >> (y) >> (z)
#define CIN4(x, y, z, w) cin >> (x) >> (y) >> (z) >> (w)
#define CIN5(x, y, z, w, u) cin >> (x) >> (y) >> (z) >> (w) >> (u)
#define SCAND(x) scanf("%d", &(x))
#define SCAND2(x, y) scanf("%d%d", &(x), &(y))
#define SCAND3(x, y, z) scanf("%d%d%d", &(x), &(y), &(z))
#define SCAND4(x, y, z, w) scanf("%d%d%d%d", &(x), &(y), &(z), &(w))
#define SCAND5(x, y, z, w, u) scanf("%d%d%d%d%d", &(x), &(y), &(z), &(w), &(u))
#define SCANLLD(x) scanf("%lld", &(x))
#define SCANLLD2(x, y) scanf("%lld%lld", &(x), &(y))
#define SCANLLD3(x, y, z) scanf("%lld%lld%lld", &(x), &(y), &(z))
#define SCANLLD4(x, y, z, w) scanf("%lld%lld%lld%lld", &(x), &(y), &(z), &(w))
#define SCANLLD5(x, y, z, w, u) \
scanf("%lld%lld%lld%lld%lld", &(x), &(y), &(z), &(w), &(u))
#define PRINTD(x) printf("%d\n", (x))
#define PRINTLLD(x) printf("%lld\n", (x))
#define DEBUG(argument) cerr << (#argument) << " : " << (argument) << "\n"
typedef long long int lli;
using namespace std;
bool compare_by_2nd(pair<int, int> a, pair<int, int> b) {
if (a.second != b.second) {
return a.second < b.second;
} else {
return a.first < b.first;
}
}
int ctoi(char c) {
if (c >= '0' and c <= '9') {
return (int)(c - '0');
}
return -1;
}
int alphabet_pos(char c) {
if (c >= 'a' and c <= 'z') {
return (int)(c - 'a');
}
return -1;
}
int alphabet_pos_capital(char c) {
if (c >= 'A' and c <= 'Z') {
return (int)(c - 'A');
}
return -1;
}
vector<string> split(string str, char ch) {
int first = 0;
int last = str.find_first_of(ch);
if (last == string::npos) {
last = SIZ(str);
}
vector<string> result;
while (first < SIZ(str)) {
string Ssubstr(str, first, last - first);
result.push_back(Ssubstr);
first = last + 1;
last = str.find_first_of(ch, first);
if (last == string::npos) {
last = SIZ(str);
}
}
return result;
}
int gcd(int a, int b) // assuming a,b >= 1
{
if (a < b) {
return gcd(b, a);
}
if (a % b == 0) {
return b;
}
return gcd(b, a % b);
}
int lcm(int a, int b) // assuming a,b >= 1
{
return a * b / gcd(a, b);
}
lli pow_fast(lli x, lli n_power, lli modulus) {
if (n_power == 0) {
return 1;
}
if (n_power % 2 == 0) {
return pow_fast(x * x % modulus, n_power / 2, modulus);
}
return x * pow_fast(x, n_power - 1, modulus) % modulus;
}
struct CombinationTable {
vector<vector<long long>> val;
CombinationTable(int size)
: val(size + 1, vector<long long>(size + 1)) // constructor
{
for (int i = 0; i <= size; ++i) // note that 0 <= i <= size
{
for (int j = 0; j <= i; ++j) {
if (j == 0 or j == i) {
val[i][j] = 1LL;
} else {
val[i][j] = val[i - 1][j - 1] + val[i - 1][j];
}
}
}
}
};
struct UnionFind // size-based
{
vector<int> parent, treesize;
UnionFind(int size)
: parent(size), treesize(size, 1) // constructor
{
for (int i = 0; i < size; ++i) {
parent[i] = i;
}
}
int root(int x) {
if (parent[x] == x) {
return x;
}
return parent[x] = root(parent[x]);
}
void unite(int x, int y) {
x = root(x);
y = root(y);
if (x == y) {
return;
}
if (treesize[x] < treesize[y]) {
parent[x] = y;
treesize[y] += treesize[x];
} else {
parent[y] = x;
treesize[x] += treesize[y];
}
}
bool sametree(int x, int y) { return root(x) == root(y); }
int gettreesize(int x) { return treesize[root(x)]; }
};
/*------------------ the end of the template -----------------------*/
signed main() {
IOS; /* making cin faster */
int N, A, B, C, D;
CIN5(N, A, B, C, D);
--A;
--B;
--C;
--D;
string S;
CIN(S);
if (C > D) {
int id = -1;
FOR(i, B, D + 1) {
if (i + 1 < N and S[i - 1] == '.' and S[i] == '.' and S[i + 1] == '.') {
id = i;
break;
}
}
if (id == -1) {
puts("No");
return 0;
}
FOR(i, A, C) {
if (S[i] == '#' and S[i + 1] == '#') {
puts("No");
return 0;
}
}
} else {
FOR(i, B, D) {
if (S[i] == '#' and S[i + 1] == '#') {
puts("No");
return 0;
}
}
FOR(i, A, C) {
if (S[i] == '#' and S[i + 1] == '#') {
puts("No");
return 0;
}
}
}
puts("Yes");
}
| [
"expression.operation.binary.add"
] | 832,223 | 832,224 | u900727536 | cpp |
p03017 | #include <iostream>
int main() {
int n, a, b, c, d;
std::string s;
std::cin >> n >> a >> b >> c >> d >> s;
bool flag = true;
for (int i = a - 1; i < d - 1; i++) {
if (s[i] == '#') {
flag &= (s[i + 1] == '.');
}
}
if (d < c) {
int t = 0;
int max = 0;
for (int i = b - 2; i < c; i++) {
if (s[i] == '.') {
t++;
max = std::max(max, t);
} else {
t = 0;
}
}
flag &= (max >= 3);
}
if (flag) {
std::cout << "Yes" << std::endl;
} else {
std::cout << "No" << std::endl;
}
}
| #include <iostream>
int main() {
int n, a, b, c, d;
std::string s;
std::cin >> n >> a >> b >> c >> d >> s;
bool flag = true;
for (int i = a - 1; i < d - 1; i++) {
if (s[i] == '#') {
flag &= (s[i + 1] == '.');
}
}
if (d < c) {
int t = 0;
int max = 0;
for (int i = b - 2; i < d + 1; i++) {
if (s[i] == '.') {
t++;
max = std::max(max, t);
} else {
t = 0;
}
}
flag &= (max >= 3);
}
if (flag) {
std::cout << "Yes" << std::endl;
} else {
std::cout << "No" << std::endl;
}
}
| [
"identifier.change",
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 832,233 | 832,234 | u718277423 | cpp |
p03017 | #include <iostream>
int main() {
int n, a, b, c, d;
std::string s;
std::cin >> n >> a >> b >> c >> d >> s;
bool flag = true;
for (int i = a - 1; i < d - 1; i++) {
if (s[i] == '#') {
flag &= (s[i + 1] == '.');
}
}
if (d < c) {
int t = 0;
int max = 0;
for (int i = b - 1; i < c; i++) {
if (s[i] == '.') {
t++;
max = std::max(max, t);
} else {
t = 0;
}
}
flag &= (max >= 3);
}
if (flag) {
std::cout << "Yes" << std::endl;
} else {
std::cout << "No" << std::endl;
}
}
| #include <iostream>
int main() {
int n, a, b, c, d;
std::string s;
std::cin >> n >> a >> b >> c >> d >> s;
bool flag = true;
for (int i = a - 1; i < d - 1; i++) {
if (s[i] == '#') {
flag &= (s[i + 1] == '.');
}
}
if (d < c) {
int t = 0;
int max = 0;
for (int i = b - 2; i < d + 1; i++) {
if (s[i] == '.') {
t++;
max = std::max(max, t);
} else {
t = 0;
}
}
flag &= (max >= 3);
}
if (flag) {
std::cout << "Yes" << std::endl;
} else {
std::cout << "No" << std::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",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 832,235 | 832,234 | u718277423 | cpp |
p03017 | #include <bits/stdc++.h>
using namespace std;
const int N = 2e5 + 5;
int n, a, b, c, d;
char s[N];
int main() {
scanf("%d%d%d%d%d", &n, &a, &b, &c, &d);
scanf("%s", s + 1);
bool flag = true;
for (int i = a; i < max(c, d); i++)
if (s[i] == '#' && s[i + 1] == '#')
flag = false;
if (c > d) {
int tot = 0;
for (int i = max(a, b - 2); i <= d - 1; i++)
if (s[i] == '.' && s[i + 1] == '.' && s[i + 2] == '.')
tot++;
if (tot == 0 && !(b - 1 == a && s[b + 1] == '.'))
flag = false;
}
printf(flag ? "Yes" : "No");
}
| #include <bits/stdc++.h>
using namespace std;
const int N = 2e5 + 5;
int n, a, b, c, d;
char s[N];
int main() {
scanf("%d%d%d%d%d", &n, &a, &b, &c, &d);
scanf("%s", s + 1);
bool flag = true;
for (int i = a; i < max(c, d); i++)
if (s[i] == '#' && s[i + 1] == '#')
flag = false;
if (c > d) {
int tot = 0;
for (int i = max(a, b - 1); i <= d - 1; i++)
if (s[i] == '.' && s[i + 1] == '.' && s[i + 2] == '.')
tot++;
if (tot == 0 && !(b - 1 == a && s[b + 1] == '.'))
flag = false;
}
printf(flag ? "Yes" : "No");
}
| [
"literal.number.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"call.arguments.change",
"expression.operation.binary.change"
] | 832,242 | 832,243 | u676323984 | cpp |
p03017 | #include <bits/stdc++.h>
using namespace std;
typedef long long lint;
typedef pair<int, int> pii;
typedef pair<lint, lint> pll;
int 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--;
string S;
cin >> S;
for (int i = A; i < max(C, D); i++) {
if (S[i] == '#' and S[i + 1] == '#') {
cout << "No" << endl;
return 0;
}
}
if (C < D) {
cout << "Yes" << endl;
return 0;
}
for (int i = B; i < D; i++) {
if (S[i] == '.' and S[i + 1] == '.' and S[i + 2] == '.') {
cout << "Yes" << endl;
return 0;
}
}
cout << "No" << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long lint;
typedef pair<int, int> pii;
typedef pair<lint, lint> pll;
int 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--;
string S;
cin >> S;
for (int i = A; i < max(C, D); i++) {
if (S[i] == '#' and S[i + 1] == '#') {
cout << "No" << endl;
return 0;
}
}
if (C < D) {
cout << "Yes" << endl;
return 0;
}
for (int i = B - 1; i < D; i++) {
if (S[i] == '.' and S[i + 1] == '.' and S[i + 2] == '.') {
cout << "Yes" << endl;
return 0;
}
}
cout << "No" << endl;
return 0;
} | [
"control_flow.loop.for.initializer.change"
] | 832,244 | 832,245 | u354638986 | cpp |
p03017 | #include <bits/stdc++.h>
using namespace std;
typedef long long lint;
typedef pair<int, int> pii;
typedef pair<lint, lint> pll;
int 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--;
string S;
cin >> S;
for (int i = A; i < max(C, D); i++) {
if (S[i] == '#' and S[i + 1] == '#') {
cout << -1 << endl;
return 0;
}
}
if (C < D) {
cout << "Yes" << endl;
return 0;
}
for (int i = B; i < D; i++) {
if (S[i] == '.' and S[i + 1] == '.' and S[i + 2] == '.') {
cout << "Yes" << endl;
return 0;
}
}
cout << "No" << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long lint;
typedef pair<int, int> pii;
typedef pair<lint, lint> pll;
int 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--;
string S;
cin >> S;
for (int i = A; i < max(C, D); i++) {
if (S[i] == '#' and S[i + 1] == '#') {
cout << "No" << endl;
return 0;
}
}
if (C < D) {
cout << "Yes" << endl;
return 0;
}
for (int i = B - 1; i < D; i++) {
if (S[i] == '.' and S[i + 1] == '.' and S[i + 2] == '.') {
cout << "Yes" << endl;
return 0;
}
}
cout << "No" << endl;
return 0;
} | [
"control_flow.loop.for.initializer.change"
] | 832,246 | 832,245 | u354638986 | cpp |
p03017 | /**
* @brief : c++ code for AtCoder
* @author : rk222
* @created: 2019.06.02 20:56:01
*/
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> P;
typedef pair<int, P> P1;
#define fr first
#define sc second
#define mp make_pair
#define pb push_back
#define rep(i, x) for (int i = 0; i < x; i++)
#define rep1(i, x) for (int i = 1; i <= x; i++)
#define rrep(i, x) for (int i = x - 1; i >= 0; i--)
#define rrep1(i, x) for (int i = x; i > 0; i--)
#define sor(v) sort(v.begin(), v.end())
#define rev(s) reverse(s.begin(), s.end())
#define lb(vec, a) lower_bound(vec.begin(), vec.end(), a)
#define ub(vec, a) upper_bound(vec.begin(), vec.end(), a)
#define uniq(vec) vec.erase(unique(vec.begin(), vec.end()), vec.end())
#define mp1(a, b, c) P1(a, P(b, c))
#define disp(x) cout << #x << ": " << x << endl
#define disp_vec(v) \
cout << #v << ":"; \
rep(i, v.size()) cout << " " << v[i]; \
cout << endl
const int INF = 100000000;
const int M = 100000000;
const int dir_4[4][2] = {{1, 0}, {0, 1}, {-1, 0}, {0, -1}};
const int dir_8[8][2] = {{1, 0}, {1, 1}, {0, 1}, {-1, 1},
{-1, 0}, {-1, -1}, {0, -1}, {1, -1}};
/* ------------------------------------- */
int main() {
int n, a, b, c, d;
string s;
cin >> n >> a >> b >> c >> d;
cin >> s;
a--;
b--;
c--;
d--;
bool ret = true;
if (c < d) {
int ms = 0;
int cnts = 0;
for (int i = a; i < c; i++) {
if (s[i] == '#') {
cnts++;
ms = max(cnts, ms);
} else {
cnts = 0;
}
}
cnts = 0;
for (int i = b; i < d; i++) {
if (s[i] == '#') {
cnts++;
ms = max(cnts, ms);
} else {
cnts = 0;
}
}
if (ms > 1) {
ret = false;
} else {
ret = true;
}
} else {
int ms = 0;
int cnts = 0;
for (int i = a; i < c; i++) {
if (s[i] == '#') {
cnts++;
ms = max(cnts, ms);
} else {
cnts = 0;
}
}
int md = 0;
int cntd = 0;
for (int i = b; i <= d; i++) {
if (s[i] == '.') {
cntd++;
md = max(cntd, md);
} else {
cntd = 0;
}
}
if (ms <= 1 && md >= 3) {
ret = true;
} else {
ret = false;
}
}
if (ret) {
cout << "Yes" << '\n';
} else {
cout << "No" << '\n';
}
/* --------------------------------- */
return 0;
} | /**
* @brief : c++ code for AtCoder
* @author : rk222
* @created: 2019.06.02 20:56:01
*/
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> P;
typedef pair<int, P> P1;
#define fr first
#define sc second
#define mp make_pair
#define pb push_back
#define rep(i, x) for (int i = 0; i < x; i++)
#define rep1(i, x) for (int i = 1; i <= x; i++)
#define rrep(i, x) for (int i = x - 1; i >= 0; i--)
#define rrep1(i, x) for (int i = x; i > 0; i--)
#define sor(v) sort(v.begin(), v.end())
#define rev(s) reverse(s.begin(), s.end())
#define lb(vec, a) lower_bound(vec.begin(), vec.end(), a)
#define ub(vec, a) upper_bound(vec.begin(), vec.end(), a)
#define uniq(vec) vec.erase(unique(vec.begin(), vec.end()), vec.end())
#define mp1(a, b, c) P1(a, P(b, c))
#define disp(x) cout << #x << ": " << x << endl
#define disp_vec(v) \
cout << #v << ":"; \
rep(i, v.size()) cout << " " << v[i]; \
cout << endl
const int INF = 100000000;
const int M = 100000000;
const int dir_4[4][2] = {{1, 0}, {0, 1}, {-1, 0}, {0, -1}};
const int dir_8[8][2] = {{1, 0}, {1, 1}, {0, 1}, {-1, 1},
{-1, 0}, {-1, -1}, {0, -1}, {1, -1}};
/* ------------------------------------- */
int main() {
int n, a, b, c, d;
string s;
cin >> n >> a >> b >> c >> d;
cin >> s;
a--;
b--;
c--;
d--;
bool ret = true;
if (c < d) {
int ms = 0;
int cnts = 0;
for (int i = a; i < c; i++) {
if (s[i] == '#') {
cnts++;
ms = max(cnts, ms);
} else {
cnts = 0;
}
}
cnts = 0;
for (int i = b; i < d; i++) {
if (s[i] == '#') {
cnts++;
ms = max(cnts, ms);
} else {
cnts = 0;
}
}
if (ms > 1) {
ret = false;
} else {
ret = true;
}
} else {
int ms = 0;
int cnts = 0;
for (int i = a; i < c; i++) {
if (s[i] == '#') {
cnts++;
ms = max(cnts, ms);
} else {
cnts = 0;
}
}
int md = 0;
int cntd = 0;
for (int i = b - 1; i <= d + 1; i++) {
if (s[i] == '.') {
cntd++;
md = max(cntd, md);
} else {
cntd = 0;
}
}
if (ms <= 1 && md >= 3) {
ret = true;
} else {
ret = false;
}
}
if (ret) {
cout << "Yes" << '\n';
} else {
cout << "No" << '\n';
}
/* --------------------------------- */
return 0;
} | [
"control_flow.loop.for.initializer.change",
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 832,247 | 832,248 | u245366924 | cpp |
p03017 | #include <iostream>
#include <string>
using namespace std;
int main() {
int n, a, b, c, d;
string s;
cin >> n >> a >> b >> c >> d;
cin >> s;
bool yes = true;
for (auto i = a - 1; i < d - 1; ++i) {
if (s[i] == '#' && s[i + 1] == '#') {
cout << "No" << endl;
return 0;
}
}
if (d < c) {
bool no = true;
for (auto i = b - 2; i <= d; ++i) {
if (s[i] == '.' && s[i + 1] == '.' && s[i + 2] == '.') {
cout << "Yes" << endl;
no = false;
return 0;
}
}
if (no) {
cout << "No" << endl;
return 0;
}
}
cout << "Yes" << endl;
}
| #include <iostream>
#include <string>
using namespace std;
int main() {
int n, a, b, c, d;
string s;
cin >> n >> a >> b >> c >> d;
cin >> s;
bool yes = true;
for (auto i = a - 1; i < d - 1; ++i) {
if (s[i] == '#' && s[i + 1] == '#') {
cout << "No" << endl;
return 0;
}
}
if (d < c) {
bool no = true;
for (auto i = b - 2; i <= d - 2; ++i) {
if (s[i] == '.' && s[i + 1] == '.' && s[i + 2] == '.') {
cout << "Yes" << endl;
no = false;
return 0;
}
}
if (no) {
cout << "No" << endl;
return 0;
}
}
cout << "Yes" << endl;
}
| [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 832,249 | 832,250 | u488731967 | cpp |
p03017 | #define _CRT_SECURE_NO_WARNINGS
#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <memory>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
using LL = long long;
LL N, A, B, C, D;
string S, T;
int main() {
cin >> N >> A >> B >> C >> D;
--A;
--B;
--C;
--D;
// N += 2;
N++;
cin >> S;
S.push_back('#');
S.push_back('#');
for (int i = min(A, C); i < max(A, C); ++i) {
if (S[i] == '#' && S[i + 1] == '#') {
cout << "No" << endl;
return 0;
}
}
for (int i = min(B, D); i < max(B, D); ++i) {
if (S[i] == '#' && S[i + 1] == '#') {
cout << "No" << endl;
return 0;
}
}
if ((A - B) * (C - D) > 0LL) {
cout << "Yes" << endl;
return 0;
}
for (int i = 0; i < N; ++i) {
if (S[i] == '#' || S[max(0, i - 1)] == '#' || S[i + 1] == '#') {
T.push_back('#');
} else {
T.push_back('.');
}
}
LL L = max(0LL, max(A, B) - 2); // min(min(A, B), min(C, D));
LL R = min(N, min(C, D) + 2); // max(max(A, B), max(C, D));
/*while (L > 0 && (S[L] == '.' || S[L - 1] == '.')) {
--L;
}
while (R < N && (S[R] == '.' || S[R + 1] == '.')) {
++R;
}*/
bool ok = false;
for (int i = L; i <= R; ++i) {
if (T[i] == '.') {
ok = true;
}
}
if (ok) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
return 0;
}
| #define _CRT_SECURE_NO_WARNINGS
#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <memory>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
using LL = long long;
LL N, A, B, C, D;
string S, T;
int main() {
cin >> N >> A >> B >> C >> D;
--A;
--B;
--C;
--D;
// N += 2;
N++;
cin >> S;
S.push_back('#');
S.push_back('#');
for (int i = min(A, C); i < max(A, C); ++i) {
if (S[i] == '#' && S[i + 1] == '#') {
cout << "No" << endl;
return 0;
}
}
for (int i = min(B, D); i < max(B, D); ++i) {
if (S[i] == '#' && S[i + 1] == '#') {
cout << "No" << endl;
return 0;
}
}
if ((A - B) * (C - D) > 0LL) {
cout << "Yes" << endl;
return 0;
}
for (int i = 0; i < N; ++i) {
if (S[i] == '#' || S[max(0, i - 1)] == '#' || S[i + 1] == '#') {
T.push_back('#');
} else {
T.push_back('.');
}
}
LL L = max(0LL, max(A, B)); // min(min(A, B), min(C, D));
LL R = min(N, min(C, D)); // max(max(A, B), max(C, D));
/*while (L > 0 && (S[L] == '.' || S[L - 1] == '.')) {
--L;
}
while (R < N && (S[R] == '.' || S[R + 1] == '.')) {
++R;
}*/
bool ok = false;
for (int i = L; i <= R; ++i) {
if (T[i] == '.') {
ok = true;
}
}
if (ok) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
return 0;
}
| [
"expression.operation.binary.remove"
] | 832,256 | 832,257 | u558671021 | cpp |
p03017 | #include <bits/stdc++.h>
using namespace std;
#define mod 1000000007
using ll = long long;
int main() {
int N, A, B, C, D;
string S;
cin >> N >> A >> B >> C >> D;
cin >> S;
int flag = 0;
for (int i = A; i < max(C, D) - 1; ++i) {
if (S[i] == '#' && S[i + 1] == '#')
flag = 1;
}
if (C > D) {
flag = 1;
for (int i = B - 2; i <= D - 1; ++i) {
if (S[i] == '.' && S[i + 1] == '.' && S[i + 2] == '.')
flag = 0;
}
}
if (flag) {
cout << "No";
} else {
cout << "Yes";
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define mod 1000000007
using ll = long long;
int main() {
int N, A, B, C, D;
string S;
cin >> N >> A >> B >> C >> D;
cin >> S;
int flag = 0;
for (int i = A; i < max(C, D) - 1; ++i) {
if (S[i] == '#' && S[i + 1] == '#')
flag = 1;
}
if (C > D) {
flag = 1;
for (int i = B - 2; i <= D - 2; ++i) {
if (S[i] == '.' && S[i + 1] == '.' && S[i + 2] == '.')
flag = 0;
}
}
if (flag) {
cout << "No";
} else {
cout << "Yes";
}
return 0;
} | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 832,282 | 832,283 | u590088474 | 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;
--a, --b, --c, --d;
if (c < d) {
bool ok = true;
for (int i = b; i + 1 < d; ++i)
if (s[i] == '#' and s[i + 1] == '#')
ok = false;
for (int i = a; i + 1 < c; ++i)
if (s[i] == '#' and s[i + 1] == '#')
ok = false;
cout << (ok ? "Yes" : "No") << endl;
} else {
bool ok = false;
for (int i = b - 1; i + 2 < d; ++i)
if (s[i] == '.' and s[i + 1] == '.' and s[i + 2] == '.')
ok = true;
for (int i = a; i + 1 < c; ++i)
if (s[i] == '#' and s[i + 1] == '#')
ok = false;
for (int i = b; i + 1 < d; ++i)
if (s[i] == '#' and s[i + 1] == '#')
ok = false;
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;
--a, --b, --c, --d;
if (c < d) {
bool ok = true;
for (int i = b; i + 1 < d; ++i)
if (s[i] == '#' and s[i + 1] == '#')
ok = false;
for (int i = a; i + 1 < c; ++i)
if (s[i] == '#' and s[i + 1] == '#')
ok = false;
cout << (ok ? "Yes" : "No") << endl;
} else {
bool ok = false;
for (int i = b - 1; i + 2 <= d + 1; ++i)
if (s[i] == '.' and s[i + 1] == '.' and s[i + 2] == '.')
ok = true;
for (int i = a; i + 1 < c; ++i)
if (s[i] == '#' and s[i + 1] == '#')
ok = false;
for (int i = b; i + 1 < d; ++i)
if (s[i] == '#' and s[i + 1] == '#')
ok = false;
cout << (ok ? "Yes" : "No") << endl;
}
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 832,289 | 832,290 | u503549962 | 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;
--a, --b, --c, --d;
if (c < d) {
bool ok = true;
for (int i = b; i + 1 < d; ++i)
if (s[i] == '#' and s[i + 1] == '#')
ok = false;
for (int i = a; i + 1 < c; ++i)
if (s[i] == '#' and s[i + 1] == '#')
ok = false;
cout << (ok ? "Yes" : "No") << endl;
} else {
bool ok = false;
for (int i = b - 1; i + 2 < n; ++i)
if (s[i] == '.' and s[i + 1] == '.' and s[i + 2] == '.')
ok = true;
for (int i = a; i + 1 < c; ++i)
if (s[i] == '#' and s[i + 1] == '#')
ok = false;
for (int i = b; i + 1 < d; ++i)
if (s[i] == '#' and s[i + 1] == '#')
ok = false;
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;
--a, --b, --c, --d;
if (c < d) {
bool ok = true;
for (int i = b; i + 1 < d; ++i)
if (s[i] == '#' and s[i + 1] == '#')
ok = false;
for (int i = a; i + 1 < c; ++i)
if (s[i] == '#' and s[i + 1] == '#')
ok = false;
cout << (ok ? "Yes" : "No") << endl;
} else {
bool ok = false;
for (int i = b - 1; i + 2 <= d + 1; ++i)
if (s[i] == '.' and s[i + 1] == '.' and s[i + 2] == '.')
ok = true;
for (int i = a; i + 1 < c; ++i)
if (s[i] == '#' and s[i + 1] == '#')
ok = false;
for (int i = b; i + 1 < d; ++i)
if (s[i] == '#' and s[i + 1] == '#')
ok = false;
cout << (ok ? "Yes" : "No") << endl;
}
}
| [
"control_flow.loop.for.condition.change",
"control_flow.branch.if.condition.change",
"misc.off_by_one"
] | 832,291 | 832,290 | u503549962 | cpp |
p03017 | #include <algorithm>
#include <iostream>
#include <math.h>
#include <string>
#include <vector>
using namespace std;
int N, A, B, C, D, judg = 0;
string S;
int main() {
cin >> N >> A >> B >> C >> D >> S;
int i, K;
if (D < C)
K = C;
if (D > C)
K = D;
for (i = A; i < K - 1; i++) {
if (S[i] == '#' && S[i + 1] == '#')
judg = 1;
}
if (judg == 0 && D < C) {
judg = 1;
for (i = B; i < D - 2; i++) {
if (S[i] == '.' && S[i + 1] == '.' && S[i + 2] == '.')
judg = 0;
}
if (judg == 1) {
if (S[D - 2] == '.' && S[D] == '.')
judg = 0;
if (S[B - 2] == '.' && S[B] == '.')
judg = 0;
}
}
if (judg == 0)
cout << "Yes" << endl;
if (judg == 1)
cout << "No" << endl;
return 0;
}
| #include <algorithm>
#include <iostream>
#include <math.h>
#include <string>
#include <vector>
using namespace std;
int N, A, B, C, D, judg = 0;
string S;
int main() {
cin >> N >> A >> B >> C >> D >> S;
int i, K;
if (D < C)
K = C;
if (D > C)
K = D;
for (i = A; i < K - 1; i++) {
if (S[i] == '#' && S[i + 1] == '#')
judg = 1;
}
if (judg == 0 && D < C) {
judg = 1;
for (i = B - 1; i < D - 2; i++) {
if (S[i] == '.' && S[i + 1] == '.' && S[i + 2] == '.')
judg = 0;
}
if (judg == 1) {
if (S[D - 2] == '.' && S[D] == '.')
judg = 0;
if (S[B - 2] == '.' && S[B] == '.')
judg = 0;
}
}
if (judg == 0)
cout << "Yes" << endl;
if (judg == 1)
cout << "No" << endl;
return 0;
}
| [
"control_flow.loop.for.initializer.change",
"assignment.change"
] | 832,292 | 832,293 | u839537391 | cpp |
p03017 | #include <bits/stdc++.h>
using namespace std;
char s[200005];
int main() {
int n;
int a, b, c, d;
scanf("%d", &n);
scanf("%d%d%d%d", &a, &b, &c, &d);
scanf("%s", s + 1);
int flag = 0;
for (int i = a + 2; i <= c - 1; i++) {
if (s[i] == '#' && s[i - 1] == '#')
flag = -1;
}
for (int i = b + 2; i <= d - 1; i++) {
if (s[i] == '#' && s[i - 1] == '#')
flag = -1;
}
if (flag == -1)
printf("No\n");
else if (c < d)
printf("Yes\n");
else if (c == d)
printf("No\n");
else {
for (int i = b; i <= c; i++) {
if (s[i - 1] == '.' && s[i] == '.' && s[i + 1] == '.') {
flag = 1;
}
}
if (flag == 1)
printf("Yes\n");
else
printf("No\n");
}
}
| #include <bits/stdc++.h>
using namespace std;
char s[200005];
int main() {
int n;
int a, b, c, d;
scanf("%d", &n);
scanf("%d%d%d%d", &a, &b, &c, &d);
scanf("%s", s + 1);
int flag = 0;
for (int i = a + 1; i <= c - 1; i++) {
if (s[i] == '#' && s[i - 1] == '#')
flag = -1;
}
for (int i = b + 1; i <= d - 1; i++) {
if (s[i] == '#' && s[i - 1] == '#')
flag = -1;
}
if (flag == -1)
printf("No\n");
else if (c < d)
printf("Yes\n");
else if (c == d)
printf("No\n");
else {
for (int i = b; i <= d; i++) {
if (s[i - 1] == '.' && s[i] == '.' && s[i + 1] == '.') {
flag = 1;
}
}
if (flag == 1)
printf("Yes\n");
else
printf("No\n");
}
}
| [
"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"
] | 832,303 | 832,304 | u818518063 | cpp |
p03017 | #include <cmath>
#include <cstring>
#include <iostream>
using namespace std;
int main() {
int n, a, b, c, d;
cin >> n >> a >> b >> c >> d;
string s;
cin >> s;
int dis = 1;
if (c > d) {
for (int i = b - 1; i < c; i++)
if (s[i - 1] == '.' && s[i] == '.' && s[i + 1] == '.') {
dis = 1;
break;
} else {
dis = 0;
}
}
int e;
e = max(c, d);
for (int i = a - 1; i < e - 1; i++) {
if (s[i] == '#' && s[i + 1] == '#') {
dis = 0;
}
}
if (dis) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
} | #include <cmath>
#include <cstring>
#include <iostream>
using namespace std;
int main() {
int n, a, b, c, d;
cin >> n >> a >> b >> c >> d;
string s;
cin >> s;
int dis = 1;
if (c > d) {
for (int i = b - 1; i < d; i++)
if (s[i - 1] == '.' && s[i] == '.' && s[i + 1] == '.') {
dis = 1;
break;
} else {
dis = 0;
}
}
int e;
e = max(c, d);
for (int i = a - 1; i < e - 1; i++) {
if (s[i] == '#' && s[i + 1] == '#') {
dis = 0;
}
}
if (dis) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
} | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 832,305 | 832,306 | u093744128 | cpp |
p03017 | #include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
#define int long long
typedef vector<int> VI;
typedef pair<int, int> pii;
#define fore(i, a) for (auto &i : a)
#define REP(i, n) for (int i = 0; i < n; i++)
#define eREP(i, n) for (int i = 0; i <= n; i++)
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define eFOR(i, a, b) for (int i = (a); i <= (b); ++i)
#define SORT(c) sort((c).begin(), (c).end())
#define rSORT(c) sort((c).rbegin(), (c).rend())
#define LB(x, a) lower_bound((x).begin(), (x).end(), (a))
#define UB(x, a) upper_bound((x).begin(), (x).end(), (a))
#define INF 1000000000
#define LLINF 9223372036854775807
#define mod 1000000007
// vector<vector<int> > dp;
// vector<vector<vector<int> > > vvvi;
// dp=vector<vector<int> >(N, vector<int>(M,0));
// vector<pair<int,int> > v;
// v.push_back(make_pair(x,y));
// priority_queue<int,vector<int>, greater<int> > q2;
signed main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N, A, B, C, D;
string S;
cin >> N >> A >> B >> C >> D;
cin >> S;
bool F = true;
bool K = false;
if (B < C && B < D && C < D) {
// cout << "KOO" << endl;
FOR(i, B - 1, D - 1) {
if (S[i] == S[i + 1] && S[i] == '#') {
F = false;
}
}
S[D - 1] = '#';
FOR(i, A - 1, C - 1) {
if (S[i] == S[i + 1] && S[i] == '#') {
F = false;
}
}
} else if (B < C && B < D && D < C) {
FOR(i, A - 1, C - 1) {
if (S[i] == S[i + 1] && S[i] == '#') {
F = false;
}
}
FOR(i, B - 2, D - 2) {
if (S[i] == S[i + 1] && S[i + 2] == S[i] && S[i] == '.') {
K = true;
}
}
if (!K)
F = false;
} else {
FOR(i, A - 1, C - 1) {
if (S[i] == S[i + 1] && S[i] == '#') {
F = false;
}
}
FOR(i, B - 1, D - 1) {
if (S[i] == S[i + 1] && S[i] == '#') {
F = false;
}
}
}
if (!F) {
cout << "No" << endl;
} else {
cout << "Yes" << endl;
}
return 0;
}
| #include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
#define int long long
typedef vector<int> VI;
typedef pair<int, int> pii;
#define fore(i, a) for (auto &i : a)
#define REP(i, n) for (int i = 0; i < n; i++)
#define eREP(i, n) for (int i = 0; i <= n; i++)
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define eFOR(i, a, b) for (int i = (a); i <= (b); ++i)
#define SORT(c) sort((c).begin(), (c).end())
#define rSORT(c) sort((c).rbegin(), (c).rend())
#define LB(x, a) lower_bound((x).begin(), (x).end(), (a))
#define UB(x, a) upper_bound((x).begin(), (x).end(), (a))
#define INF 1000000000
#define LLINF 9223372036854775807
#define mod 1000000007
// vector<vector<int> > dp;
// vector<vector<vector<int> > > vvvi;
// dp=vector<vector<int> >(N, vector<int>(M,0));
// vector<pair<int,int> > v;
// v.push_back(make_pair(x,y));
// priority_queue<int,vector<int>, greater<int> > q2;
signed main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N, A, B, C, D;
string S;
cin >> N >> A >> B >> C >> D;
cin >> S;
bool F = true;
bool K = false;
if (B < C && B < D && C < D) {
// cout << "KOO" << endl;
FOR(i, B - 1, D - 1) {
if (S[i] == S[i + 1] && S[i] == '#') {
F = false;
}
}
S[D - 1] = '#';
FOR(i, A - 1, C - 1) {
if (S[i] == S[i + 1] && S[i] == '#') {
F = false;
}
}
} else if (B < C && B < D && D < C) {
FOR(i, A - 1, C - 1) {
if (S[i] == S[i + 1] && S[i] == '#') {
F = false;
}
}
FOR(i, B - 2, D - 1) {
if (S[i] == S[i + 1] && S[i + 2] == S[i] && S[i] == '.') {
K = true;
}
}
if (!K)
F = false;
} else {
FOR(i, A - 1, C - 1) {
if (S[i] == S[i + 1] && S[i] == '#') {
F = false;
}
}
FOR(i, B - 1, D - 1) {
if (S[i] == S[i + 1] && S[i] == '#') {
F = false;
}
}
}
if (!F) {
cout << "No" << endl;
} else {
cout << "Yes" << endl;
}
return 0;
}
| [
"literal.number.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 832,314 | 832,315 | u266643907 | cpp |
p03017 | #include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
#define int long long
typedef vector<int> VI;
typedef pair<int, int> pii;
#define fore(i, a) for (auto &i : a)
#define REP(i, n) for (int i = 0; i < n; i++)
#define eREP(i, n) for (int i = 0; i <= n; i++)
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define eFOR(i, a, b) for (int i = (a); i <= (b); ++i)
#define SORT(c) sort((c).begin(), (c).end())
#define rSORT(c) sort((c).rbegin(), (c).rend())
#define LB(x, a) lower_bound((x).begin(), (x).end(), (a))
#define UB(x, a) upper_bound((x).begin(), (x).end(), (a))
#define INF 1000000000
#define LLINF 9223372036854775807
#define mod 1000000007
// vector<vector<int> > dp;
// vector<vector<vector<int> > > vvvi;
// dp=vector<vector<int> >(N, vector<int>(M,0));
// vector<pair<int,int> > v;
// v.push_back(make_pair(x,y));
// priority_queue<int,vector<int>, greater<int> > q2;
signed main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N, A, B, C, D;
string S;
cin >> N >> A >> B >> C >> D;
cin >> S;
bool F = true;
bool K = false;
if (B < C && B < D && C < D) {
// cout << "KOO" << endl;
FOR(i, B - 1, D - 1) {
if (S[i] == S[i + 1] && S[i] == '#') {
F = false;
}
}
S[D - 1] = '#';
FOR(i, A - 1, C - 1) {
if (S[i] == S[i + 1] && S[i] == '#') {
F = false;
}
}
} else if (B < C && B < D && D < C) {
FOR(i, A - 1, C - 1) {
if (S[i] == S[i + 1] && S[i] == '#') {
F = false;
}
}
FOR(i, B - 1, D - 2) {
if (S[i] == S[i + 1] && S[i + 2] == S[i] && S[i] == '.') {
K = true;
}
}
if (!K)
F = false;
} else {
FOR(i, A - 1, C - 1) {
if (S[i] == S[i + 1] && S[i] == '#') {
F = false;
}
}
FOR(i, B - 1, D - 1) {
if (S[i] == S[i + 1] && S[i] == '#') {
F = false;
}
}
}
if (!F) {
cout << "No" << endl;
} else {
cout << "Yes" << endl;
}
return 0;
}
| #include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
#define int long long
typedef vector<int> VI;
typedef pair<int, int> pii;
#define fore(i, a) for (auto &i : a)
#define REP(i, n) for (int i = 0; i < n; i++)
#define eREP(i, n) for (int i = 0; i <= n; i++)
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define eFOR(i, a, b) for (int i = (a); i <= (b); ++i)
#define SORT(c) sort((c).begin(), (c).end())
#define rSORT(c) sort((c).rbegin(), (c).rend())
#define LB(x, a) lower_bound((x).begin(), (x).end(), (a))
#define UB(x, a) upper_bound((x).begin(), (x).end(), (a))
#define INF 1000000000
#define LLINF 9223372036854775807
#define mod 1000000007
// vector<vector<int> > dp;
// vector<vector<vector<int> > > vvvi;
// dp=vector<vector<int> >(N, vector<int>(M,0));
// vector<pair<int,int> > v;
// v.push_back(make_pair(x,y));
// priority_queue<int,vector<int>, greater<int> > q2;
signed main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N, A, B, C, D;
string S;
cin >> N >> A >> B >> C >> D;
cin >> S;
bool F = true;
bool K = false;
if (B < C && B < D && C < D) {
// cout << "KOO" << endl;
FOR(i, B - 1, D - 1) {
if (S[i] == S[i + 1] && S[i] == '#') {
F = false;
}
}
S[D - 1] = '#';
FOR(i, A - 1, C - 1) {
if (S[i] == S[i + 1] && S[i] == '#') {
F = false;
}
}
} else if (B < C && B < D && D < C) {
FOR(i, A - 1, C - 1) {
if (S[i] == S[i + 1] && S[i] == '#') {
F = false;
}
}
FOR(i, B - 2, D - 1) {
if (S[i] == S[i + 1] && S[i + 2] == S[i] && S[i] == '.') {
K = true;
}
}
if (!K)
F = false;
} else {
FOR(i, A - 1, C - 1) {
if (S[i] == S[i + 1] && S[i] == '#') {
F = false;
}
}
FOR(i, B - 1, D - 1) {
if (S[i] == S[i + 1] && S[i] == '#') {
F = false;
}
}
}
if (!F) {
cout << "No" << endl;
} else {
cout << "Yes" << endl;
}
return 0;
}
| [
"literal.number.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 832,316 | 832,315 | u266643907 | cpp |
p03017 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < int(n); ++i)
int n, a, b, c, d;
string s;
bool solve() {
rep(i, n - 1) {
if (s[i] == '#' && s[i + 1] == '#') {
if (a < i && i < c)
return false;
if (b < i && i < d)
return false;
}
}
if (c < d)
return true;
for (int i = b; i < d; i++) {
if (s[i - 1] == '.' && s[i] == '.' && s[i + 1] == '.')
return true;
}
return false;
}
int main(void) {
cin >> n >> a >> b >> c >> d;
cin >> s;
a--, b--, c--, d--;
cout << ((solve()) ? "Yes" : "No") << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < int(n); ++i)
int n, a, b, c, d;
string s;
bool solve() {
rep(i, n - 1) {
if (s[i] == '#' && s[i + 1] == '#') {
if (a < i && i < c)
return false;
if (b < i && i < d)
return false;
}
}
if (c < d)
return true;
for (int i = b; i <= d; i++) {
if (s[i - 1] == '.' && s[i] == '.' && s[i + 1] == '.')
return true;
}
return false;
}
int main(void) {
cin >> n >> a >> b >> c >> d;
cin >> s;
a--, b--, c--, d--;
cout << ((solve()) ? "Yes" : "No") << endl;
return 0;
}
| [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 832,326 | 832,327 | u241615199 | cpp |
p03017 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < int(n); ++i)
int n, a, b, c, d;
string s;
bool solve() {
rep(i, n - 1) {
if (s[i] == '#' && s[i + 1] == '#') {
if (a < i && i < c)
return false;
if (b < i && i < d)
return false;
}
}
if (c < d)
return true;
for (int i = b; i < n - 1; i++) {
if (s[i - 1] == '.' && s[i] == '.' && s[i + 1] == '.')
return true;
}
return false;
}
int main(void) {
cin >> n >> a >> b >> c >> d;
cin >> s;
a--, b--, c--, d--;
cout << ((solve()) ? "Yes" : "No") << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < int(n); ++i)
int n, a, b, c, d;
string s;
bool solve() {
rep(i, n - 1) {
if (s[i] == '#' && s[i + 1] == '#') {
if (a < i && i < c)
return false;
if (b < i && i < d)
return false;
}
}
if (c < d)
return true;
for (int i = b; i <= d; i++) {
if (s[i - 1] == '.' && s[i] == '.' && s[i + 1] == '.')
return true;
}
return false;
}
int main(void) {
cin >> n >> a >> b >> c >> d;
cin >> s;
a--, b--, c--, d--;
cout << ((solve()) ? "Yes" : "No") << endl;
return 0;
}
| [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 832,328 | 832,327 | u241615199 | cpp |
p03017 | #include <bits/stdc++.h>
using namespace std;
bool isChangeble(int start, int goal, string s) {
int p = start;
int num = 0;
while (p < goal) {
if (s[p] == '.') {
num += 1;
p += 1;
if (num == 3) {
return true;
}
continue;
} else {
num = 0;
p += 1;
continue;
}
}
return false;
}
bool isDoubleSharpe(int start, int goal, string s) {
int p = start;
int num = 0;
while (p < goal) {
if (s[p] == '#') {
num += 1;
p += 1;
if (num == 2) {
return true;
}
continue;
} else {
num = 0;
p += 1;
}
}
return false;
}
int main() {
int n, a, b, c, d;
cin >> n >> a >> b >> c >> d;
a -= 1;
b -= 1;
c -= 1;
d -= 1;
string s;
cin >> s;
if (isDoubleSharpe(a, max(c, d), s)) {
cout << "No" << endl;
} else if (d < c && (s[d - 1] == '#' || s[d + 1] == '#') &&
!isChangeble(b - 1, d, s)) {
cout << "No" << endl;
} else {
cout << "Yes" << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
bool isChangeble(int start, int goal, string s) {
int p = start;
int num = 0;
while (p < goal) {
if (s[p] == '.') {
num += 1;
p += 1;
if (num == 3) {
return true;
}
continue;
} else {
num = 0;
p += 1;
continue;
}
}
return false;
}
bool isDoubleSharpe(int start, int goal, string s) {
int p = start;
int num = 0;
while (p < goal) {
if (s[p] == '#') {
num += 1;
p += 1;
if (num == 2) {
return true;
}
continue;
} else {
num = 0;
p += 1;
}
}
return false;
}
int main() {
int n, a, b, c, d;
cin >> n >> a >> b >> c >> d;
a -= 1;
b -= 1;
c -= 1;
d -= 1;
string s;
cin >> s;
if (isDoubleSharpe(a, max(c, d), s)) {
cout << "No" << endl;
} else if (d < c && (s[d - 1] == '#' || s[d + 1] == '#') &&
!isChangeble(b - 1, d + 1, s)) {
cout << "No" << endl;
} else {
cout << "Yes" << endl;
}
} | [
"control_flow.branch.if.condition.change"
] | 832,329 | 832,330 | u679245300 | cpp |
p03017 | #include <bits/stdc++.h>
using namespace std;
bool isChangeble(int start, int goal, string s) {
int p = start;
int num = 0;
while (p < goal) {
if (s[p] == '.') {
num += 1;
p += 1;
if (num == 3) {
return true;
}
continue;
} else {
num = 0;
p += 1;
continue;
}
}
return false;
}
bool isDoubleSharpe(int start, int goal, string s) {
int p = start;
int num = 0;
while (p < goal) {
if (s[p] == '#') {
num += 1;
p += 1;
if (num == 2) {
return true;
}
continue;
} else {
num = 0;
p += 1;
}
}
return false;
}
int main() {
int n, a, b, c, d;
cin >> n >> a >> b >> c >> d;
a -= 1;
b -= 1;
c -= 1;
d -= 1;
string s;
cin >> s;
if (isDoubleSharpe(a, max(c, d), s)) {
cout << "No" << endl;
} else if (d < c && (s[d - 1] == '#' || s[d + 1] == '#') &&
!isChangeble(a, d, s)) {
cout << "No" << endl;
} else {
cout << "Yes" << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
bool isChangeble(int start, int goal, string s) {
int p = start;
int num = 0;
while (p < goal) {
if (s[p] == '.') {
num += 1;
p += 1;
if (num == 3) {
return true;
}
continue;
} else {
num = 0;
p += 1;
continue;
}
}
return false;
}
bool isDoubleSharpe(int start, int goal, string s) {
int p = start;
int num = 0;
while (p < goal) {
if (s[p] == '#') {
num += 1;
p += 1;
if (num == 2) {
return true;
}
continue;
} else {
num = 0;
p += 1;
}
}
return false;
}
int main() {
int n, a, b, c, d;
cin >> n >> a >> b >> c >> d;
a -= 1;
b -= 1;
c -= 1;
d -= 1;
string s;
cin >> s;
if (isDoubleSharpe(a, max(c, d), s)) {
cout << "No" << endl;
} else if (d < c && (s[d - 1] == '#' || s[d + 1] == '#') &&
!isChangeble(b - 1, d + 1, s)) {
cout << "No" << endl;
} else {
cout << "Yes" << endl;
}
} | [
"control_flow.branch.if.condition.change"
] | 832,331 | 832,330 | u679245300 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.