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 | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(vec) vec.begin(), vec.end()
typedef long long ll;
typedef pair<ll, ll> pll;
typedef pair<int, int> pii;
const ll mod = 1e9 + 7;
const int inf = 1 << 30;
int main() {
int n, a, b, c, d;
cin >> n >> a >> b >> c >> d;
a--;
b--;
c--;
d--;
string s;
cin >> s;
bool f = 0;
rep(i, n) {
if (a < i && i + 1 < c && s[i] == '#' && s[i + 1] == '#') {
cout << "No" << endl;
return 0;
}
if (b < i && i + 1 < d && s[i] == '#' && s[i + 1] == '#') {
cout << "No" << endl;
return 0;
}
if (i + 2 < n && b - 1 <= i && i <= d && s[i] == '.' && s[i + 1] == '.' &&
s[i + 2] == '.') {
f = 1;
}
}
if (c > d && f == 0) {
cout << "No" << endl;
return 0;
}
cout << "Yes" << endl;
} | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(vec) vec.begin(), vec.end()
typedef long long ll;
typedef pair<ll, ll> pll;
typedef pair<int, int> pii;
const ll mod = 1e9 + 7;
const int inf = 1 << 30;
int main() {
int n, a, b, c, d;
cin >> n >> a >> b >> c >> d;
a--;
b--;
c--;
d--;
string s;
cin >> s;
bool f = 0;
rep(i, n) {
if (a < i && i + 1 < c && s[i] == '#' && s[i + 1] == '#') {
cout << "No" << endl;
return 0;
}
if (b < i && i + 1 < d && s[i] == '#' && s[i + 1] == '#') {
cout << "No" << endl;
return 0;
}
if (i + 2 < n && b - 1 <= i && i < d && s[i] == '.' && s[i + 1] == '.' &&
s[i + 2] == '.') {
f = 1;
}
}
if (c > d && f == 0) {
cout << "No" << endl;
return 0;
}
cout << "Yes" << endl;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 830,304 | 830,305 | u136342563 | cpp |
p03017 | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <stack>
#include <string>
#include <vector>
#define rep(i, j, n) for (i = j; i < (n); i++)
#define rrep(i, j, n) for (i = j; i > (n); i--)
typedef long long int lli;
#define N 1000000007
using namespace std;
// lli gcd(lli a,lli b){
// lli x,y;
// x=max(a,b);
// y=min(a,b);
// if(x%y==0){
// return y;
// }
// else{
// return gcd(y,x%y);
// }
//}
//
// lli lcm(lli a,lli b){
// lli x,y;
// x=max(a,b);
// y=min(a,b);
// return x*y/gcd(x,y);
//}
int main() {
lli n, a, b, c, d;
string s, ans = "Yes", t;
lli i, j;
cin >> n >> a >> b >> c >> d >> s;
if (s.find("##") != string::npos) {
if (((s.find("##") > a - 1) && (s.find("##") < c - 1)) ||
((s.find("##") > b - 1) && (s.find("##") < d - 1))) {
ans = "No";
}
} else {
if (((b - a) * (d - c)) < 0) {
if (s.find("...") == string::npos) {
ans = "No";
} else {
t = s.substr(b - 2, d - b);
if (t.find("...") == string::npos) {
ans = "No";
}
}
}
}
cout << ans << endl;
}
| #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <stack>
#include <string>
#include <vector>
#define rep(i, j, n) for (i = j; i < (n); i++)
#define rrep(i, j, n) for (i = j; i > (n); i--)
typedef long long int lli;
#define N 1000000007
using namespace std;
// lli gcd(lli a,lli b){
// lli x,y;
// x=max(a,b);
// y=min(a,b);
// if(x%y==0){
// return y;
// }
// else{
// return gcd(y,x%y);
// }
//}
//
// lli lcm(lli a,lli b){
// lli x,y;
// x=max(a,b);
// y=min(a,b);
// return x*y/gcd(x,y);
//}
int main() {
lli n, a, b, c, d;
string s, ans = "Yes", t;
lli i, j;
cin >> n >> a >> b >> c >> d >> s;
if (s.find("##") != string::npos) {
if (((s.find("##") > a - 1) && (s.find("##") < c - 1)) ||
((s.find("##") > b - 1) && (s.find("##") < d - 1))) {
ans = "No";
}
} else {
if (((b - a) * (d - c)) < 0) {
if (s.find("...") == string::npos) {
ans = "No";
} else {
t = s.substr(b - 2, d - b + 3);
if (t.find("...") == string::npos) {
ans = "No";
}
}
}
}
cout << ans << endl;
}
| [
"assignment.change"
] | 830,308 | 830,309 | u744607340 | cpp |
p03017 | #include <algorithm>
#include <array>
#include <cstdio>
#include <cstring>
#include <deque>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef vector<ll> vec;
typedef vector<vector<ll>> mat;
int main() {
int N, A, B, C, D;
cin >> N >> A >> B >> C >> D;
string S;
cin >> S;
if (C < D) {
int i = A;
while (i < D - 1) {
if (S[i] == '#' && S[i + 1] == '#') {
cout << "No" << endl;
return 0;
}
i++;
}
cout << "Yes" << endl;
return 0;
} else {
int i = A;
while (i < C - 1) {
if (S[i] == '#' && S[i + 1] == '#') {
cout << "No" << endl;
return 0;
}
i++;
}
int j = B - 1;
while (j < D - 2) {
if (S[j] == '.' && S[j + 1] == '.' && S[j + 2] == '.') {
cout << "Yes" << endl;
return 0;
}
j++;
}
cout << "No" << endl;
return 0;
}
return 0;
} | #include <algorithm>
#include <array>
#include <cstdio>
#include <cstring>
#include <deque>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef vector<ll> vec;
typedef vector<vector<ll>> mat;
int main() {
int N, A, B, C, D;
cin >> N >> A >> B >> C >> D;
string S;
cin >> S;
if (C < D) {
int i = A;
while (i < D - 1) {
if (S[i] == '#' && S[i + 1] == '#') {
cout << "No" << endl;
return 0;
}
i++;
}
cout << "Yes" << endl;
return 0;
} else {
int i = A;
while (i < C - 1) {
if (S[i] == '#' && S[i + 1] == '#') {
cout << "No" << endl;
return 0;
}
i++;
}
int j = B - 2;
while (j < D - 1) {
if (S[j] == '.' && S[j + 1] == '.' && S[j + 2] == '.') {
cout << "Yes" << endl;
return 0;
}
j++;
}
cout << "No" << endl;
return 0;
}
return 0;
} | [
"literal.number.change",
"expression.operation.binary.change",
"control_flow.loop.condition.change"
] | 830,320 | 830,321 | u215268883 | cpp |
p03017 | #include <algorithm>
#include <bitset>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
int main() {
int N, A, B, C, D;
cin >> N >> A >> B >> C >> D;
string S;
cin >> S;
bool z = 1;
if (C < D) {
for (int i = A; i < D; i++) {
if (S[i] == '#' && S[i - 1] == '#') {
z = 0;
break;
}
}
if (z == 1)
cout << "Yes" << endl;
else
cout << "No" << endl;
} else {
bool d = 0;
for (int i = A; i < C; i++) {
if (S[i] == '#' && S[i - 1] == '#') {
z = 0;
break;
}
}
for (int i = B - 1; i < D - 1; i++) {
if (S[i - 1] == S[i] && S[i] == S[i + 1] && S[i] == '.')
d = 1;
}
if (z == 1 && d == 1)
cout << "Yes" << endl;
else
cout << "No" << endl;
}
}
| #include <algorithm>
#include <bitset>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
int main() {
int N, A, B, C, D;
cin >> N >> A >> B >> C >> D;
string S;
cin >> S;
bool z = 1;
if (C < D) {
for (int i = A; i < D; i++) {
if (S[i] == '#' && S[i - 1] == '#') {
z = 0;
break;
}
}
if (z == 1)
cout << "Yes" << endl;
else
cout << "No" << endl;
} else {
bool d = 0;
for (int i = A; i < C; i++) {
if (S[i] == '#' && S[i - 1] == '#') {
z = 0;
break;
}
}
for (int i = B - 1; i < D; i++) {
if (S[i - 1] == S[i] && S[i] == S[i + 1] && S[i] == '.')
d = 1;
}
if (z == 1 && d == 1)
cout << "Yes" << endl;
else
cout << "No" << endl;
}
}
| [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 830,322 | 830,323 | u252348942 | cpp |
p03017 | #include <bits/stdc++.h>
using namespace std;
using i64 = int_fast64_t;
#define rep(i, N) for (int(i) = 0; (i) < (N); (i)++)
#define all(v) (v).begin(), (v).end()
#define eb emplace_back
int main() {
int N, A, B, C, D;
string S;
cin >> N >> A >> B >> C >> D >> S;
A--, B--, C--, D--;
bool ok = true;
for (int i = A; i < C; i++) {
if (S[i] == S[i + 1] && S[i] == '#')
ok = false;
}
for (int i = B; i < D; i++) {
if (S[i] == S[i + 1] && S[i] == '#')
ok = false;
}
if (C > D) {
bool pass = false;
for (int i = B; i < D - 1; i++) {
if (S[i] == S[i + 1] && S[i] == S[i + 2] && S[i] == '.')
pass = true;
}
if (pass == false)
ok = false;
}
if (ok)
cout << "Yes" << endl;
else
cout << "No" << endl;
} | #include <bits/stdc++.h>
using namespace std;
using i64 = int_fast64_t;
#define rep(i, N) for (int(i) = 0; (i) < (N); (i)++)
#define all(v) (v).begin(), (v).end()
#define eb emplace_back
int main() {
int N, A, B, C, D;
string S;
cin >> N >> A >> B >> C >> D >> S;
A--, B--, C--, D--;
bool ok = true;
for (int i = A; i < C; i++) {
if (S[i] == S[i + 1] && S[i] == '#')
ok = false;
}
for (int i = B; i < D; i++) {
if (S[i] == S[i + 1] && S[i] == '#')
ok = false;
}
if (C > D) {
bool pass = false;
for (int i = B - 1; i < D; i++) {
if (S[i] == S[i + 1] && S[i] == S[i + 2] && S[i] == '.')
pass = true;
}
if (pass == false)
ok = false;
}
if (ok)
cout << "Yes" << endl;
else
cout << "No" << endl;
} | [
"control_flow.loop.for.initializer.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 830,326 | 830,327 | u031178961 | cpp |
p03017 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll n, a, b, c, d;
string s;
cin >> n >> a >> b >> c >> d >> s;
if ((b < c && c < d) || c < b) {
ll cnt = 0;
for (int i = b - 1; i < d; i++) {
if (s[i] == '#') {
cnt++;
if (cnt >= 2) {
cout << "No";
return 0;
}
} else
cnt = 0;
}
cnt = 0;
for (int i = a - 1; i < c; i++) {
if (s[i] == '#') {
cnt++;
if (cnt >= 2) {
cout << "No";
return 0;
}
} else
cnt = 0;
}
}
if (d < c) {
ll cnt = 0;
bool f = 0;
for (int i = b; i < d; i++) {
if (s[i] == '.') {
cnt++;
if (cnt >= 3) {
f = 1;
}
} else
cnt = 0;
}
if (!f) {
cout << "No";
return 0;
}
cnt = 0;
for (int i = a - 1; i < c; i++) {
if (s[i] == '#') {
cnt++;
if (cnt >= 2) {
cout << "No";
return 0;
}
} else
cnt = 0;
}
}
cout << "Yes";
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll n, a, b, c, d;
string s;
cin >> n >> a >> b >> c >> d >> s;
if ((b < c && c < d) || c < b) {
ll cnt = 0;
for (int i = b - 1; i < d; i++) {
if (s[i] == '#') {
cnt++;
if (cnt >= 2) {
cout << "No";
return 0;
}
} else
cnt = 0;
}
cnt = 0;
for (int i = a - 1; i < c; i++) {
if (s[i] == '#') {
cnt++;
if (cnt >= 2) {
cout << "No";
return 0;
}
} else
cnt = 0;
}
}
if (d < c) {
ll cnt = 0;
bool f = 0;
for (int i = b - 2; i <= d; i++) {
if (s[i] == '.') {
cnt++;
if (cnt >= 3) {
f = 1;
}
} else
cnt = 0;
}
if (!f) {
cout << "No";
return 0;
}
cnt = 0;
for (int i = a - 1; i < c; i++) {
if (s[i] == '#') {
cnt++;
if (cnt >= 2) {
cout << "No";
return 0;
}
} else
cnt = 0;
}
}
cout << "Yes";
return 0;
}
| [
"control_flow.loop.for.initializer.change",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 830,333 | 830,334 | u774202056 | cpp |
p03017 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll n, a, b, c, d;
string s;
cin >> n >> a >> b >> c >> d >> s;
if ((b < c && c < d) || c < b) {
ll cnt = 0;
for (int i = b - 1; i < d; i++) {
if (s[i] == '#') {
cnt++;
if (cnt >= 2) {
cout << "No";
return 0;
}
} else
cnt = 0;
}
cnt = 0;
for (int i = a - 1; i < c; i++) {
if (s[i] == '#') {
cnt++;
if (cnt >= 2) {
cout << "No";
return 0;
}
} else
cnt = 0;
}
}
if (d < c) {
ll cnt = 0;
// if(s[b]=='#'){
bool f = 0;
for (int i = b; i <= d; i++) {
if (s[i] == '.') {
cnt++;
if (cnt >= 3) {
f = 1;
}
} else
cnt = 0;
}
if (!f) {
cout << "No";
return 0;
}
//}
cnt = 0;
for (int i = a - 1; i < c; i++) {
if (s[i] == '#') {
cnt++;
if (cnt >= 2) {
cout << "No";
return 0;
}
} else
cnt = 0;
}
}
cout << "Yes";
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll n, a, b, c, d;
string s;
cin >> n >> a >> b >> c >> d >> s;
if ((b < c && c < d) || c < b) {
ll cnt = 0;
for (int i = b - 1; i < d; i++) {
if (s[i] == '#') {
cnt++;
if (cnt >= 2) {
cout << "No";
return 0;
}
} else
cnt = 0;
}
cnt = 0;
for (int i = a - 1; i < c; i++) {
if (s[i] == '#') {
cnt++;
if (cnt >= 2) {
cout << "No";
return 0;
}
} else
cnt = 0;
}
}
if (d < c) {
ll cnt = 0;
bool f = 0;
for (int i = b - 2; i <= d; i++) {
if (s[i] == '.') {
cnt++;
if (cnt >= 3) {
f = 1;
}
} else
cnt = 0;
}
if (!f) {
cout << "No";
return 0;
}
cnt = 0;
for (int i = a - 1; i < c; i++) {
if (s[i] == '#') {
cnt++;
if (cnt >= 2) {
cout << "No";
return 0;
}
} else
cnt = 0;
}
}
cout << "Yes";
return 0;
}
| [
"control_flow.loop.for.initializer.change"
] | 830,335 | 830,334 | u774202056 | cpp |
p03017 | #include <bits/stdc++.h>
#define INF 1e9
using namespace std;
#define REPR(i, n) for (int i = (n); i >= 0; --i)
#define FOR(i, m, n) for (int i = (m); i < (n); ++i)
#define REP(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define ALL(a) (a).begin(), (a).end()
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return true;
}
return false;
}
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return true;
}
return false;
}
int gcd(int a, int b) { return b ? gcd(b, a % b) : a; }
typedef long long ll;
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
void solve() {
int N, A, B, C, D;
cin >> N >> A >> B >> C >> D;
string s;
cin >> s;
int len = 0;
FOR(i, A - 1, C) {
if (s[i] == '#')
len++;
else
len = 0;
if (len == 2) {
cout << "No" << endl;
exit(0);
}
}
len = 0;
FOR(i, B - 2, D + 1) {
if (s[i] == '#')
len++;
else
len = 0;
if (len == 2) {
cout << "No" << endl;
exit(0);
}
}
if (C > D) {
len = 0;
FOR(i, B - 1, D + 1) {
if (s[i] == '.')
len++;
else
len = 0;
if (len == 3) {
cout << "Yes" << endl;
exit(0);
}
}
cout << "No" << endl;
exit(0);
}
cout << "Yes" << endl;
}
int main() {
solve();
return 0;
}
| #include <bits/stdc++.h>
#define INF 1e9
using namespace std;
#define REPR(i, n) for (int i = (n); i >= 0; --i)
#define FOR(i, m, n) for (int i = (m); i < (n); ++i)
#define REP(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define ALL(a) (a).begin(), (a).end()
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return true;
}
return false;
}
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return true;
}
return false;
}
int gcd(int a, int b) { return b ? gcd(b, a % b) : a; }
typedef long long ll;
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
void solve() {
int N, A, B, C, D;
cin >> N >> A >> B >> C >> D;
string s;
cin >> s;
int len = 0;
FOR(i, A - 1, C) {
if (s[i] == '#')
len++;
else
len = 0;
if (len == 2) {
cout << "No" << endl;
exit(0);
}
}
len = 0;
FOR(i, B - 1, D + 1) {
if (s[i] == '#')
len++;
else
len = 0;
if (len == 2) {
cout << "No" << endl;
exit(0);
}
}
if (C > D) {
len = 0;
FOR(i, B - 2, D + 1) {
if (s[i] == '.')
len++;
else
len = 0;
if (len == 3) {
cout << "Yes" << endl;
exit(0);
}
}
cout << "No" << endl;
exit(0);
}
cout << "Yes" << endl;
}
int main() {
solve();
return 0;
}
| [
"literal.number.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 830,341 | 830,342 | u492030100 | cpp |
p03017 | #include <bits/stdc++.h>
#define INF 1e9
using namespace std;
#define REPR(i, n) for (int i = (n); i >= 0; --i)
#define FOR(i, m, n) for (int i = (m); i < (n); ++i)
#define REP(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define ALL(a) (a).begin(), (a).end()
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return true;
}
return false;
}
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return true;
}
return false;
}
int gcd(int a, int b) { return b ? gcd(b, a % b) : a; }
typedef long long ll;
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
void solve() {
int N, A, B, C, D;
cin >> N >> A >> B >> C >> D;
string s;
cin >> s;
int len = 0;
FOR(i, A - 1, C) {
if (s[i] == '#')
len++;
else
len = 0;
if (len == 2) {
cout << "No" << endl;
exit(0);
}
}
len = 0;
FOR(i, B - 1, D) {
if (s[i] == '#')
len++;
else
len = 0;
if (len == 2) {
cout << "No" << endl;
exit(0);
}
}
if (C > D) {
len = 0;
FOR(i, B - 1, D + 1) {
if (s[i] == '.')
len++;
else
len = 0;
if (len == 3) {
cout << "Yes" << endl;
exit(0);
}
}
cout << "No" << endl;
exit(0);
}
cout << "Yes" << endl;
}
int main() {
solve();
return 0;
}
| #include <bits/stdc++.h>
#define INF 1e9
using namespace std;
#define REPR(i, n) for (int i = (n); i >= 0; --i)
#define FOR(i, m, n) for (int i = (m); i < (n); ++i)
#define REP(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define ALL(a) (a).begin(), (a).end()
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return true;
}
return false;
}
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return true;
}
return false;
}
int gcd(int a, int b) { return b ? gcd(b, a % b) : a; }
typedef long long ll;
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
void solve() {
int N, A, B, C, D;
cin >> N >> A >> B >> C >> D;
string s;
cin >> s;
int len = 0;
FOR(i, A - 1, C) {
if (s[i] == '#')
len++;
else
len = 0;
if (len == 2) {
cout << "No" << endl;
exit(0);
}
}
len = 0;
FOR(i, B - 1, D + 1) {
if (s[i] == '#')
len++;
else
len = 0;
if (len == 2) {
cout << "No" << endl;
exit(0);
}
}
if (C > D) {
len = 0;
FOR(i, B - 2, D + 1) {
if (s[i] == '.')
len++;
else
len = 0;
if (len == 3) {
cout << "Yes" << endl;
exit(0);
}
}
cout << "No" << endl;
exit(0);
}
cout << "Yes" << endl;
}
int main() {
solve();
return 0;
}
| [
"literal.number.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 830,343 | 830,342 | u492030100 | cpp |
p03017 | #include <bits/stdc++.h>
#define INF 1e9
using namespace std;
#define REPR(i, n) for (int i = (n); i >= 0; --i)
#define FOR(i, m, n) for (int i = (m); i < (n); ++i)
#define REP(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define ALL(a) (a).begin(), (a).end()
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return true;
}
return false;
}
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return true;
}
return false;
}
int gcd(int a, int b) { return b ? gcd(b, a % b) : a; }
typedef long long ll;
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
void solve() {
int N, A, B, C, D;
cin >> N >> A >> B >> C >> D;
string s;
cin >> s;
int len = 0;
FOR(i, A - 1, C) {
if (s[i] == '#')
len++;
else
len = 0;
if (len == 2) {
cout << "No" << endl;
exit(0);
}
}
len = 0;
FOR(i, B - 1, D) {
if (s[i] == '#')
len++;
else
len = 0;
if (len == 2) {
cout << "No" << endl;
exit(0);
}
}
if (C > D) {
len = 0;
FOR(i, B - 1, D) {
if (s[i] == '.')
len++;
else
len = 0;
if (len == 3) {
cout << "Yes" << endl;
exit(0);
}
}
cout << "No" << endl;
exit(0);
}
cout << "Yes" << endl;
}
int main() {
solve();
return 0;
}
| #include <bits/stdc++.h>
#define INF 1e9
using namespace std;
#define REPR(i, n) for (int i = (n); i >= 0; --i)
#define FOR(i, m, n) for (int i = (m); i < (n); ++i)
#define REP(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define ALL(a) (a).begin(), (a).end()
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return true;
}
return false;
}
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return true;
}
return false;
}
int gcd(int a, int b) { return b ? gcd(b, a % b) : a; }
typedef long long ll;
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
void solve() {
int N, A, B, C, D;
cin >> N >> A >> B >> C >> D;
string s;
cin >> s;
int len = 0;
FOR(i, A - 1, C) {
if (s[i] == '#')
len++;
else
len = 0;
if (len == 2) {
cout << "No" << endl;
exit(0);
}
}
len = 0;
FOR(i, B - 1, D + 1) {
if (s[i] == '#')
len++;
else
len = 0;
if (len == 2) {
cout << "No" << endl;
exit(0);
}
}
if (C > D) {
len = 0;
FOR(i, B - 2, D + 1) {
if (s[i] == '.')
len++;
else
len = 0;
if (len == 3) {
cout << "Yes" << endl;
exit(0);
}
}
cout << "No" << endl;
exit(0);
}
cout << "Yes" << endl;
}
int main() {
solve();
return 0;
}
| [
"literal.number.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 830,344 | 830,342 | u492030100 | cpp |
p03017 | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define INF LLONG_MAX / 10
#define rep(i, n) for (int i = 0; i < n; i++)
#define krep(i, k, n, m) for (int i = k; i < n; i += m)
#define erep(i, k, n) for (int i = k; i < n; i++)
#define mod 1000000007
//最大公約数
int gcd(int s, int b) {
if (b == 0)
return s;
return gcd(b, s % b);
}
signed main() {
int n, a, b, c, d;
cin >> n >> a >> b >> c >> d;
string s;
cin >> s;
if (c < d) {
for (int i = a - 1; i < d - 1; i++) {
if (s[i] == '#' && s[i + 1] == '#') {
cout << "No" << endl;
return 0;
}
}
cout << "Yes" << endl;
} else {
for (int i = a - 1; i < c - 1; i++) {
if (s[i] == '#' && s[i + 1] == '#') {
cout << "No" << endl;
return 0;
}
}
for (int i = b - 2; i < d - 1; i++) {
if (s[i - 1] == '.' && s[i] == '.' && s[i + 1] == '.') {
cout << "Yes" << endl;
return 0;
}
}
cout << "No" << endl;
}
}
| #include <bits/stdc++.h>
using namespace std;
#define int long long
#define INF LLONG_MAX / 10
#define rep(i, n) for (int i = 0; i < n; i++)
#define krep(i, k, n, m) for (int i = k; i < n; i += m)
#define erep(i, k, n) for (int i = k; i < n; i++)
#define mod 1000000007
//最大公約数
int gcd(int s, int b) {
if (b == 0)
return s;
return gcd(b, s % b);
}
signed main() {
int n, a, b, c, d;
cin >> n >> a >> b >> c >> d;
string s;
cin >> s;
if (c < d) {
for (int i = a - 1; i < d - 1; i++) {
if (s[i] == '#' && s[i + 1] == '#') {
cout << "No" << endl;
return 0;
}
}
cout << "Yes" << endl;
} else {
for (int i = a - 1; i < c - 1; i++) {
if (s[i] == '#' && s[i + 1] == '#') {
cout << "No" << endl;
return 0;
}
}
for (int i = b - 1; i < d; i++) {
if (s[i - 1] == '.' && s[i] == '.' && s[i + 1] == '.') {
cout << "Yes" << endl;
return 0;
}
}
cout << "No" << endl;
}
}
| [
"literal.number.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"expression.operation.binary.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 830,355 | 830,356 | u686352452 | cpp |
p03017 |
#include <algorithm>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
const ll MOD_CONST = 1000000007;
const ll BIG_NUM = 1000000000000000000;
const int BIG_INT = 1000000000;
int main() {
int n, a, b, c, d;
cin >> n >> a >> b >> c >> d;
a--;
b--;
c--;
d--;
string s;
cin >> s;
bool canRace = true;
for (int i = a; i < c; i++) {
if (s[i] == '#' && s[i + 1] == '#') {
canRace = false;
}
}
for (int i = b; i < d; i++) {
if (s[i] == '#' && s[i + 1] == '#') {
canRace = false;
}
}
if (d < c) {
bool canBeyond = false;
for (int i = b; i < c; i++) {
if (s[i - 1] == '.' && s[i] == '.' && s[i + 1] == '.') {
canBeyond = true;
}
}
if (!canBeyond) {
canRace = false;
}
}
cout << (canRace ? "Yes" : "No") << endl;
}
|
#include <algorithm>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
const ll MOD_CONST = 1000000007;
const ll BIG_NUM = 1000000000000000000;
const int BIG_INT = 1000000000;
int main() {
int n, a, b, c, d;
cin >> n >> a >> b >> c >> d;
a--;
b--;
c--;
d--;
string s;
cin >> s;
bool canRace = true;
for (int i = a; i < c; i++) {
if (s[i] == '#' && s[i + 1] == '#') {
canRace = false;
}
}
for (int i = b; i < d; i++) {
if (s[i] == '#' && s[i + 1] == '#') {
canRace = false;
}
}
if (d < c) {
bool canBeyond = false;
for (int i = b; i <= d; i++) {
if (s[i - 1] == '.' && s[i] == '.' && s[i + 1] == '.') {
canBeyond = true;
}
}
if (!canBeyond) {
canRace = false;
}
}
cout << (canRace ? "Yes" : "No") << endl;
}
| [
"control_flow.loop.for.condition.change"
] | 830,361 | 830,362 | u156778176 | cpp |
p03017 | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define fi first
#define se second
#define mp make_pair
#define all(x) (x).begin(), (x).end()
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define repp(i, a, b) for (int i = a; i <= (b); ++i)
#define repr(i, a, b) for (int i = a; i >= (b); --i)
#define bit(n) (1LL << (n))
#define len(x) ((ll)(x).size())
#define debug(var) cout << "[" << #var << "]\n" << var << endl
typedef long long ll;
const int INF = 1001001001;
const ll LINF = 1001001001001001001ll;
const int MOD = 1000000007;
const double EPS = 1e-9;
template <typename T> ostream &operator<<(ostream &s, const vector<T> &v) {
int len = v.size();
for (int i = 0; i < len; ++i) {
s << v[i];
if (i < len - 1)
s << ' ';
}
return s;
}
template <typename T>
ostream &operator<<(ostream &s, const vector<vector<T>> &vv) {
int len = vv.size();
for (int i = 0; i < len; ++i) {
s << vv[i];
if (i != len - 1)
s << '\n';
}
return s;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
__attribute__((constructor)) void initial() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
cout << fixed << setprecision(15);
}
bool ok(string &S, int l, int r) {
repp(i, l, r - 1) {
if (S[i] == S[i + 1] && S[i + 1] == '#')
return false;
}
return true;
}
bool triple(string &S, int l, int r) {
repp(i, l, r - 2) {
if (S[i] == S[i + 1] && S[i + 1] == S[i + 2] && S[i] == '.')
return true;
}
return false;
}
signed main() {
int N;
cin >> N;
int A, B;
cin >> A >> B;
A--, B--;
int C, D;
cin >> C >> D;
C--, D--;
string S;
cin >> S;
if (C < D) {
if (ok(S, B, D) && ok(S, A, C))
cout << "Yes\n";
else
cout << "No\n";
} else {
if (ok(S, B, D) && ok(S, A, C) && triple(S, B, D))
cout << "Yes\n";
else
cout << "No\n";
}
} | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define fi first
#define se second
#define mp make_pair
#define all(x) (x).begin(), (x).end()
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define repp(i, a, b) for (int i = a; i <= (b); ++i)
#define repr(i, a, b) for (int i = a; i >= (b); --i)
#define bit(n) (1LL << (n))
#define len(x) ((ll)(x).size())
#define debug(var) cout << "[" << #var << "]\n" << var << endl
typedef long long ll;
const int INF = 1001001001;
const ll LINF = 1001001001001001001ll;
const int MOD = 1000000007;
const double EPS = 1e-9;
template <typename T> ostream &operator<<(ostream &s, const vector<T> &v) {
int len = v.size();
for (int i = 0; i < len; ++i) {
s << v[i];
if (i < len - 1)
s << ' ';
}
return s;
}
template <typename T>
ostream &operator<<(ostream &s, const vector<vector<T>> &vv) {
int len = vv.size();
for (int i = 0; i < len; ++i) {
s << vv[i];
if (i != len - 1)
s << '\n';
}
return s;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
__attribute__((constructor)) void initial() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
cout << fixed << setprecision(15);
}
bool ok(string &S, int l, int r) {
repp(i, l, r - 1) {
if (S[i] == S[i + 1] && S[i + 1] == '#')
return false;
}
return true;
}
bool triple(string &S, int l, int r) {
repp(i, l - 1, r - 1) {
if (S[i] == S[i + 1] && S[i + 1] == S[i + 2] && S[i] == '.')
return true;
}
return false;
}
signed main() {
int N;
cin >> N;
int A, B;
cin >> A >> B;
A--, B--;
int C, D;
cin >> C >> D;
C--, D--;
string S;
cin >> S;
if (C < D) {
if (ok(S, B, D) && ok(S, A, C))
cout << "Yes\n";
else
cout << "No\n";
} else {
if (ok(S, B, D) && ok(S, A, C) && triple(S, B, D))
cout << "Yes\n";
else
cout << "No\n";
}
} | [
"literal.number.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 830,366 | 830,367 | u995725911 | cpp |
p03017 | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define double long double
#define fo(a, b) for (int a = 0; a < b; a++)
#define Sort(a) sort(a.begin(), a.end())
#define rev(a) reverse(a.begin(), a.end())
#define fi first
#define se second
#define sz size()
#define bgn begin()
#define en end()
#define pb push_back
#define pp() pop_back()
#define V vector
#define P pair
#define yuko(a) setprecision(a)
#define uni(a) a.erase(unique(a.begin(), a.end()), a.end())
#define Q queue
#define pri priority_queue
#define Pri priority_queue<int, vector<int>, greater<int>>
#define PriP \
priority_queue<P<int, int>, vector<P<int, int>>, greater<P<int, int>>>
#define ff first.first
#define fs first.second
#define sf second.first
#define ss second.second
#define all(a) (a).begin(), (a).end()
#define elif else if
int low(V<int> a, int b) {
decltype(a)::iterator c = lower_bound(a.begin(), a.end(), b);
int d = c - a.bgn;
return d;
}
int upp(V<int> a, int b) {
decltype(a)::iterator c = upper_bound(a.begin(), a.end(), b);
int d = c - a.bgn;
return d;
}
template <class T> void cou(vector<vector<T>> a) {
int b = a.size();
int c = a[0].size();
fo(i, b) {
fo(j, c) {
cout << a[i][j];
if (j == c - 1)
cout << endl;
else
cout << ' ';
}
}
}
int wari(int a, int b) {
if (a % b == 0)
return a / b;
else
return a / b + 1;
}
int keta(int a) {
double b = a;
b = log10(b);
int c = b;
return c + 1;
}
int souwa(int a) { return a * (a + 1) / 2; }
int gcm(int a, int b) {
if (a % b == 0)
return b;
return gcm(b, a % b);
}
bool prime(int a) {
if (a < 2)
return false;
else if (a == 2)
return true;
else if (a % 2 == 0)
return false;
for (int i = 3; i <= sqrt(a) + 1; i += 2) {
if (a % i == 0)
return false;
}
return true;
}
struct Union {
vector<int> par;
Union(int a) { par = vector<int>(a, -1); }
int find(int a) {
if (par[a] < 0)
return a;
else
return par[a] = find(par[a]);
}
bool same(int a, int b) { return find(a) == find(b); }
int Size(int a) { return -par[find(a)]; }
void unite(int a, int b) {
a = find(a);
b = find(b);
if (a == b)
return;
if (Size(b) > Size(a))
swap<int>(a, b);
par[a] += par[b];
par[b] = a;
}
};
int ketas(int a) {
string b = to_string(a);
int c = 0;
fo(i, keta(a)) { c += b[i] - '0'; }
return c;
}
bool fe(int a, int b) {
a %= 10;
b %= 10;
if (a == 0)
a = 10;
if (b == 0)
b = 10;
if (a > b)
return true;
else
return false;
}
int INF = 1000000007;
struct edge {
int s, t, d;
};
V<int> mojisyu(string a) {
V<int> b(26, 0);
fo(i, a.sz) { b[a[i] - 'a']++; }
return b;
}
int wa2(int a) {
if (a % 2 == 1)
return a / 2;
return a / 2 - 1;
}
/*signed main(){
int a,b,c;
cin>>a>>b>>c;
V<V<edge>> d(a);
fo(i,b){
edge e;
cin>>e.s>>e.t>>e.d;
d[e.s].pb(e);
}
V<int> e(a,INF);
e[c]=0;
priority_queue<P<int,int>,V<P<int,int>>,greater<P<int,int>>> f;
f.push({0,c});
int h=INF;
while(!f.empty()){
P<int,int> g;
g=f.top();
f.pop();
int v = g.second, i = g.first;
for(edge l : d[v]){
if(e[l.t] > i + l.d){
e[l.t] = i + l.d;
f.push({i+l.d , l.t});
}
}
}
fo(i,a){
if(e[i]==INF)
cout<<"INF"<<endl;
else
cout<<e[i]<<endl;
}
}
?*/
int nCr(int n, int r) {
if (n < r)
return 0;
int a = 1;
r = min(r, n - r);
for (int i = n; i > n - r; i--) {
a *= i;
a /= n - i + 1;
}
return a;
}
/*void sea(int x,int y){
if(x<0||a<=x||y<0||b<=y||c[x][y]=='#')
return;
if(d[x][y])
return;
d[x][y]++;
sea(x+1,y);
sea(x-1,y);
sea(x,y+1);
sea(x,y-1);
}*/
int kaijou(int a) {
int b = 1;
fo(i, a) b *= i + 1;
return b;
}
int nPr(int a, int b) {
if (a < b)
return 0;
if (b == 0)
return 1;
int c = 1;
for (int i = a; i > a - b; i--) {
c *= i;
c %= INF;
}
return c;
}
int modinv(int a, int m) {
int b = m, u = 1, v = 0;
while (b) {
int t = a / b;
a -= t * b;
swap(a, b);
u -= t * v;
swap(u, v);
}
u %= m;
if (u < 0)
u += m;
return u;
}
int lcm(int a, int b) {
int c = modinv(gcm(a, b), INF);
return ((a * c) % INF) * (b % INF) % INF;
}
int MOD = INF;
int fac[1000010], finv[1000010], inv[1000010];
// テーブルを作る前処理
//先にCOMinit()で前処理をする
// ABC145D
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < 1000010; i++) {
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
// 二項係数計算
int COM(int n, int k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
bool naka(int a, int b, V<V<char>> c) {
return (a >= 0 && b >= 0 && a < c.sz && b < c[0].sz);
}
V<P<int, int>> mawari8 = {{0, -1}, {0, 1}, {1, 0}, {-1, 0},
{-1, -1}, {1, 1}, {1, -1}, {-1, -1}};
int inf = 1000000000000000007;
/*
signed main(){
int a,b,c;
cin>>a>>b>>c;
V<V<edge>> d(a);
fo(i,b){
edge e;
cin>>e.s>>e.t>>e.d;
d[e.s].pb(e);
}
V<int> e(a,INF);
e[c]=0;
priority_queue<P<int,int>,V<P<int,int>>,greater<P<int,int>>> f;
f.push({0,c});
int h=INF;
while(!f.empty()){
P<int,int> g;
g=f.top();
f.pop();
int v = g.second, i = g.first;
for(edge l : d[v]){
if(e[l.t] > i + l.d){
e[l.t] = i + l.d;
f.push({i+l.d , l.t});
}
}
}
fo(i,a){
if(e[i]==INF)
cout<<"INF"<<endl;
else
cout<<e[i]<<endl;
}
}*/
V<P<int, int>> mawari4 = {{0, -1}, {0, 1}, {1, 0}, {-1, 0}};
//最短経路の表 a(全部INFで初期化)
//縦横 x,y
//迷路 f
//スタートsx,sy
//ゴールgx,gy
//文字はgから使おうね
/*int bfs_haba(){
Q<P<int,int>> b;
a[sx][sy]=0;
b.push({sx,sy});
while(!b.empty()){
P<int,int> c=b.front();
b.pop();
if(c.fi==gx&&c.se==gy){
break;
}
fo(i,4){
int d=c.fi+mawari4[i].fi;
int e=c.se+mawari4[i].se;
if(0<=d&&0<=e&&d<x&&e<y&&f[d][e]!='#'&&a[d][e]==INF){
b.push({d,e});
a[d][e]=1+a[c.fi][c.se];
}
}
}
return a[gx][gy];
}*/
V<int> onajibubun(string a) {
V<int> b(a.sz);
for (int i = 1, j = 0; i < a.sz; i++) {
if (i + b[i - j] < j + b[j])
b[i] = b[i - j];
else {
int c = max<int>(0, j + b[j] - i);
while (i + c < a.sz && a[c] == a[i + c])
c++;
b[i] = c;
j = i;
}
}
b[0] = a.sz;
return b;
}
//各頂点ごとにどこに辺が出てるかの表がc
//各頂点ごとの色を表すV<int>(頂点数max)のcolorを用意する
// aはどこ塗るか、bは何で塗るかなので、(0,1,c)でよぶとおけ
V<int> color(205);
bool nibu_hantei(int a, int b, V<V<int>> c) {
color[a] = b;
fo(i, c[a].sz) {
if (b == color[c[a][i]])
return false;
if (color[c[a][i]] == 0 && !nibu_hantei(c[a][i], -b, c))
return false;
}
return true;
}
// aは頂点数
// nibu_hanteiの上にcolorを用意する
//各頂点ごとにどこに辺が出てるかの表がc
bool renketujanai_nibu_hantei(int a, V<V<int>> c) {
fo(i, a) {
if (color[i] == 0) {
if (!nibu_hantei(i, 1, c))
return false;
}
}
return true;
}
int uk1(string a, int b) {
int c = 0;
int d = pow(9, b);
for (int i = b; i < a.sz; i++) {
c += d * nCr(i - 1, b - 1);
}
if (a.sz >= b) {
if (b == 1) {
c += a[0] - '0';
}
}
return c;
}
int uk2(string a, int b) {
int c = 0;
int d = pow(9, b);
for (int i = b; i < a.sz; i++) {
c += d * nCr(i - 1, b - 1);
}
if (a.sz >= b) {
if (b == 2) {
c += ((a[0] - '0') - 1) * 9 * nCr(a.sz - 1, 1);
c += 1 * (a[1] - '0');
if (a.sz > 2)
c += uk1(a.substr(2), 1);
}
}
return c;
}
signed main() {
int a, b, c, d, e;
cin >> a >> b >> c >> d >> e;
string f;
cin >> f;
for (int i = b - 1; i < max(d - 1, e - 1); i++) {
if (f[i] == f[i + 1] && f[i] == '#') {
cout << "No" << endl;
return 0;
}
}
if (d < e) {
cout << "Yes" << endl;
return 0;
}
for (int i = c - 3; i < d - 1; i++) {
if (f[i] == f[i + 1] && f[i] == f[i + 2] && f[i] == '.') {
cout << "Yes" << endl;
return 0;
}
}
cout << "No" << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define double long double
#define fo(a, b) for (int a = 0; a < b; a++)
#define Sort(a) sort(a.begin(), a.end())
#define rev(a) reverse(a.begin(), a.end())
#define fi first
#define se second
#define sz size()
#define bgn begin()
#define en end()
#define pb push_back
#define pp() pop_back()
#define V vector
#define P pair
#define yuko(a) setprecision(a)
#define uni(a) a.erase(unique(a.begin(), a.end()), a.end())
#define Q queue
#define pri priority_queue
#define Pri priority_queue<int, vector<int>, greater<int>>
#define PriP \
priority_queue<P<int, int>, vector<P<int, int>>, greater<P<int, int>>>
#define ff first.first
#define fs first.second
#define sf second.first
#define ss second.second
#define all(a) (a).begin(), (a).end()
#define elif else if
int low(V<int> a, int b) {
decltype(a)::iterator c = lower_bound(a.begin(), a.end(), b);
int d = c - a.bgn;
return d;
}
int upp(V<int> a, int b) {
decltype(a)::iterator c = upper_bound(a.begin(), a.end(), b);
int d = c - a.bgn;
return d;
}
template <class T> void cou(vector<vector<T>> a) {
int b = a.size();
int c = a[0].size();
fo(i, b) {
fo(j, c) {
cout << a[i][j];
if (j == c - 1)
cout << endl;
else
cout << ' ';
}
}
}
int wari(int a, int b) {
if (a % b == 0)
return a / b;
else
return a / b + 1;
}
int keta(int a) {
double b = a;
b = log10(b);
int c = b;
return c + 1;
}
int souwa(int a) { return a * (a + 1) / 2; }
int gcm(int a, int b) {
if (a % b == 0)
return b;
return gcm(b, a % b);
}
bool prime(int a) {
if (a < 2)
return false;
else if (a == 2)
return true;
else if (a % 2 == 0)
return false;
for (int i = 3; i <= sqrt(a) + 1; i += 2) {
if (a % i == 0)
return false;
}
return true;
}
struct Union {
vector<int> par;
Union(int a) { par = vector<int>(a, -1); }
int find(int a) {
if (par[a] < 0)
return a;
else
return par[a] = find(par[a]);
}
bool same(int a, int b) { return find(a) == find(b); }
int Size(int a) { return -par[find(a)]; }
void unite(int a, int b) {
a = find(a);
b = find(b);
if (a == b)
return;
if (Size(b) > Size(a))
swap<int>(a, b);
par[a] += par[b];
par[b] = a;
}
};
int ketas(int a) {
string b = to_string(a);
int c = 0;
fo(i, keta(a)) { c += b[i] - '0'; }
return c;
}
bool fe(int a, int b) {
a %= 10;
b %= 10;
if (a == 0)
a = 10;
if (b == 0)
b = 10;
if (a > b)
return true;
else
return false;
}
int INF = 1000000007;
struct edge {
int s, t, d;
};
V<int> mojisyu(string a) {
V<int> b(26, 0);
fo(i, a.sz) { b[a[i] - 'a']++; }
return b;
}
int wa2(int a) {
if (a % 2 == 1)
return a / 2;
return a / 2 - 1;
}
/*signed main(){
int a,b,c;
cin>>a>>b>>c;
V<V<edge>> d(a);
fo(i,b){
edge e;
cin>>e.s>>e.t>>e.d;
d[e.s].pb(e);
}
V<int> e(a,INF);
e[c]=0;
priority_queue<P<int,int>,V<P<int,int>>,greater<P<int,int>>> f;
f.push({0,c});
int h=INF;
while(!f.empty()){
P<int,int> g;
g=f.top();
f.pop();
int v = g.second, i = g.first;
for(edge l : d[v]){
if(e[l.t] > i + l.d){
e[l.t] = i + l.d;
f.push({i+l.d , l.t});
}
}
}
fo(i,a){
if(e[i]==INF)
cout<<"INF"<<endl;
else
cout<<e[i]<<endl;
}
}
?*/
int nCr(int n, int r) {
if (n < r)
return 0;
int a = 1;
r = min(r, n - r);
for (int i = n; i > n - r; i--) {
a *= i;
a /= n - i + 1;
}
return a;
}
/*void sea(int x,int y){
if(x<0||a<=x||y<0||b<=y||c[x][y]=='#')
return;
if(d[x][y])
return;
d[x][y]++;
sea(x+1,y);
sea(x-1,y);
sea(x,y+1);
sea(x,y-1);
}*/
int kaijou(int a) {
int b = 1;
fo(i, a) b *= i + 1;
return b;
}
int nPr(int a, int b) {
if (a < b)
return 0;
if (b == 0)
return 1;
int c = 1;
for (int i = a; i > a - b; i--) {
c *= i;
c %= INF;
}
return c;
}
int modinv(int a, int m) {
int b = m, u = 1, v = 0;
while (b) {
int t = a / b;
a -= t * b;
swap(a, b);
u -= t * v;
swap(u, v);
}
u %= m;
if (u < 0)
u += m;
return u;
}
int lcm(int a, int b) {
int c = modinv(gcm(a, b), INF);
return ((a * c) % INF) * (b % INF) % INF;
}
int MOD = INF;
int fac[1000010], finv[1000010], inv[1000010];
// テーブルを作る前処理
//先にCOMinit()で前処理をする
// ABC145D
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < 1000010; i++) {
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
// 二項係数計算
int COM(int n, int k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
bool naka(int a, int b, V<V<char>> c) {
return (a >= 0 && b >= 0 && a < c.sz && b < c[0].sz);
}
V<P<int, int>> mawari8 = {{0, -1}, {0, 1}, {1, 0}, {-1, 0},
{-1, -1}, {1, 1}, {1, -1}, {-1, -1}};
int inf = 1000000000000000007;
/*
signed main(){
int a,b,c;
cin>>a>>b>>c;
V<V<edge>> d(a);
fo(i,b){
edge e;
cin>>e.s>>e.t>>e.d;
d[e.s].pb(e);
}
V<int> e(a,INF);
e[c]=0;
priority_queue<P<int,int>,V<P<int,int>>,greater<P<int,int>>> f;
f.push({0,c});
int h=INF;
while(!f.empty()){
P<int,int> g;
g=f.top();
f.pop();
int v = g.second, i = g.first;
for(edge l : d[v]){
if(e[l.t] > i + l.d){
e[l.t] = i + l.d;
f.push({i+l.d , l.t});
}
}
}
fo(i,a){
if(e[i]==INF)
cout<<"INF"<<endl;
else
cout<<e[i]<<endl;
}
}*/
V<P<int, int>> mawari4 = {{0, -1}, {0, 1}, {1, 0}, {-1, 0}};
//最短経路の表 a(全部INFで初期化)
//縦横 x,y
//迷路 f
//スタートsx,sy
//ゴールgx,gy
//文字はgから使おうね
/*int bfs_haba(){
Q<P<int,int>> b;
a[sx][sy]=0;
b.push({sx,sy});
while(!b.empty()){
P<int,int> c=b.front();
b.pop();
if(c.fi==gx&&c.se==gy){
break;
}
fo(i,4){
int d=c.fi+mawari4[i].fi;
int e=c.se+mawari4[i].se;
if(0<=d&&0<=e&&d<x&&e<y&&f[d][e]!='#'&&a[d][e]==INF){
b.push({d,e});
a[d][e]=1+a[c.fi][c.se];
}
}
}
return a[gx][gy];
}*/
V<int> onajibubun(string a) {
V<int> b(a.sz);
for (int i = 1, j = 0; i < a.sz; i++) {
if (i + b[i - j] < j + b[j])
b[i] = b[i - j];
else {
int c = max<int>(0, j + b[j] - i);
while (i + c < a.sz && a[c] == a[i + c])
c++;
b[i] = c;
j = i;
}
}
b[0] = a.sz;
return b;
}
//各頂点ごとにどこに辺が出てるかの表がc
//各頂点ごとの色を表すV<int>(頂点数max)のcolorを用意する
// aはどこ塗るか、bは何で塗るかなので、(0,1,c)でよぶとおけ
V<int> color(205);
bool nibu_hantei(int a, int b, V<V<int>> c) {
color[a] = b;
fo(i, c[a].sz) {
if (b == color[c[a][i]])
return false;
if (color[c[a][i]] == 0 && !nibu_hantei(c[a][i], -b, c))
return false;
}
return true;
}
// aは頂点数
// nibu_hanteiの上にcolorを用意する
//各頂点ごとにどこに辺が出てるかの表がc
bool renketujanai_nibu_hantei(int a, V<V<int>> c) {
fo(i, a) {
if (color[i] == 0) {
if (!nibu_hantei(i, 1, c))
return false;
}
}
return true;
}
int uk1(string a, int b) {
int c = 0;
int d = pow(9, b);
for (int i = b; i < a.sz; i++) {
c += d * nCr(i - 1, b - 1);
}
if (a.sz >= b) {
if (b == 1) {
c += a[0] - '0';
}
}
return c;
}
int uk2(string a, int b) {
int c = 0;
int d = pow(9, b);
for (int i = b; i < a.sz; i++) {
c += d * nCr(i - 1, b - 1);
}
if (a.sz >= b) {
if (b == 2) {
c += ((a[0] - '0') - 1) * 9 * nCr(a.sz - 1, 1);
c += 1 * (a[1] - '0');
if (a.sz > 2)
c += uk1(a.substr(2), 1);
}
}
return c;
}
signed main() {
int a, b, c, d, e;
cin >> a >> b >> c >> d >> e;
string f;
cin >> f;
for (int i = b - 1; i < max(d - 1, e - 1); i++) {
if (f[i] == f[i + 1] && f[i] == '#') {
cout << "No" << endl;
return 0;
}
}
if (d < e) {
cout << "Yes" << endl;
return 0;
}
for (int i = c - 2; i < e - 1; i++) {
if (f[i] == f[i + 1] && f[i] == f[i + 2] && f[i] == '.') {
cout << "Yes" << endl;
return 0;
}
}
cout << "No" << endl;
} | [
"literal.number.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"expression.operation.binary.change",
"identifier.change",
"control_flow.loop.for.condition.change"
] | 830,370 | 830,371 | u322177979 | cpp |
p03017 | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define double long double
#define fo(a, b) for (int a = 0; a < b; a++)
#define Sort(a) sort(a.begin(), a.end())
#define rev(a) reverse(a.begin(), a.end())
#define fi first
#define se second
#define sz size()
#define bgn begin()
#define en end()
#define pb push_back
#define pp() pop_back()
#define V vector
#define P pair
#define yuko(a) setprecision(a)
#define uni(a) a.erase(unique(a.begin(), a.end()), a.end())
#define Q queue
#define pri priority_queue
#define Pri priority_queue<int, vector<int>, greater<int>>
#define PriP \
priority_queue<P<int, int>, vector<P<int, int>>, greater<P<int, int>>>
#define ff first.first
#define fs first.second
#define sf second.first
#define ss second.second
#define all(a) (a).begin(), (a).end()
#define elif else if
int low(V<int> a, int b) {
decltype(a)::iterator c = lower_bound(a.begin(), a.end(), b);
int d = c - a.bgn;
return d;
}
int upp(V<int> a, int b) {
decltype(a)::iterator c = upper_bound(a.begin(), a.end(), b);
int d = c - a.bgn;
return d;
}
template <class T> void cou(vector<vector<T>> a) {
int b = a.size();
int c = a[0].size();
fo(i, b) {
fo(j, c) {
cout << a[i][j];
if (j == c - 1)
cout << endl;
else
cout << ' ';
}
}
}
int wari(int a, int b) {
if (a % b == 0)
return a / b;
else
return a / b + 1;
}
int keta(int a) {
double b = a;
b = log10(b);
int c = b;
return c + 1;
}
int souwa(int a) { return a * (a + 1) / 2; }
int gcm(int a, int b) {
if (a % b == 0)
return b;
return gcm(b, a % b);
}
bool prime(int a) {
if (a < 2)
return false;
else if (a == 2)
return true;
else if (a % 2 == 0)
return false;
for (int i = 3; i <= sqrt(a) + 1; i += 2) {
if (a % i == 0)
return false;
}
return true;
}
struct Union {
vector<int> par;
Union(int a) { par = vector<int>(a, -1); }
int find(int a) {
if (par[a] < 0)
return a;
else
return par[a] = find(par[a]);
}
bool same(int a, int b) { return find(a) == find(b); }
int Size(int a) { return -par[find(a)]; }
void unite(int a, int b) {
a = find(a);
b = find(b);
if (a == b)
return;
if (Size(b) > Size(a))
swap<int>(a, b);
par[a] += par[b];
par[b] = a;
}
};
int ketas(int a) {
string b = to_string(a);
int c = 0;
fo(i, keta(a)) { c += b[i] - '0'; }
return c;
}
bool fe(int a, int b) {
a %= 10;
b %= 10;
if (a == 0)
a = 10;
if (b == 0)
b = 10;
if (a > b)
return true;
else
return false;
}
int INF = 1000000007;
struct edge {
int s, t, d;
};
V<int> mojisyu(string a) {
V<int> b(26, 0);
fo(i, a.sz) { b[a[i] - 'a']++; }
return b;
}
int wa2(int a) {
if (a % 2 == 1)
return a / 2;
return a / 2 - 1;
}
/*signed main(){
int a,b,c;
cin>>a>>b>>c;
V<V<edge>> d(a);
fo(i,b){
edge e;
cin>>e.s>>e.t>>e.d;
d[e.s].pb(e);
}
V<int> e(a,INF);
e[c]=0;
priority_queue<P<int,int>,V<P<int,int>>,greater<P<int,int>>> f;
f.push({0,c});
int h=INF;
while(!f.empty()){
P<int,int> g;
g=f.top();
f.pop();
int v = g.second, i = g.first;
for(edge l : d[v]){
if(e[l.t] > i + l.d){
e[l.t] = i + l.d;
f.push({i+l.d , l.t});
}
}
}
fo(i,a){
if(e[i]==INF)
cout<<"INF"<<endl;
else
cout<<e[i]<<endl;
}
}
?*/
int nCr(int n, int r) {
if (n < r)
return 0;
int a = 1;
r = min(r, n - r);
for (int i = n; i > n - r; i--) {
a *= i;
a /= n - i + 1;
}
return a;
}
/*void sea(int x,int y){
if(x<0||a<=x||y<0||b<=y||c[x][y]=='#')
return;
if(d[x][y])
return;
d[x][y]++;
sea(x+1,y);
sea(x-1,y);
sea(x,y+1);
sea(x,y-1);
}*/
int kaijou(int a) {
int b = 1;
fo(i, a) b *= i + 1;
return b;
}
int nPr(int a, int b) {
if (a < b)
return 0;
if (b == 0)
return 1;
int c = 1;
for (int i = a; i > a - b; i--) {
c *= i;
c %= INF;
}
return c;
}
int modinv(int a, int m) {
int b = m, u = 1, v = 0;
while (b) {
int t = a / b;
a -= t * b;
swap(a, b);
u -= t * v;
swap(u, v);
}
u %= m;
if (u < 0)
u += m;
return u;
}
int lcm(int a, int b) {
int c = modinv(gcm(a, b), INF);
return ((a * c) % INF) * (b % INF) % INF;
}
int MOD = INF;
int fac[1000010], finv[1000010], inv[1000010];
// テーブルを作る前処理
//先にCOMinit()で前処理をする
// ABC145D
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < 1000010; i++) {
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
// 二項係数計算
int COM(int n, int k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
bool naka(int a, int b, V<V<char>> c) {
return (a >= 0 && b >= 0 && a < c.sz && b < c[0].sz);
}
V<P<int, int>> mawari8 = {{0, -1}, {0, 1}, {1, 0}, {-1, 0},
{-1, -1}, {1, 1}, {1, -1}, {-1, -1}};
int inf = 1000000000000000007;
/*
signed main(){
int a,b,c;
cin>>a>>b>>c;
V<V<edge>> d(a);
fo(i,b){
edge e;
cin>>e.s>>e.t>>e.d;
d[e.s].pb(e);
}
V<int> e(a,INF);
e[c]=0;
priority_queue<P<int,int>,V<P<int,int>>,greater<P<int,int>>> f;
f.push({0,c});
int h=INF;
while(!f.empty()){
P<int,int> g;
g=f.top();
f.pop();
int v = g.second, i = g.first;
for(edge l : d[v]){
if(e[l.t] > i + l.d){
e[l.t] = i + l.d;
f.push({i+l.d , l.t});
}
}
}
fo(i,a){
if(e[i]==INF)
cout<<"INF"<<endl;
else
cout<<e[i]<<endl;
}
}*/
V<P<int, int>> mawari4 = {{0, -1}, {0, 1}, {1, 0}, {-1, 0}};
//最短経路の表 a(全部INFで初期化)
//縦横 x,y
//迷路 f
//スタートsx,sy
//ゴールgx,gy
//文字はgから使おうね
/*int bfs_haba(){
Q<P<int,int>> b;
a[sx][sy]=0;
b.push({sx,sy});
while(!b.empty()){
P<int,int> c=b.front();
b.pop();
if(c.fi==gx&&c.se==gy){
break;
}
fo(i,4){
int d=c.fi+mawari4[i].fi;
int e=c.se+mawari4[i].se;
if(0<=d&&0<=e&&d<x&&e<y&&f[d][e]!='#'&&a[d][e]==INF){
b.push({d,e});
a[d][e]=1+a[c.fi][c.se];
}
}
}
return a[gx][gy];
}*/
V<int> onajibubun(string a) {
V<int> b(a.sz);
for (int i = 1, j = 0; i < a.sz; i++) {
if (i + b[i - j] < j + b[j])
b[i] = b[i - j];
else {
int c = max<int>(0, j + b[j] - i);
while (i + c < a.sz && a[c] == a[i + c])
c++;
b[i] = c;
j = i;
}
}
b[0] = a.sz;
return b;
}
//各頂点ごとにどこに辺が出てるかの表がc
//各頂点ごとの色を表すV<int>(頂点数max)のcolorを用意する
// aはどこ塗るか、bは何で塗るかなので、(0,1,c)でよぶとおけ
V<int> color(205);
bool nibu_hantei(int a, int b, V<V<int>> c) {
color[a] = b;
fo(i, c[a].sz) {
if (b == color[c[a][i]])
return false;
if (color[c[a][i]] == 0 && !nibu_hantei(c[a][i], -b, c))
return false;
}
return true;
}
// aは頂点数
// nibu_hanteiの上にcolorを用意する
//各頂点ごとにどこに辺が出てるかの表がc
bool renketujanai_nibu_hantei(int a, V<V<int>> c) {
fo(i, a) {
if (color[i] == 0) {
if (!nibu_hantei(i, 1, c))
return false;
}
}
return true;
}
int uk1(string a, int b) {
int c = 0;
int d = pow(9, b);
for (int i = b; i < a.sz; i++) {
c += d * nCr(i - 1, b - 1);
}
if (a.sz >= b) {
if (b == 1) {
c += a[0] - '0';
}
}
return c;
}
int uk2(string a, int b) {
int c = 0;
int d = pow(9, b);
for (int i = b; i < a.sz; i++) {
c += d * nCr(i - 1, b - 1);
}
if (a.sz >= b) {
if (b == 2) {
c += ((a[0] - '0') - 1) * 9 * nCr(a.sz - 1, 1);
c += 1 * (a[1] - '0');
if (a.sz > 2)
c += uk1(a.substr(2), 1);
}
}
return c;
}
signed main() {
int a, b, c, d, e;
cin >> a >> b >> c >> d >> e;
string f;
cin >> f;
for (int i = b - 1; i < max(d - 1, e - 1); i++) {
if (f[i] == f[i + 1] && f[i] == '#') {
cout << "No" << endl;
return 0;
}
}
if (d < e) {
cout << "Yes" << endl;
return 0;
}
for (int i = c - 2; i < d - 1; i++) {
if (f[i] == f[i + 1] && f[i] == f[i + 2] && f[i] == '.') {
cout << "Yes" << endl;
return 0;
}
}
cout << "No" << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define double long double
#define fo(a, b) for (int a = 0; a < b; a++)
#define Sort(a) sort(a.begin(), a.end())
#define rev(a) reverse(a.begin(), a.end())
#define fi first
#define se second
#define sz size()
#define bgn begin()
#define en end()
#define pb push_back
#define pp() pop_back()
#define V vector
#define P pair
#define yuko(a) setprecision(a)
#define uni(a) a.erase(unique(a.begin(), a.end()), a.end())
#define Q queue
#define pri priority_queue
#define Pri priority_queue<int, vector<int>, greater<int>>
#define PriP \
priority_queue<P<int, int>, vector<P<int, int>>, greater<P<int, int>>>
#define ff first.first
#define fs first.second
#define sf second.first
#define ss second.second
#define all(a) (a).begin(), (a).end()
#define elif else if
int low(V<int> a, int b) {
decltype(a)::iterator c = lower_bound(a.begin(), a.end(), b);
int d = c - a.bgn;
return d;
}
int upp(V<int> a, int b) {
decltype(a)::iterator c = upper_bound(a.begin(), a.end(), b);
int d = c - a.bgn;
return d;
}
template <class T> void cou(vector<vector<T>> a) {
int b = a.size();
int c = a[0].size();
fo(i, b) {
fo(j, c) {
cout << a[i][j];
if (j == c - 1)
cout << endl;
else
cout << ' ';
}
}
}
int wari(int a, int b) {
if (a % b == 0)
return a / b;
else
return a / b + 1;
}
int keta(int a) {
double b = a;
b = log10(b);
int c = b;
return c + 1;
}
int souwa(int a) { return a * (a + 1) / 2; }
int gcm(int a, int b) {
if (a % b == 0)
return b;
return gcm(b, a % b);
}
bool prime(int a) {
if (a < 2)
return false;
else if (a == 2)
return true;
else if (a % 2 == 0)
return false;
for (int i = 3; i <= sqrt(a) + 1; i += 2) {
if (a % i == 0)
return false;
}
return true;
}
struct Union {
vector<int> par;
Union(int a) { par = vector<int>(a, -1); }
int find(int a) {
if (par[a] < 0)
return a;
else
return par[a] = find(par[a]);
}
bool same(int a, int b) { return find(a) == find(b); }
int Size(int a) { return -par[find(a)]; }
void unite(int a, int b) {
a = find(a);
b = find(b);
if (a == b)
return;
if (Size(b) > Size(a))
swap<int>(a, b);
par[a] += par[b];
par[b] = a;
}
};
int ketas(int a) {
string b = to_string(a);
int c = 0;
fo(i, keta(a)) { c += b[i] - '0'; }
return c;
}
bool fe(int a, int b) {
a %= 10;
b %= 10;
if (a == 0)
a = 10;
if (b == 0)
b = 10;
if (a > b)
return true;
else
return false;
}
int INF = 1000000007;
struct edge {
int s, t, d;
};
V<int> mojisyu(string a) {
V<int> b(26, 0);
fo(i, a.sz) { b[a[i] - 'a']++; }
return b;
}
int wa2(int a) {
if (a % 2 == 1)
return a / 2;
return a / 2 - 1;
}
/*signed main(){
int a,b,c;
cin>>a>>b>>c;
V<V<edge>> d(a);
fo(i,b){
edge e;
cin>>e.s>>e.t>>e.d;
d[e.s].pb(e);
}
V<int> e(a,INF);
e[c]=0;
priority_queue<P<int,int>,V<P<int,int>>,greater<P<int,int>>> f;
f.push({0,c});
int h=INF;
while(!f.empty()){
P<int,int> g;
g=f.top();
f.pop();
int v = g.second, i = g.first;
for(edge l : d[v]){
if(e[l.t] > i + l.d){
e[l.t] = i + l.d;
f.push({i+l.d , l.t});
}
}
}
fo(i,a){
if(e[i]==INF)
cout<<"INF"<<endl;
else
cout<<e[i]<<endl;
}
}
?*/
int nCr(int n, int r) {
if (n < r)
return 0;
int a = 1;
r = min(r, n - r);
for (int i = n; i > n - r; i--) {
a *= i;
a /= n - i + 1;
}
return a;
}
/*void sea(int x,int y){
if(x<0||a<=x||y<0||b<=y||c[x][y]=='#')
return;
if(d[x][y])
return;
d[x][y]++;
sea(x+1,y);
sea(x-1,y);
sea(x,y+1);
sea(x,y-1);
}*/
int kaijou(int a) {
int b = 1;
fo(i, a) b *= i + 1;
return b;
}
int nPr(int a, int b) {
if (a < b)
return 0;
if (b == 0)
return 1;
int c = 1;
for (int i = a; i > a - b; i--) {
c *= i;
c %= INF;
}
return c;
}
int modinv(int a, int m) {
int b = m, u = 1, v = 0;
while (b) {
int t = a / b;
a -= t * b;
swap(a, b);
u -= t * v;
swap(u, v);
}
u %= m;
if (u < 0)
u += m;
return u;
}
int lcm(int a, int b) {
int c = modinv(gcm(a, b), INF);
return ((a * c) % INF) * (b % INF) % INF;
}
int MOD = INF;
int fac[1000010], finv[1000010], inv[1000010];
// テーブルを作る前処理
//先にCOMinit()で前処理をする
// ABC145D
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < 1000010; i++) {
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
// 二項係数計算
int COM(int n, int k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
bool naka(int a, int b, V<V<char>> c) {
return (a >= 0 && b >= 0 && a < c.sz && b < c[0].sz);
}
V<P<int, int>> mawari8 = {{0, -1}, {0, 1}, {1, 0}, {-1, 0},
{-1, -1}, {1, 1}, {1, -1}, {-1, -1}};
int inf = 1000000000000000007;
/*
signed main(){
int a,b,c;
cin>>a>>b>>c;
V<V<edge>> d(a);
fo(i,b){
edge e;
cin>>e.s>>e.t>>e.d;
d[e.s].pb(e);
}
V<int> e(a,INF);
e[c]=0;
priority_queue<P<int,int>,V<P<int,int>>,greater<P<int,int>>> f;
f.push({0,c});
int h=INF;
while(!f.empty()){
P<int,int> g;
g=f.top();
f.pop();
int v = g.second, i = g.first;
for(edge l : d[v]){
if(e[l.t] > i + l.d){
e[l.t] = i + l.d;
f.push({i+l.d , l.t});
}
}
}
fo(i,a){
if(e[i]==INF)
cout<<"INF"<<endl;
else
cout<<e[i]<<endl;
}
}*/
V<P<int, int>> mawari4 = {{0, -1}, {0, 1}, {1, 0}, {-1, 0}};
//最短経路の表 a(全部INFで初期化)
//縦横 x,y
//迷路 f
//スタートsx,sy
//ゴールgx,gy
//文字はgから使おうね
/*int bfs_haba(){
Q<P<int,int>> b;
a[sx][sy]=0;
b.push({sx,sy});
while(!b.empty()){
P<int,int> c=b.front();
b.pop();
if(c.fi==gx&&c.se==gy){
break;
}
fo(i,4){
int d=c.fi+mawari4[i].fi;
int e=c.se+mawari4[i].se;
if(0<=d&&0<=e&&d<x&&e<y&&f[d][e]!='#'&&a[d][e]==INF){
b.push({d,e});
a[d][e]=1+a[c.fi][c.se];
}
}
}
return a[gx][gy];
}*/
V<int> onajibubun(string a) {
V<int> b(a.sz);
for (int i = 1, j = 0; i < a.sz; i++) {
if (i + b[i - j] < j + b[j])
b[i] = b[i - j];
else {
int c = max<int>(0, j + b[j] - i);
while (i + c < a.sz && a[c] == a[i + c])
c++;
b[i] = c;
j = i;
}
}
b[0] = a.sz;
return b;
}
//各頂点ごとにどこに辺が出てるかの表がc
//各頂点ごとの色を表すV<int>(頂点数max)のcolorを用意する
// aはどこ塗るか、bは何で塗るかなので、(0,1,c)でよぶとおけ
V<int> color(205);
bool nibu_hantei(int a, int b, V<V<int>> c) {
color[a] = b;
fo(i, c[a].sz) {
if (b == color[c[a][i]])
return false;
if (color[c[a][i]] == 0 && !nibu_hantei(c[a][i], -b, c))
return false;
}
return true;
}
// aは頂点数
// nibu_hanteiの上にcolorを用意する
//各頂点ごとにどこに辺が出てるかの表がc
bool renketujanai_nibu_hantei(int a, V<V<int>> c) {
fo(i, a) {
if (color[i] == 0) {
if (!nibu_hantei(i, 1, c))
return false;
}
}
return true;
}
int uk1(string a, int b) {
int c = 0;
int d = pow(9, b);
for (int i = b; i < a.sz; i++) {
c += d * nCr(i - 1, b - 1);
}
if (a.sz >= b) {
if (b == 1) {
c += a[0] - '0';
}
}
return c;
}
int uk2(string a, int b) {
int c = 0;
int d = pow(9, b);
for (int i = b; i < a.sz; i++) {
c += d * nCr(i - 1, b - 1);
}
if (a.sz >= b) {
if (b == 2) {
c += ((a[0] - '0') - 1) * 9 * nCr(a.sz - 1, 1);
c += 1 * (a[1] - '0');
if (a.sz > 2)
c += uk1(a.substr(2), 1);
}
}
return c;
}
signed main() {
int a, b, c, d, e;
cin >> a >> b >> c >> d >> e;
string f;
cin >> f;
for (int i = b - 1; i < max(d - 1, e - 1); i++) {
if (f[i] == f[i + 1] && f[i] == '#') {
cout << "No" << endl;
return 0;
}
}
if (d < e) {
cout << "Yes" << endl;
return 0;
}
for (int i = c - 2; i < e - 1; i++) {
if (f[i] == f[i + 1] && f[i] == f[i + 2] && f[i] == '.') {
cout << "Yes" << endl;
return 0;
}
}
cout << "No" << endl;
} | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 830,372 | 830,371 | u322177979 | cpp |
p03017 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
int Max = 1000000;
int N;
int A, B, C, D;
string S;
bool possi(int a, int b) {
bool res = true;
for (int i = a + 1; i < b; i++) {
if (S[i] == S[i + 1] && S[i + 1] == '#')
res = false;
}
return res;
}
int main() {
cin >> N;
cin >> A >> B >> C >> D;
string S;
cin >> S;
if (C == D) {
cout << "No" << endl;
return 0;
}
if (C < D) {
if (possi(B - 1, D - 1) && possi(A - 1, C - 1)) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
return 0;
}
if (!possi(B - 1, D - 1)) {
// cout << 1 << endl;
cout << "No" << endl;
return 0;
}
if (!possi(A - 1, C - 1)) {
// cout << 2 << endl;
cout << "No" << endl;
return 0;
}
for (int i = B - 1; i < C; i++) {
if (S[i] == '.' && S[i - 1] == '.' && S[i + 1] == '.') {
// cout << 3 << endl;
cout << "Yes" << endl;
return 0;
}
}
cout << "No" << endl;
return 0;
} | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
int Max = 1000000;
int N;
int A, B, C, D;
string S;
bool possi(int a, int b) {
bool res = true;
for (int i = a + 1; i < b; i++) {
if (S[i] == S[i + 1] && S[i + 1] == '#')
res = false;
}
return res;
}
int main() {
cin >> N;
cin >> A >> B >> C >> D;
cin >> S;
if (C == D) {
cout << "No" << endl;
return 0;
}
if (C < D) {
if (possi(B - 1, D - 1) && possi(A - 1, C - 1)) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
return 0;
}
if (!possi(B - 1, D - 1)) {
// cout << 1 << endl;
cout << "No" << endl;
return 0;
}
if (!possi(A - 1, C - 1)) {
// cout << 2 << endl;
cout << "No" << endl;
return 0;
}
for (int i = B - 1; i < D; i++) {
if (S[i] == '.' && S[i - 1] == '.' && S[i + 1] == '.') {
// cout << 3 << endl;
cout << "Yes" << endl;
return 0;
}
}
cout << "No" << endl;
return 0;
} | [
"variable_declaration.remove",
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 830,379 | 830,378 | u797165415 | cpp |
p03017 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <ctime>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
int n, a, b, c, d;
cin >> n >> a >> b >> c >> d;
a--;
b--;
c--;
d--;
string s;
cin >> s;
int ig = 0;
if (c > d) {
for (int i = a; i <= d; i++) {
if (s[i] == '.') {
int r = i;
while (r + 1 <= d && s[r + 1] == '.')
r++;
int len = (r - i + 1);
if (len >= 3 && r > b) {
ig = 1;
}
r = i;
}
}
}
for (int i = min(a, b); i + 1 <= max(c, d); i++) {
if (s[i] == '#' && s[i + 1] == '#') {
cout << "No\n";
return 0;
}
}
if (c < d || ig) {
cout << "Yes\n";
} else {
cout << "No\n";
}
}
| #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <ctime>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
int n, a, b, c, d;
cin >> n >> a >> b >> c >> d;
a--;
b--;
c--;
d--;
string s;
cin >> s;
int ig = 0;
if (c > d) {
for (int i = a; i <= d; i++) {
if (s[i] == '.') {
int r = i;
while (r + 1 <= n && s[r + 1] == '.')
r++;
int len = (r - i + 1);
if (len >= 3 && r > b && i < d) {
ig = 1;
}
r = i;
}
}
}
for (int i = min(a, b); i + 1 <= max(c, d); i++) {
if (s[i] == '#' && s[i + 1] == '#') {
cout << "No\n";
return 0;
}
}
if (c < d || ig) {
cout << "Yes\n";
} else {
cout << "No\n";
}
}
| [
"identifier.change",
"control_flow.loop.condition.change",
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 830,404 | 830,405 | u293523151 | cpp |
p03017 | //{{{
#include <bits/stdc++.h>
using namespace std;
const string truename = "Yes";
const string falsename = "No";
struct IoSetup {
IoSetup() {
cin.tie(nullptr);
// ios::sync_with_stdio(false);
cout << fixed << setprecision(10);
cerr << fixed << setprecision(10);
};
} ioSetup;
//{{{ rep rrep loop
#define repX(a, b, c, d, x, ...) x
#define repN(a) repX a
#define rep(...) repN((__VA_ARGS__, rep4, rep3, rep2, loop))(__VA_ARGS__)
#define rrep(...) repN((__VA_ARGS__, rrep4, rrep3, rrep2))(__VA_ARGS__)
#define loop(n) rep2(i_, n)
#define rep2(i, n) rep3(i, 0, n)
#define rep3(i, begin, end) \
for (ll i = (ll)(begin), i##_end = (ll)(end); i < i##_end; ++i)
#define rep4(i, begin, end, step) \
for (ll i = (ll)(begin), i##_end = (ll)(end); i < i##_end; i += step)
#define rrep2(i, n) rrep3(i, 0, n)
#define rrep3(i, begin, end) \
for (ll i = (ll)(end - 1), i##_end = (ll)(begin); i >= i##_end; --i)
#define rrep4(i, begin, end, step) \
for (ll i = (ll)(end - 1), i##_end = (ll)(begin); i >= i##_end; i -= step)
//}}}
#define each(x, a) for (auto &x : a)
#define sz(x) ((ll)(x).size())
//{{{ Type
using ull = unsigned long long;
using ll = long long;
using pii = pair<ll, ll>;
using vp = vector<pii>;
using vs = vector<string>;
using vi = vector<ll>;
using vvi = vector<vi>;
#define v(T) vector<T>
#define vv(T) v(v(T))
template <class T> vector<T> Vector(size_t a, T val) {
return vector<T>(a, val);
}
template <class... Tail> auto Vector(size_t a, Tail... tail) {
return vector<decltype(Vector(tail...))>(a, Vector(tail...));
}
//}}}
//{{{ STL overload
template <class T, class Compare> inline void sort(T &a, Compare comp) {
sort(a.begin(), a.end(), comp);
}
template <class T> inline void sort(T &a) { sort(a.begin(), a.end()); }
template <class T> inline void rsort(T &a) { sort(a.rbegin(), a.rend()); }
template <class T> inline void reverse(T &a) { reverse(a.begin(), a.end()); }
template <class T> inline bool next_permutation(T &a) {
return next_permutation(a.begin(), a.end());
}
template <class T, class U> inline bool binary_search(T &a, const U &v) {
return binary_search(a.begin(), a.end(), v);
}
template <class T, class U> inline auto lower_bound(T &a, const U &v) {
return lower_bound(a.begin(), a.end(), v);
}
template <class T, class U> inline auto upper_bound(T &a, const U &v) {
return upper_bound(a.begin(), a.end(), v);
}
//}}}
//{{{ Functions
template <class T> inline T Sum(vector<T> &a) {
return accumulate(a.begin(), a.end(), (T)0);
}
template <class T> inline T Max(vector<T> &a) {
return *max_element(a.begin(), a.end());
}
template <class T> inline T Min(vector<T> &a) {
return *min_element(a.begin(), a.end());
}
template <class T, class U> inline bool chmax(T &a, const U &b) {
return (b > a) ? (a = b, true) : false;
}
template <class T, class U> inline bool chmin(T &a, const U &b) {
return (b < a) ? (a = b, true) : false;
}
ll gcd(const ll a, const ll b) { return b ? gcd(b, a % b) : a; }
ll lcm(const ll a, const ll b) { return a / gcd(a, b) * b; }
ll ceil(const ll a, const ll b) { return (a + b - 1) / b; }
ll popcount(ll a) {
a -= ((a >> 1) & 0x5555555555555555LL);
a = (a & 0x3333333333333333LL) + ((a >> 2) & 0x3333333333333333LL);
a = (a + (a >> 4)) & 0x0f0f0f0f0f0f0f0fLL;
a += (a >> 8);
a += (a >> 16);
a += (a >> 32);
return a & 0x7f;
}
//}}}
//{{{ in
class in {
int n, m;
public:
in() : n(0), m(0) {}
in(int n) : n(n), m(0){};
in(int n, int m) : n(n), m(m){};
template <class T> operator T() {
assert(n == 0);
assert(m == 0);
T ret;
cin >> ret;
return ret;
}
template <class T> operator vector<T>() {
assert(n > 0);
assert(m == 0);
vector<T> ret(n);
for (ll i = 0; i < (ll)n; ++i)
cin >> ret[i];
return ret;
}
template <class T> operator vector<vector<T>>() {
assert(n > 0);
assert(m > 0);
vector<vector<T>> ret(n, vector<T>(m));
for (ll i = 0; i < (ll)n; ++i)
for (ll j = 0; j < (ll)m; ++j)
cin >> ret[i][j];
return ret;
}
};
//}}}
//{{{ << overload
template <class T, class U>
ostream &operator<<(ostream &o, const pair<T, U> &j) {
o << "{" << j.first << ", " << j.second << "}";
return o;
}
template <class T, class U>
ostream &operator<<(ostream &o, const map<T, U> &j) {
o << "{";
for (auto t = j.begin(); t != j.end(); ++t)
o << (t != j.begin() ? ", " : "") << *t;
o << "}";
return o;
}
template <class T> ostream &operator<<(ostream &o, const set<T> &j) {
o << "{";
for (auto t = j.begin(); t != j.end(); ++t)
o << (t != j.begin() ? ", " : "") << *t;
o << "}";
return o;
}
template <class T> ostream &operator<<(ostream &o, const multiset<T> &j) {
o << "{";
for (auto t = j.begin(); t != j.end(); ++t)
o << (t != j.begin() ? ", " : "") << *t;
o << "}";
return o;
}
template <class T> ostream &operator<<(ostream &o, const vector<T> &j) {
o << "{";
for (ll i = 0; i < (ll)j.size(); ++i)
o << (i > 0 ? ", " : "") << j[i];
o << "}";
return o;
}
//}}}
//{{{ print / out
template <class T> int print(const T &a) {
cout << a;
return 0;
}
inline int out(bool f) {
cout << (f ? truename : falsename) << '\n';
return 0;
}
inline int out() {
cout << '\n';
return 0;
}
template <class T> inline int out(const T &t) {
print(t);
cout << '\n';
return 0;
}
template <class Head, class... Tail>
inline int out(const Head &head, const Tail &...tail) {
print(head);
cout << " ";
out(tail...);
return 0;
}
//}}}
//{{{ debug_print / debug_out
#ifdef LOCAL
#if 1 // Colorize
#include "console_color.hpp"
#else
#define setColor(...)
#endif
template <class T> int debug_print(const T &a) {
cerr << a;
return 0;
}
inline int debug_out(bool f) {
cerr << (f ? truename : falsename) << '\n';
return 0;
}
inline int debug_out() {
cerr << '\n';
return 0;
}
template <class T> inline int debug_out(const T &t) {
debug_print(t);
cerr << '\n';
return 0;
}
template <class Head, class... Tail>
inline int debug_out(const Head &head, const Tail &...tail) {
debug_print(head);
cerr << " ";
debug_out(tail...);
return 0;
}
#define debug(...) \
do { \
setColor(COL_WHITE, COL_DARK_BLUE); \
cerr << "[L." << __LINE__ << "] " << #__VA_ARGS__ << ":"; \
setColor(); \
cerr << " "; \
debug_out(__VA_ARGS__); \
} while (0)
#else
#define debug_print(...)
#define debug_out(...)
#define debug(...)
#endif
//}}}
//{{{ Modular
template <std::int_fast64_t Mod> class Modular {
using u64 = std::uint_fast64_t;
public:
u64 a;
constexpr Modular(std::int_fast64_t x = 0) noexcept
: a(x % Mod + (x < 0 ? Mod : 0)) {}
constexpr u64 val() const noexcept { return a; }
constexpr Modular operator+(const Modular rhs) const noexcept {
return Modular(*this) += rhs;
}
constexpr Modular operator-(const Modular rhs) const noexcept {
return Modular(*this) -= rhs;
}
constexpr Modular operator*(const Modular rhs) const noexcept {
return Modular(*this) *= rhs;
}
constexpr Modular operator/(const Modular rhs) const noexcept {
return Modular(*this) /= rhs;
}
constexpr bool operator==(const Modular rhs) const noexcept {
return Modular(*this).val() == rhs.val();
}
Modular &operator+=(const Modular rhs) noexcept {
a += rhs.a;
if (a >= Mod)
a -= Mod;
return *this;
}
Modular &operator-=(const Modular rhs) noexcept {
if (a < rhs.a)
a += Mod;
a -= rhs.a;
return *this;
}
Modular &operator++() noexcept { return *this += 1; }
Modular &operator--() noexcept { return *this -= 1; }
Modular &operator*=(const Modular rhs) noexcept {
a = a * rhs.a % Mod;
return *this;
}
Modular &operator/=(Modular rhs) noexcept {
u64 exp = Mod - 2;
while (exp) {
if (exp % 2)
*this *= rhs;
rhs *= rhs;
exp /= 2;
}
return *this;
}
Modular pow(u64 t) const {
if (!t)
return 1;
Modular<Mod> a = pow(t >> 1);
a *= a;
if (t & 1)
a *= *this;
return a;
}
};
template <std::int_fast64_t Mod>
ostream &operator<<(ostream &os, const Modular<Mod> &m) {
return os << m.a;
}
//}}}
const double pi = acos(-1);
const double eps = 1e-9;
const ll inf = 1001001001;
const ll mod = (ll)1e9 + 7;
using mint = Modular<mod>;
//}}}
int main() {
ll N = in();
ll a = in();
ll b = in();
ll c = in();
ll d = in();
a--;
b--;
c--;
d--;
string S = in();
bool ans = true;
rep(i, a + 1, c) {
if (S[i] == '#' && S[i - 1] == '#')
return out(false);
}
rep(i, b + 1, d) {
if (S[i] == '#' && S[i - 1] == '#')
return out(false);
}
if (c > d) { // a b d c
ll start = b;
ll end = d;
ans = false;
rep(i, start, end - 1) {
if (S[i] == '.' && S[i + 1] == '.' && S[i + 2] == '.') {
ans = true;
break;
}
}
}
out(ans);
}
| //{{{
#include <bits/stdc++.h>
using namespace std;
const string truename = "Yes";
const string falsename = "No";
struct IoSetup {
IoSetup() {
cin.tie(nullptr);
// ios::sync_with_stdio(false);
cout << fixed << setprecision(10);
cerr << fixed << setprecision(10);
};
} ioSetup;
//{{{ rep rrep loop
#define repX(a, b, c, d, x, ...) x
#define repN(a) repX a
#define rep(...) repN((__VA_ARGS__, rep4, rep3, rep2, loop))(__VA_ARGS__)
#define rrep(...) repN((__VA_ARGS__, rrep4, rrep3, rrep2))(__VA_ARGS__)
#define loop(n) rep2(i_, n)
#define rep2(i, n) rep3(i, 0, n)
#define rep3(i, begin, end) \
for (ll i = (ll)(begin), i##_end = (ll)(end); i < i##_end; ++i)
#define rep4(i, begin, end, step) \
for (ll i = (ll)(begin), i##_end = (ll)(end); i < i##_end; i += step)
#define rrep2(i, n) rrep3(i, 0, n)
#define rrep3(i, begin, end) \
for (ll i = (ll)(end - 1), i##_end = (ll)(begin); i >= i##_end; --i)
#define rrep4(i, begin, end, step) \
for (ll i = (ll)(end - 1), i##_end = (ll)(begin); i >= i##_end; i -= step)
//}}}
#define each(x, a) for (auto &x : a)
#define sz(x) ((ll)(x).size())
//{{{ Type
using ull = unsigned long long;
using ll = long long;
using pii = pair<ll, ll>;
using vp = vector<pii>;
using vs = vector<string>;
using vi = vector<ll>;
using vvi = vector<vi>;
#define v(T) vector<T>
#define vv(T) v(v(T))
template <class T> vector<T> Vector(size_t a, T val) {
return vector<T>(a, val);
}
template <class... Tail> auto Vector(size_t a, Tail... tail) {
return vector<decltype(Vector(tail...))>(a, Vector(tail...));
}
//}}}
//{{{ STL overload
template <class T, class Compare> inline void sort(T &a, Compare comp) {
sort(a.begin(), a.end(), comp);
}
template <class T> inline void sort(T &a) { sort(a.begin(), a.end()); }
template <class T> inline void rsort(T &a) { sort(a.rbegin(), a.rend()); }
template <class T> inline void reverse(T &a) { reverse(a.begin(), a.end()); }
template <class T> inline bool next_permutation(T &a) {
return next_permutation(a.begin(), a.end());
}
template <class T, class U> inline bool binary_search(T &a, const U &v) {
return binary_search(a.begin(), a.end(), v);
}
template <class T, class U> inline auto lower_bound(T &a, const U &v) {
return lower_bound(a.begin(), a.end(), v);
}
template <class T, class U> inline auto upper_bound(T &a, const U &v) {
return upper_bound(a.begin(), a.end(), v);
}
//}}}
//{{{ Functions
template <class T> inline T Sum(vector<T> &a) {
return accumulate(a.begin(), a.end(), (T)0);
}
template <class T> inline T Max(vector<T> &a) {
return *max_element(a.begin(), a.end());
}
template <class T> inline T Min(vector<T> &a) {
return *min_element(a.begin(), a.end());
}
template <class T, class U> inline bool chmax(T &a, const U &b) {
return (b > a) ? (a = b, true) : false;
}
template <class T, class U> inline bool chmin(T &a, const U &b) {
return (b < a) ? (a = b, true) : false;
}
ll gcd(const ll a, const ll b) { return b ? gcd(b, a % b) : a; }
ll lcm(const ll a, const ll b) { return a / gcd(a, b) * b; }
ll ceil(const ll a, const ll b) { return (a + b - 1) / b; }
ll popcount(ll a) {
a -= ((a >> 1) & 0x5555555555555555LL);
a = (a & 0x3333333333333333LL) + ((a >> 2) & 0x3333333333333333LL);
a = (a + (a >> 4)) & 0x0f0f0f0f0f0f0f0fLL;
a += (a >> 8);
a += (a >> 16);
a += (a >> 32);
return a & 0x7f;
}
//}}}
//{{{ in
class in {
int n, m;
public:
in() : n(0), m(0) {}
in(int n) : n(n), m(0){};
in(int n, int m) : n(n), m(m){};
template <class T> operator T() {
assert(n == 0);
assert(m == 0);
T ret;
cin >> ret;
return ret;
}
template <class T> operator vector<T>() {
assert(n > 0);
assert(m == 0);
vector<T> ret(n);
for (ll i = 0; i < (ll)n; ++i)
cin >> ret[i];
return ret;
}
template <class T> operator vector<vector<T>>() {
assert(n > 0);
assert(m > 0);
vector<vector<T>> ret(n, vector<T>(m));
for (ll i = 0; i < (ll)n; ++i)
for (ll j = 0; j < (ll)m; ++j)
cin >> ret[i][j];
return ret;
}
};
//}}}
//{{{ << overload
template <class T, class U>
ostream &operator<<(ostream &o, const pair<T, U> &j) {
o << "{" << j.first << ", " << j.second << "}";
return o;
}
template <class T, class U>
ostream &operator<<(ostream &o, const map<T, U> &j) {
o << "{";
for (auto t = j.begin(); t != j.end(); ++t)
o << (t != j.begin() ? ", " : "") << *t;
o << "}";
return o;
}
template <class T> ostream &operator<<(ostream &o, const set<T> &j) {
o << "{";
for (auto t = j.begin(); t != j.end(); ++t)
o << (t != j.begin() ? ", " : "") << *t;
o << "}";
return o;
}
template <class T> ostream &operator<<(ostream &o, const multiset<T> &j) {
o << "{";
for (auto t = j.begin(); t != j.end(); ++t)
o << (t != j.begin() ? ", " : "") << *t;
o << "}";
return o;
}
template <class T> ostream &operator<<(ostream &o, const vector<T> &j) {
o << "{";
for (ll i = 0; i < (ll)j.size(); ++i)
o << (i > 0 ? ", " : "") << j[i];
o << "}";
return o;
}
//}}}
//{{{ print / out
template <class T> int print(const T &a) {
cout << a;
return 0;
}
inline int out(bool f) {
cout << (f ? truename : falsename) << '\n';
return 0;
}
inline int out() {
cout << '\n';
return 0;
}
template <class T> inline int out(const T &t) {
print(t);
cout << '\n';
return 0;
}
template <class Head, class... Tail>
inline int out(const Head &head, const Tail &...tail) {
print(head);
cout << " ";
out(tail...);
return 0;
}
//}}}
//{{{ debug_print / debug_out
#ifdef LOCAL
#if 1 // Colorize
#include "console_color.hpp"
#else
#define setColor(...)
#endif
template <class T> int debug_print(const T &a) {
cerr << a;
return 0;
}
inline int debug_out(bool f) {
cerr << (f ? truename : falsename) << '\n';
return 0;
}
inline int debug_out() {
cerr << '\n';
return 0;
}
template <class T> inline int debug_out(const T &t) {
debug_print(t);
cerr << '\n';
return 0;
}
template <class Head, class... Tail>
inline int debug_out(const Head &head, const Tail &...tail) {
debug_print(head);
cerr << " ";
debug_out(tail...);
return 0;
}
#define debug(...) \
do { \
setColor(COL_WHITE, COL_DARK_BLUE); \
cerr << "[L." << __LINE__ << "] " << #__VA_ARGS__ << ":"; \
setColor(); \
cerr << " "; \
debug_out(__VA_ARGS__); \
} while (0)
#else
#define debug_print(...)
#define debug_out(...)
#define debug(...)
#endif
//}}}
//{{{ Modular
template <std::int_fast64_t Mod> class Modular {
using u64 = std::uint_fast64_t;
public:
u64 a;
constexpr Modular(std::int_fast64_t x = 0) noexcept
: a(x % Mod + (x < 0 ? Mod : 0)) {}
constexpr u64 val() const noexcept { return a; }
constexpr Modular operator+(const Modular rhs) const noexcept {
return Modular(*this) += rhs;
}
constexpr Modular operator-(const Modular rhs) const noexcept {
return Modular(*this) -= rhs;
}
constexpr Modular operator*(const Modular rhs) const noexcept {
return Modular(*this) *= rhs;
}
constexpr Modular operator/(const Modular rhs) const noexcept {
return Modular(*this) /= rhs;
}
constexpr bool operator==(const Modular rhs) const noexcept {
return Modular(*this).val() == rhs.val();
}
Modular &operator+=(const Modular rhs) noexcept {
a += rhs.a;
if (a >= Mod)
a -= Mod;
return *this;
}
Modular &operator-=(const Modular rhs) noexcept {
if (a < rhs.a)
a += Mod;
a -= rhs.a;
return *this;
}
Modular &operator++() noexcept { return *this += 1; }
Modular &operator--() noexcept { return *this -= 1; }
Modular &operator*=(const Modular rhs) noexcept {
a = a * rhs.a % Mod;
return *this;
}
Modular &operator/=(Modular rhs) noexcept {
u64 exp = Mod - 2;
while (exp) {
if (exp % 2)
*this *= rhs;
rhs *= rhs;
exp /= 2;
}
return *this;
}
Modular pow(u64 t) const {
if (!t)
return 1;
Modular<Mod> a = pow(t >> 1);
a *= a;
if (t & 1)
a *= *this;
return a;
}
};
template <std::int_fast64_t Mod>
ostream &operator<<(ostream &os, const Modular<Mod> &m) {
return os << m.a;
}
//}}}
const double pi = acos(-1);
const double eps = 1e-9;
const ll inf = 1001001001;
const ll mod = (ll)1e9 + 7;
using mint = Modular<mod>;
//}}}
int main() {
ll N = in();
ll a = in();
ll b = in();
ll c = in();
ll d = in();
a--;
b--;
c--;
d--;
string S = in();
bool ans = true;
rep(i, a + 1, c) {
if (S[i] == '#' && S[i - 1] == '#')
return out(false);
}
rep(i, b + 1, d) {
if (S[i] == '#' && S[i - 1] == '#')
return out(false);
}
if (c > d) { // a b d c
ll start = b - 1;
ll end = d + 1;
ans = false;
rep(i, start, end - 1) {
if (S[i] == '.' && S[i + 1] == '.' && S[i + 2] == '.') {
ans = true;
break;
}
}
}
out(ans);
}
| [
"assignment.change"
] | 830,406 | 830,407 | u899220667 | cpp |
p03017 | #include <iostream>
#include <string>
using namespace std;
int max(int a, int b) { return (a > b) ? a : b; }
int min(int a, int b) { return (a > b) ? b : a; }
int main() {
int n, a, b, c, d, st, en;
string s;
bool f = true, can_c = false;
cin >> n >> a >> b >> c >> d;
a--;
b--;
c--;
d--;
cin >> s;
en = max(c, d);
for (int i = a; i < c; i++) {
if (s[i] == '#' && s[i + 1] == '#') {
f = false;
break;
}
}
for (int i = b; i < d; i++) {
if (s[i] == '#' && s[i + 1] == '#') {
f = false;
break;
}
}
if (d < c) {
for (int i = b; i <= d; i++) {
if (s[i] == '.' && s[i + 1] == '.' && s[i + 2] == '.') {
can_c = true;
break;
}
}
if (can_c == false)
f = false;
}
if (f)
cout << "Yes\n";
else
cout << "No\n";
}
| #include <iostream>
#include <string>
using namespace std;
int max(int a, int b) { return (a > b) ? a : b; }
int min(int a, int b) { return (a > b) ? b : a; }
int main() {
int n, a, b, c, d, st, en;
string s;
bool f = true, can_c = false;
cin >> n >> a >> b >> c >> d;
a--;
b--;
c--;
d--;
cin >> s;
en = max(c, d);
for (int i = a; i < c; i++) {
if (s[i] == '#' && s[i + 1] == '#') {
f = false;
break;
}
}
for (int i = b; i < d; i++) {
if (s[i] == '#' && s[i + 1] == '#') {
f = false;
break;
}
}
if (d < c) {
for (int i = b; i <= d; i++) {
if (s[i] == '.' && s[i + 1] == '.' && s[i - 1] == '.') {
can_c = true;
break;
}
}
if (can_c == false)
f = false;
}
if (f)
cout << "Yes\n";
else
cout << "No\n";
}
| [
"control_flow.loop.for.condition.change"
] | 830,449 | 830,450 | u352248517 | cpp |
p03017 | // A
#include <bits/stdc++.h>
using ll = long long;
using namespace std;
ll mod = 1e9 + 7;
#define pa(x, n) \
for (ll i = 0; i < n; i++) { \
cout << (x[i]) << " \n"[i == n - 1]; \
};
int main() {
int N, A, B, C, D;
string s;
cin >> N >> A >> B >> C >> D;
cin >> s;
for (int i(A); i <= max(C, D); i++) {
if (s[i - 1] == '#' && s[i] == '#' && s[i + 1] == '#') {
cout << "No" << endl;
return 0;
}
}
if (C < D) { //交わらない時
cout << "Yes" << endl;
return 0;
} else {
int migi = D - 1, hidari = B - 1;
for (int i(hidari); i <= migi - 1; i++) {
if (s[i] == '.' && s[i + 1] == '.' && s[i + 2] == '.') {
cout << "Yes" << endl;
return 0;
}
}
cout << "No" << endl;
}
return 0;
}
| // A
#include <bits/stdc++.h>
using ll = long long;
using namespace std;
ll mod = 1e9 + 7;
#define pa(x, n) \
for (ll i = 0; i < n; i++) { \
cout << (x[i]) << " \n"[i == n - 1]; \
};
int main() {
int N, A, B, C, D;
string s;
cin >> N >> A >> B >> C >> D;
cin >> s;
for (int i(A); i <= max(C, D); i++) {
if (s[i - 1] == '#' && s[i] == '#' && s[i + 1] == '#') {
cout << "No" << endl;
return 0;
}
}
if (C < D) { //交わらない時
cout << "Yes" << endl;
return 0;
} else {
int migi = D - 1, hidari = B - 1;
for (int i(hidari - 1); i <= migi - 1; i++) {
if (s[i] == '.' && s[i + 1] == '.' && s[i + 2] == '.') {
cout << "Yes" << endl;
return 0;
}
}
cout << "No" << endl;
}
return 0;
}
| [
"control_flow.loop.for.initializer.change"
] | 830,455 | 830,456 | u991846372 | cpp |
p03017 | // A
#include <bits/stdc++.h>
using ll = long long;
using namespace std;
ll mod = 1e9 + 7;
#define pa(x, n) \
for (ll i = 0; i < n; i++) { \
cout << (x[i]) << " \n"[i == n - 1]; \
};
int main() {
int N, A, B, C, D;
string s;
cin >> N >> A >> B >> C >> D;
cin >> s;
for (int i(A); i <= max(C, D); i++) {
if (s[i - 1] == '#' && s[i] == '#' && s[i + 1] == '#') {
cout << "No" << endl;
return 0;
}
}
if (C < D) { //交わらない時
cout << "Yes" << endl;
return 0;
} else {
int migi = D - 1, hidari = A - 1;
for (int i(hidari); i <= migi - 1; i++) {
if (s[i] == '.' && s[i + 1] == '.' && s[i + 2] == '.') {
cout << "Yes" << endl;
return 0;
}
}
cout << "No" << endl;
}
return 0;
}
| // A
#include <bits/stdc++.h>
using ll = long long;
using namespace std;
ll mod = 1e9 + 7;
#define pa(x, n) \
for (ll i = 0; i < n; i++) { \
cout << (x[i]) << " \n"[i == n - 1]; \
};
int main() {
int N, A, B, C, D;
string s;
cin >> N >> A >> B >> C >> D;
cin >> s;
for (int i(A); i <= max(C, D); i++) {
if (s[i - 1] == '#' && s[i] == '#' && s[i + 1] == '#') {
cout << "No" << endl;
return 0;
}
}
if (C < D) { //交わらない時
cout << "Yes" << endl;
return 0;
} else {
int migi = D - 1, hidari = B - 1;
for (int i(hidari - 1); i <= migi - 1; i++) {
if (s[i] == '.' && s[i + 1] == '.' && s[i + 2] == '.') {
cout << "Yes" << endl;
return 0;
}
}
cout << "No" << endl;
}
return 0;
}
| [
"identifier.change",
"expression.operation.binary.change",
"control_flow.loop.for.initializer.change"
] | 830,457 | 830,456 | u991846372 | cpp |
p03017 | // A
#include <bits/stdc++.h>
using ll = long long;
using namespace std;
ll mod = 1e9 + 7;
#define pa(x, n) \
for (ll i = 0; i < n; i++) { \
cout << (x[i]) << " \n"[i == n - 1]; \
};
int main() {
int N, A, B, C, D;
string s;
cin >> N >> A >> B >> C >> D;
cin >> s;
for (int i(A); i <= min(C, D); i++) {
if (s[i - 1] == '#' && s[i] == '#' && s[i + 1] == '#') {
cout << "No" << endl;
return 0;
}
}
if (C < D) { //交わらない時
cout << "Yes" << endl;
return 0;
} else {
int migi = D - 1, hidari = A - 1;
for (int i(hidari); i <= migi - 1; i++) {
if (s[i] == '.' && s[i + 1] == '.' && s[i + 2] == '.') {
cout << "Yes" << endl;
return 0;
}
}
cout << "No" << endl;
}
return 0;
}
| // A
#include <bits/stdc++.h>
using ll = long long;
using namespace std;
ll mod = 1e9 + 7;
#define pa(x, n) \
for (ll i = 0; i < n; i++) { \
cout << (x[i]) << " \n"[i == n - 1]; \
};
int main() {
int N, A, B, C, D;
string s;
cin >> N >> A >> B >> C >> D;
cin >> s;
for (int i(A); i <= max(C, D); i++) {
if (s[i - 1] == '#' && s[i] == '#' && s[i + 1] == '#') {
cout << "No" << endl;
return 0;
}
}
if (C < D) { //交わらない時
cout << "Yes" << endl;
return 0;
} else {
int migi = D - 1, hidari = B - 1;
for (int i(hidari - 1); i <= migi - 1; i++) {
if (s[i] == '.' && s[i + 1] == '.' && s[i + 2] == '.') {
cout << "Yes" << endl;
return 0;
}
}
cout << "No" << endl;
}
return 0;
}
| [
"misc.opposites",
"identifier.change",
"call.function.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"control_flow.loop.for.initializer.change"
] | 830,458 | 830,456 | u991846372 | cpp |
p03017 | // A
#include <bits/stdc++.h>
using ll = long long;
using namespace std;
ll mod = 1e9 + 7;
#define pa(x, n) \
for (ll i = 0; i < n; i++) { \
cout << (x[i]) << " \n"[i == n - 1]; \
};
int main() {
int N, A, B, C, D;
string s;
cin >> N >> A >> B >> C >> D;
cin >> s;
for (int i(A); i <= min(C, D); i++) {
if (s[i - 1] == '#' && s[i] == '#' && s[i + 1] == '#') {
cout << "No" << endl;
return 0;
}
}
if (C < D) { //交わらない時
cout << "Yes" << endl;
return 0;
} else {
int migi = D - 1, hidari = A - 1;
for (int i(hidari); i <= migi - 2; i++) {
if (s[i] == '.' && s[i + 1] == '.' && s[i + 2] == '.') {
cout << "Yes" << endl;
return 0;
}
}
cout << "No" << endl;
}
return 0;
}
| // A
#include <bits/stdc++.h>
using ll = long long;
using namespace std;
ll mod = 1e9 + 7;
#define pa(x, n) \
for (ll i = 0; i < n; i++) { \
cout << (x[i]) << " \n"[i == n - 1]; \
};
int main() {
int N, A, B, C, D;
string s;
cin >> N >> A >> B >> C >> D;
cin >> s;
for (int i(A); i <= max(C, D); i++) {
if (s[i - 1] == '#' && s[i] == '#' && s[i + 1] == '#') {
cout << "No" << endl;
return 0;
}
}
if (C < D) { //交わらない時
cout << "Yes" << endl;
return 0;
} else {
int migi = D - 1, hidari = B - 1;
for (int i(hidari - 1); i <= migi - 1; i++) {
if (s[i] == '.' && s[i + 1] == '.' && s[i + 2] == '.') {
cout << "Yes" << endl;
return 0;
}
}
cout << "No" << endl;
}
return 0;
}
| [
"misc.opposites",
"identifier.change",
"call.function.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"control_flow.loop.for.initializer.change",
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 830,459 | 830,456 | u991846372 | cpp |
p03017 | // A
#include <bits/stdc++.h>
using ll = long long;
using namespace std;
ll mod = 1e9 + 7;
#define pa(x, n) \
for (ll i = 0; i < n; i++) { \
cout << (x[i]) << " \n"[i == n - 1]; \
};
int main() {
int N, A, B, C, D;
string s;
cin >> N >> A >> B >> C >> D;
cin >> s;
for (int i(A); i <= min(C, D); i++) {
if (s[i - 1] == '#' && s[i] == '#' && s[i + 1] == '#') {
cout << "No" << endl;
return 0;
}
}
if (C < D) { //交わらない時
cout << "Yes" << endl;
return 0;
} else {
int migi = C - 1, hidari = A - 1;
for (int i(hidari); i <= migi - 2; i++) {
if (s[i] == '.' && s[i + 1] == '.' && s[i + 2] == '.') {
cout << "Yes" << endl;
return 0;
}
}
cout << "No" << endl;
}
return 0;
}
| // A
#include <bits/stdc++.h>
using ll = long long;
using namespace std;
ll mod = 1e9 + 7;
#define pa(x, n) \
for (ll i = 0; i < n; i++) { \
cout << (x[i]) << " \n"[i == n - 1]; \
};
int main() {
int N, A, B, C, D;
string s;
cin >> N >> A >> B >> C >> D;
cin >> s;
for (int i(A); i <= max(C, D); i++) {
if (s[i - 1] == '#' && s[i] == '#' && s[i + 1] == '#') {
cout << "No" << endl;
return 0;
}
}
if (C < D) { //交わらない時
cout << "Yes" << endl;
return 0;
} else {
int migi = D - 1, hidari = B - 1;
for (int i(hidari - 1); i <= migi - 1; i++) {
if (s[i] == '.' && s[i + 1] == '.' && s[i + 2] == '.') {
cout << "Yes" << endl;
return 0;
}
}
cout << "No" << endl;
}
return 0;
}
| [
"misc.opposites",
"identifier.change",
"call.function.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"control_flow.loop.for.initializer.change",
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 830,460 | 830,456 | u991846372 | cpp |
p03017 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
using namespace std;
int main() {
int n, a, b, c, d, e = 0;
string s;
cin >> n >> a >> b >> c >> d >> s;
for (int h = a - 1; h < max(c, d); h++) {
if (s[h] == '#' && s[h + 1] == '#') {
cout << "No" << endl;
cin >> n;
return 0;
}
}
for (int h = a - 1; h < d; h++) {
if (s[h] == '.' && s[h + 1] == '.' && s[h + 2] == '.') {
if (h + 2 >= b && (h != a - 1 || h + 2 != b - 1)) {
e++;
}
}
}
if (c > d && e == 0) {
cout << "No" << endl;
cin >> n;
return 0;
}
cout << "Yes" << endl;
cin >> n;
} | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
using namespace std;
int main() {
int n, a, b, c, d, e = 0;
string s;
cin >> n >> a >> b >> c >> d >> s;
for (int h = a - 1; h < max(c, d); h++) {
if (s[h] == '#' && s[h + 1] == '#') {
cout << "No" << endl;
cin >> n;
return 0;
}
}
for (int h = a - 1; h < d - 1; h++) {
if (s[h] == '.' && s[h + 1] == '.' && s[h + 2] == '.') {
if (h + 2 >= b && (h != a - 1 || h + 2 != b - 1)) {
e++;
}
}
}
if (c > d && e == 0) {
cout << "No" << endl;
cin >> n;
return 0;
}
cout << "Yes" << endl;
cin >> n;
} | [
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 830,474 | 830,475 | u986568278 | cpp |
p03017 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
using namespace std;
int main() {
int n, a, b, c, d, e = 0;
string s;
cin >> n >> a >> b >> c >> d >> s;
for (int h = a - 1; h < max(c, d); h++) {
if (s[h] == '#' && s[h + 1] == '#') {
cout << "No" << endl;
cin >> n;
return 0;
}
}
for (int h = a - 1; h < d + 1; h++) {
if (s[h] == '.' && s[h + 1] == '.' && s[h + 2] == '.') {
if (h + 2 >= b && (h != a - 1 || h + 2 != b - 1)) {
e++;
}
}
}
if (c > d && e == 0) {
cout << "No" << endl;
cin >> n;
return 0;
}
cout << "Yes" << endl;
cin >> n;
} | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
using namespace std;
int main() {
int n, a, b, c, d, e = 0;
string s;
cin >> n >> a >> b >> c >> d >> s;
for (int h = a - 1; h < max(c, d); h++) {
if (s[h] == '#' && s[h + 1] == '#') {
cout << "No" << endl;
cin >> n;
return 0;
}
}
for (int h = a - 1; h < d - 1; h++) {
if (s[h] == '.' && s[h + 1] == '.' && s[h + 2] == '.') {
if (h + 2 >= b && (h != a - 1 || h + 2 != b - 1)) {
e++;
}
}
}
if (c > d && e == 0) {
cout << "No" << endl;
cin >> n;
return 0;
}
cout << "Yes" << endl;
cin >> n;
} | [
"misc.opposites",
"expression.operator.arithmetic.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 830,476 | 830,475 | u986568278 | cpp |
p03017 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
using namespace std;
int main() {
int n, a, b, c, d, e = 0;
string s;
cin >> n >> a >> b >> c >> d >> s;
for (int h = a - 1; h < max(c, d) - 1; h++) {
if (s[h] == '#' && s[h + 1] == '#') {
cout << "No" << endl;
cin >> n;
return 0;
}
}
for (int h = a - 1; h < d; h++) {
if (s[h] == '.' && s[h + 1] == '.' && s[h + 2] == '.') {
if (h + 2 >= b && (h != a - 1 || h + 2 != b - 1)) {
e++;
}
}
}
if (c > d && e == 0) {
cout << "No" << endl;
cin >> n;
return 0;
}
cout << "Yes" << endl;
cin >> n;
} | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
using namespace std;
int main() {
int n, a, b, c, d, e = 0;
string s;
cin >> n >> a >> b >> c >> d >> s;
for (int h = a - 1; h < max(c, d); h++) {
if (s[h] == '#' && s[h + 1] == '#') {
cout << "No" << endl;
cin >> n;
return 0;
}
}
for (int h = a - 1; h < d - 1; h++) {
if (s[h] == '.' && s[h + 1] == '.' && s[h + 2] == '.') {
if (h + 2 >= b && (h != a - 1 || h + 2 != b - 1)) {
e++;
}
}
}
if (c > d && e == 0) {
cout << "No" << endl;
cin >> n;
return 0;
}
cout << "Yes" << endl;
cin >> n;
} | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove",
"misc.off_by_one"
] | 830,477 | 830,475 | u986568278 | cpp |
p03017 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
using namespace std;
int main() {
int n, a, b, c, d, e = 0;
string s;
cin >> n >> a >> b >> c >> d >> s;
for (int h = a - 1; h < max(c, d) + 1; h++) {
if (s[h] == '#' && s[h + 1] == '#') {
cout << "No" << endl;
cin >> n;
return 0;
}
}
for (int h = a - 1; h < d; h++) {
if (s[h] == '.' && s[h + 1] == '.' && s[h + 2] == '.') {
if (h + 2 >= b && (h != a - 1 || h + 2 != b - 1)) {
e++;
}
}
}
if (c > d && e == 0) {
cout << "No" << endl;
cin >> n;
return 0;
}
cout << "Yes" << endl;
cin >> n;
} | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
using namespace std;
int main() {
int n, a, b, c, d, e = 0;
string s;
cin >> n >> a >> b >> c >> d >> s;
for (int h = a - 1; h < max(c, d); h++) {
if (s[h] == '#' && s[h + 1] == '#') {
cout << "No" << endl;
cin >> n;
return 0;
}
}
for (int h = a - 1; h < d - 1; h++) {
if (s[h] == '.' && s[h + 1] == '.' && s[h + 2] == '.') {
if (h + 2 >= b && (h != a - 1 || h + 2 != b - 1)) {
e++;
}
}
}
if (c > d && e == 0) {
cout << "No" << endl;
cin >> n;
return 0;
}
cout << "Yes" << endl;
cin >> n;
} | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove",
"misc.off_by_one"
] | 830,478 | 830,475 | u986568278 | cpp |
p03017 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
using namespace std;
int main() {
int n, a, b, c, d, e = 0;
string s;
cin >> n >> a >> b >> c >> d >> s;
for (int h = a - 1; h < max(c, d); h++) {
if (s[h] == '#' && s[h + 1] == '#') {
cout << "No" << endl;
cin >> n;
return 0;
}
}
for (int h = a - 1; h < d; h++) {
if (s[h] == '.' && s[h + 1] == '.' && s[h + 2] == '.') {
if (h + 2 >= b - 1 && (h != a - 1 || h + 2 != b - 1)) {
e++;
}
}
}
if (c > d && e == 0) {
cout << "No" << endl;
cin >> n;
return 0;
}
cout << "Yes" << endl;
cin >> n;
} | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
using namespace std;
int main() {
int n, a, b, c, d, e = 0;
string s;
cin >> n >> a >> b >> c >> d >> s;
for (int h = a - 1; h < max(c, d); h++) {
if (s[h] == '#' && s[h + 1] == '#') {
cout << "No" << endl;
cin >> n;
return 0;
}
}
for (int h = a - 1; h < d - 1; h++) {
if (s[h] == '.' && s[h + 1] == '.' && s[h + 2] == '.') {
if (h + 2 >= b && (h != a - 1 || h + 2 != b - 1)) {
e++;
}
}
}
if (c > d && e == 0) {
cout << "No" << endl;
cin >> n;
return 0;
}
cout << "Yes" << endl;
cin >> n;
} | [
"control_flow.loop.for.condition.change",
"misc.off_by_one",
"expression.operation.binary.remove"
] | 830,480 | 830,475 | u986568278 | cpp |
p03017 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
using namespace std;
int main() {
int n, a, b, c, d, e = 0;
string s;
cin >> n >> a >> b >> c >> d >> s;
for (int h = a - 1; h < max(c, d); h++) {
if (s[h] == '#' && s[h + 1] == '#') {
cout << "No" << endl;
cin >> n;
return 0;
}
}
for (int h = a - 1; h < d; h++) {
if (s[h] == '.' && s[h + 1] == '.' && s[h + 2] == '.') {
if (h + 2 >= b && (h != a || h + 2 != b)) {
e++;
}
}
}
if (c > d && e == 0) {
cout << "No" << endl;
cin >> n;
return 0;
}
cout << "Yes" << endl;
cin >> n;
} | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
using namespace std;
int main() {
int n, a, b, c, d, e = 0;
string s;
cin >> n >> a >> b >> c >> d >> s;
for (int h = a - 1; h < max(c, d); h++) {
if (s[h] == '#' && s[h + 1] == '#') {
cout << "No" << endl;
cin >> n;
return 0;
}
}
for (int h = a - 1; h < d - 1; h++) {
if (s[h] == '.' && s[h + 1] == '.' && s[h + 2] == '.') {
if (h + 2 >= b && (h != a - 1 || h + 2 != b - 1)) {
e++;
}
}
}
if (c > d && e == 0) {
cout << "No" << endl;
cin >> n;
return 0;
}
cout << "Yes" << endl;
cin >> n;
} | [
"control_flow.loop.for.condition.change",
"misc.off_by_one",
"control_flow.branch.if.condition.change"
] | 830,481 | 830,475 | u986568278 | cpp |
p03017 | /* おまじない */
#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
typedef long long ll;
typedef long double ld;
using namespace std;
const ll MOD = pow(10, 9) + 7;
const ll INF = (1LL << 62);
const int dx[4] = {0, 1, 0, -1};
const int dy[4] = {1, 0, -1, 0};
const int ddx[8] = {1, 0, -1, -1, -1, 0, 1, 1};
const int ddy[8] = {1, 1, 1, 0, -1, -1, -1, 0};
void init() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
}
int main() {
init();
ll N, A, B, C, D;
cin >> N >> A >> B >> C >> D;
string s;
cin >> s;
A--;
B--;
C--;
D--;
if (D < C) {
//間に岩2つ連続であったらだめ
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;
}
}
//抜かさなきゃいけない
bool isOK = false;
for (int i = D; i < C; i++) {
if (s[i] == '.' && s[i + 1] == '.' && s[i + 2] == '.')
isOK = true;
}
if (isOK)
cout << "Yes" << endl;
else
cout << "No" << endl;
return 0;
}
//間に岩2つ連続であったらだめ
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;
}
}
cout << "Yes" << endl;
return 0;
} | /* おまじない */
#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
typedef long long ll;
typedef long double ld;
using namespace std;
const ll MOD = pow(10, 9) + 7;
const ll INF = (1LL << 62);
const int dx[4] = {0, 1, 0, -1};
const int dy[4] = {1, 0, -1, 0};
const int ddx[8] = {1, 0, -1, -1, -1, 0, 1, 1};
const int ddy[8] = {1, 1, 1, 0, -1, -1, -1, 0};
void init() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
}
int main() {
init();
ll N, A, B, C, D;
cin >> N >> A >> B >> C >> D;
string s;
cin >> s;
A--;
B--;
C--;
D--;
if (D < C) {
//間に岩2つ連続であったらだめ
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;
}
}
//抜かさなきゃいけない
bool isOK = false;
for (int i = B - 1; i < D; i++) {
if (s[i] == '.' && s[i + 1] == '.' && s[i + 2] == '.')
isOK = true;
}
if (isOK)
cout << "Yes" << endl;
else
cout << "No" << endl;
return 0;
}
//間に岩2つ連続であったらだめ
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;
}
}
cout << "Yes" << endl;
return 0;
} | [
"control_flow.loop.for.initializer.change",
"identifier.change",
"control_flow.branch.if.condition.change"
] | 830,484 | 830,485 | u644568158 | cpp |
p03017 | /* おまじない */
#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
typedef long long ll;
typedef long double ld;
using namespace std;
const ll MOD = pow(10, 9) + 7;
const ll INF = (1LL << 62);
const int dx[4] = {0, 1, 0, -1};
const int dy[4] = {1, 0, -1, 0};
const int ddx[8] = {1, 0, -1, -1, -1, 0, 1, 1};
const int ddy[8] = {1, 1, 1, 0, -1, -1, -1, 0};
void init() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
}
int main() {
init();
ll N, A, B, C, D;
cin >> N >> A >> B >> C >> D;
string s;
cin >> s;
A--;
B--;
C--;
D--;
if (D < C) {
//間に岩2つ連続であったらだめ
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;
}
}
//抜かさなきゃいけない
bool isOK = false;
for (int i = D; i < C - 1; i++) {
if (s[i] == '.' && s[i + 1] == '.' && s[i + 2] == '.')
isOK = true;
}
if (isOK)
cout << "Yes" << endl;
else
cout << "No" << endl;
return 0;
}
//間に岩2つ連続であったらだめ
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;
}
}
cout << "Yes" << endl;
return 0;
} | /* おまじない */
#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
typedef long long ll;
typedef long double ld;
using namespace std;
const ll MOD = pow(10, 9) + 7;
const ll INF = (1LL << 62);
const int dx[4] = {0, 1, 0, -1};
const int dy[4] = {1, 0, -1, 0};
const int ddx[8] = {1, 0, -1, -1, -1, 0, 1, 1};
const int ddy[8] = {1, 1, 1, 0, -1, -1, -1, 0};
void init() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
}
int main() {
init();
ll N, A, B, C, D;
cin >> N >> A >> B >> C >> D;
string s;
cin >> s;
A--;
B--;
C--;
D--;
if (D < C) {
//間に岩2つ連続であったらだめ
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;
}
}
//抜かさなきゃいけない
bool isOK = false;
for (int i = B - 1; i < D; i++) {
if (s[i] == '.' && s[i + 1] == '.' && s[i + 2] == '.')
isOK = true;
}
if (isOK)
cout << "Yes" << endl;
else
cout << "No" << endl;
return 0;
}
//間に岩2つ連続であったらだめ
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;
}
}
cout << "Yes" << endl;
return 0;
} | [
"control_flow.loop.for.initializer.change",
"identifier.change",
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 830,486 | 830,485 | u644568158 | cpp |
p03017 | #include <bits/stdc++.h>
#define int long long
#define mod (int)(1e9 + 7)
#define inf (int)(3e18 + 7)
#define rep(i, n) for (int i = 0; i < n; i++)
#define REP(i, n) for (int i = 1; i < n; i++)
#define P pair<int, int>
#define PiP pair<int, pair<int, int>>
#define all(v) v.begin(), v.end()
#define mkp make_pair
#define mkt make_tuple
#define prique(T) priority_queue<T, vector<T>, greater<T>>
#define vecunique(vec) \
sort(vec.begin(), vec.end()); \
decltype(vec)::iterator result = std::unique(vec.begin(), vec.end()); \
vec.erase(result, vec.end())
using namespace std;
bool prime(int x) {
for (int i = 2; i * i <= x; i++) {
if (x % i == 0)
return false;
}
return x > 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; }
int kai(int x) {
if (x == 0)
return 1;
return kai(x - 1) * x % mod;
}
int mod_pow(int x, int y, int mod_) {
int res = 1;
while (y > 0) {
if (y & 1) {
res = res * x % mod_;
}
x = x * x % mod_;
y >>= 1;
}
return res;
}
int comb(int x, int y) {
if (y > x)
return 0;
return kai(x) * mod_pow(kai(x - y), mod - 2, mod) % mod *
mod_pow(kai(y), mod - 2, mod) % mod;
}
/*--------Library Zone!--------*/
int n, a, b, c, d;
signed main() {
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] == '#') {
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) {
for (int i = b; i < d - 1; i++) {
if (s[i] == '.' && s[i + 1] == '.' && s[i + 2] == '.') {
cout << "Yes" << endl;
return 0;
}
}
cout << "No" << endl;
} else
cout << "Yes" << endl;
}
| #include <bits/stdc++.h>
#define int long long
#define mod (int)(1e9 + 7)
#define inf (int)(3e18 + 7)
#define rep(i, n) for (int i = 0; i < n; i++)
#define REP(i, n) for (int i = 1; i < n; i++)
#define P pair<int, int>
#define PiP pair<int, pair<int, int>>
#define all(v) v.begin(), v.end()
#define mkp make_pair
#define mkt make_tuple
#define prique(T) priority_queue<T, vector<T>, greater<T>>
#define vecunique(vec) \
sort(vec.begin(), vec.end()); \
decltype(vec)::iterator result = std::unique(vec.begin(), vec.end()); \
vec.erase(result, vec.end())
using namespace std;
bool prime(int x) {
for (int i = 2; i * i <= x; i++) {
if (x % i == 0)
return false;
}
return x > 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; }
int kai(int x) {
if (x == 0)
return 1;
return kai(x - 1) * x % mod;
}
int mod_pow(int x, int y, int mod_) {
int res = 1;
while (y > 0) {
if (y & 1) {
res = res * x % mod_;
}
x = x * x % mod_;
y >>= 1;
}
return res;
}
int comb(int x, int y) {
if (y > x)
return 0;
return kai(x) * mod_pow(kai(x - y), mod - 2, mod) % mod *
mod_pow(kai(y), mod - 2, mod) % mod;
}
/*--------Library Zone!--------*/
int n, a, b, c, d;
signed main() {
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] == '#') {
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) {
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;
} else
cout << "Yes" << endl;
}
| [
"control_flow.loop.for.initializer.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 830,497 | 830,498 | u147049801 | cpp |
p03017 | #include <bits/stdc++.h>
#define int long long
#define mod (int)(1e9 + 7)
#define inf (int)(3e18 + 7)
#define rep(i, n) for (int i = 0; i < n; i++)
#define REP(i, n) for (int i = 1; i < n; i++)
#define P pair<int, int>
#define PiP pair<int, pair<int, int>>
#define all(v) v.begin(), v.end()
#define mkp make_pair
#define mkt make_tuple
#define prique(T) priority_queue<T, vector<T>, greater<T>>
#define vecunique(vec) \
sort(vec.begin(), vec.end()); \
decltype(vec)::iterator result = std::unique(vec.begin(), vec.end()); \
vec.erase(result, vec.end())
using namespace std;
bool prime(int x) {
for (int i = 2; i * i <= x; i++) {
if (x % i == 0)
return false;
}
return x > 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; }
int kai(int x) {
if (x == 0)
return 1;
return kai(x - 1) * x % mod;
}
int mod_pow(int x, int y, int mod_) {
int res = 1;
while (y > 0) {
if (y & 1) {
res = res * x % mod_;
}
x = x * x % mod_;
y >>= 1;
}
return res;
}
int comb(int x, int y) {
if (y > x)
return 0;
return kai(x) * mod_pow(kai(x - y), mod - 2, mod) % mod *
mod_pow(kai(y), mod - 2, mod) % mod;
}
/*--------Library Zone!--------*/
int n, a, b, c, d;
signed main() {
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] == '#') {
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) {
for (int i = a; i < d - 1; i++) {
if (s[i] == '.' && s[i + 1] == '.' && s[i + 2] == '.') {
cout << "Yes" << endl;
return 0;
}
}
cout << "No" << endl;
} else
cout << "Yes" << endl;
}
| #include <bits/stdc++.h>
#define int long long
#define mod (int)(1e9 + 7)
#define inf (int)(3e18 + 7)
#define rep(i, n) for (int i = 0; i < n; i++)
#define REP(i, n) for (int i = 1; i < n; i++)
#define P pair<int, int>
#define PiP pair<int, pair<int, int>>
#define all(v) v.begin(), v.end()
#define mkp make_pair
#define mkt make_tuple
#define prique(T) priority_queue<T, vector<T>, greater<T>>
#define vecunique(vec) \
sort(vec.begin(), vec.end()); \
decltype(vec)::iterator result = std::unique(vec.begin(), vec.end()); \
vec.erase(result, vec.end())
using namespace std;
bool prime(int x) {
for (int i = 2; i * i <= x; i++) {
if (x % i == 0)
return false;
}
return x > 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; }
int kai(int x) {
if (x == 0)
return 1;
return kai(x - 1) * x % mod;
}
int mod_pow(int x, int y, int mod_) {
int res = 1;
while (y > 0) {
if (y & 1) {
res = res * x % mod_;
}
x = x * x % mod_;
y >>= 1;
}
return res;
}
int comb(int x, int y) {
if (y > x)
return 0;
return kai(x) * mod_pow(kai(x - y), mod - 2, mod) % mod *
mod_pow(kai(y), mod - 2, mod) % mod;
}
/*--------Library Zone!--------*/
int n, a, b, c, d;
signed main() {
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] == '#') {
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) {
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;
} else
cout << "Yes" << endl;
}
| [
"control_flow.loop.for.initializer.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 830,499 | 830,498 | u147049801 | 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;
s = '#' + s + '#';
bool gyaku = a < b == c < d;
for (int i = max(a, b); i < min(c, d); i++) {
if (s[i - 1] == '.' && s[i] == '.' && s[i + 1] == '.')
gyaku = true;
}
bool can = true;
for (int i = a; i < c; i++) {
if (s[i] == '#' && s[i + 1] == '#')
can = false;
}
for (int i = b; i < d; i++) {
if (s[i] == '#' && s[i + 1] == '#')
can = false;
}
cout << (can && gyaku ? "Yes" : "No") << endl;
return 0;
} | #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;
s = '#' + s + '#';
bool gyaku = a < b == c < d;
for (int i = max(a, b); i <= min(c, d); i++) {
if (s[i - 1] == '.' && s[i] == '.' && s[i + 1] == '.')
gyaku = true;
}
bool can = true;
for (int i = a; i < c; i++) {
if (s[i] == '#' && s[i + 1] == '#')
can = false;
}
for (int i = b; i < d; i++) {
if (s[i] == '#' && s[i + 1] == '#')
can = false;
}
cout << (can && gyaku ? "Yes" : "No") << endl;
return 0;
} | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 830,500 | 830,501 | u412908746 | cpp |
p03017 | // unolight {{{
#include <bits/stdc++.h>
#include <unistd.h>
#define SZ(x) ((int)(x).size())
#define ALL(c) begin(c), end(c)
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define REP1(i, a, b) for (int i = (int)(a); i <= (int)(b); i++)
#define FOR(it, c) for (auto it = (c).begin(); it != (c).end(); it++)
#define MP make_pair
#define PB push_back
using namespace std;
typedef pair<int, int> PII;
typedef vector<int> VI;
typedef long long LL;
void RI() {}
template <typename... T> void RI(int &head, T &...tail) {
scanf("%d", &head);
RI(tail...);
}
template <typename T> void _dump(const char *s, T &&head) {
cerr << s << "=" << head << endl;
}
template <typename T, typename... Args>
void _dump(const char *s, T &&head, Args &&...tail) {
int c = 0;
while (*s != ',' || c != 0) {
if (*s == '(' || *s == '[' || *s == '{')
c++;
if (*s == ')' || *s == ']' || *s == '}')
c--;
cerr << *s++;
}
cerr << "=" << head << ", ";
_dump(s + 1, tail...);
}
#define dump(...) _dump(#__VA_ARGS__, __VA_ARGS__);
template <typename A, typename B>
ostream &operator<<(ostream &s, const pair<A, B> &p) {
return s << "(" << p.first << "," << p.second << ")";
}
template <typename Iter> ostream &_out(ostream &s, Iter b, Iter e) {
s << "[";
for (auto it = b; it != e; it++)
s << (it == b ? "" : " ") << *it;
s << "]";
return s;
}
template <typename T> ostream &operator<<(ostream &s, const vector<T> &c) {
return _out(s, ALL(c));
}
template <typename T> ostream &operator<<(ostream &s, const set<T> &c) {
return _out(s, ALL(c));
}
template <typename A, typename B>
ostream &operator<<(ostream &s, const map<A, B> &c) {
return _out(s, ALL(c));
}
// }}}
const int MAX_N = 200005;
int n, a, b, c, d;
char A[MAX_N];
bool dp[MAX_N] = {};
void input() {
RI(n, a, b, c, d);
a--;
b--;
c--;
d--;
scanf("%s", A);
}
bool canMove() {
for (int i = a; i < max(c, d); i++) {
if (A[i] == '#' && A[i + 1] == '#')
return false;
}
return true;
}
bool goodPosition() {
for (int i = b; i < d; i++) {
if (A[i] == '.' && A[i] == A[i + 1] && A[i + 1] == A[i + 2])
return true;
}
return false;
}
bool solve() {
if (!canMove())
return false;
if (c < d || goodPosition()) {
return true;
}
return false;
}
int main(int argc, char *argv[]) {
input();
if (solve()) {
printf("Yes\n");
} else {
printf("No\n");
}
return 0;
} | // unolight {{{
#include <bits/stdc++.h>
#include <unistd.h>
#define SZ(x) ((int)(x).size())
#define ALL(c) begin(c), end(c)
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define REP1(i, a, b) for (int i = (int)(a); i <= (int)(b); i++)
#define FOR(it, c) for (auto it = (c).begin(); it != (c).end(); it++)
#define MP make_pair
#define PB push_back
using namespace std;
typedef pair<int, int> PII;
typedef vector<int> VI;
typedef long long LL;
void RI() {}
template <typename... T> void RI(int &head, T &...tail) {
scanf("%d", &head);
RI(tail...);
}
template <typename T> void _dump(const char *s, T &&head) {
cerr << s << "=" << head << endl;
}
template <typename T, typename... Args>
void _dump(const char *s, T &&head, Args &&...tail) {
int c = 0;
while (*s != ',' || c != 0) {
if (*s == '(' || *s == '[' || *s == '{')
c++;
if (*s == ')' || *s == ']' || *s == '}')
c--;
cerr << *s++;
}
cerr << "=" << head << ", ";
_dump(s + 1, tail...);
}
#define dump(...) _dump(#__VA_ARGS__, __VA_ARGS__);
template <typename A, typename B>
ostream &operator<<(ostream &s, const pair<A, B> &p) {
return s << "(" << p.first << "," << p.second << ")";
}
template <typename Iter> ostream &_out(ostream &s, Iter b, Iter e) {
s << "[";
for (auto it = b; it != e; it++)
s << (it == b ? "" : " ") << *it;
s << "]";
return s;
}
template <typename T> ostream &operator<<(ostream &s, const vector<T> &c) {
return _out(s, ALL(c));
}
template <typename T> ostream &operator<<(ostream &s, const set<T> &c) {
return _out(s, ALL(c));
}
template <typename A, typename B>
ostream &operator<<(ostream &s, const map<A, B> &c) {
return _out(s, ALL(c));
}
// }}}
const int MAX_N = 200005;
int n, a, b, c, d;
char A[MAX_N];
bool dp[MAX_N] = {};
void input() {
RI(n, a, b, c, d);
a--;
b--;
c--;
d--;
scanf("%s", A);
}
bool canMove() {
for (int i = a; i < max(c, d); i++) {
if (A[i] == '#' && A[i + 1] == '#')
return false;
}
return true;
}
bool goodPosition() {
for (int i = b - 1; i < d; i++) {
if (A[i] == '.' && A[i] == A[i + 1] && A[i + 1] == A[i + 2])
return true;
}
return false;
}
bool solve() {
if (!canMove())
return false;
if (c < d || goodPosition()) {
return true;
}
return false;
}
int main(int argc, char *argv[]) {
input();
if (solve()) {
printf("Yes\n");
} else {
printf("No\n");
}
return 0;
} | [
"control_flow.loop.for.initializer.change"
] | 830,502 | 830,503 | u385825353 | cpp |
p03017 | // unolight {{{
#include <bits/stdc++.h>
#include <unistd.h>
#define SZ(x) ((int)(x).size())
#define ALL(c) begin(c), end(c)
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define REP1(i, a, b) for (int i = (int)(a); i <= (int)(b); i++)
#define FOR(it, c) for (auto it = (c).begin(); it != (c).end(); it++)
#define MP make_pair
#define PB push_back
using namespace std;
typedef pair<int, int> PII;
typedef vector<int> VI;
typedef long long LL;
void RI() {}
template <typename... T> void RI(int &head, T &...tail) {
scanf("%d", &head);
RI(tail...);
}
template <typename T> void _dump(const char *s, T &&head) {
cerr << s << "=" << head << endl;
}
template <typename T, typename... Args>
void _dump(const char *s, T &&head, Args &&...tail) {
int c = 0;
while (*s != ',' || c != 0) {
if (*s == '(' || *s == '[' || *s == '{')
c++;
if (*s == ')' || *s == ']' || *s == '}')
c--;
cerr << *s++;
}
cerr << "=" << head << ", ";
_dump(s + 1, tail...);
}
#define dump(...) _dump(#__VA_ARGS__, __VA_ARGS__);
template <typename A, typename B>
ostream &operator<<(ostream &s, const pair<A, B> &p) {
return s << "(" << p.first << "," << p.second << ")";
}
template <typename Iter> ostream &_out(ostream &s, Iter b, Iter e) {
s << "[";
for (auto it = b; it != e; it++)
s << (it == b ? "" : " ") << *it;
s << "]";
return s;
}
template <typename T> ostream &operator<<(ostream &s, const vector<T> &c) {
return _out(s, ALL(c));
}
template <typename T> ostream &operator<<(ostream &s, const set<T> &c) {
return _out(s, ALL(c));
}
template <typename A, typename B>
ostream &operator<<(ostream &s, const map<A, B> &c) {
return _out(s, ALL(c));
}
// }}}
const int MAX_N = 200005;
int n, a, b, c, d;
char A[MAX_N];
bool dp[MAX_N] = {};
void input() {
RI(n, a, b, c, d);
a--;
b--;
c--;
d--;
scanf("%s", A);
}
bool canMove() {
for (int i = a; i < max(c, d); i++) {
if (A[i] == '#' && A[i + 1] == '#')
return false;
}
return true;
}
bool goodPosition() {
for (int i = b; i < d; i++) {
if (A[i] == '.' && A[i] == A[i + 1] && A[i + 1] == A[i + 2])
return true;
}
return false;
}
bool solve() {
if (!canMove())
return false;
if (c < d || goodPosition()) {
return true;
}
return false;
}
int main(int argc, char *argv[]) {
input();
if (solve()) {
printf("Yes\n");
} else {
printf("No\n");
}
return 0;
} | // unolight {{{
#include <bits/stdc++.h>
#include <unistd.h>
#define SZ(x) ((int)(x).size())
#define ALL(c) begin(c), end(c)
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define REP1(i, a, b) for (int i = (int)(a); i <= (int)(b); i++)
#define FOR(it, c) for (auto it = (c).begin(); it != (c).end(); it++)
#define MP make_pair
#define PB push_back
using namespace std;
typedef pair<int, int> PII;
typedef vector<int> VI;
typedef long long LL;
void RI() {}
template <typename... T> void RI(int &head, T &...tail) {
scanf("%d", &head);
RI(tail...);
}
template <typename T> void _dump(const char *s, T &&head) {
cerr << s << "=" << head << endl;
}
template <typename T, typename... Args>
void _dump(const char *s, T &&head, Args &&...tail) {
int c = 0;
while (*s != ',' || c != 0) {
if (*s == '(' || *s == '[' || *s == '{')
c++;
if (*s == ')' || *s == ']' || *s == '}')
c--;
cerr << *s++;
}
cerr << "=" << head << ", ";
_dump(s + 1, tail...);
}
#define dump(...) _dump(#__VA_ARGS__, __VA_ARGS__);
template <typename A, typename B>
ostream &operator<<(ostream &s, const pair<A, B> &p) {
return s << "(" << p.first << "," << p.second << ")";
}
template <typename Iter> ostream &_out(ostream &s, Iter b, Iter e) {
s << "[";
for (auto it = b; it != e; it++)
s << (it == b ? "" : " ") << *it;
s << "]";
return s;
}
template <typename T> ostream &operator<<(ostream &s, const vector<T> &c) {
return _out(s, ALL(c));
}
template <typename T> ostream &operator<<(ostream &s, const set<T> &c) {
return _out(s, ALL(c));
}
template <typename A, typename B>
ostream &operator<<(ostream &s, const map<A, B> &c) {
return _out(s, ALL(c));
}
// }}}
const int MAX_N = 200005;
int n, a, b, c, d;
char A[MAX_N];
bool dp[MAX_N] = {};
void input() {
RI(n, a, b, c, d);
a--;
b--;
c--;
d--;
scanf("%s", A);
}
bool canMove() {
for (int i = a; i < max(c, d); i++) {
if (A[i] == '#' && A[i + 1] == '#')
return false;
}
return true;
}
bool goodPosition() {
for (int i = b; i <= d; i++) {
if (A[i] == '.' && A[i] == A[i - 1] && A[i + 1] == A[i])
return true;
}
return false;
}
bool solve() {
if (!canMove())
return false;
if (c < d || goodPosition()) {
return true;
}
return false;
}
int main(int argc, char *argv[]) {
input();
if (solve()) {
printf("Yes\n");
} else {
printf("No\n");
}
return 0;
} | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"misc.opposites",
"expression.operator.arithmetic.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change",
"expression.o... | 830,502 | 830,504 | u385825353 | cpp |
p03017 | #include <iostream>
using namespace std;
int main() {
int n, a, b, c, d;
cin >> n >> a >> b >> c >> d;
string s;
cin >> s;
bool judgement = true;
bool rock = false;
bool adjascent_three_free_space = false;
a--;
b--;
c--;
d--;
if (c < d) {
for (int i = a; i < d; i++) {
if (rock) {
if (s[i] == '#') {
judgement = false;
break;
}
}
if (s[i] == '#') {
rock = true;
} else {
rock = false;
}
}
if (judgement) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
} else {
for (int i = a; i < c; i++) {
if (a < i && i <= d) {
if (s[i - 1] == '.' && s[i] == '.' && s[i + 1] == '.') {
adjascent_three_free_space = true;
}
}
if (rock) {
if (s[i] == '#') {
judgement = false;
break;
}
}
if (s[i] == '#') {
rock = true;
} else {
rock = false;
}
}
if (judgement && adjascent_three_free_space) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
}
return 0;
} | #include <iostream>
using namespace std;
int main() {
int n, a, b, c, d;
cin >> n >> a >> b >> c >> d;
string s;
cin >> s;
bool judgement = true;
bool rock = false;
bool adjascent_three_free_space = false;
a--;
b--;
c--;
d--;
if (c < d) {
for (int i = a; i < d; i++) {
if (rock) {
if (s[i] == '#') {
judgement = false;
break;
}
}
if (s[i] == '#') {
rock = true;
} else {
rock = false;
}
}
if (judgement) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
} else {
for (int i = a; i < c; i++) {
if (b <= i && i <= d) {
if (s[i - 1] == '.' && s[i] == '.' && s[i + 1] == '.') {
adjascent_three_free_space = true;
}
}
if (rock) {
if (s[i] == '#') {
judgement = false;
break;
}
}
if (s[i] == '#') {
rock = true;
} else {
rock = false;
}
}
if (judgement && adjascent_three_free_space) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
}
return 0;
} | [
"control_flow.loop.for.condition.change"
] | 830,505 | 830,506 | u629133942 | cpp |
p03017 | #include <iostream>
using namespace std;
int main() {
int n, a, b, c, d;
cin >> n >> a >> b >> c >> d;
string s;
cin >> s;
bool judgement = true;
bool rock = false;
bool adjascent_three_free_space = false;
a--;
b--;
c--;
d--;
if (c < d) {
for (int i = a; i <= d; i++) {
if (rock) {
if (s[i] == '#') {
judgement = false;
break;
}
}
if (s[i] == '#') {
rock = true;
} else {
rock = false;
}
}
if (judgement) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
} else {
for (int i = a; i <= c; i++) {
if (a < i && i <= d) {
if (s[i - 1] == '.' && s[i] == '.' && s[i + 1] == '.') {
adjascent_three_free_space = true;
}
}
if (rock) {
if (s[i] == '#') {
judgement = false;
break;
}
}
if (s[i] == '#') {
rock = true;
} else {
rock = false;
}
}
if (judgement && adjascent_three_free_space) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
}
return 0;
} | #include <iostream>
using namespace std;
int main() {
int n, a, b, c, d;
cin >> n >> a >> b >> c >> d;
string s;
cin >> s;
bool judgement = true;
bool rock = false;
bool adjascent_three_free_space = false;
a--;
b--;
c--;
d--;
if (c < d) {
for (int i = a; i < d; i++) {
if (rock) {
if (s[i] == '#') {
judgement = false;
break;
}
}
if (s[i] == '#') {
rock = true;
} else {
rock = false;
}
}
if (judgement) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
} else {
for (int i = a; i < c; i++) {
if (b <= i && i <= d) {
if (s[i - 1] == '.' && s[i] == '.' && s[i + 1] == '.') {
adjascent_three_free_space = true;
}
}
if (rock) {
if (s[i] == '#') {
judgement = false;
break;
}
}
if (s[i] == '#') {
rock = true;
} else {
rock = false;
}
}
if (judgement && adjascent_three_free_space) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
}
return 0;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 830,507 | 830,506 | u629133942 | cpp |
p03017 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define PI 3.1415926535897932384626433832795
#define MOD (1000000007)
#define rep(i, n) for (int i = 0; i < (n); i++)
#define repc(i, s, n) for (int i = (s); i <= (n); i++)
#define rrep(i, n) for (int i = (n)-1; i >= 0; i--)
#define rrepc(i, s, n) for (int i = (s); i >= (n); i--)
typedef long long ll;
typedef unsigned long long ull;
int main() {
int N, A, B, C, D;
int space = 0, rock = 0;
string S;
bool ans = true, jumpover = false;
;
cin >> N >> A >> B >> C >> D >> S;
A--, B--, C--, D--;
repc(i, A, max(C, D)) {
if (S[i] == '#')
rock++;
else
rock = 0;
if (rock >= 2)
ans = false;
}
if (D < C) {
repc(i, B - 1, C) {
if (S[i] == '.')
space++;
else
space = 0;
if (space >= 3)
jumpover = true;
}
if (!jumpover)
ans = false;
}
cout << (ans ? "Yes" : "No") << endl;
return 0;
}
| #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define PI 3.1415926535897932384626433832795
#define MOD (1000000007)
#define rep(i, n) for (int i = 0; i < (n); i++)
#define repc(i, s, n) for (int i = (s); i <= (n); i++)
#define rrep(i, n) for (int i = (n)-1; i >= 0; i--)
#define rrepc(i, s, n) for (int i = (s); i >= (n); i--)
typedef long long ll;
typedef unsigned long long ull;
int main() {
int N, A, B, C, D;
int space = 0, rock = 0;
string S;
bool ans = true, jumpover = false;
;
cin >> N >> A >> B >> C >> D >> S;
A--, B--, C--, D--;
repc(i, A, max(C, D)) {
if (S[i] == '#')
rock++;
else
rock = 0;
if (rock >= 2)
ans = false;
}
if (D < C) {
repc(i, B - 1, D + 1) {
if (S[i] == '.')
space++;
else
space = 0;
if (space >= 3)
jumpover = true;
}
if (!jumpover)
ans = false;
}
cout << (ans ? "Yes" : "No") << endl;
return 0;
}
| [
"call.arguments.change"
] | 830,512 | 830,513 | u547448704 | cpp |
p03017 | #include <bits/stdc++.h>
#define REP(i, n) for (ll i = 0; i < (ll)n; i++)
#define FOR(i, a, b) for (ll i = (a); i < (ll)b; i++)
#define ALL(obj) (obj).begin(), (obj).end()
#define INF (1ll << 60)
#define sz(x) int(x.size())
using namespace std;
typedef long long ll;
using vl = vector<ll>;
using vvl = vector<vl>;
typedef double db;
typedef string str;
typedef pair<ll, ll> p;
constexpr int MOD = 1000000007;
using ll = long long;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
void print(const std::vector<ll> &v) {
std::for_each(v.begin(), v.end(), [](ll x) { std::cout << x << " "; });
std::cout << std::endl;
}
int main() {
int N, A, B, C, D;
cin >> N >> A >> B >> C >> D;
string S;
cin >> S;
//超えないと行けない時にめんどくさい
int cnt = 0;
int F = max(C, D);
for (size_t i = A - 1; i < F; i++) {
if (S[i] == '#') {
cnt++;
} else {
cnt = 0;
}
if (cnt >= 2) {
cout << "No" << endl;
return 0;
}
}
if (B >= C) {
cout << "Yes" << endl;
return 0;
}
if (C <= D) {
cout << "Yes" << endl;
return 0;
}
// AからCへ
// BからDへ
if (D <= C) {
cnt = 0;
for (int i = B - 2; i < D; i++) {
if (S[i] == '.') {
cnt++;
} else {
cnt = 0;
}
if (cnt >= 3) {
cout << "Yes" << endl;
return 0;
}
}
}
cout << "No" << endl;
return 0;
} | #include <bits/stdc++.h>
#define REP(i, n) for (ll i = 0; i < (ll)n; i++)
#define FOR(i, a, b) for (ll i = (a); i < (ll)b; i++)
#define ALL(obj) (obj).begin(), (obj).end()
#define INF (1ll << 60)
#define sz(x) int(x.size())
using namespace std;
typedef long long ll;
using vl = vector<ll>;
using vvl = vector<vl>;
typedef double db;
typedef string str;
typedef pair<ll, ll> p;
constexpr int MOD = 1000000007;
using ll = long long;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
void print(const std::vector<ll> &v) {
std::for_each(v.begin(), v.end(), [](ll x) { std::cout << x << " "; });
std::cout << std::endl;
}
int main() {
int N, A, B, C, D;
cin >> N >> A >> B >> C >> D;
string S;
cin >> S;
//超えないと行けない時にめんどくさい
int cnt = 0;
int F = max(C, D);
for (size_t i = A - 1; i < F; i++) {
if (S[i] == '#') {
cnt++;
} else {
cnt = 0;
}
if (cnt >= 2) {
cout << "No" << endl;
return 0;
}
}
if (B >= C) {
cout << "Yes" << endl;
return 0;
}
if (C <= D) {
cout << "Yes" << endl;
return 0;
}
// AからCへ
// BからDへ
if (D <= C) {
cnt = 0;
for (int i = B - 2; i < D + 1; i++) {
if (S[i] == '.') {
cnt++;
} else {
cnt = 0;
}
if (cnt >= 3) {
cout << "Yes" << endl;
return 0;
}
}
}
cout << "No" << endl;
return 0;
} | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 830,539 | 830,540 | u824337972 | cpp |
p03017 | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
int main() {
ll n, a, b, c, d;
string s;
cin >> n >> a >> b >> c >> d >> s;
bool ans = true;
if (c < d) {
bool f = false;
for (ll i = a - 1; i < d - 2; i++) {
if (s[i] == s[i + 1] && s[i] == '#') {
ans = false;
}
}
} else {
bool f = false;
for (ll i = b - 1; i < d - 1; i++) {
if (s[i - 1] == s[i] && s[i] == s[i + 1] && s[i] == '.') {
f = true;
break;
}
}
if (f) {
for (ll i = a - 1; i < c - 2; i++) {
if (s[i] == s[i + 1] && s[i] == '#') {
ans = false;
}
}
} else {
ans = false;
}
}
if (ans) {
cout << "Yes";
} else {
cout << "No";
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
int main() {
ll n, a, b, c, d;
string s;
cin >> n >> a >> b >> c >> d >> s;
bool ans = true;
if (c < d) {
bool f = false;
for (ll i = a - 1; i <= d - 2; i++) {
if (s[i] == s[i + 1] && s[i] == '#') {
ans = false;
}
}
} else {
bool f = false;
for (ll i = b - 1; i <= d - 1; i++) {
if (s[i - 1] == s[i] && s[i] == s[i + 1] && s[i] == '.') {
f = true;
break;
}
}
if (f) {
for (ll i = a - 1; i <= c - 2; i++) {
if (s[i] == s[i + 1] && s[i] == '#') {
ans = false;
}
}
} else {
ans = false;
}
}
if (ans) {
cout << "Yes";
} else {
cout << "No";
}
return 0;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 830,545 | 830,546 | u125051909 | cpp |
p03017 | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
int main() {
ll n, a, b, c, d;
string s;
cin >> n >> a >> b >> c >> d >> s;
bool ans = true;
if (c < d) {
bool f = false;
for (ll i = a - 1; i < d - 2; i++) {
if (s[i] == s[i + 1] && s[i] == '#') {
ans = false;
}
}
} else {
bool f = false;
for (ll i = b - 1; i < d - 1; i++) {
if (s[i - 1] == s[i] && s[i] == s[i + 1] && s[i] == '.') {
f = true;
break;
}
}
if (f) {
for (ll i = a - 1; i < d - 2; i++) {
if (s[i] == s[i + 1] && s[i] == '#') {
ans = false;
}
}
} else {
ans = false;
}
}
if (ans) {
cout << "Yes";
} else {
cout << "No";
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
int main() {
ll n, a, b, c, d;
string s;
cin >> n >> a >> b >> c >> d >> s;
bool ans = true;
if (c < d) {
bool f = false;
for (ll i = a - 1; i <= d - 2; i++) {
if (s[i] == s[i + 1] && s[i] == '#') {
ans = false;
}
}
} else {
bool f = false;
for (ll i = b - 1; i <= d - 1; i++) {
if (s[i - 1] == s[i] && s[i] == s[i + 1] && s[i] == '.') {
f = true;
break;
}
}
if (f) {
for (ll i = a - 1; i <= c - 2; i++) {
if (s[i] == s[i + 1] && s[i] == '#') {
ans = false;
}
}
} else {
ans = false;
}
}
if (ans) {
cout << "Yes";
} else {
cout << "No";
}
return 0;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 830,547 | 830,546 | u125051909 | cpp |
p03017 | #include <bits/stdc++.h>
using namespace std;
bool valid(int x, int y, string &s) {
for (int i = x; i + 1 <= y; ++i) {
if (s[i] == '#' and s[i + 1] == '#')
return false;
}
return true;
}
int main() {
int N, A, B, C, D;
cin >> N >> A >> B >> C >> D;
--A;
--B;
--C;
--D;
string s;
cin >> s;
if (not valid(A, C, s) or not valid(B, D, s))
return puts("No") * 0;
if (C < D) {
// reachble...
puts("Yes");
} else {
// s[A] = '#';
// C >= D
bool flag = false;
for (int i = B; i < D; ++i) {
if (i - 1 >= 0 and i + 1 < N) {
if (s[i - 1] == '.' and s[i] == '.' and s[i + 1] == '.') {
flag = true;
}
}
}
(flag ? puts("Yes") : puts("No"));
}
}
| #include <bits/stdc++.h>
using namespace std;
bool valid(int x, int y, string &s) {
for (int i = x; i + 1 <= y; ++i) {
if (s[i] == '#' and s[i + 1] == '#')
return false;
}
return true;
}
int main() {
int N, A, B, C, D;
cin >> N >> A >> B >> C >> D;
--A;
--B;
--C;
--D;
string s;
cin >> s;
if (not valid(A, C, s) or not valid(B, D, s))
return puts("No") * 0;
if (C < D) {
// reachble...
puts("Yes");
} else {
// s[A] = '#';
// C >= D
bool flag = false;
for (int i = B; i <= D; ++i) {
if (i - 1 >= 0 and i + 1 < N) {
if (s[i - 1] == '.' and s[i] == '.' and s[i + 1] == '.') {
flag = true;
}
}
}
(flag ? puts("Yes") : puts("No"));
}
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 830,548 | 830,549 | u318334550 | cpp |
p03017 | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define SORT(v, n) sort(v, v + n);
#define VSORT(v) sort(v.begin(), v.end())
#define VRSORT(v) sort(v.rbegin(), v.rend()) // vectorの降順ソート
#define ll long long
#define pb(a) push_back(a)
#define INF 1000000000
#define MOD 1000000007
using namespace std;
typedef pair<int, int> P;
typedef pair<ll, ll> LP;
typedef pair<int, P> PP;
typedef pair<ll, LP> LPP;
typedef vector<unsigned int> vec;
typedef vector<vec> mat;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
int dy[] = {0, 0, 1, -1, 0};
int dx[] = {1, -1, 0, 0, 0};
int 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;
--a, --b, --c, --d;
// int ma_dot=0,ma_block=0;
bool flg = true;
bool block = false;
int tmp = 0;
bool ok = false;
if (d < c) {
for (int i = b; i < d; i++) {
if (s[i - 1] == '.' && s[i] == '.' & s[i + 1] == '.')
ok = true;
}
}
for (int i = a; i <= c; i++) {
if (s[i] == '#' && s[i + 1] == '#')
block = true;
}
for (int i = b; i <= d; i++) {
if (s[i] == '#' && s[i + 1] == '#')
block = true;
}
if (block) {
cout << "No" << endl;
return 0;
}
if (c < d) {
cout << "Yes" << endl;
return 0;
} else {
if (ok) {
cout << "Yes" << endl;
return 0;
} else {
cout << "No" << endl;
return 0;
}
}
assert(0);
// cout<<"No"<<endl;
} | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define SORT(v, n) sort(v, v + n);
#define VSORT(v) sort(v.begin(), v.end())
#define VRSORT(v) sort(v.rbegin(), v.rend()) // vectorの降順ソート
#define ll long long
#define pb(a) push_back(a)
#define INF 1000000000
#define MOD 1000000007
using namespace std;
typedef pair<int, int> P;
typedef pair<ll, ll> LP;
typedef pair<int, P> PP;
typedef pair<ll, LP> LPP;
typedef vector<unsigned int> vec;
typedef vector<vec> mat;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
int dy[] = {0, 0, 1, -1, 0};
int dx[] = {1, -1, 0, 0, 0};
int 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;
--a, --b, --c, --d;
bool block = false;
int tmp = 0;
bool ok = false;
if (d < c) {
for (int i = b; i <= d; i++) {
if (s[i - 1] == '.' && s[i] == '.' & s[i + 1] == '.')
ok = true;
}
}
for (int i = a; i <= c; i++) {
if (s[i] == '#' && s[i + 1] == '#')
block = true;
}
for (int i = b; i <= d; i++) {
if (s[i] == '#' && s[i + 1] == '#')
block = true;
}
if (block) {
cout << "No" << endl;
return 0;
}
if (c < d) {
cout << "Yes" << endl;
return 0;
} else {
if (ok) {
cout << "Yes" << endl;
return 0;
} else {
cout << "No" << endl;
return 0;
}
}
assert(0);
// cout<<"No"<<endl;
} | [
"variable_declaration.remove",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 830,563 | 830,564 | u493750228 | cpp |
p03017 | #include <bits/stdc++.h>
using namespace std;
#pragma GCC optimize("Ofast")
#define rep(i, n) for (int i = 0; i < n; i++)
const long long MOD = 1000000007;
const long long INF = MOD * MOD;
typedef pair<int, int> P;
typedef long long ll;
ll n, m, k, ans;
string s;
main() {
int n, a, b, c, d;
cin >> n >> a >> b >> c >> d;
cin >> s;
string frag = "No";
bool tmp1 = true;
for (int i = a; i < d - 1; i++) {
if (s[i] == '#' && s[i + 1] == '#')
tmp1 = false;
}
if (c < d) {
if (tmp1)
frag = "Yes";
} else {
bool tmp2 = false;
for (int i = b - 1; i < d - 1; i++) {
if (s[i] == '.' && s[i + 1] == '.' && s[i + 2] == '.') {
tmp2 = true;
}
}
if (tmp1 && tmp2)
frag = "Yes";
}
cout << frag << endl;
} | #include <bits/stdc++.h>
using namespace std;
#pragma GCC optimize("Ofast")
#define rep(i, n) for (int i = 0; i < n; i++)
const long long MOD = 1000000007;
const long long INF = MOD * MOD;
typedef pair<int, int> P;
typedef long long ll;
ll n, m, k, ans;
string s;
main() {
int n, a, b, c, d;
cin >> n >> a >> b >> c >> d;
cin >> s;
string frag = "No";
bool tmp1 = true;
for (int i = a; i < d - 1; i++) {
if (s[i] == '#' && s[i + 1] == '#')
tmp1 = false;
}
if (c < d) {
if (tmp1)
frag = "Yes";
} else {
bool tmp2 = false;
for (int i = b - 2; i < d - 1; i++) {
if (s[i] == '.' && s[i + 1] == '.' && s[i + 2] == '.') {
tmp2 = true;
}
}
if (tmp1 && tmp2)
frag = "Yes";
}
cout << frag << endl;
} | [
"literal.number.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 830,568 | 830,569 | u974214237 | cpp |
p03017 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int N;
int A, B, C, D;
string S;
int main() {
ios_base::sync_with_stdio(0);
cin >> N >> A >> B >> C >> D >> S;
A--, B--, C--, D--;
bool bad = false;
for (int i = A; i < min(C, D); i++) {
if (S[i] == '#' && S[i + 1] == '#') {
bad = true;
}
}
bool good = true;
if (C > D) {
good = false;
for (int i = B; i <= C; i++) {
if (S[i] == '.' && S[i + 1] == '.' && S[i - 1] == '.')
good = true;
}
}
if (bad || !good)
cout << "No\n";
else
cout << "Yes\n";
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int N;
int A, B, C, D;
string S;
int main() {
ios_base::sync_with_stdio(0);
cin >> N >> A >> B >> C >> D >> S;
A--, B--, C--, D--;
bool bad = false;
for (int i = A; i < max(C, D); i++) {
if (S[i] == '#' && S[i + 1] == '#') {
bad = true;
}
}
bool good = true;
if (C > D) {
good = false;
for (int i = B; i <= D; i++) {
if (S[i] == '.' && S[i + 1] == '.' && S[i - 1] == '.')
good = true;
}
}
if (bad || !good)
cout << "No\n";
else
cout << "Yes\n";
} | [
"misc.opposites",
"identifier.change",
"call.function.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"control_flow.branch.if.condition.change"
] | 830,581 | 830,580 | u409373192 | cpp |
p03017 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int N;
int A, B, C, D;
string S;
int main() {
ios_base::sync_with_stdio(0);
cin >> N >> A >> B >> C >> D >> S;
A--, B--, C--, D--;
bool bad = false;
for (int i = A; i < min(C, D); i++) {
if (S[i] == '#' && S[i + 1] == '#') {
bad = true;
}
}
bool good = true;
if (C > D) {
good = false;
for (int i = B; i <= C; i++) {
if (S[i] == '.' && S[i + 1] == '.' && S[i - 1] == '.')
good = true;
}
}
if (bad || !good)
cout << "NO\n";
else
cout << "YES\n";
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int N;
int A, B, C, D;
string S;
int main() {
ios_base::sync_with_stdio(0);
cin >> N >> A >> B >> C >> D >> S;
A--, B--, C--, D--;
bool bad = false;
for (int i = A; i < max(C, D); i++) {
if (S[i] == '#' && S[i + 1] == '#') {
bad = true;
}
}
bool good = true;
if (C > D) {
good = false;
for (int i = B; i <= D; i++) {
if (S[i] == '.' && S[i + 1] == '.' && S[i - 1] == '.')
good = true;
}
}
if (bad || !good)
cout << "No\n";
else
cout << "Yes\n";
} | [
"misc.opposites",
"identifier.change",
"call.function.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"control_flow.branch.if.condition.change",
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 830,582 | 830,580 | u409373192 | cpp |
p03017 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <fstream>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <unordered_set>
#include <vector>
#define MOD_BIG 1000000007
#define MOD_BIG2 998244353
using std::cerr;
using std::cin;
using std::cout;
using std::endl;
using std::string;
using ll = long long;
using std::vector;
#define FOR(i, begin, end) \
for (int i = (begin), i##_end_ = (end); i < i##_end_; i++)
#define IFOR(i, begin, end) \
for (int i = (end)-1, i##_begin_ = (begin); i >= i##_begin_; i--)
#define REP(i, n) FOR(i, 0, n)
#define IREP(i, n) IFOR(i, 0, n)
//////////////////////////////////////
//////////////////////////////////////
int main() {
int N, A, B, C, D;
string S;
cin >> N >> A >> B >> C >> D;
cin >> S;
bool ans = true;
char b = '.';
FOR(i, B, D) {
if (b == '#' && S[i - 1] == '#') {
ans = false;
break;
}
b = S[i - 1];
}
b = '.';
FOR(i, A, C) {
if (b == '#' && S[i - 1] == '#') {
ans = false;
break;
}
b = S[i - 1];
}
if (C > D && ans) {
int cnt = 0;
ans = false;
if (S[B] == '.' && S[B - 2] == '.') {
ans = true;
}
FOR(i, B, D + 2) {
if (S[i - 1] == '#') {
if (cnt >= 3) {
ans = true;
}
cnt = 0;
} else {
cnt++;
}
}
}
if (ans) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
return 0;
}
| #include <algorithm>
#include <bitset>
#include <cmath>
#include <fstream>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <unordered_set>
#include <vector>
#define MOD_BIG 1000000007
#define MOD_BIG2 998244353
using std::cerr;
using std::cin;
using std::cout;
using std::endl;
using std::string;
using ll = long long;
using std::vector;
#define FOR(i, begin, end) \
for (int i = (begin), i##_end_ = (end); i < i##_end_; i++)
#define IFOR(i, begin, end) \
for (int i = (end)-1, i##_begin_ = (begin); i >= i##_begin_; i--)
#define REP(i, n) FOR(i, 0, n)
#define IREP(i, n) IFOR(i, 0, n)
//////////////////////////////////////
//////////////////////////////////////
int main() {
int N, A, B, C, D;
string S;
cin >> N >> A >> B >> C >> D;
cin >> S;
bool ans = true;
char b = '.';
FOR(i, B, D) {
if (b == '#' && S[i - 1] == '#') {
ans = false;
break;
}
b = S[i - 1];
}
b = '.';
FOR(i, A, C) {
if (b == '#' && S[i - 1] == '#') {
ans = false;
break;
}
b = S[i - 1];
}
if (C > D && ans) {
int cnt = 0;
ans = false;
if (S[B] == '.' && S[B - 2] == '.') {
ans = true;
}
FOR(i, B, D + 3) {
if (S[i - 1] == '#') {
if (cnt >= 3) {
ans = true;
}
cnt = 0;
} else {
cnt++;
}
}
}
if (ans) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
return 0;
}
| [
"literal.number.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 830,585 | 830,586 | u888094685 | cpp |
p03017 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <fstream>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <unordered_set>
#include <vector>
#define MOD_BIG 1000000007
#define MOD_BIG2 998244353
using std::cerr;
using std::cin;
using std::cout;
using std::endl;
using std::string;
using ll = long long;
using std::vector;
#define FOR(i, begin, end) \
for (int i = (begin), i##_end_ = (end); i < i##_end_; i++)
#define IFOR(i, begin, end) \
for (int i = (end)-1, i##_begin_ = (begin); i >= i##_begin_; i--)
#define REP(i, n) FOR(i, 0, n)
#define IREP(i, n) IFOR(i, 0, n)
//////////////////////////////////////
//////////////////////////////////////
int main() {
int N, A, B, C, D;
string S;
cin >> N >> A >> B >> C >> D;
cin >> S;
bool ans = true;
char b = '.';
FOR(i, B, D) {
if (b == '#' && S[i - 1] == '#') {
ans = false;
break;
}
b = S[i - 1];
}
b = '.';
FOR(i, A, C) {
if (b == '#' && S[i - 1] == '#') {
ans = false;
break;
}
b = S[i - 1];
}
if (C > D && ans) {
int cnt = 0;
ans = false;
if (S[B] == '.' && S[B - 2] == '.') {
ans = true;
}
FOR(i, B, D - 1) {
if (S[i - 1] == '#') {
if (cnt >= 3) {
ans = true;
}
cnt = 0;
} else {
cnt++;
}
}
}
if (ans) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
return 0;
}
| #include <algorithm>
#include <bitset>
#include <cmath>
#include <fstream>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <unordered_set>
#include <vector>
#define MOD_BIG 1000000007
#define MOD_BIG2 998244353
using std::cerr;
using std::cin;
using std::cout;
using std::endl;
using std::string;
using ll = long long;
using std::vector;
#define FOR(i, begin, end) \
for (int i = (begin), i##_end_ = (end); i < i##_end_; i++)
#define IFOR(i, begin, end) \
for (int i = (end)-1, i##_begin_ = (begin); i >= i##_begin_; i--)
#define REP(i, n) FOR(i, 0, n)
#define IREP(i, n) IFOR(i, 0, n)
//////////////////////////////////////
//////////////////////////////////////
int main() {
int N, A, B, C, D;
string S;
cin >> N >> A >> B >> C >> D;
cin >> S;
bool ans = true;
char b = '.';
FOR(i, B, D) {
if (b == '#' && S[i - 1] == '#') {
ans = false;
break;
}
b = S[i - 1];
}
b = '.';
FOR(i, A, C) {
if (b == '#' && S[i - 1] == '#') {
ans = false;
break;
}
b = S[i - 1];
}
if (C > D && ans) {
int cnt = 0;
ans = false;
if (S[B] == '.' && S[B - 2] == '.') {
ans = true;
}
FOR(i, B, D + 3) {
if (S[i - 1] == '#') {
if (cnt >= 3) {
ans = true;
}
cnt = 0;
} else {
cnt++;
}
}
}
if (ans) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
return 0;
}
| [] | 830,587 | 830,586 | u888094685 | cpp |
p03017 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <fstream>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <unordered_set>
#include <vector>
#define MOD_BIG 1000000007
#define MOD_BIG2 998244353
using std::cerr;
using std::cin;
using std::cout;
using std::endl;
using std::string;
using ll = long long;
using std::vector;
#define FOR(i, begin, end) \
for (int i = (begin), i##_end_ = (end); i < i##_end_; i++)
#define IFOR(i, begin, end) \
for (int i = (end)-1, i##_begin_ = (begin); i >= i##_begin_; i--)
#define REP(i, n) FOR(i, 0, n)
#define IREP(i, n) IFOR(i, 0, n)
//////////////////////////////////////
//////////////////////////////////////
int main() {
int N, A, B, C, D;
string S;
cin >> N >> A >> B >> C >> D;
cin >> S;
bool ans = true;
char b = '.';
FOR(i, B, D) {
if (b == '#' && S[i - 1] == '#') {
ans = false;
break;
}
b = S[i - 1];
}
b = '.';
FOR(i, A, C) {
if (b == '#' && S[i - 1] == '#') {
ans = false;
break;
}
b = S[i - 1];
}
if (C > D && ans) {
int cnt = 0;
ans = false;
if (S[B] == '.' && S[B - 2] == '.') {
ans = true;
}
FOR(i, B, D) {
if (S[i - 1] == '#') {
if (cnt >= 3) {
ans = true;
}
cnt = 0;
} else {
cnt++;
}
}
}
if (ans) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
return 0;
}
| #include <algorithm>
#include <bitset>
#include <cmath>
#include <fstream>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <unordered_set>
#include <vector>
#define MOD_BIG 1000000007
#define MOD_BIG2 998244353
using std::cerr;
using std::cin;
using std::cout;
using std::endl;
using std::string;
using ll = long long;
using std::vector;
#define FOR(i, begin, end) \
for (int i = (begin), i##_end_ = (end); i < i##_end_; i++)
#define IFOR(i, begin, end) \
for (int i = (end)-1, i##_begin_ = (begin); i >= i##_begin_; i--)
#define REP(i, n) FOR(i, 0, n)
#define IREP(i, n) IFOR(i, 0, n)
//////////////////////////////////////
//////////////////////////////////////
int main() {
int N, A, B, C, D;
string S;
cin >> N >> A >> B >> C >> D;
cin >> S;
bool ans = true;
char b = '.';
FOR(i, B, D) {
if (b == '#' && S[i - 1] == '#') {
ans = false;
break;
}
b = S[i - 1];
}
b = '.';
FOR(i, A, C) {
if (b == '#' && S[i - 1] == '#') {
ans = false;
break;
}
b = S[i - 1];
}
if (C > D && ans) {
int cnt = 0;
ans = false;
if (S[B] == '.' && S[B - 2] == '.') {
ans = true;
}
FOR(i, B, D + 3) {
if (S[i - 1] == '#') {
if (cnt >= 3) {
ans = true;
}
cnt = 0;
} else {
cnt++;
}
}
}
if (ans) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
return 0;
}
| [
"expression.operation.binary.add"
] | 830,589 | 830,586 | u888094685 | cpp |
p03017 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <fstream>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <unordered_set>
#include <vector>
#define MOD_BIG 1000000007
#define MOD_BIG2 998244353
using std::cerr;
using std::cin;
using std::cout;
using std::endl;
using std::string;
using ll = long long;
using std::vector;
#define FOR(i, begin, end) \
for (int i = (begin), i##_end_ = (end); i < i##_end_; i++)
#define IFOR(i, begin, end) \
for (int i = (end)-1, i##_begin_ = (begin); i >= i##_begin_; i--)
#define REP(i, n) FOR(i, 0, n)
#define IREP(i, n) IFOR(i, 0, n)
//////////////////////////////////////
//////////////////////////////////////
int main() {
int N, A, B, C, D;
string S;
cin >> N >> A >> B >> C >> D;
cin >> S;
bool ans = true;
char b = '.';
FOR(i, B, D) {
if (b == '#' && S[i - 1] == '#') {
ans = false;
break;
}
b = S[i - 1];
}
b = '.';
FOR(i, A, C) {
if (b == '#' && S[i - 1] == '#') {
ans = false;
break;
}
b = S[i - 1];
}
if (C > D && ans) {
int cnt = 0;
ans = false;
if (S[B] == '.' && S[B - 2] == '.') {
ans = true;
}
FOR(i, B, C) {
if (S[i - 1] == '#') {
if (cnt >= 3) {
ans = true;
}
cnt = 0;
} else {
cnt++;
}
}
}
if (ans) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
return 0;
}
| #include <algorithm>
#include <bitset>
#include <cmath>
#include <fstream>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <unordered_set>
#include <vector>
#define MOD_BIG 1000000007
#define MOD_BIG2 998244353
using std::cerr;
using std::cin;
using std::cout;
using std::endl;
using std::string;
using ll = long long;
using std::vector;
#define FOR(i, begin, end) \
for (int i = (begin), i##_end_ = (end); i < i##_end_; i++)
#define IFOR(i, begin, end) \
for (int i = (end)-1, i##_begin_ = (begin); i >= i##_begin_; i--)
#define REP(i, n) FOR(i, 0, n)
#define IREP(i, n) IFOR(i, 0, n)
//////////////////////////////////////
//////////////////////////////////////
int main() {
int N, A, B, C, D;
string S;
cin >> N >> A >> B >> C >> D;
cin >> S;
bool ans = true;
char b = '.';
FOR(i, B, D) {
if (b == '#' && S[i - 1] == '#') {
ans = false;
break;
}
b = S[i - 1];
}
b = '.';
FOR(i, A, C) {
if (b == '#' && S[i - 1] == '#') {
ans = false;
break;
}
b = S[i - 1];
}
if (C > D && ans) {
int cnt = 0;
ans = false;
if (S[B] == '.' && S[B - 2] == '.') {
ans = true;
}
FOR(i, B, D + 3) {
if (S[i - 1] == '#') {
if (cnt >= 3) {
ans = true;
}
cnt = 0;
} else {
cnt++;
}
}
}
if (ans) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
return 0;
}
| [
"expression.operation.binary.add"
] | 830,590 | 830,586 | u888094685 | cpp |
p03017 | #include <bits/stdc++.h>
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
long n, a, b, c, d;
string s;
cin >> n >> a >> b >> c >> d >> s;
bool ok = true;
for (int i = a - 1; i < c - 1; i++) {
if (s[i] == '#' && s[i + 1] == '#')
ok = false;
}
for (int i = b - 1; i < d - 1; i++) {
if (s[i] == '#' && s[i + 1] == '#')
ok = false;
}
if (c > d) {
bool space = false;
for (int i = a - 1; i < c - 2; i++) {
if (s[i] == '.' && s[i + 1] == '.' && s[i + 2] == '.') {
if (b <= i + 1 && i + 1 <= d)
space = true;
}
}
if (!space)
ok = false;
}
if (ok)
cout << "Yes" << endl;
else
cout << "No" << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
long n, a, b, c, d;
string s;
cin >> n >> a >> b >> c >> d >> s;
bool ok = true;
for (int i = a - 1; i < c - 1; i++) {
if (s[i] == '#' && s[i + 1] == '#')
ok = false;
}
for (int i = b - 1; i < d - 1; i++) {
if (s[i] == '#' && s[i + 1] == '#')
ok = false;
}
if (c > d) {
bool space = false;
for (int i = a - 1; i < c - 2; i++) {
if (s[i] == '.' && s[i + 1] == '.' && s[i + 2] == '.') {
if (b - 1 <= i + 1 && i + 1 <= d - 1)
space = true;
}
}
if (!space)
ok = false;
}
if (ok)
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"
] | 830,595 | 830,596 | u415325136 | cpp |
p03017 | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
const ll MOD = 998244353;
int main() {
int N, A, B, C, D;
cin >> N >> A >> B >> C >> D;
A--;
B--;
C--;
D--;
string S;
cin >> S;
int len = 0;
for (int i = A; i <= C; i++) {
if (S[i] == '#') {
len++;
if (len == 2) {
cout << "No" << endl;
return 0;
}
} else
len = 0;
}
len = 0;
for (int i = B; i <= D; i++) {
if (S[i] == '#') {
len++;
if (len == 2) {
cout << "No" << endl;
return 0;
}
} else
len = 0;
}
if (C < D) {
cout << "Yes" << endl;
return 0;
}
len = 0;
for (int i = B; i <= D + 1; i++) {
if (S[i] == '.') {
len++;
if (len == 3) {
cout << "Yes" << endl;
return 0;
}
} else
len = 0;
}
cout << "No" << endl;
}
| #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
const ll MOD = 998244353;
int main() {
int N, A, B, C, D;
cin >> N >> A >> B >> C >> D;
A--;
B--;
C--;
D--;
string S;
cin >> S;
int len = 0;
for (int i = A; i <= C; i++) {
if (S[i] == '#') {
len++;
if (len == 2) {
cout << "No" << endl;
return 0;
}
} else
len = 0;
}
len = 0;
for (int i = B; i <= D; i++) {
if (S[i] == '#') {
len++;
if (len == 2) {
cout << "No" << endl;
return 0;
}
} else
len = 0;
}
if (C < D) {
cout << "Yes" << endl;
return 0;
}
len = 0;
for (int i = B - 1; i <= D + 1; i++) {
if (S[i] == '.') {
len++;
if (len == 3) {
cout << "Yes" << endl;
return 0;
}
} else
len = 0;
}
cout << "No" << endl;
}
| [
"control_flow.loop.for.initializer.change"
] | 830,597 | 830,598 | u243961437 | cpp |
p03017 | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
#define ALL(v) (v).begin(), (v).end()
const ll MOD = 1e9 + 7;
int main() {
int N, A, B, C, D;
cin >> N >> A >> B >> C >> D;
A--;
B--;
C--;
D--;
string S;
cin >> S;
bool ok = 1;
for (int i = A; i < C; i++) {
if (S[i] == '#' && S[i + 1] == '#') {
ok = 0;
break;
}
}
for (int i = B; i < D; i++) {
if (S[i] == '#' && S[i + 1] == '#') {
ok = 0;
break;
}
}
if (C > D) {
bool ok2 = 0;
for (int i = B; i < D; i++) {
if (S[i - 1] == '.' && S[i] == '.' && S[i + 1] == '.') {
ok2 = 1;
break;
}
}
ok &= ok2;
}
if (ok)
cout << "Yes" << endl;
else
cout << "No" << endl;
}
| #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
#define ALL(v) (v).begin(), (v).end()
const ll MOD = 1e9 + 7;
int main() {
int N, A, B, C, D;
cin >> N >> A >> B >> C >> D;
A--;
B--;
C--;
D--;
string S;
cin >> S;
bool ok = 1;
for (int i = A; i < C; i++) {
if (S[i] == '#' && S[i + 1] == '#') {
ok = 0;
break;
}
}
for (int i = B; i < D; i++) {
if (S[i] == '#' && S[i + 1] == '#') {
ok = 0;
break;
}
}
if (C > D) {
bool ok2 = 0;
for (int i = B; i <= D; i++) {
if (S[i - 1] == '.' && S[i] == '.' && S[i + 1] == '.') {
ok2 = 1;
break;
}
}
ok &= ok2;
}
if (ok)
cout << "Yes" << endl;
else
cout << "No" << endl;
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 830,599 | 830,600 | u243961437 | cpp |
p03017 | #include <bits/stdc++.h>
using namespace std;
using lint = long long int;
using pint = pair<int, int>;
using plint = pair<lint, lint>;
#define ALL(x) (x).begin(), (x).end()
#define SZ(x) ((lint)(x).size())
#define POW2(n) (1LL << (n))
#define FOR(i, begin, end) \
for (int i = (begin), i##_end_ = (end); i < i##_end_; i++)
#define IFOR(i, begin, end) \
for (int i = (end)-1, i##_begin_ = (begin); i >= i##_begin_; i--)
#define REP(i, n) FOR(i, 0, n)
#define IREP(i, n) IFOR(i, 0, n)
int main() {
lint n, a, b, c, d;
cin >> n >> a >> b >> c >> d;
string s;
cin >> s;
int mode = 0;
FOR(i, a - 1, c) {
if (s[i] == '#') {
if (mode == 1) {
cout << "No"
<< "\n";
return 0;
}
mode = 1;
} else {
mode = 0;
}
}
mode = 0;
FOR(i, b - 1, d) {
if (s[i] == '#') {
if (mode == 1) {
cout << "No"
<< "\n";
return 0;
}
mode = 1;
} else {
mode = 0;
}
}
mode = 0;
if (d < c) {
FOR(i, b - 2, d) {
if (s[i] == '#') {
mode = 0;
} else {
mode += 1;
if (mode == 3) {
cout << "Yes"
<< "\n";
return 0;
}
}
}
cout << "No"
<< "\n";
return 0;
}
cout << "Yes"
<< "\n";
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using lint = long long int;
using pint = pair<int, int>;
using plint = pair<lint, lint>;
#define ALL(x) (x).begin(), (x).end()
#define SZ(x) ((lint)(x).size())
#define POW2(n) (1LL << (n))
#define FOR(i, begin, end) \
for (int i = (begin), i##_end_ = (end); i < i##_end_; i++)
#define IFOR(i, begin, end) \
for (int i = (end)-1, i##_begin_ = (begin); i >= i##_begin_; i--)
#define REP(i, n) FOR(i, 0, n)
#define IREP(i, n) IFOR(i, 0, n)
int main() {
lint n, a, b, c, d;
cin >> n >> a >> b >> c >> d;
string s;
cin >> s;
int mode = 0;
FOR(i, a - 1, c) {
if (s[i] == '#') {
if (mode == 1) {
cout << "No"
<< "\n";
return 0;
}
mode = 1;
} else {
mode = 0;
}
}
mode = 0;
FOR(i, b - 1, d) {
if (s[i] == '#') {
if (mode == 1) {
cout << "No"
<< "\n";
return 0;
}
mode = 1;
} else {
mode = 0;
}
}
mode = 0;
if (d < c) {
FOR(i, b - 2, d + 1) {
if (s[i] == '#') {
mode = 0;
} else {
mode += 1;
if (mode == 3) {
cout << "Yes"
<< "\n";
return 0;
}
}
}
cout << "No"
<< "\n";
return 0;
}
cout << "Yes"
<< "\n";
return 0;
} | [
"expression.operation.binary.add"
] | 830,619 | 830,620 | u517411077 | cpp |
p03017 | #include <algorithm>
#include <cctype>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <regex>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
typedef int long long ll;
using namespace std;
typedef pair<int, int> P;
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
const ll MOD = 1e9 + 7;
static const int MAX = 100;
static const int INF = (1 << 23);
int main() {
ll n, a, b, c, d;
cin >> n >> a >> b >> c >> d;
string s;
cin >> s;
bool cc = true;
for (ll i = a; i < c; i++) {
if (s[i] == '#' && s[i + 1] == '#') {
cc = false;
break;
}
}
for (ll i = b; i < d; i++) {
if (s[i] == '#' && s[i + 1] == '#') {
cc = false;
break;
}
}
if (!cc) {
cout << "No" << endl;
return 0;
}
if (c < d) {
cout << "Yes" << endl;
return 0;
} else {
bool f = false;
for (ll i = b; i < d; i++) {
if (i + 1 < n && s[i - 1] == '.' && s[i] == '.' && s[i + 1] == '.') {
cout << "Yes" << endl;
return 0;
}
}
cout << "No" << endl;
}
return 0;
}
| #include <algorithm>
#include <cctype>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <regex>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
typedef int long long ll;
using namespace std;
typedef pair<int, int> P;
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
const ll MOD = 1e9 + 7;
static const int MAX = 100;
static const int INF = (1 << 23);
int main() {
ll n, a, b, c, d;
cin >> n >> a >> b >> c >> d;
string s;
cin >> s;
bool cc = true;
for (ll i = a; i < c; i++) {
if (s[i] == '#' && s[i + 1] == '#') {
cc = false;
break;
}
}
for (ll i = b; i < d; i++) {
if (s[i] == '#' && s[i + 1] == '#') {
cc = false;
break;
}
}
if (!cc) {
cout << "No" << endl;
return 0;
}
if (c < d) {
cout << "Yes" << endl;
return 0;
} else {
// s = '#'+ s + '#';
bool f = false;
for (ll i = b - 1; i < d; i++) {
if (i + 1 < n && s[i - 1] == '.' && s[i] == '.' && s[i + 1] == '.') {
cout << "Yes" << endl;
return 0;
}
}
cout << "No" << endl;
// for(int i=b-1;i<=d-1;i++) if(s[i-1] == '.' && s[i] == '.' &&
// s[i+1] == '.'){
// puts("Yes");
// return 0;
// }
// puts("No");
// return 0;
}
return 0;
}
| [
"control_flow.loop.for.initializer.change"
] | 830,631 | 830,632 | u031448582 | cpp |
p03017 | #include <algorithm>
#include <cctype>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <regex>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
typedef int long long ll;
using namespace std;
typedef pair<int, int> P;
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
const ll MOD = 1e9 + 7;
static const int MAX = 100;
static const int INF = (1 << 23);
int main() {
ll n, a, b, c, d;
cin >> n >> a >> b >> c >> d;
string s;
cin >> s;
bool cc = true;
for (ll i = a; i < c; i++) {
if (s[i] == '#' && s[i + 1] == '#') {
cc = false;
break;
}
}
for (ll i = b; i < d; i++) {
if (s[i] == '#' && s[i + 1] == '#') {
cc = false;
break;
}
}
if (!cc) {
cout << "No" << endl;
return 0;
}
if (c < d) {
cout << "Yes" << endl;
return 0;
} else {
// bool f = false;
// for (ll i = b; i < d; i++) {
// if(i+1<n&&s[i-1]=='.'&&s[i]=='.'&&s[i+1]=='.'){
// cout<<"Yes"<<endl;
// return 0;
// }
// }
//
//
// cout<<"No"<<endl;
for (int i = b; i <= d; i++)
if (s[i - 1] == '.' && s[i] == '.' && s[i + 1] == '.') {
puts("Yes");
return 0;
}
puts("No");
return 0;
}
return 0;
}
| #include <algorithm>
#include <cctype>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <regex>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
typedef int long long ll;
using namespace std;
typedef pair<int, int> P;
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
const ll MOD = 1e9 + 7;
static const int MAX = 100;
static const int INF = (1 << 23);
int main() {
ll n, a, b, c, d;
cin >> n >> a >> b >> c >> d;
string s;
cin >> s;
bool cc = true;
for (ll i = a; i < c; i++) {
if (s[i] == '#' && s[i + 1] == '#') {
cc = false;
break;
}
}
for (ll i = b; i < d; i++) {
if (s[i] == '#' && s[i + 1] == '#') {
cc = false;
break;
}
}
if (!cc) {
cout << "No" << endl;
return 0;
}
if (c < d) {
cout << "Yes" << endl;
return 0;
} else {
// s = '#'+ s + '#';
// bool f = false;
// for (ll i = b; i < d; i++) {
// if(i+1<n&&s[i-1]=='.'&&s[i]=='.'&&s[i+1]=='.'){
// cout<<"Yes"<<endl;
// return 0;
// }
// }
//
//
// cout<<"No"<<endl;
for (int i = b - 1; i <= d - 1; i++)
if (s[i - 1] == '.' && s[i] == '.' && s[i + 1] == '.') {
puts("Yes");
return 0;
}
puts("No");
return 0;
}
return 0;
}
| [
"control_flow.loop.for.initializer.change",
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 830,633 | 830,634 | u031448582 | cpp |
p03017 | #include <bits/stdc++.h>
#define ll long long
#define rep(i, n) for (ll i = 0; i < n; i++)
#define repr(i, s, e) for (ll i = s; i >= e; i--)
#define reps(i, s, e) for (ll i = s; i <= e; i++)
#define inf 1e18
#define all(v) v.begin(), v.end()
#define vsort(v) sort(v.begin(), v.end())
#define vsortr(v) sort(v.begin(), v.end(), greater<ll>())
#define sz(x) x.size()
#define ceil(a, b) (a + b - 1) / b
#define ok cout << "ok" << endl;
#define sp << " " <<
using namespace std;
template <typename T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <typename T> inline bool chmin(T &a, T b) {
if (b < a) {
a = b;
return true;
}
return false;
}
template <typename T> T gcd(T a, T b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
template <typename T> T lcm(T a, T b) { return a * (b / gcd(a, b)); }
template <typename T> T keta(T num) {
T k = 0;
while (num > 0) {
num /= 10;
k++;
}
return k;
}
template <typename T> void vdebug(vector<T> v) {
cout << "vdebug" << endl;
for (auto vv : v) {
cout << vv << " ";
}
cout << endl;
}
template <typename T> void adebug(T arr[], ll n) {
cout << "adebug" << endl;
reps(i, 0, n) { cout << arr[i] << " "; }
cout << endl;
}
template <typename T1, typename T2> void mdebug(map<T1, T2> mp) {
cout << "mdebug" << endl;
for (auto const &m : mp) {
cout << m.first sp m.second << endl;
}
}
void ans(bool b) {
if (b)
cout << "Yes" << endl;
else
cout << "No" << endl;
}
void ans2(bool b) {
if (b)
cout << "YES" << endl;
else
cout << "NO" << endl;
}
int dx[] = {1, -1, 0, 0, 1, -1, 1, -1};
int dy[] = {0, 0, 1, -1, 1, -1, -1, 1};
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n, a, b, c, d;
string s;
cin >> n >> a >> b >> c >> d >> s;
int slen = s.length();
s = "#" + s + "#";
reps(i, a, d - 1) {
if (s[i] == '#' && s[i + 1] == '#') {
ans(false);
return 0;
}
}
if (c < d)
ans(true);
else {
reps(i, b + 1, d - 1) {
if (s[i - 1] == '.' && s[i] == '.' && s[i + 1] == '.') {
ans(true);
return 0;
}
}
ans(false);
}
return 0;
}
| #include <bits/stdc++.h>
#define ll long long
#define rep(i, n) for (ll i = 0; i < n; i++)
#define repr(i, s, e) for (ll i = s; i >= e; i--)
#define reps(i, s, e) for (ll i = s; i <= e; i++)
#define inf 1e18
#define all(v) v.begin(), v.end()
#define vsort(v) sort(v.begin(), v.end())
#define vsortr(v) sort(v.begin(), v.end(), greater<ll>())
#define sz(x) x.size()
#define ceil(a, b) (a + b - 1) / b
#define ok cout << "ok" << endl;
#define sp << " " <<
using namespace std;
template <typename T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <typename T> inline bool chmin(T &a, T b) {
if (b < a) {
a = b;
return true;
}
return false;
}
template <typename T> T gcd(T a, T b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
template <typename T> T lcm(T a, T b) { return a * (b / gcd(a, b)); }
template <typename T> T keta(T num) {
T k = 0;
while (num > 0) {
num /= 10;
k++;
}
return k;
}
template <typename T> void vdebug(vector<T> v) {
cout << "vdebug" << endl;
for (auto vv : v) {
cout << vv << " ";
}
cout << endl;
}
template <typename T> void adebug(T arr[], ll n) {
cout << "adebug" << endl;
reps(i, 0, n) { cout << arr[i] << " "; }
cout << endl;
}
template <typename T1, typename T2> void mdebug(map<T1, T2> mp) {
cout << "mdebug" << endl;
for (auto const &m : mp) {
cout << m.first sp m.second << endl;
}
}
void ans(bool b) {
if (b)
cout << "Yes" << endl;
else
cout << "No" << endl;
}
void ans2(bool b) {
if (b)
cout << "YES" << endl;
else
cout << "NO" << endl;
}
int dx[] = {1, -1, 0, 0, 1, -1, 1, -1};
int dy[] = {0, 0, 1, -1, 1, -1, -1, 1};
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n, a, b, c, d;
string s;
cin >> n >> a >> b >> c >> d >> s;
int slen = s.length();
s = "#" + s + "#";
reps(i, a, d - 1) {
if (s[i] == '#' && s[i + 1] == '#') {
ans(false);
return 0;
}
}
if (c < d)
ans(true);
else {
reps(i, b, d) {
if (s[i - 1] == '.' && s[i] == '.' && s[i + 1] == '.') {
ans(true);
return 0;
}
}
ans(false);
}
return 0;
}
| [
"expression.operation.binary.remove"
] | 830,645 | 830,646 | u026620445 | cpp |
p03017 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int N, A, B, C, D;
cin >> N >> A >> B >> C >> D;
string S;
cin >> S;
for (int i = A - 1; i < C - 1; 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] == '#') {
cout << "No" << endl;
return 0;
}
}
if (C < D) {
cout << "Yes" << endl;
} else {
for (int i = B - 1; i < D - 2; i++) {
if (S[i] == '.' && S[i + 1] == '.' && S[i + 2] == '.') {
cout << "Yes" << endl;
return 0;
}
}
cout << "No" << endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int N, A, B, C, D;
cin >> N >> A >> B >> C >> D;
string S;
cin >> S;
for (int i = A - 1; i < C - 1; 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] == '#') {
cout << "No" << endl;
return 0;
}
}
if (C < D) {
cout << "Yes" << endl;
} else {
for (int i = B - 2; i < D - 1; i++) {
if (S[i] == '.' && S[i + 1] == '.' && S[i + 2] == '.') {
cout << "Yes" << endl;
return 0;
}
}
cout << "No" << endl;
}
return 0;
} | [
"literal.number.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"expression.operation.binary.change",
"control_flow.branch.if.condition.change"
] | 830,647 | 830,648 | u625741705 | cpp |
p03017 | #include <algorithm>
#include <cmath>
#include <complex>
#include <cstdlib>
#include <deque>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
using Int = long long;
Int INF = 1LL << 60;
const Int MOD = 1000000000 + 7;
int main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
Int N, A, B, C, D;
string S;
cin >> N >> A >> B >> C >> D >> S;
A--;
B--;
C--;
D--;
Int flag = 1;
if (C < D) {
for (Int i = A; i < C; i++) {
if (S[i] == '#' && S[i + 1] == '#') {
flag = 0;
break;
}
}
for (Int i = B; i < D; i++) {
if (S[i] == '#' && S[i + 1] == '#') {
flag = 0;
break;
}
}
cout << (flag ? "Yes" : "No") << "\n";
} else {
for (Int i = A; i < C; i++) {
if (S[i] == '#' && S[i + 1] == '#') {
flag = 0;
break;
}
}
for (Int i = B; i < D; i++) {
if (S[i] == '#' && S[i + 1] == '#') {
flag = 0;
break;
}
}
Int flag2 = 0;
for (Int i = B - 1; i < C + 2; i++) {
if (S[i] == '.' && S[i + 1] == '.' && S[i + 2] == '.')
flag2 = 1;
}
if (flag2 == 1) {
cout << (flag ? "Yes" : "No") << "\n";
} else {
cout << "No"
<< "\n";
}
}
} | #include <algorithm>
#include <cmath>
#include <complex>
#include <cstdlib>
#include <deque>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
using Int = long long;
Int INF = 1LL << 60;
const Int MOD = 1000000000 + 7;
int main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
Int N, A, B, C, D;
string S;
cin >> N >> A >> B >> C >> D >> S;
A--;
B--;
C--;
D--;
Int flag = 1;
if (C < D) {
for (Int i = A; i < C; i++) {
if (S[i] == '#' && S[i + 1] == '#') {
flag = 0;
break;
}
}
for (Int i = B; i < D; i++) {
if (S[i] == '#' && S[i + 1] == '#') {
flag = 0;
break;
}
}
cout << (flag ? "Yes" : "No") << "\n";
} else {
for (Int i = A; i < C; i++) {
if (S[i] == '#' && S[i + 1] == '#') {
flag = 0;
break;
}
}
for (Int i = B; i < D; i++) {
if (S[i] == '#' && S[i + 1] == '#') {
flag = 0;
break;
}
}
Int flag2 = 0;
for (Int i = B - 1; i < D; i++) {
if (S[i] == '.' && S[i + 1] == '.' && S[i + 2] == '.')
flag2 = 1;
}
if (flag2 == 1) {
cout << (flag ? "Yes" : "No") << "\n";
} else {
cout << "No"
<< "\n";
}
}
} | [
"identifier.change",
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 830,649 | 830,650 | u612271542 | cpp |
p03017 | #include <algorithm>
#include <cmath>
#include <complex>
#include <cstdlib>
#include <deque>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
using Int = long long;
Int INF = 1LL << 60;
const Int MOD = 1000000000 + 7;
int main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
Int N, A, B, C, D;
string S;
cin >> N >> A >> B >> C >> D >> S;
A--;
B--;
C--;
D--;
Int flag = 1;
if (C < D) {
for (Int i = A; i < C; i++) {
if (S[i] == '#' && S[i + 1] == '#') {
flag = 0;
break;
}
}
for (Int i = B; i < D; i++) {
if (S[i] == '#' && S[i + 1] == '#') {
flag = 0;
break;
}
}
cout << (flag ? "Yes" : "No") << "\n";
} else {
for (Int i = A; i < C; i++) {
if (S[i] == '#' && S[i + 1] == '#') {
flag = 0;
break;
}
}
for (Int i = B; i < D; i++) {
if (S[i] == '#' && S[i + 1] == '#') {
flag = 0;
break;
}
}
Int flag2 = 0;
for (Int i = B - 1; i < C; i++) {
if (S[i] == '.' && S[i + 1] == '.' && S[i + 2] == '.')
flag2 = 1;
}
if (flag2 == 1) {
cout << (flag ? "Yes" : "No") << "\n";
} else {
cout << "No"
<< "\n";
}
}
} | #include <algorithm>
#include <cmath>
#include <complex>
#include <cstdlib>
#include <deque>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
using Int = long long;
Int INF = 1LL << 60;
const Int MOD = 1000000000 + 7;
int main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
Int N, A, B, C, D;
string S;
cin >> N >> A >> B >> C >> D >> S;
A--;
B--;
C--;
D--;
Int flag = 1;
if (C < D) {
for (Int i = A; i < C; i++) {
if (S[i] == '#' && S[i + 1] == '#') {
flag = 0;
break;
}
}
for (Int i = B; i < D; i++) {
if (S[i] == '#' && S[i + 1] == '#') {
flag = 0;
break;
}
}
cout << (flag ? "Yes" : "No") << "\n";
} else {
for (Int i = A; i < C; i++) {
if (S[i] == '#' && S[i + 1] == '#') {
flag = 0;
break;
}
}
for (Int i = B; i < D; i++) {
if (S[i] == '#' && S[i + 1] == '#') {
flag = 0;
break;
}
}
Int flag2 = 0;
for (Int i = B - 1; i < D; i++) {
if (S[i] == '.' && S[i + 1] == '.' && S[i + 2] == '.')
flag2 = 1;
}
if (flag2 == 1) {
cout << (flag ? "Yes" : "No") << "\n";
} else {
cout << "No"
<< "\n";
}
}
} | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 830,651 | 830,650 | u612271542 | cpp |
p03017 | #include <bits/stdc++.h>
using namespace std;
#define INF 1000000007
#define int long long
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define rep(i, n) FOR(i, 0, n)
int gcd(int a, int b) { return b ? gcd(b, a % b) : a; }
int lcm(int a, int b) { return a / gcd(a, b) * b; }
signed main() {
int N, A, B, C, D;
cin >> N >> A >> B >> C >> D;
string S;
cin >> S;
bool cb;
cb = true;
for (int i = A; i < D; i++) {
if ((S[i - 1] == '#') && (S[i] == '#')) {
cb = false;
break;
}
}
if (cb == false) {
cout << "No" << endl;
return 0;
}
if (C > D) {
bool check = false;
for (int i = B; i < D; i++) {
if (S[i - 1] == '.' && S[i] == '.' && S[i + 1] == '.') {
check = true;
}
}
if (check) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
} else {
cout << "Yes" << endl;
}
}
| #include <bits/stdc++.h>
using namespace std;
#define INF 1000000007
#define int long long
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define rep(i, n) FOR(i, 0, n)
int gcd(int a, int b) { return b ? gcd(b, a % b) : a; }
int lcm(int a, int b) { return a / gcd(a, b) * b; }
signed main() {
int N, A, B, C, D;
cin >> N >> A >> B >> C >> D;
string S;
cin >> S;
bool cb;
cb = true;
for (int i = A; i < D - 1; i++) {
if ((S[i - 1] == '#') && (S[i] == '#')) {
cb = false;
break;
}
}
if (cb == false) {
cout << "No" << endl;
return 0;
}
if (C > D) {
bool check = false;
for (int i = B - 1; i < D; i++) {
if (S[i - 1] == '.' && S[i] == '.' && S[i + 1] == '.') {
check = true;
}
}
if (check) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
} else {
cout << "Yes" << endl;
}
}
| [
"control_flow.loop.for.condition.change",
"misc.off_by_one",
"control_flow.loop.for.initializer.change"
] | 830,661 | 830,662 | u568545273 | cpp |
p03017 | #include <bits/stdc++.h>
using namespace std;
#define INF 1000000007
#define int long long
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define rep(i, n) FOR(i, 0, n)
int gcd(int a, int b) { return b ? gcd(b, a % b) : a; }
int lcm(int a, int b) { return a / gcd(a, b) * b; }
signed main() {
int N, A, B, C, D;
cin >> N >> A >> B >> C >> D;
string S;
cin >> S;
bool cb;
cb = false;
for (int i = A; i < D; i++) {
if ((S[i - 1] == '#') && (S[i] == '#')) {
cb = false;
break;
}
}
if (cb == false) {
cout << "No" << endl;
return 0;
}
if (C > D) {
bool check = false;
for (int i = B; i < D; i++) {
if (S[i - 1] == '.' && S[i] == '.' && S[i + 1] == '.') {
check = true;
}
}
if (check) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
} else {
cout << "Yes" << endl;
}
}
| #include <bits/stdc++.h>
using namespace std;
#define INF 1000000007
#define int long long
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define rep(i, n) FOR(i, 0, n)
int gcd(int a, int b) { return b ? gcd(b, a % b) : a; }
int lcm(int a, int b) { return a / gcd(a, b) * b; }
signed main() {
int N, A, B, C, D;
cin >> N >> A >> B >> C >> D;
string S;
cin >> S;
bool cb;
cb = true;
for (int i = A; i < D - 1; i++) {
if ((S[i - 1] == '#') && (S[i] == '#')) {
cb = false;
break;
}
}
if (cb == false) {
cout << "No" << endl;
return 0;
}
if (C > D) {
bool check = false;
for (int i = B - 1; i < D; i++) {
if (S[i - 1] == '.' && S[i] == '.' && S[i + 1] == '.') {
check = true;
}
}
if (check) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
} else {
cout << "Yes" << endl;
}
}
| [
"misc.opposites",
"assignment.value.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one",
"control_flow.loop.for.initializer.change"
] | 830,663 | 830,662 | u568545273 | cpp |
p03017 | #include <algorithm>
#include <bitset>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <sstream>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
bool Check(string &L, int s, int g) {
s--;
g--;
bool ans = true;
for (int i = s + 1; i < g - 1; i++) {
if (L[i] == '#' && L[i - 1] == '#')
ans = false;
}
return ans;
}
bool Check2(string &L, int s, int g) {
s--;
g--;
bool ans = false;
for (int i = s + 1; i < g + 1; i++) {
if (L[i] == '.' && L[i - 1] == '.' && L[i - 2] == '.')
ans = true;
}
return ans;
}
int main() {
int N, a, b, c, d, a1;
cin >> N >> a >> b >> c >> d;
string S;
cin >> S;
if (a > b) {
a1 = a;
a = b;
b = a1;
a1 = c;
c = d;
d = a1;
}
if (b < c && c < d) {
if (Check(S, a, d))
cout << "Yes";
else
cout << "No";
} else if (d < c) {
if (Check(S, a, c) && Check2(S, b, d))
cout << "Yes";
else
cout << "No";
} else {
if (Check(S, a, c) && Check(S, b, d))
cout << "Yes";
else
cout << "No";
}
}
| #include <algorithm>
#include <bitset>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <sstream>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
bool Check(string &L, int s, int g) {
s--;
g--;
bool ans = true;
for (int i = s + 1; i < g - 1; i++) {
if (L[i] == '#' && L[i - 1] == '#')
ans = false;
}
return ans;
}
bool Check2(string &L, int s, int g) {
s--;
g--;
bool ans = false;
for (int i = s + 1; i < g + 2; i++) {
if (L[i] == '.' && L[i - 1] == '.' && L[i - 2] == '.')
ans = true;
}
return ans;
}
int main() {
int N, a, b, c, d, a1;
cin >> N >> a >> b >> c >> d;
string S;
cin >> S;
if (a > b) {
a1 = a;
a = b;
b = a1;
a1 = c;
c = d;
d = a1;
}
if (b < c && c < d) {
if (Check(S, a, d))
cout << "Yes";
else
cout << "No";
} else if (d < c) {
if (Check(S, a, c) && Check2(S, b, d))
cout << "Yes";
else
cout << "No";
} else {
if (Check(S, a, c) && Check(S, b, d))
cout << "Yes";
else
cout << "No";
}
}
| [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 830,672 | 830,673 | u924785929 | cpp |
p03017 | #include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define drep(i, n) for (int i = (n)-1; i >= 0; --i)
#define srep(i, s, t) for (int i = s; i < t; ++i)
#define rng(a) a.begin(), a.end()
#define maxs(x, y) (x = max(x, y))
#define mins(x, y) (x = min(x, y))
#define limit(x, l, r) max(l, min(x, r))
#define lims(x, l, r) (x = max(l, min(x, r)))
#define isin(x, l, r) ((l) <= (x) && (x) < (r))
#define pb push_back
#define sz(x) (int)(x).size()
#define pcnt __builtin_popcountll
#define uni(x) x.erase(unique(rng(x)), x.end())
#define snuke srand((unsigned)clock() + (unsigned)time(NULL));
#define show(x) cout << #x << " = " << x << endl;
#define PQ(T) priority_queue<T, v(T), greater<T>>
#define bn(x) ((1 << x) - 1)
#define dup(x, y) (((x) + (y)-1) / (y))
#define newline puts("")
#define v(T) vector<T>
#define vv(T) v(v(T))
using namespace std;
typedef long long int ll;
typedef unsigned uint;
typedef unsigned long long ull;
typedef pair<int, int> P;
typedef set<int> S;
typedef queue<int> Q;
typedef queue<P> QP;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vl;
typedef vector<P> vp;
inline int in() {
int x;
scanf("%d", &x);
return x;
}
const ll LINF = 1001002003004005006ll;
const int INF = 1001001001;
const int MOD = 1000000007;
#define dame \
{ \
puts("-1"); \
return 0; \
}
#define yn \
{ puts("YES"); } \
else { \
puts("NO"); \
}
int main() {
int N, A, B, C, D;
cin >> N >> A >> B >> C >> D;
A--;
B--;
C--;
D--;
string s;
cin >> s;
int sl = sz(s);
if (C < D) {
bool flag = true;
srep(i, B + 1, D - 1) {
if (s[i] == '#' && s[i + 1] == '#') {
flag = false;
}
}
srep(i, A + 1, C - 1) {
if (s[i] == '#' && s[i + 1] == '#') {
flag = false;
}
}
if (flag) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
return 0;
}
bool flag = true;
srep(i, A + 1, C - 1) {
if (s[i] == '#' && s[i + 1] == '#') {
flag = false;
}
}
srep(i, B + 1, D - 1) {
if (s[i] == '#' && s[i + 1] == '#') {
flag = false;
}
}
bool f = true;
for (int i = B; i + 2 <= D; i++) {
if (s[i] == '.' && s[i + 1] == '.' && s[i + 2] == '.') {
f = false;
}
}
if (f)
flag = false;
if (flag) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
return 0;
} | #include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define drep(i, n) for (int i = (n)-1; i >= 0; --i)
#define srep(i, s, t) for (int i = s; i < t; ++i)
#define rng(a) a.begin(), a.end()
#define maxs(x, y) (x = max(x, y))
#define mins(x, y) (x = min(x, y))
#define limit(x, l, r) max(l, min(x, r))
#define lims(x, l, r) (x = max(l, min(x, r)))
#define isin(x, l, r) ((l) <= (x) && (x) < (r))
#define pb push_back
#define sz(x) (int)(x).size()
#define pcnt __builtin_popcountll
#define uni(x) x.erase(unique(rng(x)), x.end())
#define snuke srand((unsigned)clock() + (unsigned)time(NULL));
#define show(x) cout << #x << " = " << x << endl;
#define PQ(T) priority_queue<T, v(T), greater<T>>
#define bn(x) ((1 << x) - 1)
#define dup(x, y) (((x) + (y)-1) / (y))
#define newline puts("")
#define v(T) vector<T>
#define vv(T) v(v(T))
using namespace std;
typedef long long int ll;
typedef unsigned uint;
typedef unsigned long long ull;
typedef pair<int, int> P;
typedef set<int> S;
typedef queue<int> Q;
typedef queue<P> QP;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vl;
typedef vector<P> vp;
inline int in() {
int x;
scanf("%d", &x);
return x;
}
const ll LINF = 1001002003004005006ll;
const int INF = 1001001001;
const int MOD = 1000000007;
#define dame \
{ \
puts("-1"); \
return 0; \
}
#define yn \
{ puts("YES"); } \
else { \
puts("NO"); \
}
int main() {
int N, A, B, C, D;
cin >> N >> A >> B >> C >> D;
A--;
B--;
C--;
D--;
string s;
cin >> s;
int sl = sz(s);
if (C < D) {
bool flag = true;
srep(i, B + 1, D - 1) {
if (s[i] == '#' && s[i + 1] == '#') {
flag = false;
}
}
srep(i, A + 1, C - 1) {
if (s[i] == '#' && s[i + 1] == '#') {
flag = false;
}
}
if (flag) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
return 0;
}
bool flag = true;
srep(i, A + 1, C - 1) {
if (s[i] == '#' && s[i + 1] == '#') {
flag = false;
}
}
srep(i, B + 1, D - 1) {
if (s[i] == '#' && s[i + 1] == '#') {
flag = false;
}
}
bool f = true;
for (int i = B - 1; i + 2 <= D + 1; i++) {
if (s[i] == '.' && s[i + 1] == '.' && s[i + 2] == '.') {
f = false;
}
}
if (f)
flag = false;
if (flag) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
return 0;
} | [
"control_flow.loop.for.initializer.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 830,681 | 830,682 | u340293807 | cpp |
p03017 | #include <algorithm>
#include <bits/stdc++.h>
#include <cmath> // abs() for float, and fabs()
#include <cstdlib> // abs() for integer 絶対値求めやつ
#include <iomanip> //浮動小数点数を出力する制度の指定
#include <string>
#include <vector>
//使い方 数値をnumとして cout<<setprecision(n)<<num ;nは桁数
#define rep(i, n) for (int i = 0; i < (n); i++)
#define SORT(a) sort((a).begin(), (a).end())
#define rSORT(a) reverse((a).begin(), (a).end())
#define REV(a) reverse((a).begin(), (a).end())
using namespace std;
using ll = long long;
using db = double;
#define INF 2000000000
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
#define che(a, string) cout << "//" << string << "==" << (a) << "//" << endl;
bool IsInt(double a) {
int b = a / 1;
if (a == b) {
return true;
} else {
return false;
}
}
/*覚えてないことメaモ
数値型から文字列に変換 to_string(number);これは簡単
文字列から数値型に変換 stoi(number)
文字列からllに変換 stoll(number)
__gcd(a,b)は最大公約数を取ってくれる、aとb
の大きい方をNとしたとき、計算量は log(N);
*/
const int mod = 1e9 + 7;
// pie = M_PI
//ここから書き始める
int main() {
cout << setprecision(10);
int n, a, b, c, d;
cin >> n >> a >> b >> c >> d;
string s;
cin >> s;
int bjudge = 1;
int ajudge = 1;
for (int i = b - 1; i < d; i++) {
if (s[i] == '#' && s[i + 1] == '#') {
bjudge = 0;
}
}
for (int i = a - 1; i < c; i++) {
if (s[i] == '#' && s[i + 1] == '#') {
ajudge = 0;
}
}
if (c < d && ajudge && bjudge) {
// cout<<"c<d"<<endl;
cout << "Yes" << endl;
return 0;
} else { // d<cのときは、連続して3つの空き地がd（dは含まない)より前にあればYesになれる
if (c <= b && ajudge && bjudge) {
cout << "Yes" << endl;
return 0;
}
int null = 0;
// Bの1個手前から見て3連続で岩じゃなければいい。
int x = b - 1; // Bの要素番号」
for (int i = x - 1; i <= d; i++) {
if (s[i] == '.') {
if (s[i + 1] == '.' && s[i + 1 + 1] == '.') {
null = 1;
}
}
}
if (ajudge && bjudge && null) {
// cout<<"null"<<endl;
cout << "Yes" << endl;
return 0;
}
}
cout << "No" << endl;
}
| #include <algorithm>
#include <bits/stdc++.h>
#include <cmath> // abs() for float, and fabs()
#include <cstdlib> // abs() for integer 絶対値求めやつ
#include <iomanip> //浮動小数点数を出力する制度の指定
#include <string>
#include <vector>
//使い方 数値をnumとして cout<<setprecision(n)<<num ;nは桁数
#define rep(i, n) for (int i = 0; i < (n); i++)
#define SORT(a) sort((a).begin(), (a).end())
#define rSORT(a) reverse((a).begin(), (a).end())
#define REV(a) reverse((a).begin(), (a).end())
using namespace std;
using ll = long long;
using db = double;
#define INF 2000000000
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
#define che(a, string) cout << "//" << string << "==" << (a) << "//" << endl;
bool IsInt(double a) {
int b = a / 1;
if (a == b) {
return true;
} else {
return false;
}
}
/*覚えてないことメaモ
数値型から文字列に変換 to_string(number);これは簡単
文字列から数値型に変換 stoi(number)
文字列からllに変換 stoll(number)
__gcd(a,b)は最大公約数を取ってくれる、aとb
の大きい方をNとしたとき、計算量は log(N);
*/
const int mod = 1e9 + 7;
// pie = M_PI
//ここから書き始める
int main() {
cout << setprecision(10);
int n, a, b, c, d;
cin >> n >> a >> b >> c >> d;
string s;
cin >> s;
int bjudge = 1;
int ajudge = 1;
for (int i = b - 1; i < d; i++) {
if (s[i] == '#' && s[i + 1] == '#') {
bjudge = 0;
}
}
for (int i = a - 1; i < c; i++) {
if (s[i] == '#' && s[i + 1] == '#') {
ajudge = 0;
}
}
if (c < d && ajudge && bjudge) {
// cout<<"c<d"<<endl;
cout << "Yes" << endl;
return 0;
} else { // d<cのときは、連続して3つの空き地がd（dは含まない)より前にあればYesになれる
if (c <= b && ajudge && bjudge) {
cout << "Yes" << endl;
return 0;
}
int null = 0;
// Bの1個手前から見て3連続で岩じゃなければいい。
int x = b - 1; // Bの要素番号」
for (int i = x - 1; i <= d - 2; i++) {
if (s[i] == '.') {
if (s[i + 1] == '.' && s[i + 1 + 1] == '.') {
null = 1;
}
}
}
if (ajudge && bjudge && null) {
// cout<<"null"<<endl;
cout << "Yes" << endl;
return 0;
}
}
cout << "No" << endl;
}
| [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 830,692 | 830,693 | u298620933 | cpp |
p03017 | #include <algorithm>
#include <bits/stdc++.h>
#include <cmath> // abs() for float, and fabs()
#include <cstdlib> // abs() for integer 絶対値求めやつ
#include <iomanip> //浮動小数点数を出力する制度の指定
#include <string>
#include <vector>
//使い方 数値をnumとして cout<<setprecision(n)<<num ;nは桁数
#define rep(i, n) for (int i = 0; i < (n); i++)
#define SORT(a) sort((a).begin(), (a).end())
#define rSORT(a) reverse((a).begin(), (a).end())
#define REV(a) reverse((a).begin(), (a).end())
using namespace std;
using ll = long long;
using db = double;
#define INF 2000000000
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
#define che(a, string) cout << "//" << string << "==" << (a) << "//" << endl;
bool IsInt(double a) {
int b = a / 1;
if (a == b) {
return true;
} else {
return false;
}
}
/*覚えてないことメaモ
数値型から文字列に変換 to_string(number);これは簡単
文字列から数値型に変換 stoi(number)
文字列からllに変換 stoll(number)
__gcd(a,b)は最大公約数を取ってくれる、aとb
の大きい方をNとしたとき、計算量は log(N);
*/
const int mod = 1e9 + 7;
// pie = M_PI
//ここから書き始める
int main() {
cout << setprecision(10);
int n, a, b, c, d;
cin >> n >> a >> b >> c >> d;
string s;
cin >> s;
int bjudge = 1;
int ajudge = 1;
for (int i = b - 1; i < d; i++) {
if (s[i] == '#' && s[i + 1] == '#') {
bjudge = 0;
}
}
for (int i = a - 1; i < c; i++) {
if (s[i] == '#' && s[i + 1] == '#') {
ajudge = 0;
}
}
if (c < d && ajudge && bjudge) {
// cout<<"c<d"<<endl;
cout << "Yes" << endl;
return 0;
} else { // d<cのときは、連続して3つの空き地がd（dは含まない)より前にあればYesになれる
if (c <= b) {
cout << "Yes" << endl;
return 0;
}
int null = 0;
// Bの1個手前から見て3連続で岩じゃなければいい。
int x = b - 1; // Bの要素番号」
for (int i = x - 1; i <= d; i++) {
if (s[i] == '.') {
if (s[i + 1] == '.' && s[i + 1 + 1] == '.') {
null = 1;
}
}
}
if (ajudge && bjudge && null) {
// cout<<"null"<<endl;
cout << "Yes" << endl;
return 0;
}
}
cout << "No" << endl;
}
| #include <algorithm>
#include <bits/stdc++.h>
#include <cmath> // abs() for float, and fabs()
#include <cstdlib> // abs() for integer 絶対値求めやつ
#include <iomanip> //浮動小数点数を出力する制度の指定
#include <string>
#include <vector>
//使い方 数値をnumとして cout<<setprecision(n)<<num ;nは桁数
#define rep(i, n) for (int i = 0; i < (n); i++)
#define SORT(a) sort((a).begin(), (a).end())
#define rSORT(a) reverse((a).begin(), (a).end())
#define REV(a) reverse((a).begin(), (a).end())
using namespace std;
using ll = long long;
using db = double;
#define INF 2000000000
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
#define che(a, string) cout << "//" << string << "==" << (a) << "//" << endl;
bool IsInt(double a) {
int b = a / 1;
if (a == b) {
return true;
} else {
return false;
}
}
/*覚えてないことメaモ
数値型から文字列に変換 to_string(number);これは簡単
文字列から数値型に変換 stoi(number)
文字列からllに変換 stoll(number)
__gcd(a,b)は最大公約数を取ってくれる、aとb
の大きい方をNとしたとき、計算量は log(N);
*/
const int mod = 1e9 + 7;
// pie = M_PI
//ここから書き始める
int main() {
cout << setprecision(10);
int n, a, b, c, d;
cin >> n >> a >> b >> c >> d;
string s;
cin >> s;
int bjudge = 1;
int ajudge = 1;
for (int i = b - 1; i < d; i++) {
if (s[i] == '#' && s[i + 1] == '#') {
bjudge = 0;
}
}
for (int i = a - 1; i < c; i++) {
if (s[i] == '#' && s[i + 1] == '#') {
ajudge = 0;
}
}
if (c < d && ajudge && bjudge) {
// cout<<"c<d"<<endl;
cout << "Yes" << endl;
return 0;
} else { // d<cのときは、連続して3つの空き地がd（dは含まない)より前にあればYesになれる
if (c <= b && ajudge && bjudge) {
cout << "Yes" << endl;
return 0;
}
int null = 0;
// Bの1個手前から見て3連続で岩じゃなければいい。
int x = b - 1; // Bの要素番号」
for (int i = x - 1; i <= d - 2; i++) {
if (s[i] == '.') {
if (s[i + 1] == '.' && s[i + 1 + 1] == '.') {
null = 1;
}
}
}
if (ajudge && bjudge && null) {
// cout<<"null"<<endl;
cout << "Yes" << endl;
return 0;
}
}
cout << "No" << endl;
}
| [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 830,694 | 830,693 | u298620933 | cpp |
p03017 | #include <algorithm>
#include <bits/stdc++.h>
#include <cmath> // abs() for float, and fabs()
#include <cstdlib> // abs() for integer 絶対値求めやつ
#include <iomanip> //浮動小数点数を出力する制度の指定
#include <string>
#include <vector>
//使い方 数値をnumとして cout<<setprecision(n)<<num ;nは桁数
#define rep(i, n) for (int i = 0; i < (n); i++)
#define SORT(a) sort((a).begin(), (a).end())
#define rSORT(a) reverse((a).begin(), (a).end())
#define REV(a) reverse((a).begin(), (a).end())
using namespace std;
using ll = long long;
using db = double;
#define INF 2000000000
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
#define che(a, string) cout << "//" << string << "==" << (a) << "//" << endl;
bool IsInt(double a) {
int b = a / 1;
if (a == b) {
return true;
} else {
return false;
}
}
/*覚えてないことメaモ
数値型から文字列に変換 to_string(number);これは簡単
文字列から数値型に変換 stoi(number)
文字列からllに変換 stoll(number)
__gcd(a,b)は最大公約数を取ってくれる、aとb
の大きい方をNとしたとき、計算量は log(N);
*/
const int mod = 1e9 + 7;
// pie = M_PI
//ここから書き始める
int main() {
cout << setprecision(10);
int n, a, b, c, d;
cin >> n >> a >> b >> c >> d;
string s;
cin >> s;
int bjudge = 1;
int ajudge = 1;
for (int i = b - 1; i < d; i++) {
if (s[i] == '#' && s[i + 1] == '#') {
bjudge = 0;
}
if (bjudge == 0) {
cout << "No" << endl;
return 0;
}
}
for (int i = a - 1; i < c; i++) {
if (s[i] == '#' && s[i + 1] == '#') {
ajudge = 0;
}
if (ajudge == 0) {
cout << "No" << endl;
return 0;
}
}
if (c < d && ajudge && bjudge) {
// cout<<"c<d"<<endl;
cout << "Yes" << endl;
return 0;
} else { // d<cのときは、連続して3つの空き地がd（dは含まない)より前にあればYesになれる
int null = 0;
// Bの1個手前から見て3連続で岩じゃなければいい。
int x = b - 1; // Bの要素番号」
for (int i = x - 1; i <= d; i++) {
if (s[i] == '.') {
if (s[i - 1] == '.' && s[i + 1] == '.') {
null = 1;
}
}
}
if (null == 0) {
cout << "No" << endl;
return 0;
}
if (ajudge && bjudge && null) {
// cout<<"null"<<endl;
cout << "Yes" << endl;
return 0;
}
}
cout << "No" << endl;
}
| #include <algorithm>
#include <bits/stdc++.h>
#include <cmath> // abs() for float, and fabs()
#include <cstdlib> // abs() for integer 絶対値求めやつ
#include <iomanip> //浮動小数点数を出力する制度の指定
#include <string>
#include <vector>
//使い方 数値をnumとして cout<<setprecision(n)<<num ;nは桁数
#define rep(i, n) for (int i = 0; i < (n); i++)
#define SORT(a) sort((a).begin(), (a).end())
#define rSORT(a) reverse((a).begin(), (a).end())
#define REV(a) reverse((a).begin(), (a).end())
using namespace std;
using ll = long long;
using db = double;
#define INF 2000000000
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
#define che(a, string) cout << "//" << string << "==" << (a) << "//" << endl;
bool IsInt(double a) {
int b = a / 1;
if (a == b) {
return true;
} else {
return false;
}
}
/*覚えてないことメaモ
数値型から文字列に変換 to_string(number);これは簡単
文字列から数値型に変換 stoi(number)
文字列からllに変換 stoll(number)
__gcd(a,b)は最大公約数を取ってくれる、aとb
の大きい方をNとしたとき、計算量は log(N);
*/
const int mod = 1e9 + 7;
// pie = M_PI
//ここから書き始める
int main() {
cout << setprecision(10);
int n, a, b, c, d;
cin >> n >> a >> b >> c >> d;
string s;
cin >> s;
int bjudge = 1;
int ajudge = 1;
for (int i = b - 1; i < d; i++) {
if (s[i] == '#' && s[i + 1] == '#') {
bjudge = 0;
}
if (bjudge == 0) {
cout << "No" << endl;
return 0;
}
}
for (int i = a - 1; i < c; i++) {
if (s[i] == '#' && s[i + 1] == '#') {
ajudge = 0;
}
if (ajudge == 0) {
cout << "No" << endl;
return 0;
}
}
if (c < d && ajudge && bjudge) {
// cout<<"c<d"<<endl;
cout << "Yes" << endl;
return 0;
} else { // d<cのときは、連続して3つの空き地がd（dは含まない)より前にあればYesになれる
int null = 0;
// Bの1個手前から見て3連続で岩じゃなければいい。
int x = b - 1; // Bの要素番号」
for (int i = x; i < d; i++) {
if (s[i] == '.') {
if (s[i - 1] == '.' && s[i + 1] == '.') {
null = 1;
}
}
}
if (null == 0) {
cout << "No" << endl;
return 0;
}
if (ajudge && bjudge && null) {
// cout<<"null"<<endl;
cout << "Yes" << endl;
return 0;
}
}
cout << "No" << endl;
}
| [
"control_flow.loop.for.initializer.change",
"expression.operation.binary.remove",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 830,695 | 830,696 | u298620933 | cpp |
p03017 | #include <algorithm>
#include <bits/stdc++.h>
#include <cmath> // abs() for float, and fabs()
#include <cstdlib> // abs() for integer 絶対値求めやつ
#include <iomanip> //浮動小数点数を出力する制度の指定
#include <string>
#include <vector>
//使い方 数値をnumとして cout<<setprecision(n)<<num ;nは桁数
#define rep(i, n) for (int i = 0; i < (n); i++)
#define SORT(a) sort((a).begin(), (a).end())
#define rSORT(a) reverse((a).begin(), (a).end())
#define REV(a) reverse((a).begin(), (a).end())
using namespace std;
using ll = long long;
using db = double;
#define INF 2000000000
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
#define che(a, string) cout << "//" << string << "==" << (a) << "//" << endl;
bool IsInt(double a) {
int b = a / 1;
if (a == b) {
return true;
} else {
return false;
}
}
/*覚えてないことメaモ
数値型から文字列に変換 to_string(number);これは簡単
文字列から数値型に変換 stoi(number)
文字列からllに変換 stoll(number)
__gcd(a,b)は最大公約数を取ってくれる、aとb
の大きい方をNとしたとき、計算量は log(N);
*/
const int mod = 1e9 + 7;
// pie = M_PI
//ここから書き始める
int main() {
cout << setprecision(10);
int n, a, b, c, d;
cin >> n >> a >> b >> c >> d;
string s;
cin >> s;
int bjudge = 1;
int ajudge = 1;
for (int i = b - 1; i < d; i++) {
if (s[i] == '#' && s[i + 1] == '#') {
bjudge = 0;
}
if (bjudge == 0) {
cout << "No" << endl;
return 0;
}
}
for (int i = a - 1; i < c; i++) {
if (s[i] == '#' && s[i + 1] == '#') {
ajudge = 0;
}
if (ajudge == 0) {
cout << "No" << endl;
return 0;
}
}
if (c < d && ajudge && bjudge) {
// cout<<"c<d"<<endl;
cout << "Yes" << endl;
return 0;
} else { // d<cのときは、連続して3つの空き地がd（dは含まない)より前にあればYesになれる
int null = 0;
// Bの1個手前から見て3連続で岩じゃなければいい。
int x = b - 1; // Bの要素番号」
for (int i = x - 1; i < d; i++) {
if (s[i] == '.') {
if (s[i - 1] == '.' && s[i + 1] == '.') {
null = 1;
}
}
}
if (null == 0) {
cout << "No" << endl;
return 0;
}
if (ajudge && bjudge && null) {
// cout<<"null"<<endl;
cout << "Yes" << endl;
return 0;
}
}
cout << "No" << endl;
}
| #include <algorithm>
#include <bits/stdc++.h>
#include <cmath> // abs() for float, and fabs()
#include <cstdlib> // abs() for integer 絶対値求めやつ
#include <iomanip> //浮動小数点数を出力する制度の指定
#include <string>
#include <vector>
//使い方 数値をnumとして cout<<setprecision(n)<<num ;nは桁数
#define rep(i, n) for (int i = 0; i < (n); i++)
#define SORT(a) sort((a).begin(), (a).end())
#define rSORT(a) reverse((a).begin(), (a).end())
#define REV(a) reverse((a).begin(), (a).end())
using namespace std;
using ll = long long;
using db = double;
#define INF 2000000000
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
#define che(a, string) cout << "//" << string << "==" << (a) << "//" << endl;
bool IsInt(double a) {
int b = a / 1;
if (a == b) {
return true;
} else {
return false;
}
}
/*覚えてないことメaモ
数値型から文字列に変換 to_string(number);これは簡単
文字列から数値型に変換 stoi(number)
文字列からllに変換 stoll(number)
__gcd(a,b)は最大公約数を取ってくれる、aとb
の大きい方をNとしたとき、計算量は log(N);
*/
const int mod = 1e9 + 7;
// pie = M_PI
//ここから書き始める
int main() {
cout << setprecision(10);
int n, a, b, c, d;
cin >> n >> a >> b >> c >> d;
string s;
cin >> s;
int bjudge = 1;
int ajudge = 1;
for (int i = b - 1; i < d; i++) {
if (s[i] == '#' && s[i + 1] == '#') {
bjudge = 0;
}
if (bjudge == 0) {
cout << "No" << endl;
return 0;
}
}
for (int i = a - 1; i < c; i++) {
if (s[i] == '#' && s[i + 1] == '#') {
ajudge = 0;
}
if (ajudge == 0) {
cout << "No" << endl;
return 0;
}
}
if (c < d && ajudge && bjudge) {
// cout<<"c<d"<<endl;
cout << "Yes" << endl;
return 0;
} else { // d<cのときは、連続して3つの空き地がd（dは含まない)より前にあればYesになれる
int null = 0;
// Bの1個手前から見て3連続で岩じゃなければいい。
int x = b - 1; // Bの要素番号」
for (int i = x; i < d; i++) {
if (s[i] == '.') {
if (s[i - 1] == '.' && s[i + 1] == '.') {
null = 1;
}
}
}
if (null == 0) {
cout << "No" << endl;
return 0;
}
if (ajudge && bjudge && null) {
// cout<<"null"<<endl;
cout << "Yes" << endl;
return 0;
}
}
cout << "No" << endl;
}
| [
"control_flow.loop.for.initializer.change",
"expression.operation.binary.remove"
] | 830,697 | 830,696 | u298620933 | cpp |
p03017 | #include <algorithm>
#include <bits/stdc++.h>
#include <cmath> // abs() for float, and fabs()
#include <cstdlib> // abs() for integer 絶対値求めやつ
#include <iomanip> //浮動小数点数を出力する制度の指定
#include <string>
#include <vector>
//使い方 数値をnumとして cout<<setprecision(n)<<num ;nは桁数
#define rep(i, n) for (int i = 0; i < (n); i++)
#define SORT(a) sort((a).begin(), (a).end())
#define rSORT(a) reverse((a).begin(), (a).end())
#define REV(a) reverse((a).begin(), (a).end())
using namespace std;
using ll = long long;
using db = double;
#define INF 2000000000
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
#define che(a, string) cout << "//" << string << "==" << (a) << "//" << endl;
bool IsInt(double a) {
int b = a / 1;
if (a == b) {
return true;
} else {
return false;
}
}
/*覚えてないことメaモ
数値型から文字列に変換 to_string(number);これは簡単
文字列から数値型に変換 stoi(number)
文字列からllに変換 stoll(number)
__gcd(a,b)は最大公約数を取ってくれる、aとb
の大きい方をNとしたとき、計算量は log(N);
*/
const int mod = 1e9 + 7;
// pie = M_PI
//ここから書き始める
int main() {
cout << setprecision(10);
int n, a, b, c, d;
cin >> n >> a >> b >> c >> d;
string s;
cin >> s;
int bjudge = 1;
int ajudge = 1;
for (int i = b - 1; i < d; i++) {
if (s[i] == '#' && s[i + 1] == '#') {
bjudge = 0;
}
if (bjudge == 0) {
cout << "No" << endl;
return 0;
}
}
for (int i = a - 1; i < c; i++) {
if (s[i] == '#' && s[i + 1] == '#') {
ajudge = 0;
}
if (ajudge == 0) {
cout << "No" << endl;
return 0;
}
}
if (c < d && ajudge && bjudge) {
// cout<<"c<d"<<endl;
cout << "Yes" << endl;
return 0;
} else { // d<cのときは、連続して3つの空き地がd（dは含まない)より前にあればYesになれる
int null = 0;
// Bの1個手前から見て3連続で岩じゃなければいい。
int x = b - 1; // Bの要素番号」
for (int i = x - 1; i < d; i++) {
if (s[i] == '.') {
if (s[i + 1] == '.' && s[i + 2] == '.') {
null = 1;
}
}
}
if (null == 0) {
cout << "No" << endl;
return 0;
}
if (ajudge && bjudge && null) {
// cout<<"null"<<endl;
cout << "Yes" << endl;
return 0;
}
}
cout << "No" << endl;
}
| #include <algorithm>
#include <bits/stdc++.h>
#include <cmath> // abs() for float, and fabs()
#include <cstdlib> // abs() for integer 絶対値求めやつ
#include <iomanip> //浮動小数点数を出力する制度の指定
#include <string>
#include <vector>
//使い方 数値をnumとして cout<<setprecision(n)<<num ;nは桁数
#define rep(i, n) for (int i = 0; i < (n); i++)
#define SORT(a) sort((a).begin(), (a).end())
#define rSORT(a) reverse((a).begin(), (a).end())
#define REV(a) reverse((a).begin(), (a).end())
using namespace std;
using ll = long long;
using db = double;
#define INF 2000000000
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
#define che(a, string) cout << "//" << string << "==" << (a) << "//" << endl;
bool IsInt(double a) {
int b = a / 1;
if (a == b) {
return true;
} else {
return false;
}
}
/*覚えてないことメaモ
数値型から文字列に変換 to_string(number);これは簡単
文字列から数値型に変換 stoi(number)
文字列からllに変換 stoll(number)
__gcd(a,b)は最大公約数を取ってくれる、aとb
の大きい方をNとしたとき、計算量は log(N);
*/
const int mod = 1e9 + 7;
// pie = M_PI
//ここから書き始める
int main() {
cout << setprecision(10);
int n, a, b, c, d;
cin >> n >> a >> b >> c >> d;
string s;
cin >> s;
int bjudge = 1;
int ajudge = 1;
for (int i = b - 1; i < d; i++) {
if (s[i] == '#' && s[i + 1] == '#') {
bjudge = 0;
}
if (bjudge == 0) {
cout << "No" << endl;
return 0;
}
}
for (int i = a - 1; i < c; i++) {
if (s[i] == '#' && s[i + 1] == '#') {
ajudge = 0;
}
if (ajudge == 0) {
cout << "No" << endl;
return 0;
}
}
if (c < d && ajudge && bjudge) {
// cout<<"c<d"<<endl;
cout << "Yes" << endl;
return 0;
} else { // d<cのときは、連続して3つの空き地がd（dは含まない)より前にあればYesになれる
int null = 0;
// Bの1個手前から見て3連続で岩じゃなければいい。
int x = b - 1; // Bの要素番号」
for (int i = x; i < d; i++) {
if (s[i] == '.') {
if (s[i - 1] == '.' && s[i + 1] == '.') {
null = 1;
}
}
}
if (null == 0) {
cout << "No" << endl;
return 0;
}
if (ajudge && bjudge && null) {
// cout<<"null"<<endl;
cout << "Yes" << endl;
return 0;
}
}
cout << "No" << endl;
}
| [
"control_flow.loop.for.initializer.change",
"expression.operation.binary.remove",
"misc.opposites",
"expression.operator.arithmetic.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change",
"literal.number.change"
] | 830,698 | 830,696 | u298620933 | cpp |
p03017 | /*
これを入れて実行
g++ code.cpp
./a.out
*/
#include <algorithm>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
typedef long double ld;
int dy4[4] = {-1, 0, +1, 0};
int dx4[4] = {0, +1, 0, -1};
int dy8[8] = {-1, -1, 0, 1, 1, 1, 0, -1};
int dx8[8] = {0, 1, 1, 1, 0, -1, -1, -1};
const long long INF = 1LL << 60;
const ll MOD = 1e9 + 7;
bool greaterSecond(const pair<int, int> &f, const pair<int, int> &s) {
return f.second > s.second;
}
ll gcd(ll a, ll b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
ll nCr(ll n, ll r) {
if (r == 0 || r == n) {
return 1;
} else if (r == 1) {
return n;
}
return (nCr(n - 1, r) + nCr(n - 1, r - 1));
}
ll nPr(ll n, ll r) {
r = n - r;
ll ret = 1;
for (ll i = n; i >= r + 1; i--)
ret *= i;
return ret;
}
//-----------------------ここから-----------
int main(void) {
int n, a, b, c, d;
cin >> n >> a >> b >> c >> d;
a--;
b--;
c--;
d--;
string s;
cin >> s;
int dcnt = 0;
bool overtake = false;
for (int i = a; i <= min(d, c) + 1; i++) {
if (s[i] == '.') {
dcnt++;
} else {
dcnt = 0;
}
if (dcnt > 2) {
overtake = true;
}
}
for (int i = a; i < max(d, c) - 1; i++) {
if (s[i] == '#' && s[i + 1] == '#') {
cout << "No" << endl;
return 0;
}
}
if (!overtake) {
if (c > d) {
cout << "No" << endl;
return 0;
}
}
cout << "Yes" << endl;
}
| /*
これを入れて実行
g++ code.cpp
./a.out
*/
#include <algorithm>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
typedef long double ld;
int dy4[4] = {-1, 0, +1, 0};
int dx4[4] = {0, +1, 0, -1};
int dy8[8] = {-1, -1, 0, 1, 1, 1, 0, -1};
int dx8[8] = {0, 1, 1, 1, 0, -1, -1, -1};
const long long INF = 1LL << 60;
const ll MOD = 1e9 + 7;
bool greaterSecond(const pair<int, int> &f, const pair<int, int> &s) {
return f.second > s.second;
}
ll gcd(ll a, ll b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
ll nCr(ll n, ll r) {
if (r == 0 || r == n) {
return 1;
} else if (r == 1) {
return n;
}
return (nCr(n - 1, r) + nCr(n - 1, r - 1));
}
ll nPr(ll n, ll r) {
r = n - r;
ll ret = 1;
for (ll i = n; i >= r + 1; i--)
ret *= i;
return ret;
}
//-----------------------ここから-----------
int main(void) {
int n, a, b, c, d;
cin >> n >> a >> b >> c >> d;
a--;
b--;
c--;
d--;
string s;
cin >> s;
int dcnt = 0;
bool overtake = false;
for (int i = b - 1; i <= min(d, c) + 1; i++) {
if (s[i] == '.') {
dcnt++;
} else {
dcnt = 0;
}
if (dcnt > 2) {
overtake = true;
}
}
for (int i = a; i < max(d, c) - 1; i++) {
if (s[i] == '#' && s[i + 1] == '#') {
cout << "No" << endl;
return 0;
}
}
if (!overtake) {
if (c > d) {
cout << "No" << endl;
return 0;
}
}
cout << "Yes" << endl;
}
| [
"control_flow.loop.for.initializer.change"
] | 830,702 | 830,703 | u845000384 | cpp |
p03017 | #include <algorithm>
#include <cstdio>
using namespace std;
int read() {
int x = 0;
bool f = 0;
char c = getchar();
while (c < '0' || c > '9')
f |= c == '-', c = getchar();
while (c >= '0' && c <= '9')
x = x * 10 + (c ^ 48), c = getchar();
return f ? -x : x;
}
#define MAXN 200000
#define NO return puts("No"), 0
#define YES return puts("Yes"), 0
char str[MAXN + 5];
int main() {
int N = read(), A = read(), B = read(), C = read(), D = read();
scanf("%s", str + 1);
for (int i = A; i <= max(C, D) - 1; i++)
if (str[i] == '#' && str[i + 1] == '#')
NO;
if (C < D)
YES;
for (int i = B - 1; i <= D; i++)
if (str[i] == '.' && str[i + 1] == '.' && str[i + 2] == '.')
YES;
NO;
return 0;
}
| #include <algorithm>
#include <cstdio>
using namespace std;
int read() {
int x = 0;
bool f = 0;
char c = getchar();
while (c < '0' || c > '9')
f |= c == '-', c = getchar();
while (c >= '0' && c <= '9')
x = x * 10 + (c ^ 48), c = getchar();
return f ? -x : x;
}
#define MAXN 200000
#define NO return puts("No"), 0
#define YES return puts("Yes"), 0
char str[MAXN + 5];
int main() {
int N = read(), A = read(), B = read(), C = read(), D = read();
scanf("%s", str + 1);
for (int i = A; i <= max(C, D) - 1; i++)
if (str[i] == '#' && str[i + 1] == '#')
NO;
if (C < D)
YES;
for (int i = B - 1; i <= D - 1; i++)
if (str[i] == '.' && str[i + 1] == '.' && str[i + 2] == '.')
YES;
NO;
return 0;
}
| [
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 830,710 | 830,711 | u879099684 | cpp |
p03017 | #include <algorithm>
#include <cstdio>
using namespace std;
int read() {
int x = 0;
bool f = 0;
char c = getchar();
while (c < '0' || c > '9')
f |= c == '-', c = getchar();
while (c >= '0' && c <= '9')
x = x * 10 + (c ^ 48), c = getchar();
return f ? -x : x;
}
#define MAXN 200000
#define NO return puts("No"), 0
#define YES return puts("Yes"), 0
char str[MAXN + 5];
int main() {
int N = read(), A = read(), B = read(), C = read(), D = read();
scanf("%s", str + 1);
for (int i = A; i <= max(C, D) - 1; i++)
if (str[i] == '#' && str[i + 1] == '#')
NO;
if (C < D)
YES;
for (int i = B; i <= D; i++)
if (str[i] == '.' && str[i + 1] == '.' && str[i + 2] == '.')
YES;
NO;
return 0;
}
| #include <algorithm>
#include <cstdio>
using namespace std;
int read() {
int x = 0;
bool f = 0;
char c = getchar();
while (c < '0' || c > '9')
f |= c == '-', c = getchar();
while (c >= '0' && c <= '9')
x = x * 10 + (c ^ 48), c = getchar();
return f ? -x : x;
}
#define MAXN 200000
#define NO return puts("No"), 0
#define YES return puts("Yes"), 0
char str[MAXN + 5];
int main() {
int N = read(), A = read(), B = read(), C = read(), D = read();
scanf("%s", str + 1);
for (int i = A; i <= max(C, D) - 1; i++)
if (str[i] == '#' && str[i + 1] == '#')
NO;
if (C < D)
YES;
for (int i = B - 1; i <= D - 1; i++)
if (str[i] == '.' && str[i + 1] == '.' && str[i + 2] == '.')
YES;
NO;
return 0;
}
| [
"control_flow.loop.for.initializer.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 830,712 | 830,711 | u879099684 | cpp |
p03017 | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define double long double
#define rep(i, n) for (int i = 0; i < n; i++)
#define mod 1000000007 // 10^9+7
#define INF 99999999999 // 10^12-1
#define dev 998244353 // tenka1
#define P pair<int, int>
#define F first
#define S second
int n, a, b, c, d;
string s;
bool ans = true;
signed main() {
cin >> n >> a >> b >> c >> d >> s;
if (c < d) {
for (int i = a; i < d - 1; i++) {
if (s[i] == '#' && s[i + 1] == '#')
ans = false;
}
} else {
for (int i = a; i < c - 1; i++) {
if (s[i] == '#' && s[i + 1] == '#')
ans = false;
}
bool tri = false;
for (int i = b; i < d; i++) {
if (s.substr(i - 2, 3) == "...")
tri = true;
}
if (tri == false)
ans = false;
}
if (ans)
puts("Yes");
else
puts("No");
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define int long long
#define double long double
#define rep(i, n) for (int i = 0; i < n; i++)
#define mod 1000000007 // 10^9+7
#define INF 99999999999 // 10^12-1
#define dev 998244353 // tenka1
#define P pair<int, int>
#define F first
#define S second
int n, a, b, c, d;
string s;
bool ans = true;
signed main() {
cin >> n >> a >> b >> c >> d >> s;
if (c < d) {
for (int i = a; i < d - 1; i++) {
if (s[i] == '#' && s[i + 1] == '#')
ans = false;
}
} else {
for (int i = a; i < c - 1; i++) {
if (s[i] == '#' && s[i + 1] == '#')
ans = false;
}
bool tri = false;
for (int i = b; i <= d; i++) {
if (s.substr(i - 2, 3) == "...")
tri = true;
}
if (tri == false)
ans = false;
}
if (ans)
puts("Yes");
else
puts("No");
return 0;
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 830,715 | 830,716 | u988961969 | cpp |
p03017 | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define double long double
#define rep(i, n) for (int i = 0; i < n; i++)
#define mod 1000000007 // 10^9+7
#define INF 99999999999 // 10^12-1
#define dev 998244353 // tenka1
#define P pair<int, int>
#define F first
#define S second
int n, a, b, c, d;
string s;
bool ans = true;
signed main() {
cin >> n >> a >> b >> c >> d >> s;
if (c < d) {
for (int i = a; i < d - 1; i++) {
if (s[i] == '#' && s[i + 1] == '#')
ans = false;
}
} else {
for (int i = a; i < c - 1; i++) {
if (s[i] == '#' && s[i + 1] == '#')
ans = false;
}
bool tri = false;
for (int i = b; i < d - 1; i++) {
if (s.substr(i, 3) == "...")
tri = true;
}
if (tri == false)
ans = false;
}
if (ans)
puts("Yes");
else
puts("No");
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define int long long
#define double long double
#define rep(i, n) for (int i = 0; i < n; i++)
#define mod 1000000007 // 10^9+7
#define INF 99999999999 // 10^12-1
#define dev 998244353 // tenka1
#define P pair<int, int>
#define F first
#define S second
int n, a, b, c, d;
string s;
bool ans = true;
signed main() {
cin >> n >> a >> b >> c >> d >> s;
if (c < d) {
for (int i = a; i < d - 1; i++) {
if (s[i] == '#' && s[i + 1] == '#')
ans = false;
}
} else {
for (int i = a; i < c - 1; i++) {
if (s[i] == '#' && s[i + 1] == '#')
ans = false;
}
bool tri = false;
for (int i = b; i <= d; i++) {
if (s.substr(i - 2, 3) == "...")
tri = true;
}
if (tri == false)
ans = false;
}
if (ans)
puts("Yes");
else
puts("No");
return 0;
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 830,717 | 830,716 | u988961969 | cpp |
p03017 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using vi = vector<int>;
using vvi = vector<vi>;
using vl = vector<ll>;
using vvl = vector<vl>;
void AGC034A() {
int N, A, B, C, D;
cin >> N >> A >> B >> C >> D;
--A;
--B;
--C;
--D;
string S;
cin >> S;
int sign = D - C > 0 ? 1 : -1;
for (int i = A; i < C - 1; ++i) {
if (S[i] == '#' && S[i + 1] == '#') {
cout << "No" << endl;
return;
}
}
for (int i = B; i < D - 1; ++i) {
if (S[i] == '#' && S[i + 1] == '#') {
cout << "No" << endl;
return;
}
}
if (sign == -1) {
bool isOk = false;
for (int i = B; i < D; ++i) {
if (S[i] == '.' && S[i + 1] == '.' && S[i + 2] == '.') {
isOk = true;
break;
}
}
if (!isOk) {
cout << "No" << endl;
return;
}
}
cout << "Yes" << endl;
}
int main() {
AGC034A();
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using vi = vector<int>;
using vvi = vector<vi>;
using vl = vector<ll>;
using vvl = vector<vl>;
void AGC034A() {
int N, A, B, C, D;
cin >> N >> A >> B >> C >> D;
--A;
--B;
--C;
--D;
string S;
cin >> S;
int sign = D - C > 0 ? 1 : -1;
for (int i = A; i < C - 1; ++i) {
if (S[i] == '#' && S[i + 1] == '#') {
cout << "No" << endl;
return;
}
}
for (int i = B; i < D - 1; ++i) {
if (S[i] == '#' && S[i + 1] == '#') {
cout << "No" << endl;
return;
}
}
if (sign == -1) {
bool isOk = false;
for (int i = B - 1; i < D; ++i) {
if (S[i] == '.' && S[i + 1] == '.' && S[i + 2] == '.') {
isOk = true;
break;
}
}
if (!isOk) {
cout << "No" << endl;
return;
}
}
cout << "Yes" << endl;
}
int main() {
AGC034A();
return 0;
} | [
"control_flow.loop.for.initializer.change"
] | 830,718 | 830,719 | u227117171 | cpp |
p03017 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, e) for (int i = 0; i < (int)(e); i++)
#define reps(i, s, e) for (int i = s; i < (int)(e); i++)
#define repr(i, s, e) for (int i = s; i > (int)(e); i--)
#define pb push_back
typedef long long ll;
const ll INF = 1LL << 60;
int main() {
int n, a, b, c, d;
cin >> n >> a >> b >> c >> d;
string s;
cin >> s;
string ans = "Yes";
// a->b must possible
reps(i, a - 1, b - 1) {
if (s[i] == '#' && s[i + 1] == '#') {
ans = "No";
break;
}
}
// c->d must possible
reps(i, c - 1, d - 1) {
if (s[i] == '#' && s[i + 1] == '#') {
ans = "No";
break;
}
}
// jump must be possible
if (ans == "Yes") {
/*
if(a < b && b < c && c < d){
reps(i,b-1,c-2){
if(s[i-1]=='.' && s[i]=='.' && s[i+1]=='.'){
jump_flag = "Yes";
break;
}
}
}*/
if (a < b && b < d && d < c) {
string jump_flag = "No";
reps(i, b - 1, d - 1) {
if (s[i - 1] == '.' && s[i] == '.' && s[i + 1] == '.') {
jump_flag = "Yes";
break;
}
}
if (jump_flag == "No") {
ans = "No";
}
}
}
cout << ans;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, e) for (int i = 0; i < (int)(e); i++)
#define reps(i, s, e) for (int i = s; i < (int)(e); i++)
#define repr(i, s, e) for (int i = s; i > (int)(e); i--)
#define pb push_back
typedef long long ll;
const ll INF = 1LL << 60;
int main() {
int n, a, b, c, d;
cin >> n >> a >> b >> c >> d;
string s;
cin >> s;
string ans = "Yes";
// a->b must possible
reps(i, a - 1, b - 1) {
if (s[i] == '#' && s[i + 1] == '#') {
ans = "No";
break;
}
}
// c->d must possible
reps(i, c - 1, d - 1) {
if (s[i] == '#' && s[i + 1] == '#') {
ans = "No";
break;
}
}
// jump must be possible
if (ans == "Yes") {
/*
if(a < b && b < c && c < d){
reps(i,b-1,c-2){
if(s[i-1]=='.' && s[i]=='.' && s[i+1]=='.'){
jump_flag = "Yes";
break;
}
}
}*/
if (a < b && b < d && d < c) {
string jump_flag = "No";
reps(i, b - 1, d) {
if (s[i - 1] == '.' && s[i] == '.' && s[i + 1] == '.') {
jump_flag = "Yes";
break;
}
}
if (jump_flag == "No") {
ans = "No";
}
}
}
cout << ans;
} | [
"expression.operation.binary.remove"
] | 830,720 | 830,721 | u694859623 | cpp |
p03017 | #include <algorithm>
#include <cmath>
#include <cstring>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <stack>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
using ui = unsigned int;
const ll MOD = 1000000007;
// 034
int main() {
ll N, A, B, C, D;
scanf("%lld %lld %lld %lld %lld", &N, &A, &B, &C, &D);
bool passing = C > D ? true : false;
static char S[200010];
scanf("%s", S);
bool unable = false;
bool able_pass = false;
if (B <= C) {
// A-D�Ԃ̓��j�\���ׂ�(�₪2�A��������_��)
//���łɒǂ��z���\�������ׂ�(���n��3������OK)
ll stone_continue = 0;
ll plane_continue = 0;
for (ll i = A; i <= D; i++) {
if (S[i - 1] == '#') {
stone_continue++;
plane_continue = 0;
if (stone_continue >= 2) {
unable = true;
break;
}
} else {
plane_continue++;
stone_continue = 0;
if (plane_continue >= 3 && i >= B + 1 && i <= C && i <= D + 1) {
able_pass = true;
}
}
if (unable == true) {
break;
}
}
if (passing == true && able_pass == false) {
unable = true;
}
} else {
ll stone_continue = 0;
// A-C�ׂ�
for (ll i = A; i <= C; i++) {
if (S[i - 1] == '#') {
stone_continue++;
if (stone_continue >= 2) {
unable = true;
break;
}
} else {
stone_continue = 0;
}
}
if (unable == false) {
// B-D�ׂ�
for (ll i = B; i <= D; i++) {
if (S[i - 1] == '#') {
stone_continue++;
if (stone_continue >= 2) {
unable = true;
break;
}
} else {
stone_continue = 0;
}
}
}
}
if (unable == true) {
printf("No\n");
} else {
printf("Yes\n");
}
} | #include <algorithm>
#include <cmath>
#include <cstring>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <stack>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
using ui = unsigned int;
const ll MOD = 1000000007;
// 034
int main() {
ll N, A, B, C, D;
scanf("%lld %lld %lld %lld %lld", &N, &A, &B, &C, &D);
bool passing = C > D ? true : false;
static char S[200010];
scanf("%s", S);
bool unable = false;
bool able_pass = false;
if (B <= C) {
// A-D�Ԃ̓��j�\���ׂ�(�₪2�A��������_��)
//���łɒǂ��z���\�������ׂ�(���n��3������OK)
ll stone_continue = 0;
ll plane_continue = 0;
for (ll i = A; i <= max(C, D); i++) {
if (S[i - 1] == '#') {
stone_continue++;
plane_continue = 0;
if (stone_continue >= 2) {
unable = true;
break;
}
} else {
plane_continue++;
stone_continue = 0;
if (plane_continue >= 3 && i >= B + 1 && i <= C && i <= D + 1) {
able_pass = true;
}
}
if (unable == true) {
break;
}
}
if (passing == true && able_pass == false) {
unable = true;
}
} else {
ll stone_continue = 0;
// A-C�ׂ�
for (ll i = A; i <= C; i++) {
if (S[i - 1] == '#') {
stone_continue++;
if (stone_continue >= 2) {
unable = true;
break;
}
} else {
stone_continue = 0;
}
}
if (unable == false) {
// B-D�ׂ�
for (ll i = B; i <= D; i++) {
if (S[i - 1] == '#') {
stone_continue++;
if (stone_continue >= 2) {
unable = true;
break;
}
} else {
stone_continue = 0;
}
}
}
}
if (unable == true) {
printf("No\n");
} else {
printf("Yes\n");
}
} | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"call.add"
] | 830,727 | 830,728 | u572472538 | cpp |
p03017 | #include <algorithm>
#include <climits>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <queue>
#include <sstream>
#include <string>
#include <vector>
bool sort_pair(std::pair<int64_t, std::string> origin,
std::pair<int64_t, std::string> another) {
return origin.first < another.first;
}
int main() {
int64_t n, a, b, c, d;
std::cin >> n;
std::cin >> a;
std::cin >> b;
std::cin >> c;
std::cin >> d;
std::string mas;
std::cin >> mas;
std::string result = "No";
int kabe = 0;
if (c < d) {
result = "Yes";
for (int i = 0; i < n; i++) {
if (mas[i] == '#') {
kabe += 1;
} else {
kabe = 0;
}
if (1 < kabe) {
if ((i + 1 < d && b < i + 1) || (i + 1 < c && a < i + 1)) {
result = "No";
break;
}
}
}
} else {
int count = 0;
for (int i = b - 1; i < n; i++) {
if (mas[i] == '.') {
count += 1;
kabe = 0;
} else {
count = 0;
kabe += 1;
}
if (1 < kabe) {
if ((i + 1 < d && b < i + 1) || (i + 1 < c && a < i + 1)) {
break;
}
}
if (count >= 3) {
if (i + 1 <= d) {
result = "Yes";
break;
}
} else if (count == 2 && i + 1 == d && mas[i + 1] == '.') {
result = "Yes";
break;
}
}
}
std::cout << result;
}
| #include <algorithm>
#include <climits>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <queue>
#include <sstream>
#include <string>
#include <vector>
bool sort_pair(std::pair<int64_t, std::string> origin,
std::pair<int64_t, std::string> another) {
return origin.first < another.first;
}
int main() {
int64_t n, a, b, c, d;
std::cin >> n;
std::cin >> a;
std::cin >> b;
std::cin >> c;
std::cin >> d;
std::string mas;
std::cin >> mas;
std::string result = "No";
int kabe = 0;
if (c < d) {
result = "Yes";
for (int i = 0; i < n; i++) {
if (mas[i] == '#') {
kabe += 1;
} else {
kabe = 0;
}
if (1 < kabe) {
if ((i + 1 < d && b < i + 1) || (i + 1 < c && a < i + 1)) {
result = "No";
break;
}
}
}
} else {
int count = 0;
for (int i = b - 2; i < n; i++) {
if (mas[i] == '.') {
count += 1;
kabe = 0;
} else {
count = 0;
kabe += 1;
}
if (1 < kabe) {
if ((i + 1 < d && b < i + 1) || (i + 1 < c && a < i + 1)) {
break;
}
}
if (count >= 3) {
if (i + 1 <= d) {
result = "Yes";
break;
}
} else if (count == 2) {
if (i + 1 == d && mas[i + 1] == '.') {
result = "Yes";
break;
}
}
}
}
std::cout << result;
}
| [
"literal.number.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"expression.operation.binary.change",
"control_flow.branch.if.condition.change",
"control_flow.branch.if.add"
] | 830,729 | 830,730 | u184115330 | cpp |
p03017 | #include <iostream>
using namespace std;
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
typedef long long ll;
int main() {
int N, A, B, C, D;
cin >> N >> A >> B >> C >> D;
char S[200000];
bool can = true;
bool space3 = false;
string ans;
rep(i, N) cin >> S[i];
if (C < D) {
for (int i = A - 1; i < C - 1; i++) {
if (S[i] == '#' && S[i + 1] == '#') {
can = false;
break;
}
}
for (int i = C; i < D - 1; i++) {
if (S[i] == '#' && S[i + 1] == '#') {
can = false;
break;
}
}
} else {
for (int i = B - 1; i < D - 1; i++) {
if (S[i] == '.' && S[i + 1] == '.' && S[i + 2] == '.') {
space3 = true;
B = S[i + 1];
break;
}
}
if (space3) {
for (int i = B; i < D - 1; i++) {
if (S[i] == '#' && S[i + 1] == '#') {
can = false;
}
}
for (int i = A; i < C - 1; i++) {
if (S[i] == '#' && S[i + 1] == '#') {
can = false;
}
}
} else
can = false;
}
if (can) {
cout << "Yes" << endl;
} else
cout << "No" << endl;
} | #include <iostream>
using namespace std;
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
typedef long long ll;
int main() {
int N, A, B, C, D;
cin >> N >> A >> B >> C >> D;
char S[200000];
bool can = true;
bool space3 = false;
string ans;
rep(i, N) cin >> S[i];
if (C < D) {
for (int i = A - 1; i < C - 1; i++) {
if (S[i] == '#' && S[i + 1] == '#') {
can = false;
break;
}
}
for (int i = C; i < D - 1; i++) {
if (S[i] == '#' && S[i + 1] == '#') {
can = false;
break;
}
}
} else {
for (int i = B - 2; i < D - 1; i++) {
if (S[i] == '.' && S[i + 1] == '.' && S[i + 2] == '.') {
space3 = true;
B = S[i + 1];
break;
}
}
if (space3) {
for (int i = B; i < D - 1; i++) {
if (S[i] == '#' && S[i + 1] == '#') {
can = false;
}
}
for (int i = A; i < C - 1; i++) {
if (S[i] == '#' && S[i + 1] == '#') {
can = false;
}
}
} else
can = false;
}
if (can) {
cout << "Yes" << endl;
} else
cout << "No" << endl;
} | [
"literal.number.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 830,731 | 830,732 | u637834578 | cpp |
p03017 | #include <algorithm>
#include <cmath>
#include <complex>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <locale>
#include <map>
#include <numeric>
#include <queue>
#include <string>
#include <vector>
const long long int INF = 1e9;
typedef long long int ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define Rep(i, n) for (int i = 1; i <= (int)(n); i++)
#define llrep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define llRep(i, n) for (ll i = 1; i <= (ll)(n); i++)
using namespace std;
struct Point {
int x, y;
};
bool vector_finder(std::vector<ll> vec, ll number) {
auto itr = std::find(vec.begin(), vec.end(), number);
size_t index = std::distance(vec.begin(), itr);
if (index != vec.size()) { // 発見できたとき
return true;
} else { // 発見できなかったとき
return false;
}
}
ll factorial(ll N) {
ll ans = 1;
llRep(i, N) { ans *= i; }
return ans;
}
ll extended_factorial(ll N) {
ll ans = 1;
llRep(i, N) {
ans *= i;
ans %= (ll)(1e9 + 7);
}
return ans;
}
vector<ll> Eratosthenes(ll N) {
bool arr[N + 1];
// initialization
arr[0] = false;
arr[1] = false;
for (ll i = 2; i < N + 1; i++) {
arr[i] = true;
}
// eratosthenes
for (ll i = 2; i <= sqrt(N); i++) {
if (arr[i]) {
for (ll j = 0; i * (j + 2) <= N; j++) {
arr[i * (j + 2)] = false; // not prime number
}
}
}
vector<ll> prime;
llRep(i, N) {
if (arr[i] == true) {
prime.push_back(i);
}
}
return prime;
}
ll gcd(ll a, ll b) {
ll temp;
while (a % b != 0) {
temp = b;
b = a % b;
a = temp;
}
return b;
}
ll lcm(ll a, ll b) { return a * b / gcd(a, b); }
char alphabet[] = {'a', 'b', 'c', 'd', 'e', 'f', 'g', 'h', 'i',
'j', 'k', 'l', 'm', 'n', 'o', 'p', 'q', 'r',
's', 't', 'u', 'v', 'w', 'x', 'y', 'z'};
int main() {
int N, A, B, C, D;
string S;
cin >> N >> A >> B >> C >> D;
cin >> S;
A -= 1;
B -= 1;
C -= 1;
D -= 1;
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;
} else {
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 <complex>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <locale>
#include <map>
#include <numeric>
#include <queue>
#include <string>
#include <vector>
const long long int INF = 1e9;
typedef long long int ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define Rep(i, n) for (int i = 1; i <= (int)(n); i++)
#define llrep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define llRep(i, n) for (ll i = 1; i <= (ll)(n); i++)
using namespace std;
struct Point {
int x, y;
};
bool vector_finder(std::vector<ll> vec, ll number) {
auto itr = std::find(vec.begin(), vec.end(), number);
size_t index = std::distance(vec.begin(), itr);
if (index != vec.size()) { // 発見できたとき
return true;
} else { // 発見できなかったとき
return false;
}
}
ll factorial(ll N) {
ll ans = 1;
llRep(i, N) { ans *= i; }
return ans;
}
ll extended_factorial(ll N) {
ll ans = 1;
llRep(i, N) {
ans *= i;
ans %= (ll)(1e9 + 7);
}
return ans;
}
vector<ll> Eratosthenes(ll N) {
bool arr[N + 1];
// initialization
arr[0] = false;
arr[1] = false;
for (ll i = 2; i < N + 1; i++) {
arr[i] = true;
}
// eratosthenes
for (ll i = 2; i <= sqrt(N); i++) {
if (arr[i]) {
for (ll j = 0; i * (j + 2) <= N; j++) {
arr[i * (j + 2)] = false; // not prime number
}
}
}
vector<ll> prime;
llRep(i, N) {
if (arr[i] == true) {
prime.push_back(i);
}
}
return prime;
}
ll gcd(ll a, ll b) {
ll temp;
while (a % b != 0) {
temp = b;
b = a % b;
a = temp;
}
return b;
}
ll lcm(ll a, ll b) { return a * b / gcd(a, b); }
char alphabet[] = {'a', 'b', 'c', 'd', 'e', 'f', 'g', 'h', 'i',
'j', 'k', 'l', 'm', 'n', 'o', 'p', 'q', 'r',
's', 't', 'u', 'v', 'w', 'x', 'y', 'z'};
int main() {
int N, A, B, C, D;
string S;
cin >> N >> A >> B >> C >> D;
cin >> S;
A -= 1;
B -= 1;
C -= 1;
D -= 1;
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;
} else {
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;
}
}
| [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 830,743 | 830,744 | u981890679 | cpp |
p03017 | #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n, a, b, c, d;
cin >> n >> a >> b >> c >> d;
string s;
cin >> s;
bool ans = true;
if (c < d) {
for (int i = b; i < d; i++) {
if (s[i] == '#' && s[i - 1] == '#') {
ans = false;
break;
}
}
for (int i = a; i < c; i++) {
if (s[i] == '#' && s[i - 1] == '#') {
ans = false;
break;
}
}
if (ans)
cout << "Yes" << endl;
else
cout << "No" << endl;
return 0;
}
for (int i = b; i < d; i++) {
if (s[i] == '#' && s[i - 1] == '#') {
ans = false;
break;
}
}
if (!ans) {
cout << "No" << endl;
return 0;
}
for (int i = a; i < c; i++) {
if (s[i] == '#' && s[i - 1] == '#') {
ans = false;
break;
}
}
bool has2 = false;
if (c < b)
has2 = true;
else {
for (int i = b + 1; i < d; i++) {
if (s[i] == '.' && s[i - 1] == '.' && s[i - 2] == '.') {
has2 = true;
break;
}
}
}
if (ans && has2)
cout << "Yes" << endl;
else
cout << "No" << endl;
return 0;
}
| #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n, a, b, c, d;
cin >> n >> a >> b >> c >> d;
string s;
cin >> s;
bool ans = true;
if (c < d) {
for (int i = b; i < d; i++) {
if (s[i] == '#' && s[i - 1] == '#') {
ans = false;
break;
}
}
for (int i = a; i < c; i++) {
if (s[i] == '#' && s[i - 1] == '#') {
ans = false;
break;
}
}
if (ans)
cout << "Yes" << endl;
else
cout << "No" << endl;
return 0;
}
for (int i = b; i < d; i++) {
if (s[i] == '#' && s[i - 1] == '#') {
ans = false;
break;
}
}
if (!ans) {
cout << "No" << endl;
return 0;
}
for (int i = a; i < c; i++) {
if (s[i] == '#' && s[i - 1] == '#') {
ans = false;
break;
}
}
bool has2 = false;
if (c < b)
has2 = true;
else {
for (int i = b - 1; i < d; i++) {
if (s[i] == '.' && s[i - 1] == '.' && s[i + 1] == '.') {
has2 = true;
break;
}
}
}
if (ans && has2)
cout << "Yes" << endl;
else
cout << "No" << endl;
return 0;
}
| [
"misc.opposites",
"expression.operator.arithmetic.change",
"control_flow.loop.for.initializer.change",
"expression.operation.binary.change",
"control_flow.loop.for.condition.change"
] | 830,745 | 830,746 | u007567244 | cpp |
p03017 | #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n, a, b, c, d;
cin >> n >> a >> b >> c >> d;
string s;
cin >> s;
bool ans = true;
if (c < d) {
for (int i = b; i < d; i++) {
if (s[i] == '#' && s[i - 1] == '#') {
ans = false;
break;
}
}
for (int i = a; i < c; i++) {
if (s[i] == '#' && s[i - 1] == '#') {
ans = false;
break;
}
}
if (ans)
cout << "Yes" << endl;
else
cout << "No" << endl;
return 0;
}
for (int i = b; i < d; i++) {
if (s[i] == '#' && s[i - 1] == '#') {
ans = false;
break;
}
}
if (!ans) {
cout << "No" << endl;
return 0;
}
for (int i = a; i < c; i++) {
if (s[i] == '#' && s[i - 1] == '#') {
ans = false;
break;
}
}
bool has2 = false;
if (c < b)
has2 = true;
else {
for (int i = b + 1; i < c; i++) {
if (s[i] == '.' && s[i - 1] == '.' && s[i - 2] == '.') {
has2 = true;
break;
}
}
}
if (ans && has2)
cout << "Yes" << endl;
else
cout << "No" << endl;
return 0;
}
| #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n, a, b, c, d;
cin >> n >> a >> b >> c >> d;
string s;
cin >> s;
bool ans = true;
if (c < d) {
for (int i = b; i < d; i++) {
if (s[i] == '#' && s[i - 1] == '#') {
ans = false;
break;
}
}
for (int i = a; i < c; i++) {
if (s[i] == '#' && s[i - 1] == '#') {
ans = false;
break;
}
}
if (ans)
cout << "Yes" << endl;
else
cout << "No" << endl;
return 0;
}
for (int i = b; i < d; i++) {
if (s[i] == '#' && s[i - 1] == '#') {
ans = false;
break;
}
}
if (!ans) {
cout << "No" << endl;
return 0;
}
for (int i = a; i < c; i++) {
if (s[i] == '#' && s[i - 1] == '#') {
ans = false;
break;
}
}
bool has2 = false;
if (c < b)
has2 = true;
else {
for (int i = b - 1; i < d; i++) {
if (s[i] == '.' && s[i - 1] == '.' && s[i + 1] == '.') {
has2 = true;
break;
}
}
}
if (ans && has2)
cout << "Yes" << endl;
else
cout << "No" << endl;
return 0;
}
| [
"misc.opposites",
"expression.operator.arithmetic.change",
"control_flow.loop.for.initializer.change",
"expression.operation.binary.change",
"identifier.change",
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 830,747 | 830,746 | u007567244 | cpp |
p03017 | #pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
struct __INIT {
__INIT() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(15);
}
} __init;
#define max3(a, b, c) max(a, max(b, c))
#define min3(a, b, c) min(a, min(b, c))
#define MOD 1000000007
#define INF (1 << 30)
#define LINF (1LL << 60)
#define endl "\n"
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define reprev(i, n) for (int(i) = (n - 1); (i) >= 0; (i)--)
#define Flag(x) (1 << (x))
#define Flagcount(x) __builtin_popcount(x)
#define pint pair<int, int>
#define pdouble pair<double, double>
typedef unsigned long long int ull;
typedef long long lint;
int main(void) {
int N, A, B, C, D, check = 0;
cin >> N >> A >> B >> C >> D;
A--, B--, C--, D--;
string S;
cin >> S;
for (int i = A; i < D; i++)
if (i + 1 < N && S[i] == '#' && S[i + 1] == '#')
check = 1;
if (C > D) {
int check2 = 0;
for (int i = B - 1; i < C; i++)
if (S[i] == '.' && S[i + 1] == '.' && S[i + 2] == '.' && i + 2 < N)
check2 = 1;
if (check2 == 0)
check = 1;
}
if (check == 1)
cout << "No" << endl;
else
cout << "Yes" << endl;
} | #pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
struct __INIT {
__INIT() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(15);
}
} __init;
#define max3(a, b, c) max(a, max(b, c))
#define min3(a, b, c) min(a, min(b, c))
#define MOD 1000000007
#define INF (1 << 30)
#define LINF (1LL << 60)
#define endl "\n"
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define reprev(i, n) for (int(i) = (n - 1); (i) >= 0; (i)--)
#define Flag(x) (1 << (x))
#define Flagcount(x) __builtin_popcount(x)
#define pint pair<int, int>
#define pdouble pair<double, double>
typedef unsigned long long int ull;
typedef long long lint;
int main(void) {
int N, A, B, C, D, check = 0;
cin >> N >> A >> B >> C >> D;
A--, B--, C--, D--;
string S;
cin >> S;
for (int i = A; i < D; i++)
if (i + 1 < N && S[i] == '#' && S[i + 1] == '#')
check = 1;
if (C > D) {
int check2 = 0;
for (int i = B - 1; i < D; i++)
if (S[i] == '.' && S[i + 1] == '.' && S[i + 2] == '.' && i + 2 < N)
check2 = 1;
if (check2 == 0)
check = 1;
}
if (check == 1)
cout << "No" << endl;
else
cout << "Yes" << endl;
} | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 830,755 | 830,756 | u601444374 | cpp |
p03017 | #pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
struct __INIT {
__INIT() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(15);
}
} __init;
#define max3(a, b, c) max(a, max(b, c))
#define min3(a, b, c) min(a, min(b, c))
#define MOD 1000000007
#define INF (1 << 30)
#define LINF (1LL << 60)
#define endl "\n"
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define reprev(i, n) for (int(i) = (n - 1); (i) >= 0; (i)--)
#define Flag(x) (1 << (x))
#define Flagcount(x) __builtin_popcount(x)
#define pint pair<int, int>
#define pdouble pair<double, double>
typedef unsigned long long int ull;
typedef long long lint;
int main(void) {
int N, A, B, C, D, check = 0;
cin >> N >> A >> B >> C >> D;
A--, B--, C--, D--;
string S;
cin >> S;
for (int i = A; i < D; i++)
if (i + 1 < N && S[i] == '#' && S[i + 1] == '#')
check = 1;
if (C > D) {
int check2 = 0;
for (int i = B - 1; i < D - 1; i++)
if (S[i] == '.' && S[i + 1] == '.' && S[i + 2] == '.' && i + 2 < N)
check2 = 1;
if (check2 == 0)
check = 1;
}
if (check == 1)
cout << "No" << endl;
else
cout << "Yes" << endl;
} | #pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
struct __INIT {
__INIT() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(15);
}
} __init;
#define max3(a, b, c) max(a, max(b, c))
#define min3(a, b, c) min(a, min(b, c))
#define MOD 1000000007
#define INF (1 << 30)
#define LINF (1LL << 60)
#define endl "\n"
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define reprev(i, n) for (int(i) = (n - 1); (i) >= 0; (i)--)
#define Flag(x) (1 << (x))
#define Flagcount(x) __builtin_popcount(x)
#define pint pair<int, int>
#define pdouble pair<double, double>
typedef unsigned long long int ull;
typedef long long lint;
int main(void) {
int N, A, B, C, D, check = 0;
cin >> N >> A >> B >> C >> D;
A--, B--, C--, D--;
string S;
cin >> S;
for (int i = A; i < D; i++)
if (i + 1 < N && S[i] == '#' && S[i + 1] == '#')
check = 1;
if (C > D) {
int check2 = 0;
for (int i = B - 1; i < D; i++)
if (S[i] == '.' && S[i + 1] == '.' && S[i + 2] == '.' && i + 2 < N)
check2 = 1;
if (check2 == 0)
check = 1;
}
if (check == 1)
cout << "No" << endl;
else
cout << "Yes" << endl;
} | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 830,757 | 830,756 | u601444374 | cpp |
p03017 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (long long i = 0; i < (long long)(n); i++)
typedef long long ll;
typedef pair<int, int> P;
using vi = vector<int>;
using vvi = vector<vector<int>>;
using vc = vector<char>;
using vvc = vector<vector<char>>;
const int inf = 1000000009;
void chmin(auto &a, auto b) {
if (b < a)
a = b;
}
void chmax(auto &a, auto b) {
if (a < b)
a = b;
}
int main() {
int n, a, b, c, d;
cin >> n >> a >> b >> c >> d;
string s;
cin >> s;
rep(i, n - 1) {
if (s[i] == '#' && s[i + 1] == '#') {
if ((a - 1 < i && i < c - 1) || (b - 1 < i && i < d - 1)) {
cout << "No" << endl;
return 0;
}
}
}
if ((a > b && c < d) || (a < b && c > d)) {
rep(i, n - 2) {
if (s[i] == '.' && s[i + 1] == '.' && s[i + 2] == '.') {
if (max(a, b) - 1 <= i + 1 && i + 1 <= min(c, d)) {
cout << "Yes" << endl;
return 0;
}
}
}
cout << "No" << endl;
} else
cout << "Yes" << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (long long i = 0; i < (long long)(n); i++)
typedef long long ll;
typedef pair<int, int> P;
using vi = vector<int>;
using vvi = vector<vector<int>>;
using vc = vector<char>;
using vvc = vector<vector<char>>;
const int inf = 1000000009;
void chmin(auto &a, auto b) {
if (b < a)
a = b;
}
void chmax(auto &a, auto b) {
if (a < b)
a = b;
}
int main() {
int n, a, b, c, d;
cin >> n >> a >> b >> c >> d;
string s;
cin >> s;
rep(i, n - 1) {
if (s[i] == '#' && s[i + 1] == '#') {
if ((a - 1 <= i && i < c - 1) || (b - 1 <= i && i < d - 1)) {
cout << "No" << endl;
return 0;
}
}
}
if ((a > b && c < d) || (a < b && c > d)) {
rep(i, n - 2) {
if (s[i] == '.' && s[i + 1] == '.' && s[i + 2] == '.') {
if (max(a, b) - 1 <= i + 1 && i + 1 < min(c, d)) {
cout << "Yes" << endl;
return 0;
}
}
}
cout << "No" << endl;
} else
cout << "Yes" << endl;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 830,776 | 830,777 | u422633119 | cpp |
p03017 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll d = 1000000000;
int main() {
int N, A, B, C, D;
cin >> N >> A >> B >> C >> D;
string S;
cin >> S;
bool flag1 = true;
bool flag5 = false; //初めのBの位置の前からDまでに.が３連続以上あるか
if (C > D) {
//#の連続数をカウント
for (int i = A; i < C - 1; i++) {
if (S[i] == '#' && S[i + 1] == '#') {
flag1 = false;
break;
}
}
for (int i = B - 2; i <= D - 3; i++) {
if (S[i] == '.' && S[i + 1] == '.' && S[i + 2] == '.') {
flag5 = true;
break;
}
}
if (flag1 && flag5)
cout << "Yes" << endl;
else
cout << "No" << endl;
}
if (C < D) {
for (int i = A; i < D - 1; i++) {
if (S[i] == '#' && S[i + 1] == '#') {
flag1 = false;
break;
}
}
if (flag1)
cout << "Yes" << endl;
else
cout << "No" << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll d = 1000000000;
int main() {
int N, A, B, C, D;
cin >> N >> A >> B >> C >> D;
string S;
cin >> S;
bool flag1 = true;
bool flag5 = false; //初めのBの位置の前からDまでに.が３連続以上あるか
if (C > D) {
//#の連続数をカウント
for (int i = A; i < C - 1; i++) {
if (S[i] == '#' && S[i + 1] == '#') {
flag1 = false;
break;
}
}
for (int i = B - 2; i <= D - 2; i++) {
if (S[i] == '.' && S[i + 1] == '.' && S[i + 2] == '.') {
flag5 = true;
break;
}
}
if (flag1 && flag5)
cout << "Yes" << endl;
else
cout << "No" << endl;
}
if (C < D) {
for (int i = A; i < D - 1; i++) {
if (S[i] == '#' && S[i + 1] == '#') {
flag1 = false;
break;
}
}
if (flag1)
cout << "Yes" << endl;
else
cout << "No" << endl;
}
} | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 830,793 | 830,794 | u037276799 | cpp |
p03017 | #include <bits/stdc++.h> // ver1.8
#define int long long
#define ALL(v) (v).begin(), (v).end()
#define Vi vector<int>
#define pb push_back
#define mp make_pair
#define rep(i, a, b) for (int i = a; i < b; i++)
#define repeq(i, a, b) for (int i = a; i <= b; i++)
#define repr(i, a, b) for (int i = a; i > b; i--)
#define repreq(i, a, b) for (int i = a; i >= b; i--)
#define leng(n) (int)(log10(n) + 1)
#define INF 9000000000000000000 // 9.0 * 10^18
#define MOD 1000000007 // 10^9 + 7
#define PAI 3.14159265358979
using namespace std;
int gcd(int a, int b) { return b ? gcd(b, a % b) : a; } // 最大公約数gcd
int lcm(int a, int b) { return a / gcd(a, b) * b; } // 最小公倍数lcm
signed main() {
cout << fixed << setprecision(14);
int n, s1, s2, g1, g2;
cin >> n >> s1 >> s2 >> g1 >> g2;
s1--;
s2--;
g1--;
g2--;
string m;
cin >> m;
rep(i, s1, g1 - 1) {
if (m[i] == '#' && m[i + 1] == '#') {
cout << "No" << endl;
return 0;
}
}
rep(i, s2, g2 - 1) {
if (m[i] == '#' && m[i + 1] == '#') {
cout << "No" << endl;
return 0;
}
}
if (g1 < g2) {
cout << "Yes" << endl;
return 0;
}
rep(i, s2, g2) {
if (m[i - 1] == '.' && m[i] == '.' && m[i + 1] == '.') {
cout << "Yes" << endl;
return 0;
}
}
cout << "No" << endl;
return 0;
}
| #include <bits/stdc++.h> // ver1.8
#define int long long
#define ALL(v) (v).begin(), (v).end()
#define Vi vector<int>
#define pb push_back
#define mp make_pair
#define rep(i, a, b) for (int i = a; i < b; i++)
#define repeq(i, a, b) for (int i = a; i <= b; i++)
#define repr(i, a, b) for (int i = a; i > b; i--)
#define repreq(i, a, b) for (int i = a; i >= b; i--)
#define leng(n) (int)(log10(n) + 1)
#define INF 9000000000000000000 // 9.0 * 10^18
#define MOD 1000000007 // 10^9 + 7
#define PAI 3.14159265358979
using namespace std;
int gcd(int a, int b) { return b ? gcd(b, a % b) : a; } // 最大公約数gcd
int lcm(int a, int b) { return a / gcd(a, b) * b; } // 最小公倍数lcm
signed main() {
cout << fixed << setprecision(14);
int n, s1, s2, g1, g2;
cin >> n >> s1 >> s2 >> g1 >> g2;
s1--;
s2--;
g1--;
g2--;
string m;
cin >> m;
rep(i, s1, g1 - 1) {
if (m[i] == '#' && m[i + 1] == '#') {
cout << "No" << endl;
return 0;
}
}
rep(i, s2, g2 - 1) {
if (m[i] == '#' && m[i + 1] == '#') {
cout << "No" << endl;
return 0;
}
}
if (g1 < g2) {
cout << "Yes" << endl;
return 0;
}
rep(i, s2, g2 + 1) {
if (m[i - 1] == '.' && m[i] == '.' && m[i + 1] == '.') {
cout << "Yes" << endl;
return 0;
}
}
cout << "No" << endl;
return 0;
}
| [
"expression.operation.binary.add"
] | 830,797 | 830,798 | u095453583 | cpp |
p03017 | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
using namespace std;
int main() {
int n, a, b, c, d;
cin >> n >> a >> b >> c >> d;
string s;
cin >> s;
for (int i = a; i < c - 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;
}
}
if (c > d) {
for (int i = b; i < d; i++) {
if (s[i - 2] == '.' && s[i - 1] == '.' && s[i] == '.') {
cout << "Yes" << endl;
return 0;
}
}
cout << "No" << endl;
return 0;
}
cout << "Yes" << endl;
}
| #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
using namespace std;
int main() {
int n, a, b, c, d;
cin >> n >> a >> b >> c >> d;
string s;
cin >> s;
for (int i = a; i < c - 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;
}
}
if (c > d) {
for (int i = b; i <= d; i++) {
if (s[i - 2] == '.' && s[i - 1] == '.' && s[i] == '.') {
cout << "Yes" << endl;
return 0;
}
}
cout << "No" << endl;
return 0;
}
cout << "Yes" << endl;
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 830,801 | 830,802 | u401900157 | cpp |
p03017 | #include <iostream>
using namespace std;
int n, a, b, c, d;
string road;
int main(void) {
cin >> n >> a >> b >> c >> d >> road;
for (int i = a; i < max(c, d) - 1; i++) {
if (road[i] == '#' && road[i + 1] == '#') {
cout << "No" << endl;
return 0;
}
}
if (c < d) {
cout << "Yes" << endl;
return 0;
}
for (int i = b - 1; i < min(c, d) - 1; i++) {
if (road[i] == '.' && road[i + 1] == '.' && road[i + 2] == '.') {
cout << "Yes" << endl;
return 0;
}
}
cout << "No" << endl;
}
| #include <iostream>
using namespace std;
int n, a, b, c, d;
string road;
int main(void) {
cin >> n >> a >> b >> c >> d >> road;
for (int i = a; i < max(c, d) - 1; i++) {
if (road[i] == '#' && road[i + 1] == '#') {
cout << "No" << endl;
return 0;
}
}
if (c < d) {
cout << "Yes" << endl;
return 0;
}
for (int i = b - 2; i < min(c, d) - 1; i++) {
if (road[i] == '.' && road[i + 1] == '.' && road[i + 2] == '.') {
cout << "Yes" << endl;
return 0;
}
}
cout << "No" << endl;
}
| [
"literal.number.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 830,803 | 830,804 | u050428930 | cpp |
p03017 | #include <iostream>
using namespace std;
int n, a, b, c, d;
string road;
int main(void) {
cin >> n >> a >> b >> c >> d >> road;
for (int i = a; i < max(c, d) - 1; i++) {
if (road[i] == '#' && road[i + 1] == '#') {
cout << "No" << endl;
return 0;
}
}
if (c < d) {
cout << "Yes" << endl;
return 0;
}
for (int i = a - 1; i < min(c, d) - 1; i++) {
if (road[i] == '.' && road[i + 1] == '.' && road[i + 2] == '.') {
cout << "Yes" << endl;
return 0;
}
}
cout << "No" << endl;
}
| #include <iostream>
using namespace std;
int n, a, b, c, d;
string road;
int main(void) {
cin >> n >> a >> b >> c >> d >> road;
for (int i = a; i < max(c, d) - 1; i++) {
if (road[i] == '#' && road[i + 1] == '#') {
cout << "No" << endl;
return 0;
}
}
if (c < d) {
cout << "Yes" << endl;
return 0;
}
for (int i = b - 2; i < min(c, d) - 1; i++) {
if (road[i] == '.' && road[i + 1] == '.' && road[i + 2] == '.') {
cout << "Yes" << endl;
return 0;
}
}
cout << "No" << endl;
}
| [
"identifier.change",
"control_flow.loop.for.initializer.change",
"expression.operation.binary.change",
"literal.number.change",
"expression.off_by_one"
] | 830,805 | 830,804 | u050428930 | cpp |
p03017 | #include <iostream>
using namespace std;
int n, a, b, c, d;
string road;
int main(void) {
cin >> n >> a >> b >> c >> d >> road;
for (int i = a; i < max(c, d) - 1; i++) {
if (road[i] == '#' && road[i + 1] == '#') {
cout << "No" << endl;
return 0;
}
}
if (c < d) {
cout << "Yes" << endl;
return 0;
}
for (int i = a - 1; i < min(c, d) - 2; i++) {
if (road[i] == '.' && road[i + 1] == '.' && road[i + 2] == '.') {
cout << "Yes" << endl;
return 0;
}
}
cout << "No" << endl;
}
| #include <iostream>
using namespace std;
int n, a, b, c, d;
string road;
int main(void) {
cin >> n >> a >> b >> c >> d >> road;
for (int i = a; i < max(c, d) - 1; i++) {
if (road[i] == '#' && road[i + 1] == '#') {
cout << "No" << endl;
return 0;
}
}
if (c < d) {
cout << "Yes" << endl;
return 0;
}
for (int i = b - 2; i < min(c, d) - 1; i++) {
if (road[i] == '.' && road[i + 1] == '.' && road[i + 2] == '.') {
cout << "Yes" << endl;
return 0;
}
}
cout << "No" << endl;
}
| [
"identifier.change",
"control_flow.loop.for.initializer.change",
"expression.operation.binary.change",
"literal.number.change",
"expression.off_by_one",
"control_flow.loop.for.condition.change"
] | 830,806 | 830,804 | u050428930 | cpp |
p03017 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, A, B, C, D, ren = 0, sharp = 0, cant = 0, over = 0;
string S;
cin >> N >> A >> B >> C >> D;
cin >> S;
for (int i = A; i < max(C, D); i++) {
if (S[i] == '#') {
sharp++;
} else {
cant = max(cant, sharp);
sharp = 0;
}
}
cant = max(cant, sharp);
if (C < D) {
if (1 < cant) {
cout << "No";
} else {
cout << "Yes";
}
} else {
for (int i = B - 2; i < D; i++) {
if (S[i] == '#') {
over = max(ren, over);
ren = 0;
} else {
ren++;
}
}
over = max(ren, over);
if (1 < cant || over < 3) {
cout << "No";
} else {
cout << "Yes";
}
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, A, B, C, D, ren = 0, sharp = 0, cant = 0, over = 0;
string S;
cin >> N >> A >> B >> C >> D;
cin >> S;
for (int i = A; i <= max(C, D); i++) {
if (S[i] == '#') {
sharp++;
} else {
cant = max(cant, sharp);
sharp = 0;
}
}
cant = max(cant, sharp);
if (C < D) {
if (1 < cant) {
cout << "No";
} else {
cout << "Yes";
}
} else {
for (int i = B - 2; i <= D; i++) {
if (S[i] == '#') {
over = max(ren, over);
ren = 0;
} else {
ren++;
}
}
over = max(ren, over);
if (1 < cant || over < 3) {
cout << "No";
} else {
cout << "Yes";
}
}
} | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"control_flow.branch.if.condition.change"
] | 830,809 | 830,810 | u926416331 | cpp |
p03017 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, A, B, C, D, ren = 0, sharp = 0, cant = 0, over = 0;
string S;
cin >> N >> A >> B >> C >> D;
cin >> S;
for (int i = A; i <= max(C, D); i++) {
if (S[i] == '#') {
sharp++;
} else {
cant = max(cant, sharp);
sharp = 0;
}
}
cant = max(cant, sharp);
if (C < D) {
if (1 < cant) {
cout << "No";
} else {
cout << "Yes";
}
} else {
for (int i = B - 1; i <= D; i++) {
if (S[i] == '#') {
over = max(ren, over);
ren = 0;
} else {
ren++;
}
}
over = max(ren, over);
if (1 < cant || over < 3) {
cout << "No";
} else {
cout << "Yes";
}
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, A, B, C, D, ren = 0, sharp = 0, cant = 0, over = 0;
string S;
cin >> N >> A >> B >> C >> D;
cin >> S;
for (int i = A; i <= max(C, D); i++) {
if (S[i] == '#') {
sharp++;
} else {
cant = max(cant, sharp);
sharp = 0;
}
}
cant = max(cant, sharp);
if (C < D) {
if (1 < cant) {
cout << "No";
} else {
cout << "Yes";
}
} else {
for (int i = B - 2; i <= D; i++) {
if (S[i] == '#') {
over = max(ren, over);
ren = 0;
} else {
ren++;
}
}
over = max(ren, over);
if (1 < cant || over < 3) {
cout << "No";
} else {
cout << "Yes";
}
}
} | [
"literal.number.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 830,811 | 830,810 | u926416331 | cpp |
p03017 | #include <bits/stdc++.h>
#define SORT(a) sort(a.begin(), a.end())
#define RSORT(a) sort(a.rbegin(), a.rend())
#define REP(i, n) for (int i = 0; i < n; i++)
#define RREP(i, n) for (int i = n - 1; 0 <= i; i--)
#define FOR(i, start, end) for (int i = start; i < end; i++)
#define RFOR(i, start, end) for (int i = start - 1; 0 <= i; i--)
#define ALL(a) a.begin(), a.end()
using ll = long long;
using namespace std;
constexpr int INF32 = 1'050'000'000;
constexpr long long INF64 = 4'000'000'000'000'000'000;
constexpr int MOD7 = 1'000'000'007;
constexpr int MOD9 = 1'000'000'009;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
void print() { std::cout << '\n'; }
template <class H, class... T> void print(H &&head, T &&...args) {
std::cout << head;
sizeof...(args) == 0 ? std::cout << "" : std::cout << ' ';
print(std::forward<T>(args)...);
}
template <class T> void print(std::vector<T> &v) {
for (int i = 0; i < v.size(); i++) {
std::cout << v[i];
i == v.size() - 1 ? std::cout << '\n' : std::cout << ' ';
}
}
template <class T> void print(std::vector<std::vector<T>> &v) {
for (int i = 0; i < v.size(); i++) {
for (int j = 0; j < v[i].size(); j++) {
std::cout << v[i][j];
j == v[i].size() - 1 ? std::cout << '\n' : std::cout << ' ';
}
}
}
void debug() { std::cerr << '\n'; }
template <class H, class... T> void debug(H &&head, T &&...args) {
std::cerr << head;
sizeof...(args) == 0 ? std::cerr << "" : std::cerr << ' ';
debug(std::forward<T>(args)...);
}
template <class T> void debug(std::vector<T> &v) {
for (int i = 0; i < v.size(); i++) {
std::cerr << v[i];
i == v.size() - 1 ? std::cerr << '\n' : std::cerr << ' ';
}
}
template <class T> void debug(std::vector<std::vector<T>> &v) {
for (int i = 0; i < v.size(); i++) {
for (int j = 0; j < v[i].size(); j++) {
std::cerr << v[i][j];
j == v[i].size() - 1 ? std::cerr << '\n' : std::cerr << ' ';
}
}
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N, A, B, C, D;
cin >> N >> A >> B >> C >> D;
A--;
B--;
C--;
D--;
string s;
cin >> s;
auto yes = []() {
print("Yes");
exit(0);
};
auto no = []() {
print("No");
exit(0);
};
FOR(i, 1, N) {
if (s[i - 1] == '#' && s[i] == '#' &&
((A < i - 1 && i < C) || (B < i - 1 && i < D)))
no();
}
if (D < C) {
FOR(i, B, D) {
if (s[i - 1] == '.' && s[i] == '.' && s[i + 1] == '.') {
yes();
}
}
no();
}
yes();
return 0;
} | #include <bits/stdc++.h>
#define SORT(a) sort(a.begin(), a.end())
#define RSORT(a) sort(a.rbegin(), a.rend())
#define REP(i, n) for (int i = 0; i < n; i++)
#define RREP(i, n) for (int i = n - 1; 0 <= i; i--)
#define FOR(i, start, end) for (int i = start; i < end; i++)
#define RFOR(i, start, end) for (int i = start - 1; 0 <= i; i--)
#define ALL(a) a.begin(), a.end()
using ll = long long;
using namespace std;
constexpr int INF32 = 1'050'000'000;
constexpr long long INF64 = 4'000'000'000'000'000'000;
constexpr int MOD7 = 1'000'000'007;
constexpr int MOD9 = 1'000'000'009;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
void print() { std::cout << '\n'; }
template <class H, class... T> void print(H &&head, T &&...args) {
std::cout << head;
sizeof...(args) == 0 ? std::cout << "" : std::cout << ' ';
print(std::forward<T>(args)...);
}
template <class T> void print(std::vector<T> &v) {
for (int i = 0; i < v.size(); i++) {
std::cout << v[i];
i == v.size() - 1 ? std::cout << '\n' : std::cout << ' ';
}
}
template <class T> void print(std::vector<std::vector<T>> &v) {
for (int i = 0; i < v.size(); i++) {
for (int j = 0; j < v[i].size(); j++) {
std::cout << v[i][j];
j == v[i].size() - 1 ? std::cout << '\n' : std::cout << ' ';
}
}
}
void debug() { std::cerr << '\n'; }
template <class H, class... T> void debug(H &&head, T &&...args) {
std::cerr << head;
sizeof...(args) == 0 ? std::cerr << "" : std::cerr << ' ';
debug(std::forward<T>(args)...);
}
template <class T> void debug(std::vector<T> &v) {
for (int i = 0; i < v.size(); i++) {
std::cerr << v[i];
i == v.size() - 1 ? std::cerr << '\n' : std::cerr << ' ';
}
}
template <class T> void debug(std::vector<std::vector<T>> &v) {
for (int i = 0; i < v.size(); i++) {
for (int j = 0; j < v[i].size(); j++) {
std::cerr << v[i][j];
j == v[i].size() - 1 ? std::cerr << '\n' : std::cerr << ' ';
}
}
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N, A, B, C, D;
cin >> N >> A >> B >> C >> D;
A--;
B--;
C--;
D--;
string s;
cin >> s;
auto yes = []() {
print("Yes");
exit(0);
};
auto no = []() {
print("No");
exit(0);
};
FOR(i, 1, N) {
if (s[i - 1] == '#' && s[i] == '#' &&
((A < i - 1 && i < C) || (B < i - 1 && i < D)))
no();
}
if (D < C) {
FOR(i, B, D + 1) {
if (s[i - 1] == '.' && s[i] == '.' && s[i + 1] == '.') {
yes();
}
}
no();
}
yes();
return 0;
} | [
"expression.operation.binary.add"
] | 830,812 | 830,813 | u324303263 | cpp |
p03017 | #include <bits/stdc++.h>
#define SORT(a) sort(a.begin(), a.end())
#define RSORT(a) sort(a.rbegin(), a.rend())
#define REP(i, n) for (int i = 0; i < n; i++)
#define RREP(i, n) for (int i = n - 1; 0 <= i; i--)
#define FOR(i, start, end) for (int i = start; i < end; i++)
#define RFOR(i, start, end) for (int i = start - 1; 0 <= i; i--)
#define ALL(a) a.begin(), a.end()
using ll = long long;
using namespace std;
constexpr int INF32 = 1'050'000'000;
constexpr long long INF64 = 4'000'000'000'000'000'000;
constexpr int MOD7 = 1'000'000'007;
constexpr int MOD9 = 1'000'000'009;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
void print() { std::cout << '\n'; }
template <class H, class... T> void print(H &&head, T &&...args) {
std::cout << head;
sizeof...(args) == 0 ? std::cout << "" : std::cout << ' ';
print(std::forward<T>(args)...);
}
template <class T> void print(std::vector<T> &v) {
for (int i = 0; i < v.size(); i++) {
std::cout << v[i];
i == v.size() - 1 ? std::cout << '\n' : std::cout << ' ';
}
}
template <class T> void print(std::vector<std::vector<T>> &v) {
for (int i = 0; i < v.size(); i++) {
for (int j = 0; j < v[i].size(); j++) {
std::cout << v[i][j];
j == v[i].size() - 1 ? std::cout << '\n' : std::cout << ' ';
}
}
}
void debug() { std::cerr << '\n'; }
template <class H, class... T> void debug(H &&head, T &&...args) {
std::cerr << head;
sizeof...(args) == 0 ? std::cerr << "" : std::cerr << ' ';
debug(std::forward<T>(args)...);
}
template <class T> void debug(std::vector<T> &v) {
for (int i = 0; i < v.size(); i++) {
std::cerr << v[i];
i == v.size() - 1 ? std::cerr << '\n' : std::cerr << ' ';
}
}
template <class T> void debug(std::vector<std::vector<T>> &v) {
for (int i = 0; i < v.size(); i++) {
for (int j = 0; j < v[i].size(); j++) {
std::cerr << v[i][j];
j == v[i].size() - 1 ? std::cerr << '\n' : std::cerr << ' ';
}
}
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N, A, B, C, D;
cin >> N >> A >> B >> C >> D;
A--;
B--;
C--;
D--;
string s;
cin >> s;
auto yes = []() {
print("Yes");
exit(0);
};
auto no = []() {
print("No");
exit(0);
};
FOR(i, 1, N) {
if (s[i - 1] == '#' && s[i] == '#' &&
((A < i && i < C) || (B < i && i < D)))
no();
}
if (D < C) {
FOR(i, B, D) {
if (s[i - 1] == '.' && s[i] == '.' && s[i + 1] == '.') {
yes();
}
}
no();
}
yes();
return 0;
} | #include <bits/stdc++.h>
#define SORT(a) sort(a.begin(), a.end())
#define RSORT(a) sort(a.rbegin(), a.rend())
#define REP(i, n) for (int i = 0; i < n; i++)
#define RREP(i, n) for (int i = n - 1; 0 <= i; i--)
#define FOR(i, start, end) for (int i = start; i < end; i++)
#define RFOR(i, start, end) for (int i = start - 1; 0 <= i; i--)
#define ALL(a) a.begin(), a.end()
using ll = long long;
using namespace std;
constexpr int INF32 = 1'050'000'000;
constexpr long long INF64 = 4'000'000'000'000'000'000;
constexpr int MOD7 = 1'000'000'007;
constexpr int MOD9 = 1'000'000'009;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
void print() { std::cout << '\n'; }
template <class H, class... T> void print(H &&head, T &&...args) {
std::cout << head;
sizeof...(args) == 0 ? std::cout << "" : std::cout << ' ';
print(std::forward<T>(args)...);
}
template <class T> void print(std::vector<T> &v) {
for (int i = 0; i < v.size(); i++) {
std::cout << v[i];
i == v.size() - 1 ? std::cout << '\n' : std::cout << ' ';
}
}
template <class T> void print(std::vector<std::vector<T>> &v) {
for (int i = 0; i < v.size(); i++) {
for (int j = 0; j < v[i].size(); j++) {
std::cout << v[i][j];
j == v[i].size() - 1 ? std::cout << '\n' : std::cout << ' ';
}
}
}
void debug() { std::cerr << '\n'; }
template <class H, class... T> void debug(H &&head, T &&...args) {
std::cerr << head;
sizeof...(args) == 0 ? std::cerr << "" : std::cerr << ' ';
debug(std::forward<T>(args)...);
}
template <class T> void debug(std::vector<T> &v) {
for (int i = 0; i < v.size(); i++) {
std::cerr << v[i];
i == v.size() - 1 ? std::cerr << '\n' : std::cerr << ' ';
}
}
template <class T> void debug(std::vector<std::vector<T>> &v) {
for (int i = 0; i < v.size(); i++) {
for (int j = 0; j < v[i].size(); j++) {
std::cerr << v[i][j];
j == v[i].size() - 1 ? std::cerr << '\n' : std::cerr << ' ';
}
}
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N, A, B, C, D;
cin >> N >> A >> B >> C >> D;
A--;
B--;
C--;
D--;
string s;
cin >> s;
auto yes = []() {
print("Yes");
exit(0);
};
auto no = []() {
print("No");
exit(0);
};
FOR(i, 1, N) {
if (s[i - 1] == '#' && s[i] == '#' &&
((A < i - 1 && i < C) || (B < i - 1 && i < D)))
no();
}
if (D < C) {
FOR(i, B, D + 1) {
if (s[i - 1] == '.' && s[i] == '.' && s[i + 1] == '.') {
yes();
}
}
no();
}
yes();
return 0;
} | [
"control_flow.branch.if.condition.change"
] | 830,814 | 830,813 | u324303263 | cpp |
p03017 | #include <bits/stdc++.h>
#define SORT(a) sort(a.begin(), a.end())
#define RSORT(a) sort(a.rbegin(), a.rend())
#define REP(i, n) for (int i = 0; i < n; i++)
#define RREP(i, n) for (int i = n - 1; 0 <= i; i--)
#define FOR(i, start, end) for (int i = start; i < end; i++)
#define RFOR(i, start, end) for (int i = start - 1; 0 <= i; i--)
#define ALL(a) a.begin(), a.end()
using ll = long long;
using namespace std;
constexpr int INF32 = 1'050'000'000;
constexpr long long INF64 = 4'000'000'000'000'000'000;
constexpr int MOD7 = 1'000'000'007;
constexpr int MOD9 = 1'000'000'009;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
void print() { std::cout << '\n'; }
template <class H, class... T> void print(H &&head, T &&...args) {
std::cout << head;
sizeof...(args) == 0 ? std::cout << "" : std::cout << ' ';
print(std::forward<T>(args)...);
}
template <class T> void print(std::vector<T> &v) {
for (int i = 0; i < v.size(); i++) {
std::cout << v[i];
i == v.size() - 1 ? std::cout << '\n' : std::cout << ' ';
}
}
template <class T> void print(std::vector<std::vector<T>> &v) {
for (int i = 0; i < v.size(); i++) {
for (int j = 0; j < v[i].size(); j++) {
std::cout << v[i][j];
j == v[i].size() - 1 ? std::cout << '\n' : std::cout << ' ';
}
}
}
void debug() { std::cerr << '\n'; }
template <class H, class... T> void debug(H &&head, T &&...args) {
std::cerr << head;
sizeof...(args) == 0 ? std::cerr << "" : std::cerr << ' ';
debug(std::forward<T>(args)...);
}
template <class T> void debug(std::vector<T> &v) {
for (int i = 0; i < v.size(); i++) {
std::cerr << v[i];
i == v.size() - 1 ? std::cerr << '\n' : std::cerr << ' ';
}
}
template <class T> void debug(std::vector<std::vector<T>> &v) {
for (int i = 0; i < v.size(); i++) {
for (int j = 0; j < v[i].size(); j++) {
std::cerr << v[i][j];
j == v[i].size() - 1 ? std::cerr << '\n' : std::cerr << ' ';
}
}
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N, A, B, C, D;
cin >> N >> A >> B >> C >> D;
A--;
B--;
C--;
D--;
string s;
cin >> s;
auto yes = []() {
print("Yes");
exit(0);
};
auto no = []() {
print("No");
exit(0);
};
FOR(i, 1, N) {
if (s[i - 1] == '#' && s[i] == '#' &&
((A < i && i < C) || (B < i && i < D)))
no();
}
if (D < C) {
FOR(i, B, D - 1) {
if (s[i - 1] == '.' && s[i] == '.' && s[i + 1] == '.') {
yes();
}
}
no();
}
yes();
return 0;
} | #include <bits/stdc++.h>
#define SORT(a) sort(a.begin(), a.end())
#define RSORT(a) sort(a.rbegin(), a.rend())
#define REP(i, n) for (int i = 0; i < n; i++)
#define RREP(i, n) for (int i = n - 1; 0 <= i; i--)
#define FOR(i, start, end) for (int i = start; i < end; i++)
#define RFOR(i, start, end) for (int i = start - 1; 0 <= i; i--)
#define ALL(a) a.begin(), a.end()
using ll = long long;
using namespace std;
constexpr int INF32 = 1'050'000'000;
constexpr long long INF64 = 4'000'000'000'000'000'000;
constexpr int MOD7 = 1'000'000'007;
constexpr int MOD9 = 1'000'000'009;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
void print() { std::cout << '\n'; }
template <class H, class... T> void print(H &&head, T &&...args) {
std::cout << head;
sizeof...(args) == 0 ? std::cout << "" : std::cout << ' ';
print(std::forward<T>(args)...);
}
template <class T> void print(std::vector<T> &v) {
for (int i = 0; i < v.size(); i++) {
std::cout << v[i];
i == v.size() - 1 ? std::cout << '\n' : std::cout << ' ';
}
}
template <class T> void print(std::vector<std::vector<T>> &v) {
for (int i = 0; i < v.size(); i++) {
for (int j = 0; j < v[i].size(); j++) {
std::cout << v[i][j];
j == v[i].size() - 1 ? std::cout << '\n' : std::cout << ' ';
}
}
}
void debug() { std::cerr << '\n'; }
template <class H, class... T> void debug(H &&head, T &&...args) {
std::cerr << head;
sizeof...(args) == 0 ? std::cerr << "" : std::cerr << ' ';
debug(std::forward<T>(args)...);
}
template <class T> void debug(std::vector<T> &v) {
for (int i = 0; i < v.size(); i++) {
std::cerr << v[i];
i == v.size() - 1 ? std::cerr << '\n' : std::cerr << ' ';
}
}
template <class T> void debug(std::vector<std::vector<T>> &v) {
for (int i = 0; i < v.size(); i++) {
for (int j = 0; j < v[i].size(); j++) {
std::cerr << v[i][j];
j == v[i].size() - 1 ? std::cerr << '\n' : std::cerr << ' ';
}
}
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N, A, B, C, D;
cin >> N >> A >> B >> C >> D;
A--;
B--;
C--;
D--;
string s;
cin >> s;
auto yes = []() {
print("Yes");
exit(0);
};
auto no = []() {
print("No");
exit(0);
};
FOR(i, 1, N) {
if (s[i - 1] == '#' && s[i] == '#' &&
((A < i - 1 && i < C) || (B < i - 1 && i < D)))
no();
}
if (D < C) {
FOR(i, B, D + 1) {
if (s[i - 1] == '.' && s[i] == '.' && s[i + 1] == '.') {
yes();
}
}
no();
}
yes();
return 0;
} | [
"control_flow.branch.if.condition.change",
"misc.opposites",
"expression.operator.arithmetic.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 830,815 | 830,813 | u324303263 | cpp |
p03017 | #include <bits/stdc++.h>
#define SORT(a) sort(a.begin(), a.end())
#define RSORT(a) sort(a.rbegin(), a.rend())
#define REP(i, n) for (int i = 0; i < n; i++)
#define RREP(i, n) for (int i = n; 0 <= i; i--)
#define FOR(i, start, end) for (int i = start; i < end; i++)
#define RFOR(i, start, end) for (int i = start; end <= i; i--)
#define ALL(a) a.begin(), a.end()
#define MOD(a) a %= 1000000007
using ll = long long;
using namespace std;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N, A, B, C, D;
cin >> N >> A >> B >> C >> D;
string S;
cin >> S;
S = "#" + S + "#";
auto can_reach = [&](int start, int end) {
FOR(i, start, end - 1) {
if (S[i] == '#' && S[i + 1] == '#')
return false;
}
return true;
};
if (!can_reach(A, C) || !can_reach(B, D)) {
std::cout << "No" << '\n';
return 0;
}
if (D < C) {
bool f = false;
FOR(i, B, D) {
if (S[i - 1] == '.' && S[i] == '.' && S[i + 1] == '.') {
f = true;
}
}
if (!f) {
std::cout << "No" << '\n';
return 0;
}
}
std::cout << "Yes" << '\n';
return 0;
}
| #include <bits/stdc++.h>
#define SORT(a) sort(a.begin(), a.end())
#define RSORT(a) sort(a.rbegin(), a.rend())
#define REP(i, n) for (int i = 0; i < n; i++)
#define RREP(i, n) for (int i = n; 0 <= i; i--)
#define FOR(i, start, end) for (int i = start; i < end; i++)
#define RFOR(i, start, end) for (int i = start; end <= i; i--)
#define ALL(a) a.begin(), a.end()
#define MOD(a) a %= 1000000007
using ll = long long;
using namespace std;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N, A, B, C, D;
cin >> N >> A >> B >> C >> D;
string S;
cin >> S;
S = "#" + S + "#";
auto can_reach = [&](int start, int end) {
FOR(i, start, end - 1) {
if (S[i] == '#' && S[i + 1] == '#')
return false;
}
return true;
};
if (!can_reach(A, C) || !can_reach(B, D)) {
std::cout << "No" << '\n';
return 0;
}
if (D < C) {
bool f = false;
FOR(i, B, D + 1) {
if (S[i - 1] == '.' && S[i] == '.' && S[i + 1] == '.') {
f = true;
}
}
if (!f) {
std::cout << "No" << '\n';
return 0;
}
}
std::cout << "Yes" << '\n';
return 0;
}
| [
"expression.operation.binary.add"
] | 830,816 | 830,817 | u324303263 | cpp |
p03017 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define INF 1LL << 62
#define inf 1000000007
int main() {
ll n, a, b, c, d;
cin >> n >> a >> b >> c >> d;
a--;
b--;
c--;
d--;
string s;
cin >> s;
if (c < d) {
if (b < a) {
bool ans = false;
for (int i = a + 2; i <= c; i++) {
if (s[i] == '.' && s[i - 1] == '.' && s[i - 2] == '.') {
ans = true;
break;
}
}
if (ans == false) {
cout << "No" << endl;
return 0;
}
}
}
if (d < c) {
if (a < b) {
bool ans = false;
for (int i = b + 2; i <= d; i++) {
if (s[i] == '.' && s[i - 1] == '.' && s[i - 2] == '.') {
ans = true;
break;
}
}
if (ans == false) {
cout << "No" << endl;
return 0;
}
}
}
ll L = min(a, b), R = max(c, d);
for (int i = L + 1; i <= R; i++) {
if (s[i] == '#' && s[i - 1] == '#') {
cout << "No";
return 0;
}
}
cout << "Yes";
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define INF 1LL << 62
#define inf 1000000007
int main() {
ll n, a, b, c, d;
cin >> n >> a >> b >> c >> d;
a--;
b--;
c--;
d--;
string s;
cin >> s;
if (c < d) {
if (b < a) {
bool ans = false;
for (int i = a + 1; i <= c + 1; i++) {
if (s[i] == '.' && s[i - 1] == '.' && s[i - 2] == '.') {
ans = true;
break;
}
}
if (ans == false) {
cout << "No" << endl;
return 0;
}
}
}
if (d < c) {
if (a < b) {
bool ans = false;
for (int i = b + 1; i <= d + 1; i++) {
if (s[i] == '.' && s[i - 1] == '.' && s[i - 2] == '.') {
ans = true;
break;
}
}
if (ans == false) {
cout << "No" << endl;
return 0;
}
}
}
ll L = min(a, b), R = max(c, d);
for (int i = L + 1; i <= R; i++) {
if (s[i] == '#' && s[i - 1] == '#') {
cout << "No";
return 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",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 830,818 | 830,819 | u166378830 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.