problem_id stringlengths 6 6 | buggy_code stringlengths 8 526k ⌀ | fixed_code stringlengths 12 526k ⌀ | labels listlengths 0 15 ⌀ | buggy_submission_id int64 1 1.54M ⌀ | fixed_submission_id int64 2 1.54M ⌀ | user_id stringlengths 10 10 ⌀ | language stringclasses 9 values |
|---|---|---|---|---|---|---|---|
p03017 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define ll long long int
#define INF 1000000007
#define llINF 1000000000000000007
#define v(i) vector<i>
#define vv(i) vector<vector<i>>
// cin.eof() 入力個数の問題
// int num = atoi(string.c_str()); 文字列の整数変換
int keta(ll n) {
int ans = 0;
while (n > 0) {
n /= 10;
ans++;
}
return ans;
}
ll _pow(ll a, ll b) {
ll ans = 1;
rep(i, b) { ans *= a; }
return ans;
}
int main() {
int n, a, b, c, d;
cin >> n >> a >> b >> c >> d;
string s;
cin >> s;
bool flag = false;
int count = 0;
// if(s[0] == '.')count++;
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;
}
}
for (int i = b; i < d; i++) {
if (s[i] == '.') {
count++;
} else {
count = 0;
}
if (count == 3) {
flag = true;
}
}
if (c < d) {
cout << "Yes" << endl;
return false;
} else {
if (flag) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define ll long long int
#define INF 1000000007
#define llINF 1000000000000000007
#define v(i) vector<i>
#define vv(i) vector<vector<i>>
// cin.eof() 入力個数の問題
// int num = atoi(string.c_str()); 文字列の整数変換
int keta(ll n) {
int ans = 0;
while (n > 0) {
n /= 10;
ans++;
}
return ans;
}
ll _pow(ll a, ll b) {
ll ans = 1;
rep(i, b) { ans *= a; }
return ans;
}
int main() {
int n, a, b, c, d;
cin >> n >> a >> b >> c >> d;
string s;
cin >> s;
bool flag = false;
int count = 0;
// if(s[0] == '.')count++;
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;
}
}
for (int i = b - 2; i <= d; i++) {
if (s[i] == '.') {
count++;
} else {
count = 0;
}
if (count == 3) {
flag = true;
}
}
if (c < d) {
cout << "Yes" << endl;
return false;
} else {
if (flag) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
}
return 0;
}
| [
"control_flow.loop.for.initializer.change",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 839,424 | 839,423 | u776439373 | cpp |
p03017 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define ll long long int
#define INF 1000000007
#define llINF 1000000000000000007
#define v(i) vector<i>
#define vv(i) vector<vector<i>>
// cin.eof() 入力個数の問題
// int num = atoi(string.c_str()); 文字列の整数変換
int keta(ll n) {
int ans = 0;
while (n > 0) {
n /= 10;
ans++;
}
return ans;
}
ll _pow(ll a, ll b) {
ll ans = 1;
rep(i, b) { ans *= a; }
return ans;
}
int main() {
int n, a, b, c, d;
cin >> n >> a >> b >> c >> d;
string s;
cin >> s;
bool flag = false;
int count = 0;
// if(s[0] == '.')count++;
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;
}
}
for (int i = b - 1; i < d; i++) {
if (s[i] == '.') {
count++;
} else {
count = 0;
}
if (count == 3) {
flag = true;
}
}
if (c < d) {
cout << "Yes" << endl;
return false;
} else {
if (flag) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define ll long long int
#define INF 1000000007
#define llINF 1000000000000000007
#define v(i) vector<i>
#define vv(i) vector<vector<i>>
// cin.eof() 入力個数の問題
// int num = atoi(string.c_str()); 文字列の整数変換
int keta(ll n) {
int ans = 0;
while (n > 0) {
n /= 10;
ans++;
}
return ans;
}
ll _pow(ll a, ll b) {
ll ans = 1;
rep(i, b) { ans *= a; }
return ans;
}
int main() {
int n, a, b, c, d;
cin >> n >> a >> b >> c >> d;
string s;
cin >> s;
bool flag = false;
int count = 0;
// if(s[0] == '.')count++;
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;
}
}
for (int i = b - 2; i <= d; i++) {
if (s[i] == '.') {
count++;
} else {
count = 0;
}
if (count == 3) {
flag = true;
}
}
if (c < d) {
cout << "Yes" << endl;
return false;
} else {
if (flag) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
}
return 0;
}
| [
"literal.number.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"expression.operation.binary.change",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change"
] | 839,425 | 839,423 | u776439373 | cpp |
p03017 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int n, a, b, c, d;
string s;
cin >> n >> a >> b >> c >> d >> s;
--a;
--b;
--c;
--d;
bool sunuke = true;
bool funuke = true;
for (int i = a; i < c; ++i)
if (s[i] == '#' && s[i + 1] == '#')
sunuke = false;
for (int i = b; i < d; ++i)
if (s[i] == '#' && s[i + 1] == '#')
funuke = false;
bool poss;
if (c == d)
poss = false;
else if (c < d) {
if (sunuke && funuke)
poss = true;
else
poss = false;
} else {
bool skip = false;
for (int i = b; i <= c; ++i)
if (s[i - 1] == '.' && s[i] == '.' && s[i + 1] == '.')
skip = true;
if (sunuke && funuke && skip)
poss = true;
else
poss = false;
}
if (poss)
cout << "Yes" << endl;
else
cout << "No" << endl;
return 0;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int n, a, b, c, d;
string s;
cin >> n >> a >> b >> c >> d >> s;
--a;
--b;
--c;
--d;
bool sunuke = true;
bool funuke = true;
for (int i = a; i < c; ++i)
if (s[i] == '#' && s[i + 1] == '#')
sunuke = false;
for (int i = b; i < d; ++i)
if (s[i] == '#' && s[i + 1] == '#')
funuke = false;
bool poss;
if (c == d)
poss = false;
else if (c < d) {
if (sunuke && funuke)
poss = true;
else
poss = false;
} else {
bool skip = false;
for (int i = b; i <= d; ++i)
if (s[i - 1] == '.' && s[i] == '.' && s[i + 1] == '.')
skip = true;
if (sunuke && funuke && skip)
poss = true;
else
poss = false;
}
if (poss)
cout << "Yes" << endl;
else
cout << "No" << endl;
return 0;
} | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 839,448 | 839,449 | u714642046 | cpp |
p03017 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <queue>
#include <set>
#include <tuple>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
ll inf = 1000000007;
int main() {
int n, a, b, c, d;
cin >> n >> a >> b >> c >> d;
string s;
cin >> s;
int su = a - 1;
int hu = b - 1;
while (1) {
if (hu == d - 1) {
break;
}
hu++;
if (s[hu] == '#') {
hu++;
if (s[hu] == '#') {
cout << "No" << endl;
return 0;
}
}
}
while (1) {
if (su == c - 1) {
break;
}
su++;
if (s[su] == '#') {
su++;
if (s[su] == '#') {
cout << "No" << endl;
return 0;
}
}
}
if (su < hu) {
cout << "Yes" << endl;
return 0;
} 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 <algorithm>
#include <bitset>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <queue>
#include <set>
#include <tuple>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
ll inf = 1000000007;
int main() {
int n, a, b, c, d;
cin >> n >> a >> b >> c >> d;
string s;
cin >> s;
int su = a - 1;
int hu = b - 1;
while (1) {
if (hu == d - 1) {
break;
}
hu++;
if (s[hu] == '#') {
hu++;
if (s[hu] == '#') {
cout << "No" << endl;
return 0;
}
}
}
while (1) {
if (su == c - 1) {
break;
}
su++;
if (s[su] == '#') {
su++;
if (s[su] == '#') {
cout << "No" << endl;
return 0;
}
}
}
if (su < hu) {
cout << "Yes" << endl;
return 0;
} 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"
] | 839,458 | 839,456 | u077051605 | cpp |
p03017 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <queue>
#include <set>
#include <tuple>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
ll inf = 1000000007;
int main() {
int n, a, b, c, d;
cin >> n >> a >> b >> c >> d;
string s;
cin >> s;
int su = a - 1;
int hu = b - 1;
while (1) {
if (hu == d - 1) {
break;
}
hu++;
if (s[hu] == '#') {
hu++;
if (s[hu] == '#') {
cout << "No" << endl;
return 0;
}
}
}
while (1) {
if (su == c - 1) {
break;
}
su++;
if (s[su] == '#') {
su++;
if (s[su] == '#') {
cout << "No" << endl;
return 0;
}
}
}
if (su < hu) {
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;
} | #include <algorithm>
#include <bitset>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <queue>
#include <set>
#include <tuple>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
ll inf = 1000000007;
int main() {
int n, a, b, c, d;
cin >> n >> a >> b >> c >> d;
string s;
cin >> s;
int su = a - 1;
int hu = b - 1;
while (1) {
if (hu == d - 1) {
break;
}
hu++;
if (s[hu] == '#') {
hu++;
if (s[hu] == '#') {
cout << "No" << endl;
return 0;
}
}
}
while (1) {
if (su == c - 1) {
break;
}
su++;
if (s[su] == '#') {
su++;
if (s[su] == '#') {
cout << "No" << endl;
return 0;
}
}
}
if (su < hu) {
cout << "Yes" << endl;
return 0;
} 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",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 839,459 | 839,456 | u077051605 | cpp |
p03017 | #include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define repi(i, a, b) for (int i = int(a); i < int(b); ++i)
#define all(x) (x).begin(), (x).end()
#define PI 3.14159265358979323846264338327950L
using namespace std;
typedef long long ll;
typedef long double ld;
int main() {
int n, a, b, c, d;
string s;
cin >> n >> a >> b >> c >> d;
cin >> s;
bool cnt1 = false, cnt2 = false;
repi(i, a - 1, c) if (s[i] == '#' && s[i] == s[i + 1]) cnt1 = true;
repi(i, b - 1, d) if (s[i] == '#' && s[i] == s[i + 1]) cnt1 = true;
if (c < d) {
if (!cnt1)
cout << "Yes";
else
cout << "No";
} else {
repi(i, b - 1, d) if (s[i] == '.' && s[i] == s[i + 1] &&
s[i + 1] == s[i + 2]) cnt2 = true;
if ((!cnt1) && cnt2)
cout << "Yes";
else
cout << "No";
}
} | #include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define repi(i, a, b) for (int i = int(a); i < int(b); ++i)
#define all(x) (x).begin(), (x).end()
#define PI 3.14159265358979323846264338327950L
using namespace std;
typedef long long ll;
typedef long double ld;
int main() {
int n, a, b, c, d;
string s;
cin >> n >> a >> b >> c >> d;
cin >> s;
bool cnt1 = false, cnt2 = false;
repi(i, a - 1, c) if (s[i] == '#' && s[i] == s[i + 1]) cnt1 = true;
repi(i, b - 1, d) if (s[i] == '#' && s[i] == s[i + 1]) cnt1 = true;
if (c < d) {
if (!cnt1)
cout << "Yes";
else
cout << "No";
} else {
repi(i, b - 1, d) if (s[i - 1] == '.' && s[i] == s[i - 1] &&
s[i + 1] == s[i]) cnt2 = true;
if ((!cnt1) && cnt2)
cout << "Yes";
else
cout << "No";
}
} | [
"control_flow.branch.if.condition.change",
"misc.opposites",
"expression.operator.arithmetic.change",
"variable_access.subscript.index.change",
"expression.operation.binary.remove"
] | 839,466 | 839,467 | u151236434 | cpp |
p03017 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using vl = vector<ll>;
using vll = vector<vl>;
using Pll = pair<ll, ll>;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define all(v) v.begin(), v.end()
#define sz(x) ((int)x.size())
#define pb push_back
#define mp make_pair
#define mt make_tuple
#define F first
#define S second
const int MOD = 1e9 + 7;
const ll INF = 2e15;
template <class T> void print(const T &t) { cout << t << endl; }
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;
}
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
int main() {
ll n, a, b, c, d;
cin >> n >> a >> b >> c >> d;
string s;
cin >> s;
s.insert(0, ".");
bool OK = true;
for (ll i = a; i < c; i++) {
if (s[i] == '#' && s[i + 1] == '#') {
OK = false;
}
}
for (ll i = b; i < d; i++) {
if (s[i] == '#' && s[i + 1] == '#') {
OK = false;
}
}
if (c > d) {
bool z = false;
for (ll i = b - 1; i < d - 1; i++) {
if (s[i] == '.' && s[i + 1] == '.' && s[i + 2] == '.') {
z = true;
}
}
if (!z) {
OK = false;
}
}
cout << (OK ? "Yes" : "No") << endl;
}
| #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using vl = vector<ll>;
using vll = vector<vl>;
using Pll = pair<ll, ll>;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define all(v) v.begin(), v.end()
#define sz(x) ((int)x.size())
#define pb push_back
#define mp make_pair
#define mt make_tuple
#define F first
#define S second
const int MOD = 1e9 + 7;
const ll INF = 2e15;
template <class T> void print(const T &t) { cout << t << endl; }
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;
}
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
int main() {
ll n, a, b, c, d;
cin >> n >> a >> b >> c >> d;
string s;
cin >> s;
s.insert(0, ".");
bool OK = true;
for (ll i = a; i < c; i++) {
if (s[i] == '#' && s[i + 1] == '#') {
OK = false;
}
}
for (ll i = b; i < d; i++) {
if (s[i] == '#' && s[i + 1] == '#') {
OK = false;
}
}
if (c > d) {
bool z = false;
for (ll i = b - 1; i < d; i++) {
if (s[i] == '.' && s[i + 1] == '.' && s[i + 2] == '.') {
z = true;
}
}
if (!z) {
OK = false;
}
}
cout << (OK ? "Yes" : "No") << endl;
}
| [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 839,473 | 839,474 | u201304522 | cpp |
p03017 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using vl = vector<ll>;
using vll = vector<vl>;
using Pll = pair<ll, ll>;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define all(v) v.begin(), v.end()
#define sz(x) ((int)x.size())
#define pb push_back
#define mp make_pair
#define mt make_tuple
#define F first
#define S second
const int MOD = 1e9 + 7;
const ll INF = 2e15;
template <class T> void print(const T &t) { cout << t << endl; }
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;
}
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
int main() {
ll n, a, b, c, d;
cin >> n >> a >> b >> c >> d;
string s;
cin >> s;
s.insert(0, ".");
bool OK = true;
for (ll i = a; i < c; i++) {
if (s[i] == '#' && s[i + 1] == '#') {
OK = false;
}
}
for (ll i = b; i < d; i++) {
if (s[i] == '#' && s[i + 1] == '#') {
OK = false;
}
}
if (c > d) {
bool z = false;
for (ll i = b; i < d - 1; i++) {
if (s[i] == '.' && s[i + 1] == '.' && s[i + 2] == '.') {
z = true;
}
}
if (!z) {
OK = false;
}
}
cout << (OK ? "Yes" : "No") << endl;
}
| #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using vl = vector<ll>;
using vll = vector<vl>;
using Pll = pair<ll, ll>;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define all(v) v.begin(), v.end()
#define sz(x) ((int)x.size())
#define pb push_back
#define mp make_pair
#define mt make_tuple
#define F first
#define S second
const int MOD = 1e9 + 7;
const ll INF = 2e15;
template <class T> void print(const T &t) { cout << t << endl; }
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;
}
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
int main() {
ll n, a, b, c, d;
cin >> n >> a >> b >> c >> d;
string s;
cin >> s;
s.insert(0, ".");
bool OK = true;
for (ll i = a; i < c; i++) {
if (s[i] == '#' && s[i + 1] == '#') {
OK = false;
}
}
for (ll i = b; i < d; i++) {
if (s[i] == '#' && s[i + 1] == '#') {
OK = false;
}
}
if (c > d) {
bool z = false;
for (ll i = b - 1; i < d; i++) {
if (s[i] == '.' && s[i + 1] == '.' && s[i + 2] == '.') {
z = true;
}
}
if (!z) {
OK = false;
}
}
cout << (OK ? "Yes" : "No") << endl;
}
| [
"control_flow.loop.for.initializer.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 839,475 | 839,474 | u201304522 | cpp |
p03017 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, a, b, c, d, ans = 0;
cin >> n >> a >> b >> c >> d;
string t;
cin >> t;
string s = '#' + t + '#';
if (c > d) {
for (int i = b; i <= d; i++) {
if (s[i] == '.' && s[i + 1] == '.' && s[i + 2] == '.')
ans++;
}
if (ans == 0) {
cout << "No";
return 0;
}
}
for (int i = b; i < d; i++) {
if (s[i] == '#' && s[i + 1] == '#') {
cout << "No";
return 0;
}
}
for (int i = a; i < c; i++) {
if (s[i] == '#' && s[i + 1] == '#') {
cout << "No";
return 0;
}
}
cout << "Yes";
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, a, b, c, d, ans = 0;
cin >> n >> a >> b >> c >> d;
string t;
cin >> t;
string s = '#' + t + '#';
if (c > d) {
for (int i = b; i <= d; i++) {
if (s[i - 1] == '.' && s[i + 1] == '.' && s[i] == '.')
ans++;
}
if (ans == 0) {
cout << "No";
return 0;
}
}
for (int i = b; i < d; i++) {
if (s[i] == '#' && s[i + 1] == '#') {
cout << "No";
return 0;
}
}
for (int i = a; i < c; i++) {
if (s[i] == '#' && s[i + 1] == '#') {
cout << "No";
return 0;
}
}
cout << "Yes";
} | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one",
"expression.operation.binary.remove"
] | 839,485 | 839,486 | u713574885 | cpp |
p03017 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, a, b, c, d, ans = 0;
cin >> n >> a >> b >> c >> d;
string t;
cin >> t;
string s = '#' + t + '#';
if (c > d) {
for (int i = b - 1; i <= d; i++) {
if (s[i] == '.' && s[i + 1] == '.' && s[i + 2] == '.')
ans++;
}
if (ans == 0) {
cout << "No";
return 0;
}
}
for (int i = b; i < d; i++) {
if (s[i] == '#' && s[i + 1] == '#') {
cout << "No";
return 0;
}
}
for (int i = a; i < c; i++) {
if (s[i] == '#' && s[i + 1] == '#') {
cout << "No";
return 0;
}
}
cout << "Yes";
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, a, b, c, d, ans = 0;
cin >> n >> a >> b >> c >> d;
string t;
cin >> t;
string s = '#' + t + '#';
if (c > d) {
for (int i = b; i <= d; i++) {
if (s[i - 1] == '.' && s[i + 1] == '.' && s[i] == '.')
ans++;
}
if (ans == 0) {
cout << "No";
return 0;
}
}
for (int i = b; i < d; i++) {
if (s[i] == '#' && s[i + 1] == '#') {
cout << "No";
return 0;
}
}
for (int i = a; i < c; i++) {
if (s[i] == '#' && s[i + 1] == '#') {
cout << "No";
return 0;
}
}
cout << "Yes";
} | [
"control_flow.loop.for.initializer.change",
"expression.operation.binary.remove",
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 839,487 | 839,486 | u713574885 | cpp |
p03017 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define irep(i, n) for (int i = (n); i >= 0; i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
const int INF = 1 << 30;
int main() {
int n, a, b, c, d;
string s;
cin >> n >> a >> b >> c >> d >> s;
bool sunuke = true, funuke = true;
a--;
b--;
c--;
d--;
for (int i = a; i < c; i++)
if (s[i] == '#' && s[i + 1] == '#')
sunuke = false;
for (int i = b; i < d; i++)
if (s[i] == '#' && s[i + 1] == '#')
funuke = false;
bool can = sunuke && funuke;
if (!can) {
cout << "No" << endl;
return 0;
}
if (c < d) {
cout << "Yes" << endl;
} else {
can = false;
for (int i = b + 1; i < d; i++) {
if ((s[i] == s[i - 1] && s[i] == s[i + 1] && s[i] == '.')) {
can = true;
}
}
if (can)
cout << "Yes" << endl;
else
cout << "No" << endl;
}
return 0;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define irep(i, n) for (int i = (n); i >= 0; i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
const int INF = 1 << 30;
int main() {
int n, a, b, c, d;
string s;
cin >> n >> a >> b >> c >> d >> s;
bool sunuke = true, funuke = true;
a--;
b--;
c--;
d--;
for (int i = a; i < c; i++)
if (s[i] == '#' && s[i + 1] == '#')
sunuke = false;
for (int i = b; i < d; i++)
if (s[i] == '#' && s[i + 1] == '#')
funuke = false;
bool can = sunuke && funuke;
if (!can) {
cout << "No" << endl;
return 0;
}
if (c < d) {
cout << "Yes" << endl;
} else {
can = false;
for (int i = b; i <= d; i++) {
if ((s[i] == s[i - 1] && s[i] == s[i + 1] && s[i] == '.')) {
can = true;
}
}
if (can)
cout << "Yes" << endl;
else
cout << "No" << endl;
}
return 0;
} | [
"control_flow.loop.for.initializer.change",
"expression.operation.binary.remove",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 839,488 | 839,489 | u309168663 | cpp |
p03017 | #include <bits/stdc++.h>
#include <float.h>
#include <math.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rrep(i, n) for (int i = 0; i <= (n); i++)
using namespace std;
typedef long long ll;
const ll INF = 1LL << 62;
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;
}
// 多次元 vector 生成
template <class T> vector<T> make_vec(size_t a) { return vector<T>(a); }
template <class T, class... Ts> auto make_vec(size_t a, Ts... ts) {
return vector<decltype(make_vec<T>(ts...))>(a, make_vec<T>(ts...));
}
const int MOD = 1000000007;
int main() {
int N, A, B, C, D;
cin >> N >> A >> B >> C >> D;
string S;
cin >> S;
bool isOK = true;
for (int i = A - 1; i < C - 1; i++) {
if (S[i] == '#' && S[i + 1] == '#') {
isOK = false;
}
}
for (int i = A - 1; i < C - 1; i++) {
if (S[i] == '#' && S[i + 1] == '#') {
isOK = false;
}
}
if (D < C) {
bool isNG = true;
for (int i = B - 1; i < D - 1; i++) {
if (S[i - 1] == '.' && S[i] == '.' && S[i + 1] == '.') {
isNG = false;
}
}
if (isNG)
isOK = false;
}
if (isOK)
cout << "Yes" << endl;
else
cout << "No" << endl;
} | #include <bits/stdc++.h>
#include <float.h>
#include <math.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rrep(i, n) for (int i = 0; i <= (n); i++)
using namespace std;
typedef long long ll;
const ll INF = 1LL << 62;
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;
}
// 多次元 vector 生成
template <class T> vector<T> make_vec(size_t a) { return vector<T>(a); }
template <class T, class... Ts> auto make_vec(size_t a, Ts... ts) {
return vector<decltype(make_vec<T>(ts...))>(a, make_vec<T>(ts...));
}
const int MOD = 1000000007;
int main() {
int N, A, B, C, D;
cin >> N >> A >> B >> C >> D;
string S;
cin >> S;
bool isOK = true;
for (int i = A - 1; i < C - 1; i++) {
if (S[i] == '#' && S[i + 1] == '#') {
isOK = false;
}
}
for (int i = B - 1; i < D - 1; i++) {
if (S[i] == '#' && S[i + 1] == '#') {
isOK = false;
}
}
if (D < C) {
bool isNG = true;
for (int i = B - 1; i < D; i++) {
if (S[i - 1] == '.' && S[i] == '.' && S[i + 1] == '.') {
isNG = false;
}
}
if (isNG)
isOK = false;
}
if (isOK)
cout << "Yes" << endl;
else
cout << "No" << endl;
} | [
"identifier.change",
"control_flow.loop.for.initializer.change",
"expression.operation.binary.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 839,494 | 839,493 | u622045059 | cpp |
p03017 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define REP(i, m, n) for (ll i = (ll)(m); i < (ll)(n); i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int n, a, b, c, d;
cin >> n >> a >> b >> c >> d;
a--;
b--;
c--;
d--;
string s;
cin >> s;
string ans = "Yes";
bool space = false;
for (int i = a; i <= max(c, d); i++) {
if (a < i && i <= c) {
if (s[i] == '#' && s[i + 1] == '#') {
ans = "No";
break;
}
}
if (b < i && i <= d) {
if (s[i] == '#' && s[i + 1] == '#') {
ans = "No";
break;
}
if (s[i] == '.' && s[i - 1] == '.' && s[i + 1] == '.')
space = true;
}
}
if (c > d && !space)
ans = "No";
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define REP(i, m, n) for (ll i = (ll)(m); i < (ll)(n); i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int n, a, b, c, d;
cin >> n >> a >> b >> c >> d;
a--;
b--;
c--;
d--;
string s;
cin >> s;
string ans = "Yes";
bool space = false;
for (int i = a; i <= max(c, d); i++) {
if (a < i && i <= c) {
if (s[i] == '#' && s[i + 1] == '#') {
ans = "No";
break;
}
}
if (b <= i && i <= d) {
if (s[i] == '#' && s[i + 1] == '#') {
ans = "No";
break;
}
if (s[i] == '.' && s[i - 1] == '.' && s[i + 1] == '.')
space = true;
}
}
if (c > d && !space)
ans = "No";
cout << ans << endl;
return 0;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 839,507 | 839,508 | u487530783 | cpp |
p03017 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int n, a, b, c, d;
cin >> n >> a >> b >> c >> d;
string s;
cin >> s;
s = '#' + s + '#';
bool tri = false;
for (int i = a; i <= c; i++) {
if (s[i] == '#') {
if (s[i + 1] == '#') {
cout << "No" << endl;
return 0;
}
}
}
for (int i = b; i <= d; i++) {
if (s[i] == '#') {
if (s[i + 1] == '#') {
cout << "No" << endl;
return 0;
}
} else {
if (s[i + 1] == '.' && s[i + 2] == '.')
tri = true;
}
}
if (c < d) {
cout << "Yes" << endl;
return 0;
} else if (tri) {
cout << "Yes" << endl;
return 0;
} else
cout << "No" << endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int n, a, b, c, d;
cin >> n >> a >> b >> c >> d;
string s;
cin >> s;
s = '#' + s + '#';
bool tri = false;
for (int i = a; i <= c; i++) {
if (s[i] == '#') {
if (s[i + 1] == '#') {
cout << "No" << endl;
return 0;
}
}
}
for (int i = b; i <= d; i++) {
if (s[i] == '#') {
if (s[i + 1] == '#') {
cout << "No" << endl;
return 0;
}
} else {
if (s[i - 1] == '.' && s[i + 1] == '.')
tri = true;
}
}
if (c < d) {
cout << "Yes" << endl;
return 0;
} else if (tri) {
cout << "Yes" << endl;
return 0;
} else
cout << "No" << endl;
} | [
"misc.opposites",
"expression.operator.arithmetic.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change",
"literal.number.change"
] | 839,509 | 839,510 | u732578115 | cpp |
p03017 | #include <bits/stdc++.h>
#include <iostream>
#include <math.h>
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() {
int N, A, B, C, D;
cin >> N >> A >> B >> C >> D;
string S;
cin >> S;
bool ikeru = true;
for (int i = A - 1; i < C - 1; i++) {
if (S[i] == '#') {
continue;
}
if (S[i + 1] == '#' && S[i + 2] == '#') {
ikeru = false;
break;
}
}
for (int i = B - 1; i < D - 1; i++) {
if (S[i] == '#') {
continue;
}
if (S[i + 1] == '#' && S[i + 2] == '#') {
ikeru = false;
break;
}
}
if (C > D) {
bool murikamo = true;
for (int i = B - 1; i < D - 1; i++) {
if (S[i] == '#') {
continue;
}
if (S[i - 1] != '#' && S[i + 1] != '#') {
murikamo = false;
break;
}
}
if (murikamo) {
ikeru = false;
}
}
if (ikeru) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
return 0;
} | #include <bits/stdc++.h>
#include <iostream>
#include <math.h>
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() {
int N, A, B, C, D;
cin >> N >> A >> B >> C >> D;
string S;
cin >> S;
bool ikeru = true;
for (int i = A - 1; i < C - 1; i++) {
if (S[i] == '#') {
continue;
}
if (S[i + 1] == '#' && S[i + 2] == '#') {
ikeru = false;
break;
}
}
for (int i = B - 1; i < D - 1; i++) {
if (S[i] == '#') {
continue;
}
if (S[i + 1] == '#' && S[i + 2] == '#') {
ikeru = false;
break;
}
}
if (C > D) {
bool murikamo = true;
for (int i = B - 1; i < D; i++) {
if (S[i] == '#') {
continue;
}
if (S[i - 1] != '#' && S[i + 1] != '#') {
murikamo = false;
break;
}
}
if (murikamo) {
ikeru = false;
}
}
if (ikeru) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
return 0;
} | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 839,511 | 839,512 | u651314218 | cpp |
p03017 | #include <bits/stdc++.h>
#include <iostream>
#include <math.h>
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() {
int N, A, B, C, D;
cin >> N >> A >> B >> C >> D;
string S;
cin >> S;
bool ikeru = true;
for (int i = A - 1; i < C; i++) {
if (S[i] == '#') {
continue;
}
if (S[i + 1] == '#' && S[i + 2] == '#') {
ikeru = false;
break;
}
}
for (int i = B - 1; i < D; i++) {
if (S[i] == '#') {
continue;
}
if (S[i + 1] == '#' && S[i + 2] == '#') {
ikeru = false;
break;
}
}
if (C > D) {
bool murikamo = true;
for (int i = B - 1; i < D - 1; i++) {
if (S[i] == '#') {
continue;
}
if (S[i - 1] != '#' && S[i + 1] != '#') {
murikamo = false;
break;
}
}
if (murikamo) {
ikeru = false;
}
}
if (ikeru) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
return 0;
} | #include <bits/stdc++.h>
#include <iostream>
#include <math.h>
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() {
int N, A, B, C, D;
cin >> N >> A >> B >> C >> D;
string S;
cin >> S;
bool ikeru = true;
for (int i = A - 1; i < C - 1; i++) {
if (S[i] == '#') {
continue;
}
if (S[i + 1] == '#' && S[i + 2] == '#') {
ikeru = false;
break;
}
}
for (int i = B - 1; i < D - 1; i++) {
if (S[i] == '#') {
continue;
}
if (S[i + 1] == '#' && S[i + 2] == '#') {
ikeru = false;
break;
}
}
if (C > D) {
bool murikamo = true;
for (int i = B - 1; i < D; i++) {
if (S[i] == '#') {
continue;
}
if (S[i - 1] != '#' && S[i + 1] != '#') {
murikamo = false;
break;
}
}
if (murikamo) {
ikeru = false;
}
}
if (ikeru) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
return 0;
} | [
"control_flow.loop.for.condition.change",
"misc.off_by_one",
"expression.operation.binary.remove"
] | 839,513 | 839,512 | u651314218 | cpp |
p03017 | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <string>
#include <vector>
#define repl(i, l, r) for (ll i = l; i < r; i++)
#define rep(i, n) repl(i, 0, n)
using namespace std;
using ll = long long;
int main() {
ll N, A, B, C, D;
cin >> N >> A >> B >> C >> D;
string S;
cin >> S;
S = '#' + S + '#';
bool ans = true;
repl(i, A, C) {
if (S[i] == '#' && S[i + 1] == '#') {
ans = false;
}
}
repl(i, B, D) {
if (S[i] == '#' && S[i + 1] == '#') {
ans = false;
}
}
if (A < B && C > D) {
ans = false;
repl(i, B - 1, D - 1) {
if (S[i] == '.' && S[i + 1] == '.' && S[i + 2] == '.') {
ans = true;
}
}
}
if (ans) {
cout << "Yes";
} else {
cout << "No";
}
return 0;
} | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <string>
#include <vector>
#define repl(i, l, r) for (ll i = l; i < r; i++)
#define rep(i, n) repl(i, 0, n)
using namespace std;
using ll = long long;
int main() {
ll N, A, B, C, D;
cin >> N >> A >> B >> C >> D;
string S;
cin >> S;
S = '#' + S + '#';
bool ans = true;
repl(i, A, C) {
if (S[i] == '#' && S[i + 1] == '#') {
ans = false;
}
}
repl(i, B, D) {
if (S[i] == '#' && S[i + 1] == '#') {
ans = false;
}
}
if (A < B && C > D) {
ans = false;
repl(i, B - 1, D) {
if (S[i] == '.' && S[i + 1] == '.' && S[i + 2] == '.') {
ans = true;
}
}
}
if (ans) {
cout << "Yes";
} else {
cout << "No";
}
return 0;
} | [
"expression.operation.binary.remove"
] | 839,514 | 839,515 | u401139594 | cpp |
p03017 | #include <algorithm>
#include <cmath>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <vector>
#define reps(i, s, n) for (int(i) = (s); (i) < (n); (i)++)
#define rep(i, n) reps(i, 0, n)
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using vi = vector<int>;
using vl = vector<ll>;
int main() {
ll n, a, b, c, d;
cin >> n >> a >> b >> c >> d;
string s;
cin >> s;
s = "#" + s + "#";
reps(i, a, c) {
if (s[i] == '#' && s[i + 1] == '#') {
cout << "No" << endl;
return 0;
}
}
reps(i, b, d) {
if (s[i] == '#' && s[i + 1] == '#') {
cout << "No" << endl;
return 0;
}
}
if (c < d) {
cout << "Yes" << endl;
return 0;
} else {
reps(i, b, d + 1) {
if (s[i - 1] == '.' && s[i] == '.' && s[i + 1] == '.') {
cout << "Yes" << endl;
return 0;
}
}
}
cout << "Yes" << endl;
return 0;
}
| #include <algorithm>
#include <cmath>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <vector>
#define reps(i, s, n) for (int(i) = (s); (i) < (n); (i)++)
#define rep(i, n) reps(i, 0, n)
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using vi = vector<int>;
using vl = vector<ll>;
int main() {
ll n, a, b, c, d;
cin >> n >> a >> b >> c >> d;
string s;
cin >> s;
s = "#" + s + "#";
reps(i, a, c) {
if (s[i] == '#' && s[i + 1] == '#') {
cout << "No" << endl;
return 0;
}
}
reps(i, b, d) {
if (s[i] == '#' && s[i + 1] == '#') {
cout << "No" << endl;
return 0;
}
}
if (c < d) {
cout << "Yes" << endl;
return 0;
} else {
reps(i, b, d + 1) {
if (s[i - 1] == '.' && s[i] == '.' && s[i + 1] == '.') {
cout << "Yes" << endl;
return 0;
}
}
}
cout << "No" << endl;
return 0;
}
| [
"literal.string.change",
"io.output.change"
] | 839,527 | 839,528 | u704411633 | cpp |
p03017 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define VI vector<int>
#define VL vector<ll>
#define PII pair<int, int>
#define VII vector<PII>
#define mp make_pair
#define pb push_back
#define PI acos(-1)
#define ld long double
#define FOR(i, a, b) for (int i = a; i < b; ++i)
const ll inf = 1e18;
const int MxN = 200000;
int n, a, b, c, d;
string s;
bool dfs(int p1, int dest) {
for (int i = p1; i < dest; ++i) {
if (s[i] == '#' && s[i + 1] == '#')
return false;
}
return true;
}
void solve() {
cin >> n >> a >> b >> c >> d;
a--;
b--;
c--;
d--;
// string s ;
cin >> s;
bool ans = dfs(a, c) && dfs(b, d);
if (c < d) {
cout << (ans ? "Yes" : "No");
} else {
bool ok = false;
int cnt = 0;
for (int i = b + 1; i < min(d - 1, n - 1); ++i) {
if (s[i - 1] == '.' && s[i] == '.' && s[i + 1] == '.') {
ok = true;
break;
}
}
if (ok)
cout << (ans ? "Yes" : "No");
else
cout << "No";
}
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int t = 1;
// cin >> t ;
while (t--)
solve();
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define VI vector<int>
#define VL vector<ll>
#define PII pair<int, int>
#define VII vector<PII>
#define mp make_pair
#define pb push_back
#define PI acos(-1)
#define ld long double
#define FOR(i, a, b) for (int i = a; i < b; ++i)
const ll inf = 1e18;
const int MxN = 200000;
int n, a, b, c, d;
string s;
bool dfs(int p1, int dest) {
for (int i = p1; i < dest; ++i) {
if (s[i] == '#' && s[i + 1] == '#')
return false;
}
return true;
}
void solve() {
cin >> n >> a >> b >> c >> d;
a--;
b--;
c--;
d--;
// string s ;
cin >> s;
bool ans = dfs(a, c) && dfs(b, d);
if (c < d) {
cout << (ans ? "Yes" : "No");
} else {
bool ok = false;
int cnt = 0;
for (int i = b; i < min(d + 1, n - 1); ++i) {
if (s[i - 1] == '.' && s[i] == '.' && s[i + 1] == '.') {
ok = true;
break;
}
}
if (ok)
cout << (ans ? "Yes" : "No");
else
cout << "No";
}
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int t = 1;
// cin >> t ;
while (t--)
solve();
return 0;
}
| [
"control_flow.loop.for.initializer.change",
"expression.operation.binary.remove",
"misc.opposites",
"expression.operator.arithmetic.change",
"control_flow.branch.if.condition.change"
] | 839,531 | 839,532 | u507638984 | cpp |
p03017 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define VI vector<int>
#define VL vector<ll>
#define PII pair<int, int>
#define VII vector<PII>
#define mp make_pair
#define pb push_back
#define PI acos(-1)
#define ld long double
#define FOR(i, a, b) for (int i = a; i < b; ++i)
const ll inf = 1e18;
const int MxN = 200000;
int n, a, b, c, d;
string s;
bool dfs(int p1, int dest) {
for (int i = p1; i < dest; ++i) {
if (s[i] == '#' && s[i + 1] == '#')
return false;
}
return true;
}
void solve() {
cin >> n >> a >> b >> c >> d;
a--;
b--;
c--;
d--;
// string s ;
cin >> s;
bool ans = dfs(a, c) && dfs(b, d);
if (c < d) {
cout << (ans ? "Yes" : "No");
} else {
bool ok = false;
int cnt = 0;
for (int i = b + 1; i < min(d + 1, n - 1); ++i) {
if (s[i - 1] == '.' && s[i] == '.' && s[i + 1] == '.') {
ok = true;
break;
}
}
if (ok)
cout << (ans ? "Yes" : "No");
else
cout << "No";
}
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int t = 1;
// cin >> t ;
while (t--)
solve();
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define VI vector<int>
#define VL vector<ll>
#define PII pair<int, int>
#define VII vector<PII>
#define mp make_pair
#define pb push_back
#define PI acos(-1)
#define ld long double
#define FOR(i, a, b) for (int i = a; i < b; ++i)
const ll inf = 1e18;
const int MxN = 200000;
int n, a, b, c, d;
string s;
bool dfs(int p1, int dest) {
for (int i = p1; i < dest; ++i) {
if (s[i] == '#' && s[i + 1] == '#')
return false;
}
return true;
}
void solve() {
cin >> n >> a >> b >> c >> d;
a--;
b--;
c--;
d--;
// string s ;
cin >> s;
bool ans = dfs(a, c) && dfs(b, d);
if (c < d) {
cout << (ans ? "Yes" : "No");
} else {
bool ok = false;
int cnt = 0;
for (int i = b; i < min(d + 1, n - 1); ++i) {
if (s[i - 1] == '.' && s[i] == '.' && s[i + 1] == '.') {
ok = true;
break;
}
}
if (ok)
cout << (ans ? "Yes" : "No");
else
cout << "No";
}
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int t = 1;
// cin >> t ;
while (t--)
solve();
return 0;
}
| [
"control_flow.loop.for.initializer.change",
"expression.operation.binary.remove"
] | 839,533 | 839,532 | u507638984 | cpp |
p03017 | #include <iostream>
using namespace std;
int main() {
int n, a, b, c, d;
cin >> n >> a >> b >> c >> d;
a--;
b--;
c--;
d--;
string str;
cin >> str;
int cnt = 0;
for (int i = a; i < c; i++) {
if (str[i] == '#') {
cnt++;
if (cnt == 2) {
cout << "No" << endl;
return 0;
}
} else {
cnt = 0;
}
}
cnt = 0;
for (int i = b; i < d; i++) {
if (str[i] == '#') {
cnt++;
if (cnt == 2) {
cout << "No" << endl;
return 0;
}
} else {
cnt = 0;
}
}
if (c < d) {
cout << "Yes" << endl;
return 0;
}
cnt = 0;
for (int i = b - 1; i < d + 1; i++) {
if (str[i] == '.') {
cnt++;
if (cnt == 3) {
cout << "Yes" << endl;
return 0;
}
} else {
cnt = 0;
}
}
cout << "No" << endl;
return 0;
}
| #include <iostream>
using namespace std;
int main() {
int n, a, b, c, d;
cin >> n >> a >> b >> c >> d;
a--;
b--;
c--;
d--;
string str;
cin >> str;
int cnt = 0;
for (int i = a; i <= c; i++) {
if (str[i] == '#') {
cnt++;
if (cnt == 2) {
cout << "No" << endl;
return 0;
}
} else {
cnt = 0;
}
}
cnt = 0;
for (int i = b; i <= d; i++) {
if (str[i] == '#') {
cnt++;
if (cnt == 2) {
cout << "No" << endl;
return 0;
}
} else {
cnt = 0;
}
}
if (c < d) {
cout << "Yes" << endl;
return 0;
}
cnt = 0;
for (int i = b - 1; i <= d + 1; i++) {
if (str[i] == '.') {
cnt++;
if (cnt == 3) {
cout << "Yes" << endl;
return 0;
}
} else {
cnt = 0;
}
}
cout << "No" << endl;
return 0;
}
| [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 839,537 | 839,538 | u509420256 | cpp |
p03017 | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define REP2(i, x, n) for (int i = x; i < (n); ++i)
#define ALL(v) v.begin(), v.end()
#define RALL(v) v.rbegin(), v.rend()
using namespace std;
using ll = long long;
using P = pair<int, int>;
static const double PI = acos(-1);
static const int INF = 1e9 + 7;
#define REP(i, n) for (int i = 0; i < (n); ++i)
// debug
#ifdef _DEBUG
#define debug(var) \
do { \
cout << #var << " :"; \
view(var); \
} while (0)
#else
#define debug(...)
#endif
template <typename T> void view(T e) { cout << e << endl; }
template <typename T> void view(const vector<T> &v) {
for (const auto &e : v) {
cout << e << " ";
}
cout << endl;
}
template <typename T> void view(const vector<vector<T>> &vv) {
for (const auto &v : vv) {
view(v);
}
}
int main() {
int n, a, b, c, d;
cin >> n >> a >> b >> c >> d;
a--;
b--;
c--;
d--;
string s;
cin >> s;
bool ok = true;
REP2(i, a, c + 1) {
if (s[i] == '#' && s[i + 1] == '#')
ok = false;
}
REP2(i, b, d + 1) {
if (s[i] == '#' && s[i + 1] == '#')
ok = false;
}
if (!ok) {
cout << "No" << endl;
return 0;
}
if (c < d) {
cout << "Yes" << endl;
return 0;
}
ok = false;
REP2(i, b, d) {
if (s[i + 1] == '.' && s[i] == '.' && s[i - 1] == '.') {
ok = true;
break;
}
}
if (ok) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
return 0;
} | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define REP2(i, x, n) for (int i = x; i < (n); ++i)
#define ALL(v) v.begin(), v.end()
#define RALL(v) v.rbegin(), v.rend()
using namespace std;
using ll = long long;
using P = pair<int, int>;
static const double PI = acos(-1);
static const int INF = 1e9 + 7;
#define REP(i, n) for (int i = 0; i < (n); ++i)
// debug
#ifdef _DEBUG
#define debug(var) \
do { \
cout << #var << " :"; \
view(var); \
} while (0)
#else
#define debug(...)
#endif
template <typename T> void view(T e) { cout << e << endl; }
template <typename T> void view(const vector<T> &v) {
for (const auto &e : v) {
cout << e << " ";
}
cout << endl;
}
template <typename T> void view(const vector<vector<T>> &vv) {
for (const auto &v : vv) {
view(v);
}
}
int main() {
int n, a, b, c, d;
cin >> n >> a >> b >> c >> d;
a--;
b--;
c--;
d--;
string s;
cin >> s;
bool ok = true;
REP2(i, a, c + 1) {
if (s[i] == '#' && s[i + 1] == '#')
ok = false;
}
REP2(i, b, d + 1) {
if (s[i] == '#' && s[i + 1] == '#')
ok = false;
}
if (!ok) {
cout << "No" << endl;
return 0;
}
if (c < d) {
cout << "Yes" << endl;
return 0;
}
ok = false;
REP2(i, b, d + 1) {
if (s[i + 1] == '.' && s[i] == '.' && s[i - 1] == '.') {
ok = true;
break;
}
}
if (ok) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
return 0;
} | [
"expression.operation.binary.add"
] | 839,544 | 839,545 | u849151695 | cpp |
p03017 | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define REP2(i, x, n) for (int i = x; i < (n); ++i)
#define ALL(v) v.begin(), v.end()
#define RALL(v) v.rbegin(), v.rend()
using namespace std;
using ll = long long;
using P = pair<int, int>;
static const double PI = acos(-1);
static const int INF = 1e9 + 7;
#define REP(i, n) for (int i = 0; i < (n); ++i)
// debug
#ifdef _DEBUG
#define debug(var) \
do { \
cout << #var << " :"; \
view(var); \
} while (0)
#else
#define debug(...)
#endif
template <typename T> void view(T e) { cout << e << endl; }
template <typename T> void view(const vector<T> &v) {
for (const auto &e : v) {
cout << e << " ";
}
cout << endl;
}
template <typename T> void view(const vector<vector<T>> &vv) {
for (const auto &v : vv) {
view(v);
}
}
int main() {
int n, a, b, c, d;
cin >> n >> a >> b >> c >> d;
a--;
b--;
c--;
d--;
string s;
cin >> s;
bool ok = true;
REP2(i, a, c + 1) {
if (s[i] == '#' && s[i + 1] == '#')
ok = false;
}
REP2(i, b, d + 1) {
if (s[i] == '#' && s[i + 1] == '#')
ok = false;
}
if (!ok) {
cout << "No" << endl;
return 0;
}
if (c < d) {
cout << "Yes" << endl;
return 0;
}
ok = false;
REP2(i, b + 1, d) {
if (s[i + 1] == '.' && s[i] == '.' && s[i - 1] == '.') {
ok = true;
break;
}
}
if (ok) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
return 0;
} | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define REP2(i, x, n) for (int i = x; i < (n); ++i)
#define ALL(v) v.begin(), v.end()
#define RALL(v) v.rbegin(), v.rend()
using namespace std;
using ll = long long;
using P = pair<int, int>;
static const double PI = acos(-1);
static const int INF = 1e9 + 7;
#define REP(i, n) for (int i = 0; i < (n); ++i)
// debug
#ifdef _DEBUG
#define debug(var) \
do { \
cout << #var << " :"; \
view(var); \
} while (0)
#else
#define debug(...)
#endif
template <typename T> void view(T e) { cout << e << endl; }
template <typename T> void view(const vector<T> &v) {
for (const auto &e : v) {
cout << e << " ";
}
cout << endl;
}
template <typename T> void view(const vector<vector<T>> &vv) {
for (const auto &v : vv) {
view(v);
}
}
int main() {
int n, a, b, c, d;
cin >> n >> a >> b >> c >> d;
a--;
b--;
c--;
d--;
string s;
cin >> s;
bool ok = true;
REP2(i, a, c + 1) {
if (s[i] == '#' && s[i + 1] == '#')
ok = false;
}
REP2(i, b, d + 1) {
if (s[i] == '#' && s[i + 1] == '#')
ok = false;
}
if (!ok) {
cout << "No" << endl;
return 0;
}
if (c < d) {
cout << "Yes" << endl;
return 0;
}
ok = false;
REP2(i, b, d + 1) {
if (s[i + 1] == '.' && s[i] == '.' && s[i - 1] == '.') {
ok = true;
break;
}
}
if (ok) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
return 0;
} | [
"expression.operation.binary.remove"
] | 839,546 | 839,545 | u849151695 | cpp |
p03017 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int n, a, b, c, d;
cin >> n >> a >> b >> c >> d;
a--;
b--;
c--;
d--;
string s;
cin >> s;
bool ok = true;
if (c < d /* A B C D */) {
for (int i = a + 1; i <= c; i++) {
if (s[i] == '#' && s[i - 1] == '#') {
ok = false;
break;
}
}
for (int i = b + 1; i <= d; i++) {
if (s[i] == '#' && s[i - 1] == '#') {
ok = false;
break;
}
}
} else { /* A B D C */
for (int i = a + 1; i <= c; i++) {
if (s[i] == '#' && s[i - 1] == '#') {
ok = false;
break;
}
}
for (int i = b + 1; i <= d; i++) {
if (s[i] == '#' && s[i - 1] == '#') {
ok = false;
break;
}
}
bool jump = false;
for (int i = b + 1; i <= d - 1; i++) {
if (s[i - 1] == '.' && s[i] == '.' && s[i + 1] == '.') {
jump = true;
break;
}
}
if (!jump) {
ok = false;
}
}
if (ok) {
puts("Yes");
} else {
puts("No");
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int n, a, b, c, d;
cin >> n >> a >> b >> c >> d;
a--;
b--;
c--;
d--;
string s;
cin >> s;
bool ok = true;
if (c < d /* A B C D */) {
for (int i = a + 1; i <= c; i++) {
if (s[i] == '#' && s[i - 1] == '#') {
ok = false;
break;
}
}
for (int i = b + 1; i <= d; i++) {
if (s[i] == '#' && s[i - 1] == '#') {
ok = false;
break;
}
}
} else { /* A B D C */
for (int i = a + 1; i <= c; i++) {
if (s[i] == '#' && s[i - 1] == '#') {
ok = false;
break;
}
}
for (int i = b + 1; i <= d; i++) {
if (s[i] == '#' && s[i - 1] == '#') {
ok = false;
break;
}
}
bool jump = false;
for (int i = b; i <= d; i++) {
if (s[i - 1] == '.' && s[i] == '.' && s[i + 1] == '.') {
jump = true;
break;
}
}
if (!jump) {
ok = false;
}
}
if (ok) {
puts("Yes");
} else {
puts("No");
}
return 0;
}
| [
"control_flow.loop.for.initializer.change",
"expression.operation.binary.remove",
"control_flow.loop.for.condition.change"
] | 839,561 | 839,562 | u902387200 | cpp |
p03017 | #include <bits/stdc++.h>
typedef long long int ll;
typedef long double ld;
using namespace std;
const long long int INF = 1e18;
const long long int MOD = 1e9 + 7;
typedef pair<ll, ll> pairs;
typedef vector<pairs> p;
struct edge {
ll to, cost;
};
ll gcd(ll a, ll b) {
if (b == 0) {
return a;
} else {
return gcd(b, a % b);
}
}
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
ll keta(ll N) {
int tmp{};
while (N > 0) {
tmp += (N % 10);
N /= 10;
}
N = tmp;
return N;
}
// 素数
vector<bool> IsPrime;
void sieve(size_t max) {
if (max + 1 > IsPrime.size()) {
IsPrime.resize(max + 1, true);
}
IsPrime[0] = false;
IsPrime[1] = false;
for (size_t i = 2; i * i <= max; ++i) {
if (IsPrime[i]) {
for (size_t j = 2; i * j <= max; ++j) {
IsPrime[i * j] = false;
}
}
}
}
// べき乗の余り
ll modpow(ll a, ll n) {
ll res = 1;
while (n) {
if (n & 1) {
res = res * a % MOD;
}
a = a * a % MOD;
n = n >> 1;
}
return res;
}
// コンビネーション
ll MAXN = 2e5 + 10;
vector<ll> inv(MAXN);
ll nCk(ll n, ll k) {
ll res = 1;
for (ll i = 1; i <= k; i++) {
res = res * (n - i + 1) % MOD;
}
for (ll i = 1; i <= k; i++) {
res = res * inv[i] % MOD;
}
return res;
}
// 回文
bool kai(string S) {
bool flag = true;
for (ll i = 0; i < S.size() / 2; ++i) {
if (S[i] != S[S.size() - i - 1]) {
flag = false;
break;
}
}
return flag;
}
// ---------------------------------------------
int main() {
ll n, a, b, c, d;
cin >> n >> a >> b >> c >> d;
a--;
b--;
c--;
d--;
string s;
cin >> s;
for (ll i = a; i < c; ++i) {
if (s[i] == s[i + 1] and s[i] == '#') {
cout << "No" << endl;
return 0;
}
}
for (ll i = b; i < d; ++i) {
if (s[i] == s[i + 1] and s[i] == '#') {
cout << "No" << endl;
return 0;
}
}
bool flag = false;
if (c < d) {
cout << "Yes" << endl;
return 0;
} else {
for (ll i = b; i < d; ++i) {
if (s[i] == '.' and s[i - 1] == '.' and s[i + 1] == '.') {
flag = true;
}
}
}
if (flag) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
return 0;
} | #include <bits/stdc++.h>
typedef long long int ll;
typedef long double ld;
using namespace std;
const long long int INF = 1e18;
const long long int MOD = 1e9 + 7;
typedef pair<ll, ll> pairs;
typedef vector<pairs> p;
struct edge {
ll to, cost;
};
ll gcd(ll a, ll b) {
if (b == 0) {
return a;
} else {
return gcd(b, a % b);
}
}
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
ll keta(ll N) {
int tmp{};
while (N > 0) {
tmp += (N % 10);
N /= 10;
}
N = tmp;
return N;
}
// 素数
vector<bool> IsPrime;
void sieve(size_t max) {
if (max + 1 > IsPrime.size()) {
IsPrime.resize(max + 1, true);
}
IsPrime[0] = false;
IsPrime[1] = false;
for (size_t i = 2; i * i <= max; ++i) {
if (IsPrime[i]) {
for (size_t j = 2; i * j <= max; ++j) {
IsPrime[i * j] = false;
}
}
}
}
// べき乗の余り
ll modpow(ll a, ll n) {
ll res = 1;
while (n) {
if (n & 1) {
res = res * a % MOD;
}
a = a * a % MOD;
n = n >> 1;
}
return res;
}
// コンビネーション
ll MAXN = 2e5 + 10;
vector<ll> inv(MAXN);
ll nCk(ll n, ll k) {
ll res = 1;
for (ll i = 1; i <= k; i++) {
res = res * (n - i + 1) % MOD;
}
for (ll i = 1; i <= k; i++) {
res = res * inv[i] % MOD;
}
return res;
}
// 回文
bool kai(string S) {
bool flag = true;
for (ll i = 0; i < S.size() / 2; ++i) {
if (S[i] != S[S.size() - i - 1]) {
flag = false;
break;
}
}
return flag;
}
// ---------------------------------------------
int main() {
ll n, a, b, c, d;
cin >> n >> a >> b >> c >> d;
a--;
b--;
c--;
d--;
string s;
cin >> s;
for (ll i = a; i < c; ++i) {
if (s[i] == s[i + 1] and s[i] == '#') {
cout << "No" << endl;
return 0;
}
}
for (ll i = b; i < d; ++i) {
if (s[i] == s[i + 1] and s[i] == '#') {
cout << "No" << endl;
return 0;
}
}
bool flag = false;
if (c < d) {
cout << "Yes" << endl;
return 0;
} else {
for (ll i = b; i <= d; ++i) {
if (s[i] == '.' and s[i - 1] == '.' and s[i + 1] == '.') {
flag = true;
}
}
if (flag) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
}
return 0;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 839,583 | 839,584 | u473023730 | cpp |
p03017 | #include <bits/stdc++.h>
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define codefor \
int test; \
scanf("%d", &test); \
while (test--)
#define yn(ans) cout << (ans ? "Yes" : "No") << endl
#define YN(ans) cout << (ans ? "YES" : "NO") << endl
#define umap unordered_map
#define uset unordered_set
using namespace std;
using ll = long long;
const int MOD = 1000000007;
//入力系
void scan(int &a) { scanf("%d", &a); }
void scan(long long &a) { scanf("%lld", &a); }
template <class T> void scan(T &a) { cin >> a; }
template <class T> void scan(vector<T> &vec) {
for (auto &&it : vec)
scan(it);
}
void in() {}
template <class Head, class... Tail> void in(Head &head, Tail &...tail) {
scan(head);
in(tail...);
}
//出力系
void print(const int &a) { printf("%d", a); }
void print(const long long &a) { printf("%lld", a); }
void print(const double &a) { printf("%.15lf", a); }
template <class T> void print(const T &a) { cout << a; }
template <class T> void print(const vector<T> &vec) {
if (vec.empty())
return;
print(vec[0]);
for (auto it = vec.begin(); ++it != vec.end();) {
putchar(' ');
print(*it);
}
}
void out() { putchar('\n'); }
template <class T> void out(const T &t) {
print(t);
putchar('\n');
}
template <class Head, class... Tail>
void out(const Head &head, const Tail &...tail) {
print(head);
putchar(' ');
out(tail...);
}
//デバッグ系
template <class T> void dprint(const T &a) { cerr << a; }
template <class T> void dprint(const vector<T> &vec) {
if (vec.empty())
return;
cerr << vec[0];
for (auto it = vec.begin(); ++it != vec.end();) {
cerr << " " << *it;
}
}
void debug() { cerr << endl; }
template <class T> void debug(const T &t) {
dprint(t);
cerr << endl;
}
template <class Head, class... Tail>
void debug(const Head &head, const Tail &...tail) {
dprint(head);
cerr << " ";
debug(tail...);
}
int main() {
int n, a, b, c, d;
in(n, a, b, c, d);
string s;
cin >> s;
int ans = 1;
for (int i = a; i < c; i++) {
if (s[i] == '#' && s[i + 1] == '#') {
ans = 0;
goto skip;
}
}
for (int i = b; i < d; i++) {
if (s[i] == '#' && s[i + 1] == '#') {
ans = 0;
goto skip;
}
}
if (c > d) {
ans = 0;
for (int i = b - 1; i <= d; i++) {
if (s[i - 1] == '.' && s[i] == '.' && s[i + 1] == '.') {
ans = 1;
goto skip;
}
}
}
skip:
yn(ans);
}
| #include <bits/stdc++.h>
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define codefor \
int test; \
scanf("%d", &test); \
while (test--)
#define yn(ans) cout << (ans ? "Yes" : "No") << endl
#define YN(ans) cout << (ans ? "YES" : "NO") << endl
#define umap unordered_map
#define uset unordered_set
using namespace std;
using ll = long long;
const int MOD = 1000000007;
//入力系
void scan(int &a) { scanf("%d", &a); }
void scan(long long &a) { scanf("%lld", &a); }
template <class T> void scan(T &a) { cin >> a; }
template <class T> void scan(vector<T> &vec) {
for (auto &&it : vec)
scan(it);
}
void in() {}
template <class Head, class... Tail> void in(Head &head, Tail &...tail) {
scan(head);
in(tail...);
}
//出力系
void print(const int &a) { printf("%d", a); }
void print(const long long &a) { printf("%lld", a); }
void print(const double &a) { printf("%.15lf", a); }
template <class T> void print(const T &a) { cout << a; }
template <class T> void print(const vector<T> &vec) {
if (vec.empty())
return;
print(vec[0]);
for (auto it = vec.begin(); ++it != vec.end();) {
putchar(' ');
print(*it);
}
}
void out() { putchar('\n'); }
template <class T> void out(const T &t) {
print(t);
putchar('\n');
}
template <class Head, class... Tail>
void out(const Head &head, const Tail &...tail) {
print(head);
putchar(' ');
out(tail...);
}
//デバッグ系
template <class T> void dprint(const T &a) { cerr << a; }
template <class T> void dprint(const vector<T> &vec) {
if (vec.empty())
return;
cerr << vec[0];
for (auto it = vec.begin(); ++it != vec.end();) {
cerr << " " << *it;
}
}
void debug() { cerr << endl; }
template <class T> void debug(const T &t) {
dprint(t);
cerr << endl;
}
template <class Head, class... Tail>
void debug(const Head &head, const Tail &...tail) {
dprint(head);
cerr << " ";
debug(tail...);
}
int main() {
int n, a, b, c, d;
in(n, a, b, c, d);
string s;
cin >> s;
int ans = 1;
for (int i = a; i < c; i++) {
if (s[i] == '#' && s[i + 1] == '#') {
ans = 0;
goto skip;
}
}
for (int i = b; i < d; i++) {
if (s[i] == '#' && s[i + 1] == '#') {
ans = 0;
goto skip;
}
}
if (c > d) {
ans = 0;
for (int i = b - 1; i <= d - 1; i++) {
if (s[i - 1] == '.' && s[i] == '.' && s[i + 1] == '.') {
ans = 1;
goto skip;
}
}
}
skip:
yn(ans);
} | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 839,587 | 839,588 | u225660136 | cpp |
p03017 | #include <bits/stdc++.h>
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define codefor \
int test; \
scanf("%d", &test); \
while (test--)
#define yn(ans) cout << (ans ? "Yes" : "No") << endl
#define YN(ans) cout << (ans ? "YES" : "NO") << endl
#define umap unordered_map
#define uset unordered_set
using namespace std;
using ll = long long;
const int MOD = 1000000007;
//入力系
void scan(int &a) { scanf("%d", &a); }
void scan(long long &a) { scanf("%lld", &a); }
template <class T> void scan(T &a) { cin >> a; }
template <class T> void scan(vector<T> &vec) {
for (auto &&it : vec)
scan(it);
}
void in() {}
template <class Head, class... Tail> void in(Head &head, Tail &...tail) {
scan(head);
in(tail...);
}
//出力系
void print(const int &a) { printf("%d", a); }
void print(const long long &a) { printf("%lld", a); }
void print(const double &a) { printf("%.15lf", a); }
template <class T> void print(const T &a) { cout << a; }
template <class T> void print(const vector<T> &vec) {
if (vec.empty())
return;
print(vec[0]);
for (auto it = vec.begin(); ++it != vec.end();) {
putchar(' ');
print(*it);
}
}
void out() { putchar('\n'); }
template <class T> void out(const T &t) {
print(t);
putchar('\n');
}
template <class Head, class... Tail>
void out(const Head &head, const Tail &...tail) {
print(head);
putchar(' ');
out(tail...);
}
//デバッグ系
template <class T> void dprint(const T &a) { cerr << a; }
template <class T> void dprint(const vector<T> &vec) {
if (vec.empty())
return;
cerr << vec[0];
for (auto it = vec.begin(); ++it != vec.end();) {
cerr << " " << *it;
}
}
void debug() { cerr << endl; }
template <class T> void debug(const T &t) {
dprint(t);
cerr << endl;
}
template <class Head, class... Tail>
void debug(const Head &head, const Tail &...tail) {
dprint(head);
cerr << " ";
debug(tail...);
}
int main() {
int n, a, b, c, d;
in(n, a, b, c, d);
string s;
cin >> s;
int ans = 1;
for (int i = a; i < c; i++) {
if (s[i] == '#' && s[i + 1] == '#') {
ans = 0;
goto skip;
}
}
for (int i = b; i < d; i++) {
if (s[i] == '#' && s[i + 1] == '#') {
ans = 0;
goto skip;
}
}
if (c > d) {
ans = 0;
for (int i = b; i <= d; i++) {
if (s[i - 1] == '.' && s[i] == '.' && s[i + 1] == '.') {
ans = 1;
goto skip;
}
}
}
skip:
yn(ans);
} | #include <bits/stdc++.h>
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define codefor \
int test; \
scanf("%d", &test); \
while (test--)
#define yn(ans) cout << (ans ? "Yes" : "No") << endl
#define YN(ans) cout << (ans ? "YES" : "NO") << endl
#define umap unordered_map
#define uset unordered_set
using namespace std;
using ll = long long;
const int MOD = 1000000007;
//入力系
void scan(int &a) { scanf("%d", &a); }
void scan(long long &a) { scanf("%lld", &a); }
template <class T> void scan(T &a) { cin >> a; }
template <class T> void scan(vector<T> &vec) {
for (auto &&it : vec)
scan(it);
}
void in() {}
template <class Head, class... Tail> void in(Head &head, Tail &...tail) {
scan(head);
in(tail...);
}
//出力系
void print(const int &a) { printf("%d", a); }
void print(const long long &a) { printf("%lld", a); }
void print(const double &a) { printf("%.15lf", a); }
template <class T> void print(const T &a) { cout << a; }
template <class T> void print(const vector<T> &vec) {
if (vec.empty())
return;
print(vec[0]);
for (auto it = vec.begin(); ++it != vec.end();) {
putchar(' ');
print(*it);
}
}
void out() { putchar('\n'); }
template <class T> void out(const T &t) {
print(t);
putchar('\n');
}
template <class Head, class... Tail>
void out(const Head &head, const Tail &...tail) {
print(head);
putchar(' ');
out(tail...);
}
//デバッグ系
template <class T> void dprint(const T &a) { cerr << a; }
template <class T> void dprint(const vector<T> &vec) {
if (vec.empty())
return;
cerr << vec[0];
for (auto it = vec.begin(); ++it != vec.end();) {
cerr << " " << *it;
}
}
void debug() { cerr << endl; }
template <class T> void debug(const T &t) {
dprint(t);
cerr << endl;
}
template <class Head, class... Tail>
void debug(const Head &head, const Tail &...tail) {
dprint(head);
cerr << " ";
debug(tail...);
}
int main() {
int n, a, b, c, d;
in(n, a, b, c, d);
string s;
cin >> s;
int ans = 1;
for (int i = a; i < c; i++) {
if (s[i] == '#' && s[i + 1] == '#') {
ans = 0;
goto skip;
}
}
for (int i = b; i < d; i++) {
if (s[i] == '#' && s[i + 1] == '#') {
ans = 0;
goto skip;
}
}
if (c > d) {
ans = 0;
for (int i = b - 1; i <= d - 1; i++) {
if (s[i - 1] == '.' && s[i] == '.' && s[i + 1] == '.') {
ans = 1;
goto skip;
}
}
}
skip:
yn(ans);
} | [
"control_flow.loop.for.initializer.change",
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 839,589 | 839,588 | u225660136 | cpp |
p03017 | #include <bits/stdc++.h>
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define codefor \
int test; \
scanf("%d", &test); \
while (test--)
#define yn(ans) cout << (ans ? "Yes" : "No") << endl
#define YN(ans) cout << (ans ? "YES" : "NO") << endl
#define umap unordered_map
#define uset unordered_set
using namespace std;
using ll = long long;
const int MOD = 1000000007;
//入力系
void scan(int &a) { scanf("%d", &a); }
void scan(long long &a) { scanf("%lld", &a); }
template <class T> void scan(T &a) { cin >> a; }
template <class T> void scan(vector<T> &vec) {
for (auto &&it : vec)
scan(it);
}
void in() {}
template <class Head, class... Tail> void in(Head &head, Tail &...tail) {
scan(head);
in(tail...);
}
//出力系
void print(const int &a) { printf("%d", a); }
void print(const long long &a) { printf("%lld", a); }
void print(const double &a) { printf("%.15lf", a); }
template <class T> void print(const T &a) { cout << a; }
template <class T> void print(const vector<T> &vec) {
if (vec.empty())
return;
print(vec[0]);
for (auto it = vec.begin(); ++it != vec.end();) {
putchar(' ');
print(*it);
}
}
void out() { putchar('\n'); }
template <class T> void out(const T &t) {
print(t);
putchar('\n');
}
template <class Head, class... Tail>
void out(const Head &head, const Tail &...tail) {
print(head);
putchar(' ');
out(tail...);
}
//デバッグ系
template <class T> void dprint(const T &a) { cerr << a; }
template <class T> void dprint(const vector<T> &vec) {
if (vec.empty())
return;
cerr << vec[0];
for (auto it = vec.begin(); ++it != vec.end();) {
cerr << " " << *it;
}
}
void debug() { cerr << endl; }
template <class T> void debug(const T &t) {
dprint(t);
cerr << endl;
}
template <class Head, class... Tail>
void debug(const Head &head, const Tail &...tail) {
dprint(head);
cerr << " ";
debug(tail...);
}
int main() {
int n, a, b, c, d;
in(n, a, b, c, d);
string s;
cin >> s;
int ans = 1;
for (int i = a; i < c; i++) {
if (s[i] == '#' && s[i + 1] == '#') {
ans = 0;
goto skip;
}
}
for (int i = b; i < d; i++) {
if (s[i] == '#' && s[i + 1] == '#') {
ans = 0;
goto skip;
}
}
if (c > d) {
ans = 0;
for (int i = b; i <= d - 1; i++) {
if (s[i - 1] == '.' && s[i] == '.' && s[i + 1] == '.') {
ans = 1;
goto skip;
}
}
}
skip:
yn(ans);
} | #include <bits/stdc++.h>
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define codefor \
int test; \
scanf("%d", &test); \
while (test--)
#define yn(ans) cout << (ans ? "Yes" : "No") << endl
#define YN(ans) cout << (ans ? "YES" : "NO") << endl
#define umap unordered_map
#define uset unordered_set
using namespace std;
using ll = long long;
const int MOD = 1000000007;
//入力系
void scan(int &a) { scanf("%d", &a); }
void scan(long long &a) { scanf("%lld", &a); }
template <class T> void scan(T &a) { cin >> a; }
template <class T> void scan(vector<T> &vec) {
for (auto &&it : vec)
scan(it);
}
void in() {}
template <class Head, class... Tail> void in(Head &head, Tail &...tail) {
scan(head);
in(tail...);
}
//出力系
void print(const int &a) { printf("%d", a); }
void print(const long long &a) { printf("%lld", a); }
void print(const double &a) { printf("%.15lf", a); }
template <class T> void print(const T &a) { cout << a; }
template <class T> void print(const vector<T> &vec) {
if (vec.empty())
return;
print(vec[0]);
for (auto it = vec.begin(); ++it != vec.end();) {
putchar(' ');
print(*it);
}
}
void out() { putchar('\n'); }
template <class T> void out(const T &t) {
print(t);
putchar('\n');
}
template <class Head, class... Tail>
void out(const Head &head, const Tail &...tail) {
print(head);
putchar(' ');
out(tail...);
}
//デバッグ系
template <class T> void dprint(const T &a) { cerr << a; }
template <class T> void dprint(const vector<T> &vec) {
if (vec.empty())
return;
cerr << vec[0];
for (auto it = vec.begin(); ++it != vec.end();) {
cerr << " " << *it;
}
}
void debug() { cerr << endl; }
template <class T> void debug(const T &t) {
dprint(t);
cerr << endl;
}
template <class Head, class... Tail>
void debug(const Head &head, const Tail &...tail) {
dprint(head);
cerr << " ";
debug(tail...);
}
int main() {
int n, a, b, c, d;
in(n, a, b, c, d);
string s;
cin >> s;
int ans = 1;
for (int i = a; i < c; i++) {
if (s[i] == '#' && s[i + 1] == '#') {
ans = 0;
goto skip;
}
}
for (int i = b; i < d; i++) {
if (s[i] == '#' && s[i + 1] == '#') {
ans = 0;
goto skip;
}
}
if (c > d) {
ans = 0;
for (int i = b - 1; i <= d - 1; i++) {
if (s[i - 1] == '.' && s[i] == '.' && s[i + 1] == '.') {
ans = 1;
goto skip;
}
}
}
skip:
yn(ans);
} | [
"control_flow.loop.for.initializer.change"
] | 839,590 | 839,588 | u225660136 | cpp |
p03017 | #include <bits/stdc++.h>
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define codefor \
int test; \
scanf("%d", &test); \
while (test--)
#define yn(ans) cout << (ans ? "Yes" : "No") << endl
#define YN(ans) cout << (ans ? "YES" : "NO") << endl
#define umap unordered_map
#define uset unordered_set
using namespace std;
using ll = long long;
const int MOD = 1000000007;
//入力系
void scan(int &a) { scanf("%d", &a); }
void scan(long long &a) { scanf("%lld", &a); }
template <class T> void scan(T &a) { cin >> a; }
template <class T> void scan(vector<T> &vec) {
for (auto &&it : vec)
scan(it);
}
void in() {}
template <class Head, class... Tail> void in(Head &head, Tail &...tail) {
scan(head);
in(tail...);
}
//出力系
void print(const int &a) { printf("%d", a); }
void print(const long long &a) { printf("%lld", a); }
void print(const double &a) { printf("%.15lf", a); }
template <class T> void print(const T &a) { cout << a; }
template <class T> void print(const vector<T> &vec) {
if (vec.empty())
return;
print(vec[0]);
for (auto it = vec.begin(); ++it != vec.end();) {
putchar(' ');
print(*it);
}
}
void out() { putchar('\n'); }
template <class T> void out(const T &t) {
print(t);
putchar('\n');
}
template <class Head, class... Tail>
void out(const Head &head, const Tail &...tail) {
print(head);
putchar(' ');
out(tail...);
}
//デバッグ系
template <class T> void dprint(const T &a) { cerr << a; }
template <class T> void dprint(const vector<T> &vec) {
if (vec.empty())
return;
cerr << vec[0];
for (auto it = vec.begin(); ++it != vec.end();) {
cerr << " " << *it;
}
}
void debug() { cerr << endl; }
template <class T> void debug(const T &t) {
dprint(t);
cerr << endl;
}
template <class Head, class... Tail>
void debug(const Head &head, const Tail &...tail) {
dprint(head);
cerr << " ";
debug(tail...);
}
int main() {
int n, a, b, c, d;
in(n, a, b, c, d);
string s;
cin >> s;
int ans = 1;
for (int i = a; i < c; i++) {
if (s[i] == '#' && s[i + 1] == '#') {
ans = 0;
goto skip;
}
}
for (int i = b; i < d; i++) {
if (s[i] == '#' && s[i + 1] == '#') {
ans = 0;
goto skip;
}
}
if (c > d) {
ans = 0;
for (int i = b; i <= c - 1; i++) {
if (s[i - 1] == '.' && s[i] == '.' && s[i + 1] == '.') {
ans = 1;
goto skip;
}
}
}
skip:
yn(ans);
} | #include <bits/stdc++.h>
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define codefor \
int test; \
scanf("%d", &test); \
while (test--)
#define yn(ans) cout << (ans ? "Yes" : "No") << endl
#define YN(ans) cout << (ans ? "YES" : "NO") << endl
#define umap unordered_map
#define uset unordered_set
using namespace std;
using ll = long long;
const int MOD = 1000000007;
//入力系
void scan(int &a) { scanf("%d", &a); }
void scan(long long &a) { scanf("%lld", &a); }
template <class T> void scan(T &a) { cin >> a; }
template <class T> void scan(vector<T> &vec) {
for (auto &&it : vec)
scan(it);
}
void in() {}
template <class Head, class... Tail> void in(Head &head, Tail &...tail) {
scan(head);
in(tail...);
}
//出力系
void print(const int &a) { printf("%d", a); }
void print(const long long &a) { printf("%lld", a); }
void print(const double &a) { printf("%.15lf", a); }
template <class T> void print(const T &a) { cout << a; }
template <class T> void print(const vector<T> &vec) {
if (vec.empty())
return;
print(vec[0]);
for (auto it = vec.begin(); ++it != vec.end();) {
putchar(' ');
print(*it);
}
}
void out() { putchar('\n'); }
template <class T> void out(const T &t) {
print(t);
putchar('\n');
}
template <class Head, class... Tail>
void out(const Head &head, const Tail &...tail) {
print(head);
putchar(' ');
out(tail...);
}
//デバッグ系
template <class T> void dprint(const T &a) { cerr << a; }
template <class T> void dprint(const vector<T> &vec) {
if (vec.empty())
return;
cerr << vec[0];
for (auto it = vec.begin(); ++it != vec.end();) {
cerr << " " << *it;
}
}
void debug() { cerr << endl; }
template <class T> void debug(const T &t) {
dprint(t);
cerr << endl;
}
template <class Head, class... Tail>
void debug(const Head &head, const Tail &...tail) {
dprint(head);
cerr << " ";
debug(tail...);
}
int main() {
int n, a, b, c, d;
in(n, a, b, c, d);
string s;
cin >> s;
int ans = 1;
for (int i = a; i < c; i++) {
if (s[i] == '#' && s[i + 1] == '#') {
ans = 0;
goto skip;
}
}
for (int i = b; i < d; i++) {
if (s[i] == '#' && s[i + 1] == '#') {
ans = 0;
goto skip;
}
}
if (c > d) {
ans = 0;
for (int i = b - 1; i <= d - 1; i++) {
if (s[i - 1] == '.' && s[i] == '.' && s[i + 1] == '.') {
ans = 1;
goto skip;
}
}
}
skip:
yn(ans);
} | [
"control_flow.loop.for.initializer.change",
"identifier.change",
"control_flow.branch.if.condition.change"
] | 839,591 | 839,588 | u225660136 | cpp |
p03017 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main(void) {
int N, A, B, C, D;
string S;
cin >> N >> A >> B >> C >> D >> S;
for (int i = A - 1; i < C - 1; i++) {
if (S[i] == S[i + 1] && S[i] == '#') {
cout << "No" << endl;
return 0;
}
}
for (int i = B - 1; i < D - 1; i++) {
if (S[i] == S[i + 1] && S[i] == '#') {
cout << "No" << endl;
return 0;
}
}
if (C < D) {
cout << "Yes" << endl;
} else {
bool ok = false;
for (int i = B; i <= D; i++) {
if (S[i] == '.' && S[i - 1] == '.' && S[i + 1] == '.') {
ok = true;
}
}
if (ok) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main(void) {
int N, A, B, C, D;
string S;
cin >> N >> A >> B >> C >> D >> S;
for (int i = A - 1; i < C - 1; i++) {
if (S[i] == S[i + 1] && S[i] == '#') {
cout << "No" << endl;
return 0;
}
}
for (int i = B - 1; i < D - 1; i++) {
if (S[i] == S[i + 1] && S[i] == '#') {
cout << "No" << endl;
return 0;
}
}
if (C < D) {
cout << "Yes" << endl;
} else {
bool ok = false;
for (int i = B - 1; i <= D - 1; i++) {
if (S[i] == '.' && S[i - 1] == '.' && S[i + 1] == '.') {
ok = true;
}
}
if (ok) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
}
return 0;
}
| [
"control_flow.loop.for.initializer.change",
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 839,597 | 839,598 | u158758556 | cpp |
p03017 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
using pii = pair<int, int>;
const int INF = 2e9;
int main() {
int n, a, b, c, d;
cin >> n >> a >> b >> c >> d;
string s;
cin >> s;
int p = 0;
for (int i = a; i < max(c, d); i++) {
if (s[i] == '#' && s[i - 1] == '#') {
p++;
break;
}
}
if (d < c) {
p++;
for (int i = b; i <= d; i++) {
if (s[i] == '.' && s[i + 1] == '.' && s[i - 1] == '.') {
p--;
break;
}
}
}
if (p == 0)
cout << "Yes" << endl;
else
cout << "No" << endl;
}
| #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
using pii = pair<int, int>;
const int INF = 2e9;
int main() {
int n, a, b, c, d;
cin >> n >> a >> b >> c >> d;
string s;
cin >> s;
int p = 0;
for (int i = a; i < max(c, d); i++) {
if (s[i] == '#' && s[i - 1] == '#') {
p++;
break;
}
}
if (d < c) {
p++;
for (int i = b; i <= d; i++) {
if (s[i] == '.' && s[i - 1] == '.' && s[i - 2] == '.') {
p--;
break;
}
}
}
if (p == 0)
cout << "Yes" << endl;
else
cout << "No" << endl;
}
| [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove",
"control_flow.branch.if.condition.change"
] | 839,606 | 839,607 | u816145694 | cpp |
p03017 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
using pii = pair<int, int>;
const int INF = 2e9;
int main() {
int n, a, b, c, d;
cin >> n >> a >> b >> c >> d;
string s;
cin >> s;
int p = 0;
for (int i = a; i < max(c, d); i++) {
if (s[i] == '#' && s[i - 1] == '#') {
p++;
break;
}
}
if (d < c) {
p++;
for (int i = b; i <= d; i++) {
if (s[i] == '.' && s[i + 1] == '.' && s[i + 2] == '.') {
p--;
break;
}
}
}
if (p == 0)
cout << "Yes" << endl;
else
cout << "No" << endl;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
using pii = pair<int, int>;
const int INF = 2e9;
int main() {
int n, a, b, c, d;
cin >> n >> a >> b >> c >> d;
string s;
cin >> s;
int p = 0;
for (int i = a; i < max(c, d); i++) {
if (s[i] == '#' && s[i - 1] == '#') {
p++;
break;
}
}
if (d < c) {
p++;
for (int i = b; i <= d; i++) {
if (s[i] == '.' && s[i - 1] == '.' && s[i - 2] == '.') {
p--;
break;
}
}
}
if (p == 0)
cout << "Yes" << endl;
else
cout << "No" << endl;
}
| [
"misc.opposites",
"expression.operator.arithmetic.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 839,608 | 839,607 | u816145694 | cpp |
p03017 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
using pii = pair<int, int>;
const int INF = 2e9;
int main() {
int n, a, b, c, d;
cin >> n >> a >> b >> c >> d;
string s;
cin >> s;
int p = 0;
for (int i = a; i < max(c, d); i++) {
if (s[i] == '#' && s[i - 1] == '#') {
p++;
break;
}
}
if (d < c) {
p++;
for (int i = b; i <= d; i++) {
if (s[i] == '.' && s[i + 1] == '.' && s[i - 1] == '.') {
p--;
break;
}
}
}
if (p == 0)
cout << "Yes" << endl;
else
cout << "No" << endl;
}
| #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
using pii = pair<int, int>;
const int INF = 2e9;
int main() {
int n, a, b, c, d;
cin >> n >> a >> b >> c >> d;
string s;
cin >> s;
int p = 0;
for (int i = a; i < max(c, d); i++) {
if (s[i] == '#' && s[i - 1] == '#') {
p++;
break;
}
}
if (d < c) {
p++;
for (int i = b; i <= d; i++) {
if (s[i] == '.' && s[i - 1] == '.' && s[i - 2] == '.') {
p--;
break;
}
}
}
if (p == 0)
cout << "Yes" << endl;
else
cout << "No" << endl;
} | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove",
"control_flow.branch.if.condition.change"
] | 839,606 | 839,609 | u816145694 | cpp |
p03017 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
using pii = pair<int, int>;
const int INF = 2e9;
int main() {
int n, a, b, c, d;
cin >> n >> a >> b >> c >> d;
string s;
cin >> s;
int p = 0;
for (int i = a; i < max(c, d); i++) {
if (s[i] == '#' && s[i - 1] == '#') {
p++;
break;
}
}
if (d < c) {
p++;
for (int i = b; i <= d; i++) {
if (s[i] == '.' && s[i + 1] == '.' && s[i + 2] == '.') {
p--;
break;
}
}
}
if (p == 0)
cout << "Yes" << endl;
else
cout << "No" << endl;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
using pii = pair<int, int>;
const int INF = 2e9;
int main() {
int n, a, b, c, d;
cin >> n >> a >> b >> c >> d;
string s;
cin >> s;
int p = 0;
for (int i = a; i < max(c, d); i++) {
if (s[i] == '#' && s[i - 1] == '#') {
p++;
break;
}
}
if (d < c) {
p++;
for (int i = b; i <= d; i++) {
if (s[i] == '.' && s[i - 1] == '.' && s[i - 2] == '.') {
p--;
break;
}
}
}
if (p == 0)
cout << "Yes" << endl;
else
cout << "No" << endl;
} | [
"misc.opposites",
"expression.operator.arithmetic.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 839,608 | 839,609 | u816145694 | cpp |
p03017 | #include <bits/stdc++.h>
using namespace std;
#define int long long
typedef pair<int, int> P;
int INF = 1e9 + 7;
int mod = 1e9 + 7;
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
signed main() {
int N, A, B, C, D;
string S;
cin >> N >> A >> B >> C >> D >> 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 ((A < B && C < D) || (B < A && C < D)) {
cout << "Yes" << endl;
} else {
for (int i = max(A, B) - 1; i < min(C, D) - 2; i++) {
if (S[i] == '.' && S[i + 1] == '.' && S[i + 2] == '.') {
cout << "Yes" << endl;
return 0;
}
}
cout << "No" << endl;
}
}
| #include <bits/stdc++.h>
using namespace std;
#define int long long
typedef pair<int, int> P;
int INF = 1e9 + 7;
int mod = 1e9 + 7;
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
signed main() {
int N, A, B, C, D;
string S;
cin >> N >> A >> B >> C >> D >> 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 ((A < B && C < D) || (B < A && C < D)) {
cout << "Yes" << endl;
} else {
for (int i = max(A, B) - 2; i < min(C, D) - 1; i++) {
if (S[i] == '.' && S[i + 1] == '.' && S[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",
"control_flow.branch.if.condition.change"
] | 839,616 | 839,617 | u237390401 | cpp |
p03017 | #include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using ll = long long;
using namespace std;
constexpr int MOD = 1e9 + 7;
constexpr ll MOD_LL = ll(1e9 + 7);
int main(void) {
int n, a, b, c, d;
string s;
cin >> n >> a >> b >> c >> d >> s;
a--;
b--;
c--;
d--;
for (int i = a; i <= c; ++i) {
if (s[i] == '#' && s[i + 1] == '#') {
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;
} else if (c > d) {
bool threeDot = false;
for (int i = b; i < d; ++i) {
if (s.substr(i - 1, 3) == "...") {
threeDot = true;
}
}
if (threeDot)
cout << "Yes" << endl;
else
cout << "No" << endl;
}
return 0;
}
| #include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using ll = long long;
using namespace std;
constexpr int MOD = 1e9 + 7;
constexpr ll MOD_LL = ll(1e9 + 7);
int main(void) {
int n, a, b, c, d;
string s;
cin >> n >> a >> b >> c >> d >> s;
a--;
b--;
c--;
d--;
for (int i = a; i < c; ++i) {
if (s[i] == '#' && s[i + 1] == '#') {
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;
} else if (c > d) {
bool threeDot = false;
for (int i = b; i <= d; ++i) {
if (s.substr(i - 1, 3) == "...") {
threeDot = true;
}
}
if (threeDot)
cout << "Yes" << endl;
else
cout << "No" << endl;
}
return 0;
}
| [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"control_flow.branch.if.condition.change"
] | 839,626 | 839,627 | u835805357 | cpp |
p03017 | #include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using ll = long long;
using namespace std;
constexpr int MOD = 1e9 + 7;
constexpr ll MOD_LL = ll(1e9 + 7);
int main(void) {
int n, a, b, c, d;
string s;
cin >> n >> a >> b >> c >> d >> s;
a--;
b--;
c--;
d--;
for (int i = a; i <= c; ++i) {
if (s[i] == '#' && s[i + 1] == '#') {
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;
} else if (c > d) {
bool threeDot = false;
for (int i = b; i <= d; ++i) {
if (s.substr(i, 3) == "...") {
threeDot = true;
}
}
if (threeDot)
cout << "Yes" << endl;
else
cout << "No" << endl;
}
return 0;
}
| #include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using ll = long long;
using namespace std;
constexpr int MOD = 1e9 + 7;
constexpr ll MOD_LL = ll(1e9 + 7);
int main(void) {
int n, a, b, c, d;
string s;
cin >> n >> a >> b >> c >> d >> s;
a--;
b--;
c--;
d--;
for (int i = a; i < c; ++i) {
if (s[i] == '#' && s[i + 1] == '#') {
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;
} else if (c > d) {
bool threeDot = false;
for (int i = b; i <= d; ++i) {
if (s.substr(i - 1, 3) == "...") {
threeDot = true;
}
}
if (threeDot)
cout << "Yes" << endl;
else
cout << "No" << endl;
}
return 0;
}
| [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"control_flow.branch.if.condition.change",
"misc.off_by_one"
] | 839,628 | 839,627 | u835805357 | cpp |
p03017 | #include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using ll = long long;
using namespace std;
constexpr int MOD = 1e9 + 7;
constexpr ll MOD_LL = ll(1e9 + 7);
int main(void) {
int n, a, b, c, d;
string s;
cin >> n >> a >> b >> c >> d >> s;
a--;
b--;
c--;
d--;
for (int i = a; i <= c; ++i) {
if (s[i] == '#' && s[i + 1] == '#') {
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;
} else if (c > d) {
bool threeDot = false;
for (int i = b; i < d; ++i) {
if (s.substr(i, 3) == "...") {
threeDot = true;
}
}
if (threeDot)
cout << "Yes" << endl;
else
cout << "No" << endl;
}
return 0;
}
| #include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using ll = long long;
using namespace std;
constexpr int MOD = 1e9 + 7;
constexpr ll MOD_LL = ll(1e9 + 7);
int main(void) {
int n, a, b, c, d;
string s;
cin >> n >> a >> b >> c >> d >> s;
a--;
b--;
c--;
d--;
for (int i = a; i < c; ++i) {
if (s[i] == '#' && s[i + 1] == '#') {
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;
} else if (c > d) {
bool threeDot = false;
for (int i = b; i <= d; ++i) {
if (s.substr(i - 1, 3) == "...") {
threeDot = true;
}
}
if (threeDot)
cout << "Yes" << endl;
else
cout << "No" << endl;
}
return 0;
}
| [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"control_flow.branch.if.condition.change",
"misc.off_by_one"
] | 839,629 | 839,627 | u835805357 | cpp |
p03017 | #include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using ll = long long;
using namespace std;
constexpr int MOD = 1e9 + 7;
constexpr ll MOD_LL = ll(1e9 + 7);
int main(void) {
int n, a, b, c, d;
string s;
cin >> n >> a >> b >> c >> d >> s;
a--;
b--;
c--;
d--;
for (int i = a; i < c; ++i) {
if (s[i] == '#' && s[i + 1] == '#') {
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;
} else if (c > d) {
bool threeDot = false;
for (int i = b; i < d; ++i) {
if (s.substr(i, 3) == "...") {
threeDot = true;
}
}
if (threeDot)
cout << "Yes" << endl;
else
cout << "No" << endl;
}
return 0;
}
| #include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using ll = long long;
using namespace std;
constexpr int MOD = 1e9 + 7;
constexpr ll MOD_LL = ll(1e9 + 7);
int main(void) {
int n, a, b, c, d;
string s;
cin >> n >> a >> b >> c >> d >> s;
a--;
b--;
c--;
d--;
for (int i = a; i < c; ++i) {
if (s[i] == '#' && s[i + 1] == '#') {
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;
} else if (c > d) {
bool threeDot = false;
for (int i = b; i <= d; ++i) {
if (s.substr(i - 1, 3) == "...") {
threeDot = true;
}
}
if (threeDot)
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",
"misc.off_by_one"
] | 839,630 | 839,627 | u835805357 | cpp |
p03017 | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int N, A, B, C, D;
cin >> N >> A >> B >> C >> D;
A--;
B--;
C--;
D--;
string S;
cin >> S;
bool flag = true;
for (int i = A; i < max(C, D) - 1; i++) {
if (S[i] == '#' && S[i + 1] == '#') {
flag = false;
break;
}
}
if (flag && C > D) {
flag = false;
for (int i = B; i < D - 1; i++) {
if (S[i - 1] == '.' && S[i] == '.' && S[i + 1] == '.') {
flag = true;
break;
}
}
}
cout << (flag ? "Yes" : "No") << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int N, A, B, C, D;
cin >> N >> A >> B >> C >> D;
A--;
B--;
C--;
D--;
string S;
cin >> S;
bool flag = true;
for (int i = A; i < max(C, D) - 1; i++) {
if (S[i] == '#' && S[i + 1] == '#') {
flag = false;
break;
}
}
if (flag && C > D) {
flag = false;
for (int i = B; i <= D; i++) {
if (S[i - 1] == '.' && S[i] == '.' && S[i + 1] == '.') {
flag = true;
break;
}
}
}
cout << (flag ? "Yes" : "No") << endl;
return 0;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 839,633 | 839,634 | u615194706 | cpp |
p03017 | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define double long double
#define lp(i, n) for (int i = 0; i < (n); i++)
#define lps(i, j, n) for (int i = j; i < n; i++)
#define fordebug \
int hoge; \
cin >> hoge;
#define DEKAI 1000000007
#define floot10 cout << fixed << setprecision(15)
#define all(v) v.begin(), v.end()
double PI = acos(-1);
signed main() {
int n, a, b, c, d;
cin >> n >> a >> b >> c >> d;
a--, b--, c--, d--;
string s;
cin >> s;
string ans = "Yes";
//まずは、一人だけの時辿り着けるか考える
//間に石が２個 並んでたら無理
// a-c
for (int i = a + 1; i <= c; i++) {
if (s[i] == '#' && s[i - 1] == '#') {
ans = "No";
}
}
// b-d
for (int i = b + 1; i < d; i++) {
if (s[i] == '#' && s[i - 1] == '#') {
ans = "No";
}
}
//追い越し必要？
if (b < c && d < c) {
//マスが3つ連続で空いてないとダメ！
//追い越せるのはb-dの間
bool check = false;
for (int i = b + 1; i < d + 1; i++) {
if (s[i - 2] == '.' && s[i - 1] == '.' && s[i] == '.') {
check = true;
}
}
if (check == false) { // falseのままだったら、追い越せないのでNO
ans = "No";
}
}
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define int long long
#define double long double
#define lp(i, n) for (int i = 0; i < (n); i++)
#define lps(i, j, n) for (int i = j; i < n; i++)
#define fordebug \
int hoge; \
cin >> hoge;
#define DEKAI 1000000007
#define floot10 cout << fixed << setprecision(15)
#define all(v) v.begin(), v.end()
double PI = acos(-1);
signed main() {
int n, a, b, c, d;
cin >> n >> a >> b >> c >> d;
a--, b--, c--, d--;
string s;
cin >> s;
string ans = "Yes";
//まずは、一人だけの時辿り着けるか考える
//間に石が２個 並んでたら無理
// a-c
for (int i = a + 1; i <= c; i++) {
if (s[i] == '#' && s[i - 1] == '#') {
ans = "No";
}
}
// b-d
for (int i = b + 1; i <= d; i++) {
if (s[i] == '#' && s[i - 1] == '#') {
ans = "No";
}
}
//追い越し必要？
if (b < c && d < c) {
//マスが3つ連続で空いてないとダメ！
//追い越せるのはb-dの間
bool check = false;
for (int i = b + 1; i <= d + 1; i++) {
if (s[i - 2] == '.' && s[i - 1] == '.' && s[i] == '.') {
check = true;
}
}
if (check == false) { // falseのままだったら、追い越せないのでNO
ans = "No";
}
}
cout << ans << endl;
return 0;
}
| [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"control_flow.branch.if.condition.change"
] | 839,648 | 839,649 | u501494362 | cpp |
p03017 | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define double long double
#define lp(i, n) for (int i = 0; i < (n); i++)
#define lps(i, j, n) for (int i = j; i < n; i++)
#define fordebug \
int hoge; \
cin >> hoge;
#define DEKAI 1000000007
#define floot10 cout << fixed << setprecision(15)
#define all(v) v.begin(), v.end()
double PI = acos(-1);
signed main() {
int n, a, b, c, d;
cin >> n >> a >> b >> c >> d;
a--, b--, c--, d--;
string s;
cin >> s;
string ans = "Yes";
//まずは、一人だけの時辿り着けるか考える
//間に石が２個 並んでたら無理
// a-c
for (int i = a + 1; i <= c; i++) {
if (s[i] == '#' && s[i - 1] == '#') {
ans = "No";
}
}
// b-d
for (int i = b + 1; i < d; i++) {
if (s[i] == '#' && s[i - 1] == '#') {
ans = "No";
}
}
//追い越し必要？
if (b < c && d < c) {
//マスが3つ連続で空いてないとダメ！
//追い越せるのはb-dの間
bool check = false;
for (int i = b + 2; i < d; i++) {
if (s[i - 2] == '.' && s[i - 1] == '.' && s[i] == '.') {
check = true;
}
}
if (check == false) { // falseのままだったら、追い越せないのでNO
ans = "No";
}
}
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define int long long
#define double long double
#define lp(i, n) for (int i = 0; i < (n); i++)
#define lps(i, j, n) for (int i = j; i < n; i++)
#define fordebug \
int hoge; \
cin >> hoge;
#define DEKAI 1000000007
#define floot10 cout << fixed << setprecision(15)
#define all(v) v.begin(), v.end()
double PI = acos(-1);
signed main() {
int n, a, b, c, d;
cin >> n >> a >> b >> c >> d;
a--, b--, c--, d--;
string s;
cin >> s;
string ans = "Yes";
//まずは、一人だけの時辿り着けるか考える
//間に石が２個 並んでたら無理
// a-c
for (int i = a + 1; i <= c; i++) {
if (s[i] == '#' && s[i - 1] == '#') {
ans = "No";
}
}
// b-d
for (int i = b + 1; i <= d; i++) {
if (s[i] == '#' && s[i - 1] == '#') {
ans = "No";
}
}
//追い越し必要？
if (b < c && d < c) {
//マスが3つ連続で空いてないとダメ！
//追い越せるのはb-dの間
bool check = false;
for (int i = b + 1; i <= d + 1; i++) {
if (s[i - 2] == '.' && s[i - 1] == '.' && s[i] == '.') {
check = true;
}
}
if (check == false) { // falseのままだったら、追い越せないのでNO
ans = "No";
}
}
cout << ans << endl;
return 0;
}
| [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"literal.number.change",
"control_flow.loop.for.initializer.change",
"control_flow.branch.if.condition.change",
"misc.off_by_one"
] | 839,650 | 839,649 | u501494362 | cpp |
p03017 | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define double long double
#define lp(i, n) for (int i = 0; i < (n); i++)
#define lps(i, j, n) for (int i = j; i < n; i++)
#define fordebug \
int hoge; \
cin >> hoge;
#define DEKAI 1000000007
#define floot10 cout << fixed << setprecision(15)
#define all(v) v.begin(), v.end()
double PI = acos(-1);
signed main() {
int n, a, b, c, d;
cin >> n >> a >> b >> c >> d;
a--, b--, c--, d--;
string s;
cin >> s;
string ans = "Yes";
//まずは、一人だけの時辿り着けるか考える
//間に石が２個 並んでたら無理
// a-c
for (int i = a + 1; i <= c; i++) {
if (s[i] == '#' && s[i - 1] == '#') {
ans = "No";
}
}
// b-d
for (int i = b + 1; i < d; i++) {
if (s[i] == '#' && s[i - 1] == '#') {
ans = "No";
}
}
//追い越し必要？
if (b < c && d < c) {
//マスが3つ連続で空いてないとダメ！
//追い越せるのはb-dの間
bool check = false;
for (int i = b + 1; i < d + 1; i++) {
if (s[i - 2] == '.' && s[i - 1] == '.' && s[i] == '.') {
check = true;
}
}
if (check == false) { // falseのままだったら、追い越せないのでNO
ans = "No";
}
}
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define int long long
#define double long double
#define lp(i, n) for (int i = 0; i < (n); i++)
#define lps(i, j, n) for (int i = j; i < n; i++)
#define fordebug \
int hoge; \
cin >> hoge;
#define DEKAI 1000000007
#define floot10 cout << fixed << setprecision(15)
#define all(v) v.begin(), v.end()
double PI = acos(-1);
signed main() {
int n, a, b, c, d;
cin >> n >> a >> b >> c >> d;
a--, b--, c--, d--;
string s;
cin >> s;
string ans = "Yes";
//まずは、一人だけの時辿り着けるか考える
//間に石が２個 並んでたら無理
// a-c
for (int i = a + 1; i <= c; i++) {
if (s[i] == '#' && s[i - 1] == '#') {
ans = "No";
}
}
// b-d
for (int i = b + 1; i < d; i++) {
if (s[i] == '#' && s[i - 1] == '#') {
ans = "No";
}
}
//追い越し必要？
if (b < c && d < c) {
//マスが3つ連続で空いてないとダメ！
//追い越せるのはb-dの間
bool check = false;
for (int i = b + 1; i <= d + 1; i++) {
if (s[i - 2] == '.' && s[i - 1] == '.' && s[i] == '.') {
check = true;
}
}
if (check == false) { // falseのままだったら、追い越せないのでNO
ans = "No";
}
}
cout << ans << endl;
return 0;
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 839,648 | 839,651 | u501494362 | cpp |
p03017 | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define double long double
#define lp(i, n) for (int i = 0; i < (n); i++)
#define lps(i, j, n) for (int i = j; i < n; i++)
#define fordebug \
int hoge; \
cin >> hoge;
#define DEKAI 1000000007
#define floot10 cout << fixed << setprecision(15)
#define all(v) v.begin(), v.end()
double PI = acos(-1);
signed main() {
int n, a, b, c, d;
cin >> n >> a >> b >> c >> d;
a--, b--, c--, d--;
string s;
cin >> s;
string ans = "Yes";
//まずは、一人だけの時辿り着けるか考える
//間に石が２個 並んでたら無理
// a-c
for (int i = a + 1; i <= c; i++) {
if (s[i] == '#' && s[i - 1] == '#') {
ans = "No";
}
}
// b-d
for (int i = b + 1; i < d; i++) {
if (s[i] == '#' && s[i - 1] == '#') {
ans = "No";
}
}
//追い越し必要？
if (b < c && d < c) {
//マスが3つ連続で空いてないとダメ！
//追い越せるのはb-dの間
bool check = false;
for (int i = b + 2; i < d; i++) {
if (s[i - 2] == '.' && s[i - 1] == '.' && s[i] == '.') {
check = true;
}
}
if (check == false) { // falseのままだったら、追い越せないのでNO
ans = "No";
}
}
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define int long long
#define double long double
#define lp(i, n) for (int i = 0; i < (n); i++)
#define lps(i, j, n) for (int i = j; i < n; i++)
#define fordebug \
int hoge; \
cin >> hoge;
#define DEKAI 1000000007
#define floot10 cout << fixed << setprecision(15)
#define all(v) v.begin(), v.end()
double PI = acos(-1);
signed main() {
int n, a, b, c, d;
cin >> n >> a >> b >> c >> d;
a--, b--, c--, d--;
string s;
cin >> s;
string ans = "Yes";
//まずは、一人だけの時辿り着けるか考える
//間に石が２個 並んでたら無理
// a-c
for (int i = a + 1; i <= c; i++) {
if (s[i] == '#' && s[i - 1] == '#') {
ans = "No";
}
}
// b-d
for (int i = b + 1; i < d; i++) {
if (s[i] == '#' && s[i - 1] == '#') {
ans = "No";
}
}
//追い越し必要？
if (b < c && d < c) {
//マスが3つ連続で空いてないとダメ！
//追い越せるのはb-dの間
bool check = false;
for (int i = b + 1; i <= d + 1; i++) {
if (s[i - 2] == '.' && s[i - 1] == '.' && s[i] == '.') {
check = true;
}
}
if (check == false) { // falseのままだったら、追い越せないのでNO
ans = "No";
}
}
cout << ans << endl;
return 0;
}
| [
"literal.number.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"expression.operation.binary.change",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 839,650 | 839,651 | u501494362 | cpp |
p03017 | /*
* じょえチャンネル
* 高評価・チャンネル登録よろしくおねがいします！
* https://www.youtube.com/channel/UCRXsI3FL_kvaVL9zoolBfbQ
*/
#include <bits/stdc++.h>
//#pragma GCC target("avx2")
//#pragma GCC optimize("O3")
//#pragma GCC optimize("unroll-loops")
#define f(i, n) for (int i = 0; i < (n); i++)
#define inf (int)(3e18)
// here!!!
// define int long long !!!!!
#define int long long
// define int long long !!!!!
#define mod (int)((1e9) + 7)
#define intt long long
#define itn long long
#define P pair<int, int>
#define rep(i, n) for (int i = 0; i < n; i++)
#define REP(i, n) for (int i = 1; i <= n; i++)
#define ALL(v) v.begin(), v.end()
using namespace std;
// Library
//モッドパウ
inline int modpow(int x, int y, int m = mod) {
int res = 1;
while (y) {
if (y % 2) {
res *= x;
res %= m;
}
x = x * x % m;
y /= 2;
}
return res;
}
int mypow(int x, int y) {
int res = 1;
while (y) {
if (y % 2) {
res *= x;
}
x = x * x;
y /= 2;
}
return res;
}
// is the number (x) a prime number?
bool prime(int x) {
for (int i = 2; i * i <= x; i++) {
if (!(x % i)) {
return false;
}
}
return true;
}
// saidai-kouyakusuu
inline int gcd(int x, int y) {
if (!y) {
return x;
}
return gcd(y, x % y);
}
// number of keta
int keta(int x) {
int ans = 0;
while (x) {
x /= 10;
ans++;
}
return ans;
}
// sum of keta
int ketasum(int x) {
int ans = 0;
while (x) {
ans += x % 10;
x /= 10;
}
return ans;
}
inline int lcm(int x, int y) {
int ans = x / gcd(x, y) * y;
return ans;
}
int twobeki(int x) {
int ans = 0;
while (1) {
if (!(x & 1)) {
ans++;
x /= 2;
} else {
break;
}
}
return ans;
}
template <class T, class U> inline bool chmax(T &lhs, const U &rhs) {
if (lhs < rhs) {
lhs = rhs;
return 1;
}
return 0;
}
template <class T, class U> inline bool chmin(T &lhs, const U &rhs) {
if (lhs > rhs) {
lhs = rhs;
return 1;
}
return 0;
}
void Yes() { cout << "Yes" << endl; }
void No() { cout << "No" << endl; }
void YES() { cout << "YES" << endl; }
void NO() { cout << "NO" << endl; }
#define fin(i) scanf("%lld", &i)
#define fout(i) printf("%lld", i)
#define fendl printf("\n")
int kai(int x, int y) {
int res = 1;
for (int i = x - y + 1; i <= x; i++) {
res *= i;
res %= mod;
}
return res;
}
int comb(int x, int y) {
if (y > x)
return 0;
// cout<<kai(x, y)<<' '<<modpow(kai(y, y), mod - 2)<<endl;
return kai(x, y) * modpow(kai(y, y), mod - 2) % mod;
}
// Library-End
class modInt {
int value, modulo;
public:
modInt() : value(0), modulo(mod) { value = 0; }
template <typename T>
modInt(T value = 0, int modulo = mod) : value(value), modulo(modulo) {
if (value < 0) {
value = -value;
value %= modulo;
value = -value;
value += modulo;
}
this->value = value % modulo;
}
inline operator int() const { return value; }
inline modInt &operator+=(modInt x) {
value += x.value;
if (value >= modulo)
value -= modulo;
return *this;
}
inline modInt &operator++() {
if (value == modulo - 1)
value = 0;
else
value++;
return *this;
}
inline modInt &operator-() const { return modInt(0) -= *this; }
inline modInt &operator-=(modInt x) {
value -= x.value;
if (value < 0)
value += modulo;
return *this;
}
inline modInt &operator--() {
if (value == 0)
value = modulo - 1;
else
value--;
return *this;
}
inline modInt &operator*=(modInt x) {
value = value * x.value % modulo;
return *this;
}
inline modInt &operator/=(modInt x) { return operator*=(x.inv()); }
inline modInt inv() { return modpow(*this, modulo - 2); }
template <typename T> modInt operator+(T x) { return modInt(*this) += x; }
template <typename T> modInt &operator+=(T x) {
return operator+=(modInt(x, modulo));
}
template <typename T> modInt operator-(T x) { return modInt(*this) -= x; }
template <typename T> modInt &operator-=(T x) {
return operator-=(modInt(x, modulo));
}
template <typename T> modInt operator*(T x) { return modInt(*this) *= x; }
template <typename T> modInt &operator*=(T x) {
return operator*=(modInt(x, modulo));
}
template <typename T> modInt operator/(T x) { return modInt(*this) /= x; }
template <typename T> modInt &operator/=(T x) {
return operator/=(modInt(x, modulo));
}
};
istream &operator>>(istream &ist, modInt &x) {
int a;
ist >> a;
x = a;
return ist;
}
#define vecin(v) \
for (int i = 0; i < v.size(); i++) \
scanf("%lld", &v[i]);
#define vecout(v) \
{ \
for (int i = 0; i < v.size(); i++) \
printf("%lld\n", v[i]); \
}
// SegTree
template <class T> class SegTree {
int n; // 葉の数
vector<T> data; // データを格納するvector
T def; // 初期値かつ単位元
function<T(T, T)> operation; // 区間クエリで使う処理
function<T(T, T)> update; // 点更新で使う処理
// 区間[a,b)の総和。ノードk=[l,r)に着目している。
T _query(int a, int b, int k, int l, int r) {
if (r <= a || b <= l)
return def; // 交差しない
if (a <= l && r <= b)
return data[k]; // a,l,r,bの順で完全に含まれる
else {
T c1 = _query(a, b, 2 * k + 1, l, (l + r) / 2); // 左の子
T c2 = _query(a, b, 2 * k + 2, (l + r) / 2, r); // 右の子
return operation(c1, c2);
}
}
public:
// _n:必要サイズ, _def:初期値かつ単位元, _operation:クエリ関数,
// _update:更新関数
SegTree(size_t _n, T _def, function<T(T, T)> _operation,
function<T(T, T)> _update)
: def(_def), operation(_operation), update(_update) {
n = 1;
while (n < _n) {
n *= 2;
}
data = vector<T>(2 * n - 1, def);
}
// 場所i(0-indexed)の値をxで更新
void change(int i, T x) {
i += n - 1;
data[i] = update(data[i], x);
while (i > 0) {
i = (i - 1) / 2;
data[i] = operation(data[i * 2 + 1], data[i * 2 + 2]);
}
}
// [a, b)の区間クエリを実行
T query(int a, int b) { return _query(a, b, 0, 0, n); }
// 添字でアクセス
T operator[](int i) { return data[i + n - 1]; }
};
#define R_MIN ([](long long a, long long b) { return min(a, b); })
#define R_MAX ([](long long a, long long b) { return max(a, b); })
#define R_SUM ([](long long a, long long b) { return a + b; })
#define NORMAL_UPDATE ([](long long a, long long b) { return b; })
#define ADD_UPDATE ([](long long a, long long b) { return a + b; })
#define MINUS_UPDATE ([](long long a, long long b) { return a - b; }
class Union_Find {
vector<int> par;
vector<int> rankmy;
vector<int> ookisa;
public:
Union_Find(int size) {
par = vector<int>(size);
rankmy = vector<int>(size);
ookisa = vector<int>(size);
for (int i = 0; i < size; i++) {
par[i] = i;
ookisa[i] = 1;
}
}
int find(int x) {
if (par[x] == x) {
return x;
}
return par[x] = find(par[x]);
}
void unite(int x, int y) {
x = find(x);
y = find(y);
if (x == y) {
return;
}
if (rankmy[x] < rankmy[y]) {
par[x] = y;
ookisa[y] += ookisa[x];
ookisa[x] = 0;
} else {
par[y] = x;
ookisa[x] += ookisa[y];
ookisa[y] = 0;
if (rankmy[x] == rankmy[y]) {
rankmy[x]++;
}
}
}
int size(int i) {
i = find(i);
return ookisa[i];
}
bool same(int x, int y) { return find(x) == find(y); }
};
// Union-Find-End
#define endl "\n" // interactive の時に注意！！！
int n, a, b, c, d;
string s;
signed main() {
ios::sync_with_stdio(false);
std::cin.tie(nullptr);
cin >> n >> a >> b >> c >> d >> s;
for (int i = a - 1; i <= c - 2; i++) {
if (s[i] == s[i + 1] && s[i] == '#') {
No();
return 0;
}
}
for (int i = b - 1; i <= d - 2; i++) {
if (s[i] == s[i + 1] && s[i] == '#') {
No();
return 0;
}
}
if (c > d) {
for (int i = max(0ll, b - 1); i <= d - 3; i++) {
if (s[i] == s[i + 1] && s[i] == s[i + 2] && s[i] == '.') {
if (i + 3 < s.size()) {
if (s[i + 3] == '#' && b - 1 == i + 2) {
continue;
}
}
Yes();
return 0;
}
}
No();
} else
Yes();
}
| /*
* じょえチャンネル
* 高評価・チャンネル登録よろしくおねがいします！
* https://www.youtube.com/channel/UCRXsI3FL_kvaVL9zoolBfbQ
*/
#include <bits/stdc++.h>
//#pragma GCC target("avx2")
//#pragma GCC optimize("O3")
//#pragma GCC optimize("unroll-loops")
#define f(i, n) for (int i = 0; i < (n); i++)
#define inf (int)(3e18)
// here!!!
// define int long long !!!!!
#define int long long
// define int long long !!!!!
#define mod (int)((1e9) + 7)
#define intt long long
#define itn long long
#define P pair<int, int>
#define rep(i, n) for (int i = 0; i < n; i++)
#define REP(i, n) for (int i = 1; i <= n; i++)
#define ALL(v) v.begin(), v.end()
using namespace std;
// Library
//モッドパウ
inline int modpow(int x, int y, int m = mod) {
int res = 1;
while (y) {
if (y % 2) {
res *= x;
res %= m;
}
x = x * x % m;
y /= 2;
}
return res;
}
int mypow(int x, int y) {
int res = 1;
while (y) {
if (y % 2) {
res *= x;
}
x = x * x;
y /= 2;
}
return res;
}
// is the number (x) a prime number?
bool prime(int x) {
for (int i = 2; i * i <= x; i++) {
if (!(x % i)) {
return false;
}
}
return true;
}
// saidai-kouyakusuu
inline int gcd(int x, int y) {
if (!y) {
return x;
}
return gcd(y, x % y);
}
// number of keta
int keta(int x) {
int ans = 0;
while (x) {
x /= 10;
ans++;
}
return ans;
}
// sum of keta
int ketasum(int x) {
int ans = 0;
while (x) {
ans += x % 10;
x /= 10;
}
return ans;
}
inline int lcm(int x, int y) {
int ans = x / gcd(x, y) * y;
return ans;
}
int twobeki(int x) {
int ans = 0;
while (1) {
if (!(x & 1)) {
ans++;
x /= 2;
} else {
break;
}
}
return ans;
}
template <class T, class U> inline bool chmax(T &lhs, const U &rhs) {
if (lhs < rhs) {
lhs = rhs;
return 1;
}
return 0;
}
template <class T, class U> inline bool chmin(T &lhs, const U &rhs) {
if (lhs > rhs) {
lhs = rhs;
return 1;
}
return 0;
}
void Yes() { cout << "Yes" << endl; }
void No() { cout << "No" << endl; }
void YES() { cout << "YES" << endl; }
void NO() { cout << "NO" << endl; }
#define fin(i) scanf("%lld", &i)
#define fout(i) printf("%lld", i)
#define fendl printf("\n")
int kai(int x, int y) {
int res = 1;
for (int i = x - y + 1; i <= x; i++) {
res *= i;
res %= mod;
}
return res;
}
int comb(int x, int y) {
if (y > x)
return 0;
// cout<<kai(x, y)<<' '<<modpow(kai(y, y), mod - 2)<<endl;
return kai(x, y) * modpow(kai(y, y), mod - 2) % mod;
}
// Library-End
class modInt {
int value, modulo;
public:
modInt() : value(0), modulo(mod) { value = 0; }
template <typename T>
modInt(T value = 0, int modulo = mod) : value(value), modulo(modulo) {
if (value < 0) {
value = -value;
value %= modulo;
value = -value;
value += modulo;
}
this->value = value % modulo;
}
inline operator int() const { return value; }
inline modInt &operator+=(modInt x) {
value += x.value;
if (value >= modulo)
value -= modulo;
return *this;
}
inline modInt &operator++() {
if (value == modulo - 1)
value = 0;
else
value++;
return *this;
}
inline modInt &operator-() const { return modInt(0) -= *this; }
inline modInt &operator-=(modInt x) {
value -= x.value;
if (value < 0)
value += modulo;
return *this;
}
inline modInt &operator--() {
if (value == 0)
value = modulo - 1;
else
value--;
return *this;
}
inline modInt &operator*=(modInt x) {
value = value * x.value % modulo;
return *this;
}
inline modInt &operator/=(modInt x) { return operator*=(x.inv()); }
inline modInt inv() { return modpow(*this, modulo - 2); }
template <typename T> modInt operator+(T x) { return modInt(*this) += x; }
template <typename T> modInt &operator+=(T x) {
return operator+=(modInt(x, modulo));
}
template <typename T> modInt operator-(T x) { return modInt(*this) -= x; }
template <typename T> modInt &operator-=(T x) {
return operator-=(modInt(x, modulo));
}
template <typename T> modInt operator*(T x) { return modInt(*this) *= x; }
template <typename T> modInt &operator*=(T x) {
return operator*=(modInt(x, modulo));
}
template <typename T> modInt operator/(T x) { return modInt(*this) /= x; }
template <typename T> modInt &operator/=(T x) {
return operator/=(modInt(x, modulo));
}
};
istream &operator>>(istream &ist, modInt &x) {
int a;
ist >> a;
x = a;
return ist;
}
#define vecin(v) \
for (int i = 0; i < v.size(); i++) \
scanf("%lld", &v[i]);
#define vecout(v) \
{ \
for (int i = 0; i < v.size(); i++) \
printf("%lld\n", v[i]); \
}
// SegTree
template <class T> class SegTree {
int n; // 葉の数
vector<T> data; // データを格納するvector
T def; // 初期値かつ単位元
function<T(T, T)> operation; // 区間クエリで使う処理
function<T(T, T)> update; // 点更新で使う処理
// 区間[a,b)の総和。ノードk=[l,r)に着目している。
T _query(int a, int b, int k, int l, int r) {
if (r <= a || b <= l)
return def; // 交差しない
if (a <= l && r <= b)
return data[k]; // a,l,r,bの順で完全に含まれる
else {
T c1 = _query(a, b, 2 * k + 1, l, (l + r) / 2); // 左の子
T c2 = _query(a, b, 2 * k + 2, (l + r) / 2, r); // 右の子
return operation(c1, c2);
}
}
public:
// _n:必要サイズ, _def:初期値かつ単位元, _operation:クエリ関数,
// _update:更新関数
SegTree(size_t _n, T _def, function<T(T, T)> _operation,
function<T(T, T)> _update)
: def(_def), operation(_operation), update(_update) {
n = 1;
while (n < _n) {
n *= 2;
}
data = vector<T>(2 * n - 1, def);
}
// 場所i(0-indexed)の値をxで更新
void change(int i, T x) {
i += n - 1;
data[i] = update(data[i], x);
while (i > 0) {
i = (i - 1) / 2;
data[i] = operation(data[i * 2 + 1], data[i * 2 + 2]);
}
}
// [a, b)の区間クエリを実行
T query(int a, int b) { return _query(a, b, 0, 0, n); }
// 添字でアクセス
T operator[](int i) { return data[i + n - 1]; }
};
#define R_MIN ([](long long a, long long b) { return min(a, b); })
#define R_MAX ([](long long a, long long b) { return max(a, b); })
#define R_SUM ([](long long a, long long b) { return a + b; })
#define NORMAL_UPDATE ([](long long a, long long b) { return b; })
#define ADD_UPDATE ([](long long a, long long b) { return a + b; })
#define MINUS_UPDATE ([](long long a, long long b) { return a - b; }
class Union_Find {
vector<int> par;
vector<int> rankmy;
vector<int> ookisa;
public:
Union_Find(int size) {
par = vector<int>(size);
rankmy = vector<int>(size);
ookisa = vector<int>(size);
for (int i = 0; i < size; i++) {
par[i] = i;
ookisa[i] = 1;
}
}
int find(int x) {
if (par[x] == x) {
return x;
}
return par[x] = find(par[x]);
}
void unite(int x, int y) {
x = find(x);
y = find(y);
if (x == y) {
return;
}
if (rankmy[x] < rankmy[y]) {
par[x] = y;
ookisa[y] += ookisa[x];
ookisa[x] = 0;
} else {
par[y] = x;
ookisa[x] += ookisa[y];
ookisa[y] = 0;
if (rankmy[x] == rankmy[y]) {
rankmy[x]++;
}
}
}
int size(int i) {
i = find(i);
return ookisa[i];
}
bool same(int x, int y) { return find(x) == find(y); }
};
// Union-Find-End
#define endl "\n" // interactive の時に注意！！！
int n, a, b, c, d;
string s;
signed main() {
ios::sync_with_stdio(false);
std::cin.tie(nullptr);
cin >> n >> a >> b >> c >> d >> s;
for (int i = a - 1; i <= c - 2; i++) {
if (s[i] == s[i + 1] && s[i] == '#') {
No();
return 0;
}
}
for (int i = b - 1; i <= d - 2; i++) {
if (s[i] == s[i + 1] && s[i] == '#') {
No();
return 0;
}
}
if (c > d) {
for (int i = max(0ll, b - 2); i <= d - 2; i++) {
if (s[i] == s[i + 1] && s[i] == s[i + 2] && s[i] == '.') {
if (i + 3 < s.size()) {
if (s[i + 3] == '#' && b - 1 == i + 2) {
continue;
}
}
Yes();
return 0;
}
}
No();
} else
Yes();
}
| [
"literal.number.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"call.arguments.change",
"expression.operation.binary.change",
"control_flow.branch.if.condition.change"
] | 839,670 | 839,671 | u943070796 | cpp |
p03017 | /*
* じょえチャンネル
* 高評価・チャンネル登録よろしくおねがいします！
* https://www.youtube.com/channel/UCRXsI3FL_kvaVL9zoolBfbQ
*/
#include <bits/stdc++.h>
//#pragma GCC target("avx2")
//#pragma GCC optimize("O3")
//#pragma GCC optimize("unroll-loops")
#define f(i, n) for (int i = 0; i < (n); i++)
#define inf (int)(3e18)
// here!!!
// define int long long !!!!!
#define int long long
// define int long long !!!!!
#define mod (int)((1e9) + 7)
#define intt long long
#define itn long long
#define P pair<int, int>
#define rep(i, n) for (int i = 0; i < n; i++)
#define REP(i, n) for (int i = 1; i <= n; i++)
#define ALL(v) v.begin(), v.end()
using namespace std;
// Library
//モッドパウ
inline int modpow(int x, int y, int m = mod) {
int res = 1;
while (y) {
if (y % 2) {
res *= x;
res %= m;
}
x = x * x % m;
y /= 2;
}
return res;
}
int mypow(int x, int y) {
int res = 1;
while (y) {
if (y % 2) {
res *= x;
}
x = x * x;
y /= 2;
}
return res;
}
// is the number (x) a prime number?
bool prime(int x) {
for (int i = 2; i * i <= x; i++) {
if (!(x % i)) {
return false;
}
}
return true;
}
// saidai-kouyakusuu
inline int gcd(int x, int y) {
if (!y) {
return x;
}
return gcd(y, x % y);
}
// number of keta
int keta(int x) {
int ans = 0;
while (x) {
x /= 10;
ans++;
}
return ans;
}
// sum of keta
int ketasum(int x) {
int ans = 0;
while (x) {
ans += x % 10;
x /= 10;
}
return ans;
}
inline int lcm(int x, int y) {
int ans = x / gcd(x, y) * y;
return ans;
}
int twobeki(int x) {
int ans = 0;
while (1) {
if (!(x & 1)) {
ans++;
x /= 2;
} else {
break;
}
}
return ans;
}
template <class T, class U> inline bool chmax(T &lhs, const U &rhs) {
if (lhs < rhs) {
lhs = rhs;
return 1;
}
return 0;
}
template <class T, class U> inline bool chmin(T &lhs, const U &rhs) {
if (lhs > rhs) {
lhs = rhs;
return 1;
}
return 0;
}
void Yes() { cout << "Yes" << endl; }
void No() { cout << "No" << endl; }
void YES() { cout << "YES" << endl; }
void NO() { cout << "NO" << endl; }
#define fin(i) scanf("%lld", &i)
#define fout(i) printf("%lld", i)
#define fendl printf("\n")
int kai(int x, int y) {
int res = 1;
for (int i = x - y + 1; i <= x; i++) {
res *= i;
res %= mod;
}
return res;
}
int comb(int x, int y) {
if (y > x)
return 0;
// cout<<kai(x, y)<<' '<<modpow(kai(y, y), mod - 2)<<endl;
return kai(x, y) * modpow(kai(y, y), mod - 2) % mod;
}
// Library-End
class modInt {
int value, modulo;
public:
modInt() : value(0), modulo(mod) { value = 0; }
template <typename T>
modInt(T value = 0, int modulo = mod) : value(value), modulo(modulo) {
if (value < 0) {
value = -value;
value %= modulo;
value = -value;
value += modulo;
}
this->value = value % modulo;
}
inline operator int() const { return value; }
inline modInt &operator+=(modInt x) {
value += x.value;
if (value >= modulo)
value -= modulo;
return *this;
}
inline modInt &operator++() {
if (value == modulo - 1)
value = 0;
else
value++;
return *this;
}
inline modInt &operator-() const { return modInt(0) -= *this; }
inline modInt &operator-=(modInt x) {
value -= x.value;
if (value < 0)
value += modulo;
return *this;
}
inline modInt &operator--() {
if (value == 0)
value = modulo - 1;
else
value--;
return *this;
}
inline modInt &operator*=(modInt x) {
value = value * x.value % modulo;
return *this;
}
inline modInt &operator/=(modInt x) { return operator*=(x.inv()); }
inline modInt inv() { return modpow(*this, modulo - 2); }
template <typename T> modInt operator+(T x) { return modInt(*this) += x; }
template <typename T> modInt &operator+=(T x) {
return operator+=(modInt(x, modulo));
}
template <typename T> modInt operator-(T x) { return modInt(*this) -= x; }
template <typename T> modInt &operator-=(T x) {
return operator-=(modInt(x, modulo));
}
template <typename T> modInt operator*(T x) { return modInt(*this) *= x; }
template <typename T> modInt &operator*=(T x) {
return operator*=(modInt(x, modulo));
}
template <typename T> modInt operator/(T x) { return modInt(*this) /= x; }
template <typename T> modInt &operator/=(T x) {
return operator/=(modInt(x, modulo));
}
};
istream &operator>>(istream &ist, modInt &x) {
int a;
ist >> a;
x = a;
return ist;
}
#define vecin(v) \
for (int i = 0; i < v.size(); i++) \
scanf("%lld", &v[i]);
#define vecout(v) \
{ \
for (int i = 0; i < v.size(); i++) \
printf("%lld\n", v[i]); \
}
// SegTree
template <class T> class SegTree {
int n; // 葉の数
vector<T> data; // データを格納するvector
T def; // 初期値かつ単位元
function<T(T, T)> operation; // 区間クエリで使う処理
function<T(T, T)> update; // 点更新で使う処理
// 区間[a,b)の総和。ノードk=[l,r)に着目している。
T _query(int a, int b, int k, int l, int r) {
if (r <= a || b <= l)
return def; // 交差しない
if (a <= l && r <= b)
return data[k]; // a,l,r,bの順で完全に含まれる
else {
T c1 = _query(a, b, 2 * k + 1, l, (l + r) / 2); // 左の子
T c2 = _query(a, b, 2 * k + 2, (l + r) / 2, r); // 右の子
return operation(c1, c2);
}
}
public:
// _n:必要サイズ, _def:初期値かつ単位元, _operation:クエリ関数,
// _update:更新関数
SegTree(size_t _n, T _def, function<T(T, T)> _operation,
function<T(T, T)> _update)
: def(_def), operation(_operation), update(_update) {
n = 1;
while (n < _n) {
n *= 2;
}
data = vector<T>(2 * n - 1, def);
}
// 場所i(0-indexed)の値をxで更新
void change(int i, T x) {
i += n - 1;
data[i] = update(data[i], x);
while (i > 0) {
i = (i - 1) / 2;
data[i] = operation(data[i * 2 + 1], data[i * 2 + 2]);
}
}
// [a, b)の区間クエリを実行
T query(int a, int b) { return _query(a, b, 0, 0, n); }
// 添字でアクセス
T operator[](int i) { return data[i + n - 1]; }
};
#define R_MIN ([](long long a, long long b) { return min(a, b); })
#define R_MAX ([](long long a, long long b) { return max(a, b); })
#define R_SUM ([](long long a, long long b) { return a + b; })
#define NORMAL_UPDATE ([](long long a, long long b) { return b; })
#define ADD_UPDATE ([](long long a, long long b) { return a + b; })
#define MINUS_UPDATE ([](long long a, long long b) { return a - b; }
class Union_Find {
vector<int> par;
vector<int> rankmy;
vector<int> ookisa;
public:
Union_Find(int size) {
par = vector<int>(size);
rankmy = vector<int>(size);
ookisa = vector<int>(size);
for (int i = 0; i < size; i++) {
par[i] = i;
ookisa[i] = 1;
}
}
int find(int x) {
if (par[x] == x) {
return x;
}
return par[x] = find(par[x]);
}
void unite(int x, int y) {
x = find(x);
y = find(y);
if (x == y) {
return;
}
if (rankmy[x] < rankmy[y]) {
par[x] = y;
ookisa[y] += ookisa[x];
ookisa[x] = 0;
} else {
par[y] = x;
ookisa[x] += ookisa[y];
ookisa[y] = 0;
if (rankmy[x] == rankmy[y]) {
rankmy[x]++;
}
}
}
int size(int i) {
i = find(i);
return ookisa[i];
}
bool same(int x, int y) { return find(x) == find(y); }
};
// Union-Find-End
#define endl "\n" // interactive の時に注意！！！
int n, a, b, c, d;
string s;
signed main() {
ios::sync_with_stdio(false);
std::cin.tie(nullptr);
cin >> n >> a >> b >> c >> d >> s;
for (int i = a - 1; i <= c - 2; i++) {
if (s[i] == s[i + 1] && s[i] == '#') {
No();
return 0;
}
}
for (int i = b - 1; i <= d - 2; i++) {
if (s[i] == s[i + 1] && s[i] == '#') {
No();
return 0;
}
}
if (c > d) {
for (int i = max(0ll, b - 2); i <= d - 3; i++) {
if (s[i] == s[i + 1] && s[i] == s[i + 2] && s[i] == '.') {
if (i + 3 < s.size()) {
if (s[i + 3] == '#' && b - 1 == i + 2) {
continue;
}
}
Yes();
return 0;
}
}
No();
} else
Yes();
}
| /*
* じょえチャンネル
* 高評価・チャンネル登録よろしくおねがいします！
* https://www.youtube.com/channel/UCRXsI3FL_kvaVL9zoolBfbQ
*/
#include <bits/stdc++.h>
//#pragma GCC target("avx2")
//#pragma GCC optimize("O3")
//#pragma GCC optimize("unroll-loops")
#define f(i, n) for (int i = 0; i < (n); i++)
#define inf (int)(3e18)
// here!!!
// define int long long !!!!!
#define int long long
// define int long long !!!!!
#define mod (int)((1e9) + 7)
#define intt long long
#define itn long long
#define P pair<int, int>
#define rep(i, n) for (int i = 0; i < n; i++)
#define REP(i, n) for (int i = 1; i <= n; i++)
#define ALL(v) v.begin(), v.end()
using namespace std;
// Library
//モッドパウ
inline int modpow(int x, int y, int m = mod) {
int res = 1;
while (y) {
if (y % 2) {
res *= x;
res %= m;
}
x = x * x % m;
y /= 2;
}
return res;
}
int mypow(int x, int y) {
int res = 1;
while (y) {
if (y % 2) {
res *= x;
}
x = x * x;
y /= 2;
}
return res;
}
// is the number (x) a prime number?
bool prime(int x) {
for (int i = 2; i * i <= x; i++) {
if (!(x % i)) {
return false;
}
}
return true;
}
// saidai-kouyakusuu
inline int gcd(int x, int y) {
if (!y) {
return x;
}
return gcd(y, x % y);
}
// number of keta
int keta(int x) {
int ans = 0;
while (x) {
x /= 10;
ans++;
}
return ans;
}
// sum of keta
int ketasum(int x) {
int ans = 0;
while (x) {
ans += x % 10;
x /= 10;
}
return ans;
}
inline int lcm(int x, int y) {
int ans = x / gcd(x, y) * y;
return ans;
}
int twobeki(int x) {
int ans = 0;
while (1) {
if (!(x & 1)) {
ans++;
x /= 2;
} else {
break;
}
}
return ans;
}
template <class T, class U> inline bool chmax(T &lhs, const U &rhs) {
if (lhs < rhs) {
lhs = rhs;
return 1;
}
return 0;
}
template <class T, class U> inline bool chmin(T &lhs, const U &rhs) {
if (lhs > rhs) {
lhs = rhs;
return 1;
}
return 0;
}
void Yes() { cout << "Yes" << endl; }
void No() { cout << "No" << endl; }
void YES() { cout << "YES" << endl; }
void NO() { cout << "NO" << endl; }
#define fin(i) scanf("%lld", &i)
#define fout(i) printf("%lld", i)
#define fendl printf("\n")
int kai(int x, int y) {
int res = 1;
for (int i = x - y + 1; i <= x; i++) {
res *= i;
res %= mod;
}
return res;
}
int comb(int x, int y) {
if (y > x)
return 0;
// cout<<kai(x, y)<<' '<<modpow(kai(y, y), mod - 2)<<endl;
return kai(x, y) * modpow(kai(y, y), mod - 2) % mod;
}
// Library-End
class modInt {
int value, modulo;
public:
modInt() : value(0), modulo(mod) { value = 0; }
template <typename T>
modInt(T value = 0, int modulo = mod) : value(value), modulo(modulo) {
if (value < 0) {
value = -value;
value %= modulo;
value = -value;
value += modulo;
}
this->value = value % modulo;
}
inline operator int() const { return value; }
inline modInt &operator+=(modInt x) {
value += x.value;
if (value >= modulo)
value -= modulo;
return *this;
}
inline modInt &operator++() {
if (value == modulo - 1)
value = 0;
else
value++;
return *this;
}
inline modInt &operator-() const { return modInt(0) -= *this; }
inline modInt &operator-=(modInt x) {
value -= x.value;
if (value < 0)
value += modulo;
return *this;
}
inline modInt &operator--() {
if (value == 0)
value = modulo - 1;
else
value--;
return *this;
}
inline modInt &operator*=(modInt x) {
value = value * x.value % modulo;
return *this;
}
inline modInt &operator/=(modInt x) { return operator*=(x.inv()); }
inline modInt inv() { return modpow(*this, modulo - 2); }
template <typename T> modInt operator+(T x) { return modInt(*this) += x; }
template <typename T> modInt &operator+=(T x) {
return operator+=(modInt(x, modulo));
}
template <typename T> modInt operator-(T x) { return modInt(*this) -= x; }
template <typename T> modInt &operator-=(T x) {
return operator-=(modInt(x, modulo));
}
template <typename T> modInt operator*(T x) { return modInt(*this) *= x; }
template <typename T> modInt &operator*=(T x) {
return operator*=(modInt(x, modulo));
}
template <typename T> modInt operator/(T x) { return modInt(*this) /= x; }
template <typename T> modInt &operator/=(T x) {
return operator/=(modInt(x, modulo));
}
};
istream &operator>>(istream &ist, modInt &x) {
int a;
ist >> a;
x = a;
return ist;
}
#define vecin(v) \
for (int i = 0; i < v.size(); i++) \
scanf("%lld", &v[i]);
#define vecout(v) \
{ \
for (int i = 0; i < v.size(); i++) \
printf("%lld\n", v[i]); \
}
// SegTree
template <class T> class SegTree {
int n; // 葉の数
vector<T> data; // データを格納するvector
T def; // 初期値かつ単位元
function<T(T, T)> operation; // 区間クエリで使う処理
function<T(T, T)> update; // 点更新で使う処理
// 区間[a,b)の総和。ノードk=[l,r)に着目している。
T _query(int a, int b, int k, int l, int r) {
if (r <= a || b <= l)
return def; // 交差しない
if (a <= l && r <= b)
return data[k]; // a,l,r,bの順で完全に含まれる
else {
T c1 = _query(a, b, 2 * k + 1, l, (l + r) / 2); // 左の子
T c2 = _query(a, b, 2 * k + 2, (l + r) / 2, r); // 右の子
return operation(c1, c2);
}
}
public:
// _n:必要サイズ, _def:初期値かつ単位元, _operation:クエリ関数,
// _update:更新関数
SegTree(size_t _n, T _def, function<T(T, T)> _operation,
function<T(T, T)> _update)
: def(_def), operation(_operation), update(_update) {
n = 1;
while (n < _n) {
n *= 2;
}
data = vector<T>(2 * n - 1, def);
}
// 場所i(0-indexed)の値をxで更新
void change(int i, T x) {
i += n - 1;
data[i] = update(data[i], x);
while (i > 0) {
i = (i - 1) / 2;
data[i] = operation(data[i * 2 + 1], data[i * 2 + 2]);
}
}
// [a, b)の区間クエリを実行
T query(int a, int b) { return _query(a, b, 0, 0, n); }
// 添字でアクセス
T operator[](int i) { return data[i + n - 1]; }
};
#define R_MIN ([](long long a, long long b) { return min(a, b); })
#define R_MAX ([](long long a, long long b) { return max(a, b); })
#define R_SUM ([](long long a, long long b) { return a + b; })
#define NORMAL_UPDATE ([](long long a, long long b) { return b; })
#define ADD_UPDATE ([](long long a, long long b) { return a + b; })
#define MINUS_UPDATE ([](long long a, long long b) { return a - b; }
class Union_Find {
vector<int> par;
vector<int> rankmy;
vector<int> ookisa;
public:
Union_Find(int size) {
par = vector<int>(size);
rankmy = vector<int>(size);
ookisa = vector<int>(size);
for (int i = 0; i < size; i++) {
par[i] = i;
ookisa[i] = 1;
}
}
int find(int x) {
if (par[x] == x) {
return x;
}
return par[x] = find(par[x]);
}
void unite(int x, int y) {
x = find(x);
y = find(y);
if (x == y) {
return;
}
if (rankmy[x] < rankmy[y]) {
par[x] = y;
ookisa[y] += ookisa[x];
ookisa[x] = 0;
} else {
par[y] = x;
ookisa[x] += ookisa[y];
ookisa[y] = 0;
if (rankmy[x] == rankmy[y]) {
rankmy[x]++;
}
}
}
int size(int i) {
i = find(i);
return ookisa[i];
}
bool same(int x, int y) { return find(x) == find(y); }
};
// Union-Find-End
#define endl "\n" // interactive の時に注意！！！
int n, a, b, c, d;
string s;
signed main() {
ios::sync_with_stdio(false);
std::cin.tie(nullptr);
cin >> n >> a >> b >> c >> d >> s;
for (int i = a - 1; i <= c - 2; i++) {
if (s[i] == s[i + 1] && s[i] == '#') {
No();
return 0;
}
}
for (int i = b - 1; i <= d - 2; i++) {
if (s[i] == s[i + 1] && s[i] == '#') {
No();
return 0;
}
}
if (c > d) {
for (int i = max(0ll, b - 2); i <= d - 2; i++) {
if (s[i] == s[i + 1] && s[i] == s[i + 2] && s[i] == '.') {
if (i + 3 < s.size()) {
if (s[i + 3] == '#' && b - 1 == i + 2) {
continue;
}
}
Yes();
return 0;
}
}
No();
} else
Yes();
}
| [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 839,672 | 839,671 | u943070796 | cpp |
p03017 | // AtCoder.cpp : このファイルには 'main'
// 関数が含まれています。プログラム実行の開始と終了がそこで行われます。
//
// AtCoder.cpp : このファイルには 'main'
// 関数が含まれています。プログラム実行の開始と終了がそこで行われます。
//
#ifndef ONLINE_JUDGE
#endif
#define _USE_MATH_DEFINES
#include <math.h>
//#include<cmath>
#include <algorithm>
#include <array>
#include <assert.h>
#include <bitset>
#include <chrono>
#include <cmath>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <memory>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_set>
#include <vector>
#pragma GCC optimize("Ofast")
//#include "Ants.h"
using namespace std;
typedef long long ll;
#define rad_to_deg(rad) (((rad) / 2 / M_PI) * 360)
#define EPS (1e-7)
#define INF (1e9)
#define PI (acos(-1))
#define rep(i, n) for (int i = 0; i < n; i++)
#define show(s) cout << s << endl
#define chmin(x, y) x = min(x, y)
#define chmax(x, y) x = max(x, y)
#define LINF (1LL << 50)
#define MOD (1e9 + 7)
#define rep1(i, n) for (int i = 1; i <= n; i++)
#define rrep(i, n) for (int i = n - 1; i >= 0; --i)
typedef pair<ll, ll> P;
ll gcd(ll a, ll b) { //最大公約数を求める///最大公倍数a*b/gcd(a,b)
if (b == 0)
return a;
return gcd(b, a % b);
}
ll lcd(ll a, ll b) { //最小公倍数を求める b=0のときaを返す
if (b == 0)
return a;
return (a / gcd(a, b)) * b;
}
vector<int> divnum(ll num) {
int dig;
vector<int> p;
while (num) {
dig = num % 10;
p.push_back(dig);
num /= 10;
}
return p;
}
int digiter(ll num) {
int dig;
vector<int> p;
while (num) {
dig = num % 10;
p.push_back(dig);
num /= 10;
}
return p.size();
}
vector<int> convertstring(string s) {
vector<int> d;
ll n = s.size();
rep(i, n) { d.push_back(s[i] - '0'); }
return d;
}
map<ll, int> prime_factor(ll n) {
map<ll, int> ret;
for (ll i = 2; i * i <= n; i++) {
while (n % i == 0) {
ret[i]++;
n /= i;
}
}
if (n != 1)
ret[n] = 1;
return ret;
}
vector<ll> Enumeration(ll n) {
vector<ll> res;
for (ll i = 1; i * i <= n; i++) {
if (n % i != 0)
continue;
res.push_back(i);
if (i * i != n)
res.push_back(n / i);
}
return res;
}
ll myPow(ll x, ll n, ll m) { // x^n
if (n == 0)
return 1;
if (n % 2 == 0)
return myPow(x * x % m, n / 2, m);
else
return x * myPow(x, n - 1, m) % m;
}
std::vector<int> Eratosthenes(const int N) //素数列挙
{
std::vector<bool> is_prime(N + 1);
for (int i = 0; i <= N; i++) {
is_prime[i] = true;
}
std::vector<int> P;
for (int i = 2; i <= N; i++) {
if (is_prime[i]) {
for (int j = 2 * i; j <= N; j += i) {
is_prime[j] = false;
}
P.emplace_back(i);
}
}
return P;
}
const ll mod = MOD;
struct mint {
ll x; // typedef long long ll;
mint(ll x = 0) : x((x % mod + mod) % mod) {}
mint operator-() const { return mint(-x); }
mint &operator+=(const mint a) {
if ((x += a.x) >= mod)
x -= mod;
return *this;
}
mint &operator-=(const mint a) {
if ((x += mod - a.x) >= mod)
x -= mod;
return *this;
}
mint &operator*=(const mint a) {
(x *= a.x) %= mod;
return *this;
}
mint operator+(const mint a) const { return mint(*this) += a; }
mint operator-(const mint a) const { return mint(*this) -= a; }
mint operator*(const mint a) const { return mint(*this) *= a; }
mint pow(ll t) const {
if (!t)
return 1;
mint a = pow(t >> 1);
a *= a;
if (t & 1)
a *= *this;
return a;
}
// for prime mod
mint inv() const { return pow(mod - 2); }
mint &operator/=(const mint a) { return *this *= a.inv(); }
mint operator/(const mint a) const { return mint(*this) /= a; }
// operator long long() const { return x; }
};
istream &operator>>(istream &is, const mint &a) { return is >> a.x; }
ostream &operator<<(ostream &os, const mint &a) { return os << a.x; }
struct combination { // comb(a,b)でよぶaCb
vector<mint> fact, ifact;
combination(ll n) : fact(n + 1), ifact(n + 1) {
assert(n < mod);
fact[0] = 1;
for (ll i = 1; i <= n; ++i)
fact[i] = fact[i - 1] * i;
ifact[n] = fact[n].inv();
for (ll i = n; i >= 1; --i)
ifact[i - 1] = ifact[i] * i;
}
mint operator()(ll n, ll k) {
if (k < 0 || k > n)
return 0;
return fact[n] * ifact[k] * ifact[n - k];
}
} comb(1000005); // comb貯め
mint f(ll n, ll k) {
if (n < 0)
return 0;
// nPk = nCk * k!
mint res = comb(n, k);
res *= comb.fact[k];
return res;
}
struct SegmentTree {
private:
int n;
vector<int> node;
public:
SegmentTree(vector<int> v) { // SegmentTree seg(vector<int>(N,INF))で呼び出し
int sz = v.size();
n = 1;
while (n < sz)
n *= 2;
node.resize(2 * n - 1, INF);
for (int i = 0; i < sz; i++)
node[i + n - 1] = v[i];
for (int i = n - 2; i >= 0; i--)
node[i] = min(node[2 * i + 1], node[2 * i + 2]);
}
void update(int x, int val) {
x += (n - 1);
node[x] = val;
while (x > 0) {
x = (x - 1) / 2;
node[x] = min(node[2 * x + 1], node[2 * x + 2]);
}
}
int getmin(int a, int b, int k = 0, int l = 0, int r = -1) {
if (r < 0)
r = n;
if (r <= a || b <= l)
return INF;
if (a <= l && r <= b)
return node[k];
int vl = getmin(a, b, 2 * k + 1, l, (l + r) / 2);
int vr = getmin(a, b, 2 * k + 2, (l + r) / 2, r);
return min(vl, vr);
}
};
// 1-indexedなので注意。
struct BIT {
private:
vector<int> bit;
int N;
public:
BIT(int size) {
N = size;
bit.resize(N + 1);
}
// 一点更新です
void add(int a, int w) { // a番目をwに更新
for (int x = a; x <= N; x += x & -x)
bit[x] += w;
}
// 1~Nまでの和を求める。
int sum(int a) {
int ret = 0;
for (int x = a; x > 0; x -= x & -x)
ret += bit[x];
return ret;
}
};
/****Union-Ford-Tree***/
/*int par[int(0x7ffffff)];//Parent
int Rank[int(0x7ffffff)];//Deep_of_the_Tree
//int a[100] = { 4,2,3,1,5 }, m[100] ={3,2,2};
//int n = 0;
//const ll mod = 1000000007;
//n要素で初期化
void init(int n) {
for (int i = 0; i < n; i++) {
par[i] = i;
Rank[i] = 0;
}
}
//木の根探し
int find(int x) {
if (par[x] == x) {
return x;
}
else {
return par[x] = find(par[x]);
}
}
//xとyの属する集合を併合
void unite(int x, int y) {
x = find(x);
y = find(y);
if (x == y)return;
if (Rank[x] < Rank[y]) {
par[x] = y;
}
else {
par[y] = x;
if (Rank[x] == Rank[y])Rank[x]++;
}
}
bool same(int x, int y) {
return find(x) == find(y);
}*/
// queue古い順,stack新しい順
/************************************************************************************/
int N, A, B, C, D;
string S;
int32_t main() {
cin >> N >> A >> B >> C >> D >> S;
S += '#' + S + '#';
auto can_reach = [&](int s, int t) {
for (int i = s; i < t; i++) {
if (S[i] == '#' && S[i] == S[i + 1])
return false;
}
return true;
};
if (D > C) {
if (can_reach(A, C) && can_reach(B, D)) {
cout << "Yes" << endl;
} else
cout << "No" << endl;
return 0;
}
if (C > D) {
if (can_reach(A, C) && can_reach(B, D)) {
for (int i = B; i <= D; i++) {
if (S[i - 1] == '.' && S[i] == '.' && S[i + 1] == '.') {
cout << "Yes" << endl;
return 0;
}
}
}
cout << "No" << endl;
return 0;
}
cout << "Yes" << endl;
} | // AtCoder.cpp : このファイルには 'main'
// 関数が含まれています。プログラム実行の開始と終了がそこで行われます。
//
// AtCoder.cpp : このファイルには 'main'
// 関数が含まれています。プログラム実行の開始と終了がそこで行われます。
//
#ifndef ONLINE_JUDGE
#endif
#define _USE_MATH_DEFINES
#include <math.h>
//#include<cmath>
#include <algorithm>
#include <array>
#include <assert.h>
#include <bitset>
#include <chrono>
#include <cmath>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <memory>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_set>
#include <vector>
#pragma GCC optimize("Ofast")
//#include "Ants.h"
using namespace std;
typedef long long ll;
#define rad_to_deg(rad) (((rad) / 2 / M_PI) * 360)
#define EPS (1e-7)
#define INF (1e9)
#define PI (acos(-1))
#define rep(i, n) for (int i = 0; i < n; i++)
#define show(s) cout << s << endl
#define chmin(x, y) x = min(x, y)
#define chmax(x, y) x = max(x, y)
#define LINF (1LL << 50)
#define MOD (1e9 + 7)
#define rep1(i, n) for (int i = 1; i <= n; i++)
#define rrep(i, n) for (int i = n - 1; i >= 0; --i)
typedef pair<ll, ll> P;
ll gcd(ll a, ll b) { //最大公約数を求める///最大公倍数a*b/gcd(a,b)
if (b == 0)
return a;
return gcd(b, a % b);
}
ll lcd(ll a, ll b) { //最小公倍数を求める b=0のときaを返す
if (b == 0)
return a;
return (a / gcd(a, b)) * b;
}
vector<int> divnum(ll num) {
int dig;
vector<int> p;
while (num) {
dig = num % 10;
p.push_back(dig);
num /= 10;
}
return p;
}
int digiter(ll num) {
int dig;
vector<int> p;
while (num) {
dig = num % 10;
p.push_back(dig);
num /= 10;
}
return p.size();
}
vector<int> convertstring(string s) {
vector<int> d;
ll n = s.size();
rep(i, n) { d.push_back(s[i] - '0'); }
return d;
}
map<ll, int> prime_factor(ll n) {
map<ll, int> ret;
for (ll i = 2; i * i <= n; i++) {
while (n % i == 0) {
ret[i]++;
n /= i;
}
}
if (n != 1)
ret[n] = 1;
return ret;
}
vector<ll> Enumeration(ll n) {
vector<ll> res;
for (ll i = 1; i * i <= n; i++) {
if (n % i != 0)
continue;
res.push_back(i);
if (i * i != n)
res.push_back(n / i);
}
return res;
}
ll myPow(ll x, ll n, ll m) { // x^n
if (n == 0)
return 1;
if (n % 2 == 0)
return myPow(x * x % m, n / 2, m);
else
return x * myPow(x, n - 1, m) % m;
}
std::vector<int> Eratosthenes(const int N) //素数列挙
{
std::vector<bool> is_prime(N + 1);
for (int i = 0; i <= N; i++) {
is_prime[i] = true;
}
std::vector<int> P;
for (int i = 2; i <= N; i++) {
if (is_prime[i]) {
for (int j = 2 * i; j <= N; j += i) {
is_prime[j] = false;
}
P.emplace_back(i);
}
}
return P;
}
const ll mod = MOD;
struct mint {
ll x; // typedef long long ll;
mint(ll x = 0) : x((x % mod + mod) % mod) {}
mint operator-() const { return mint(-x); }
mint &operator+=(const mint a) {
if ((x += a.x) >= mod)
x -= mod;
return *this;
}
mint &operator-=(const mint a) {
if ((x += mod - a.x) >= mod)
x -= mod;
return *this;
}
mint &operator*=(const mint a) {
(x *= a.x) %= mod;
return *this;
}
mint operator+(const mint a) const { return mint(*this) += a; }
mint operator-(const mint a) const { return mint(*this) -= a; }
mint operator*(const mint a) const { return mint(*this) *= a; }
mint pow(ll t) const {
if (!t)
return 1;
mint a = pow(t >> 1);
a *= a;
if (t & 1)
a *= *this;
return a;
}
// for prime mod
mint inv() const { return pow(mod - 2); }
mint &operator/=(const mint a) { return *this *= a.inv(); }
mint operator/(const mint a) const { return mint(*this) /= a; }
// operator long long() const { return x; }
};
istream &operator>>(istream &is, const mint &a) { return is >> a.x; }
ostream &operator<<(ostream &os, const mint &a) { return os << a.x; }
struct combination { // comb(a,b)でよぶaCb
vector<mint> fact, ifact;
combination(ll n) : fact(n + 1), ifact(n + 1) {
assert(n < mod);
fact[0] = 1;
for (ll i = 1; i <= n; ++i)
fact[i] = fact[i - 1] * i;
ifact[n] = fact[n].inv();
for (ll i = n; i >= 1; --i)
ifact[i - 1] = ifact[i] * i;
}
mint operator()(ll n, ll k) {
if (k < 0 || k > n)
return 0;
return fact[n] * ifact[k] * ifact[n - k];
}
} comb(1000005); // comb貯め
mint f(ll n, ll k) {
if (n < 0)
return 0;
// nPk = nCk * k!
mint res = comb(n, k);
res *= comb.fact[k];
return res;
}
struct SegmentTree {
private:
int n;
vector<int> node;
public:
SegmentTree(vector<int> v) { // SegmentTree seg(vector<int>(N,INF))で呼び出し
int sz = v.size();
n = 1;
while (n < sz)
n *= 2;
node.resize(2 * n - 1, INF);
for (int i = 0; i < sz; i++)
node[i + n - 1] = v[i];
for (int i = n - 2; i >= 0; i--)
node[i] = min(node[2 * i + 1], node[2 * i + 2]);
}
void update(int x, int val) {
x += (n - 1);
node[x] = val;
while (x > 0) {
x = (x - 1) / 2;
node[x] = min(node[2 * x + 1], node[2 * x + 2]);
}
}
int getmin(int a, int b, int k = 0, int l = 0, int r = -1) {
if (r < 0)
r = n;
if (r <= a || b <= l)
return INF;
if (a <= l && r <= b)
return node[k];
int vl = getmin(a, b, 2 * k + 1, l, (l + r) / 2);
int vr = getmin(a, b, 2 * k + 2, (l + r) / 2, r);
return min(vl, vr);
}
};
// 1-indexedなので注意。
struct BIT {
private:
vector<int> bit;
int N;
public:
BIT(int size) {
N = size;
bit.resize(N + 1);
}
// 一点更新です
void add(int a, int w) { // a番目をwに更新
for (int x = a; x <= N; x += x & -x)
bit[x] += w;
}
// 1~Nまでの和を求める。
int sum(int a) {
int ret = 0;
for (int x = a; x > 0; x -= x & -x)
ret += bit[x];
return ret;
}
};
/****Union-Ford-Tree***/
/*int par[int(0x7ffffff)];//Parent
int Rank[int(0x7ffffff)];//Deep_of_the_Tree
//int a[100] = { 4,2,3,1,5 }, m[100] ={3,2,2};
//int n = 0;
//const ll mod = 1000000007;
//n要素で初期化
void init(int n) {
for (int i = 0; i < n; i++) {
par[i] = i;
Rank[i] = 0;
}
}
//木の根探し
int find(int x) {
if (par[x] == x) {
return x;
}
else {
return par[x] = find(par[x]);
}
}
//xとyの属する集合を併合
void unite(int x, int y) {
x = find(x);
y = find(y);
if (x == y)return;
if (Rank[x] < Rank[y]) {
par[x] = y;
}
else {
par[y] = x;
if (Rank[x] == Rank[y])Rank[x]++;
}
}
bool same(int x, int y) {
return find(x) == find(y);
}*/
// queue古い順,stack新しい順
/************************************************************************************/
int N, A, B, C, D;
string S;
int32_t main() {
cin >> N >> A >> B >> C >> D >> S;
S = '#' + S + '#';
auto can_reach = [&](int s, int t) {
for (int i = s; i < t; i++) {
if (S[i] == '#' && S[i] == S[i + 1])
return false;
}
return true;
};
if (D > C) {
if (can_reach(A, C) && can_reach(B, D)) {
cout << "Yes" << endl;
} else
cout << "No" << endl;
return 0;
}
if (C > D) {
if (can_reach(A, C) && can_reach(B, D)) {
for (int i = B; i <= D; i++) {
if (S[i - 1] == '.' && S[i] == '.' && S[i + 1] == '.') {
cout << "Yes" << endl;
return 0;
}
}
}
cout << "No" << endl;
return 0;
}
cout << "No" << endl;
} | [
"assignment.value.change",
"literal.string.change",
"io.output.change"
] | 839,678 | 839,679 | u338903636 | cpp |
p03017 | // AtCoder.cpp : このファイルには 'main'
// 関数が含まれています。プログラム実行の開始と終了がそこで行われます。
//
// AtCoder.cpp : このファイルには 'main'
// 関数が含まれています。プログラム実行の開始と終了がそこで行われます。
//
#ifndef ONLINE_JUDGE
#endif
#define _USE_MATH_DEFINES
#include <math.h>
//#include<cmath>
#include <algorithm>
#include <array>
#include <assert.h>
#include <bitset>
#include <chrono>
#include <cmath>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <memory>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_set>
#include <vector>
#pragma GCC optimize("Ofast")
//#include "Ants.h"
using namespace std;
typedef long long ll;
#define rad_to_deg(rad) (((rad) / 2 / M_PI) * 360)
#define EPS (1e-7)
#define INF (1e9)
#define PI (acos(-1))
#define rep(i, n) for (int i = 0; i < n; i++)
#define show(s) cout << s << endl
#define chmin(x, y) x = min(x, y)
#define chmax(x, y) x = max(x, y)
#define LINF (1LL << 50)
#define MOD (1e9 + 7)
#define rep1(i, n) for (int i = 1; i <= n; i++)
#define rrep(i, n) for (int i = n - 1; i >= 0; --i)
typedef pair<ll, ll> P;
ll gcd(ll a, ll b) { //最大公約数を求める///最大公倍数a*b/gcd(a,b)
if (b == 0)
return a;
return gcd(b, a % b);
}
ll lcd(ll a, ll b) { //最小公倍数を求める b=0のときaを返す
if (b == 0)
return a;
return (a / gcd(a, b)) * b;
}
vector<int> divnum(ll num) {
int dig;
vector<int> p;
while (num) {
dig = num % 10;
p.push_back(dig);
num /= 10;
}
return p;
}
int digiter(ll num) {
int dig;
vector<int> p;
while (num) {
dig = num % 10;
p.push_back(dig);
num /= 10;
}
return p.size();
}
vector<int> convertstring(string s) {
vector<int> d;
ll n = s.size();
rep(i, n) { d.push_back(s[i] - '0'); }
return d;
}
map<ll, int> prime_factor(ll n) {
map<ll, int> ret;
for (ll i = 2; i * i <= n; i++) {
while (n % i == 0) {
ret[i]++;
n /= i;
}
}
if (n != 1)
ret[n] = 1;
return ret;
}
vector<ll> Enumeration(ll n) {
vector<ll> res;
for (ll i = 1; i * i <= n; i++) {
if (n % i != 0)
continue;
res.push_back(i);
if (i * i != n)
res.push_back(n / i);
}
return res;
}
ll myPow(ll x, ll n, ll m) { // x^n
if (n == 0)
return 1;
if (n % 2 == 0)
return myPow(x * x % m, n / 2, m);
else
return x * myPow(x, n - 1, m) % m;
}
std::vector<int> Eratosthenes(const int N) //素数列挙
{
std::vector<bool> is_prime(N + 1);
for (int i = 0; i <= N; i++) {
is_prime[i] = true;
}
std::vector<int> P;
for (int i = 2; i <= N; i++) {
if (is_prime[i]) {
for (int j = 2 * i; j <= N; j += i) {
is_prime[j] = false;
}
P.emplace_back(i);
}
}
return P;
}
const ll mod = MOD;
struct mint {
ll x; // typedef long long ll;
mint(ll x = 0) : x((x % mod + mod) % mod) {}
mint operator-() const { return mint(-x); }
mint &operator+=(const mint a) {
if ((x += a.x) >= mod)
x -= mod;
return *this;
}
mint &operator-=(const mint a) {
if ((x += mod - a.x) >= mod)
x -= mod;
return *this;
}
mint &operator*=(const mint a) {
(x *= a.x) %= mod;
return *this;
}
mint operator+(const mint a) const { return mint(*this) += a; }
mint operator-(const mint a) const { return mint(*this) -= a; }
mint operator*(const mint a) const { return mint(*this) *= a; }
mint pow(ll t) const {
if (!t)
return 1;
mint a = pow(t >> 1);
a *= a;
if (t & 1)
a *= *this;
return a;
}
// for prime mod
mint inv() const { return pow(mod - 2); }
mint &operator/=(const mint a) { return *this *= a.inv(); }
mint operator/(const mint a) const { return mint(*this) /= a; }
// operator long long() const { return x; }
};
istream &operator>>(istream &is, const mint &a) { return is >> a.x; }
ostream &operator<<(ostream &os, const mint &a) { return os << a.x; }
struct combination { // comb(a,b)でよぶaCb
vector<mint> fact, ifact;
combination(ll n) : fact(n + 1), ifact(n + 1) {
assert(n < mod);
fact[0] = 1;
for (ll i = 1; i <= n; ++i)
fact[i] = fact[i - 1] * i;
ifact[n] = fact[n].inv();
for (ll i = n; i >= 1; --i)
ifact[i - 1] = ifact[i] * i;
}
mint operator()(ll n, ll k) {
if (k < 0 || k > n)
return 0;
return fact[n] * ifact[k] * ifact[n - k];
}
} comb(1000005); // comb貯め
mint f(ll n, ll k) {
if (n < 0)
return 0;
// nPk = nCk * k!
mint res = comb(n, k);
res *= comb.fact[k];
return res;
}
struct SegmentTree {
private:
int n;
vector<int> node;
public:
SegmentTree(vector<int> v) { // SegmentTree seg(vector<int>(N,INF))で呼び出し
int sz = v.size();
n = 1;
while (n < sz)
n *= 2;
node.resize(2 * n - 1, INF);
for (int i = 0; i < sz; i++)
node[i + n - 1] = v[i];
for (int i = n - 2; i >= 0; i--)
node[i] = min(node[2 * i + 1], node[2 * i + 2]);
}
void update(int x, int val) {
x += (n - 1);
node[x] = val;
while (x > 0) {
x = (x - 1) / 2;
node[x] = min(node[2 * x + 1], node[2 * x + 2]);
}
}
int getmin(int a, int b, int k = 0, int l = 0, int r = -1) {
if (r < 0)
r = n;
if (r <= a || b <= l)
return INF;
if (a <= l && r <= b)
return node[k];
int vl = getmin(a, b, 2 * k + 1, l, (l + r) / 2);
int vr = getmin(a, b, 2 * k + 2, (l + r) / 2, r);
return min(vl, vr);
}
};
// 1-indexedなので注意。
struct BIT {
private:
vector<int> bit;
int N;
public:
BIT(int size) {
N = size;
bit.resize(N + 1);
}
// 一点更新です
void add(int a, int w) { // a番目をwに更新
for (int x = a; x <= N; x += x & -x)
bit[x] += w;
}
// 1~Nまでの和を求める。
int sum(int a) {
int ret = 0;
for (int x = a; x > 0; x -= x & -x)
ret += bit[x];
return ret;
}
};
/****Union-Ford-Tree***/
/*int par[int(0x7ffffff)];//Parent
int Rank[int(0x7ffffff)];//Deep_of_the_Tree
//int a[100] = { 4,2,3,1,5 }, m[100] ={3,2,2};
//int n = 0;
//const ll mod = 1000000007;
//n要素で初期化
void init(int n) {
for (int i = 0; i < n; i++) {
par[i] = i;
Rank[i] = 0;
}
}
//木の根探し
int find(int x) {
if (par[x] == x) {
return x;
}
else {
return par[x] = find(par[x]);
}
}
//xとyの属する集合を併合
void unite(int x, int y) {
x = find(x);
y = find(y);
if (x == y)return;
if (Rank[x] < Rank[y]) {
par[x] = y;
}
else {
par[y] = x;
if (Rank[x] == Rank[y])Rank[x]++;
}
}
bool same(int x, int y) {
return find(x) == find(y);
}*/
// queue古い順,stack新しい順
/************************************************************************************/
int N, A, B, C, D;
string S;
int32_t main() {
cin >> N >> A >> B >> C >> D >> S;
S += '#' + S + '#';
auto can_reach = [&](int s, int t) {
for (int i = s; i < t; i++) {
if (S[i] == '#' && S[i] == S[i + 1])
return false;
}
return true;
};
if (D > C) {
if (can_reach(A, C) && can_reach(B, D)) {
cout << "Yes" << endl;
} else
cout << "No" << endl;
return 0;
}
if (C > D) {
if (can_reach(A, C) && can_reach(B, D)) {
for (int i = B; i <= D; i++) {
if (S[i - 1] == '.' && S[i] == '.' && S[i + 1] == '.') {
cout << "Yes" << endl;
return 0;
}
}
}
cout << "No" << endl;
return 0;
}
cout << "No" << endl;
} | // AtCoder.cpp : このファイルには 'main'
// 関数が含まれています。プログラム実行の開始と終了がそこで行われます。
//
// AtCoder.cpp : このファイルには 'main'
// 関数が含まれています。プログラム実行の開始と終了がそこで行われます。
//
#ifndef ONLINE_JUDGE
#endif
#define _USE_MATH_DEFINES
#include <math.h>
//#include<cmath>
#include <algorithm>
#include <array>
#include <assert.h>
#include <bitset>
#include <chrono>
#include <cmath>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <memory>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_set>
#include <vector>
#pragma GCC optimize("Ofast")
//#include "Ants.h"
using namespace std;
typedef long long ll;
#define rad_to_deg(rad) (((rad) / 2 / M_PI) * 360)
#define EPS (1e-7)
#define INF (1e9)
#define PI (acos(-1))
#define rep(i, n) for (int i = 0; i < n; i++)
#define show(s) cout << s << endl
#define chmin(x, y) x = min(x, y)
#define chmax(x, y) x = max(x, y)
#define LINF (1LL << 50)
#define MOD (1e9 + 7)
#define rep1(i, n) for (int i = 1; i <= n; i++)
#define rrep(i, n) for (int i = n - 1; i >= 0; --i)
typedef pair<ll, ll> P;
ll gcd(ll a, ll b) { //最大公約数を求める///最大公倍数a*b/gcd(a,b)
if (b == 0)
return a;
return gcd(b, a % b);
}
ll lcd(ll a, ll b) { //最小公倍数を求める b=0のときaを返す
if (b == 0)
return a;
return (a / gcd(a, b)) * b;
}
vector<int> divnum(ll num) {
int dig;
vector<int> p;
while (num) {
dig = num % 10;
p.push_back(dig);
num /= 10;
}
return p;
}
int digiter(ll num) {
int dig;
vector<int> p;
while (num) {
dig = num % 10;
p.push_back(dig);
num /= 10;
}
return p.size();
}
vector<int> convertstring(string s) {
vector<int> d;
ll n = s.size();
rep(i, n) { d.push_back(s[i] - '0'); }
return d;
}
map<ll, int> prime_factor(ll n) {
map<ll, int> ret;
for (ll i = 2; i * i <= n; i++) {
while (n % i == 0) {
ret[i]++;
n /= i;
}
}
if (n != 1)
ret[n] = 1;
return ret;
}
vector<ll> Enumeration(ll n) {
vector<ll> res;
for (ll i = 1; i * i <= n; i++) {
if (n % i != 0)
continue;
res.push_back(i);
if (i * i != n)
res.push_back(n / i);
}
return res;
}
ll myPow(ll x, ll n, ll m) { // x^n
if (n == 0)
return 1;
if (n % 2 == 0)
return myPow(x * x % m, n / 2, m);
else
return x * myPow(x, n - 1, m) % m;
}
std::vector<int> Eratosthenes(const int N) //素数列挙
{
std::vector<bool> is_prime(N + 1);
for (int i = 0; i <= N; i++) {
is_prime[i] = true;
}
std::vector<int> P;
for (int i = 2; i <= N; i++) {
if (is_prime[i]) {
for (int j = 2 * i; j <= N; j += i) {
is_prime[j] = false;
}
P.emplace_back(i);
}
}
return P;
}
const ll mod = MOD;
struct mint {
ll x; // typedef long long ll;
mint(ll x = 0) : x((x % mod + mod) % mod) {}
mint operator-() const { return mint(-x); }
mint &operator+=(const mint a) {
if ((x += a.x) >= mod)
x -= mod;
return *this;
}
mint &operator-=(const mint a) {
if ((x += mod - a.x) >= mod)
x -= mod;
return *this;
}
mint &operator*=(const mint a) {
(x *= a.x) %= mod;
return *this;
}
mint operator+(const mint a) const { return mint(*this) += a; }
mint operator-(const mint a) const { return mint(*this) -= a; }
mint operator*(const mint a) const { return mint(*this) *= a; }
mint pow(ll t) const {
if (!t)
return 1;
mint a = pow(t >> 1);
a *= a;
if (t & 1)
a *= *this;
return a;
}
// for prime mod
mint inv() const { return pow(mod - 2); }
mint &operator/=(const mint a) { return *this *= a.inv(); }
mint operator/(const mint a) const { return mint(*this) /= a; }
// operator long long() const { return x; }
};
istream &operator>>(istream &is, const mint &a) { return is >> a.x; }
ostream &operator<<(ostream &os, const mint &a) { return os << a.x; }
struct combination { // comb(a,b)でよぶaCb
vector<mint> fact, ifact;
combination(ll n) : fact(n + 1), ifact(n + 1) {
assert(n < mod);
fact[0] = 1;
for (ll i = 1; i <= n; ++i)
fact[i] = fact[i - 1] * i;
ifact[n] = fact[n].inv();
for (ll i = n; i >= 1; --i)
ifact[i - 1] = ifact[i] * i;
}
mint operator()(ll n, ll k) {
if (k < 0 || k > n)
return 0;
return fact[n] * ifact[k] * ifact[n - k];
}
} comb(1000005); // comb貯め
mint f(ll n, ll k) {
if (n < 0)
return 0;
// nPk = nCk * k!
mint res = comb(n, k);
res *= comb.fact[k];
return res;
}
struct SegmentTree {
private:
int n;
vector<int> node;
public:
SegmentTree(vector<int> v) { // SegmentTree seg(vector<int>(N,INF))で呼び出し
int sz = v.size();
n = 1;
while (n < sz)
n *= 2;
node.resize(2 * n - 1, INF);
for (int i = 0; i < sz; i++)
node[i + n - 1] = v[i];
for (int i = n - 2; i >= 0; i--)
node[i] = min(node[2 * i + 1], node[2 * i + 2]);
}
void update(int x, int val) {
x += (n - 1);
node[x] = val;
while (x > 0) {
x = (x - 1) / 2;
node[x] = min(node[2 * x + 1], node[2 * x + 2]);
}
}
int getmin(int a, int b, int k = 0, int l = 0, int r = -1) {
if (r < 0)
r = n;
if (r <= a || b <= l)
return INF;
if (a <= l && r <= b)
return node[k];
int vl = getmin(a, b, 2 * k + 1, l, (l + r) / 2);
int vr = getmin(a, b, 2 * k + 2, (l + r) / 2, r);
return min(vl, vr);
}
};
// 1-indexedなので注意。
struct BIT {
private:
vector<int> bit;
int N;
public:
BIT(int size) {
N = size;
bit.resize(N + 1);
}
// 一点更新です
void add(int a, int w) { // a番目をwに更新
for (int x = a; x <= N; x += x & -x)
bit[x] += w;
}
// 1~Nまでの和を求める。
int sum(int a) {
int ret = 0;
for (int x = a; x > 0; x -= x & -x)
ret += bit[x];
return ret;
}
};
/****Union-Ford-Tree***/
/*int par[int(0x7ffffff)];//Parent
int Rank[int(0x7ffffff)];//Deep_of_the_Tree
//int a[100] = { 4,2,3,1,5 }, m[100] ={3,2,2};
//int n = 0;
//const ll mod = 1000000007;
//n要素で初期化
void init(int n) {
for (int i = 0; i < n; i++) {
par[i] = i;
Rank[i] = 0;
}
}
//木の根探し
int find(int x) {
if (par[x] == x) {
return x;
}
else {
return par[x] = find(par[x]);
}
}
//xとyの属する集合を併合
void unite(int x, int y) {
x = find(x);
y = find(y);
if (x == y)return;
if (Rank[x] < Rank[y]) {
par[x] = y;
}
else {
par[y] = x;
if (Rank[x] == Rank[y])Rank[x]++;
}
}
bool same(int x, int y) {
return find(x) == find(y);
}*/
// queue古い順,stack新しい順
/************************************************************************************/
int N, A, B, C, D;
string S;
int32_t main() {
cin >> N >> A >> B >> C >> D >> S;
S = '#' + S + '#';
auto can_reach = [&](int s, int t) {
for (int i = s; i < t; i++) {
if (S[i] == '#' && S[i] == S[i + 1])
return false;
}
return true;
};
if (D > C) {
if (can_reach(A, C) && can_reach(B, D)) {
cout << "Yes" << endl;
} else
cout << "No" << endl;
return 0;
}
if (C > D) {
if (can_reach(A, C) && can_reach(B, D)) {
for (int i = B; i <= D; i++) {
if (S[i - 1] == '.' && S[i] == '.' && S[i + 1] == '.') {
cout << "Yes" << endl;
return 0;
}
}
}
cout << "No" << endl;
return 0;
}
cout << "No" << endl;
} | [
"assignment.value.change"
] | 839,680 | 839,679 | u338903636 | cpp |
p03017 | // AtCoder.cpp : このファイルには 'main'
// 関数が含まれています。プログラム実行の開始と終了がそこで行われます。
//
// AtCoder.cpp : このファイルには 'main'
// 関数が含まれています。プログラム実行の開始と終了がそこで行われます。
//
#ifndef ONLINE_JUDGE
#endif
#define _USE_MATH_DEFINES
#include <math.h>
//#include<cmath>
#include <algorithm>
#include <array>
#include <assert.h>
#include <bitset>
#include <chrono>
#include <cmath>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <memory>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_set>
#include <vector>
#pragma GCC optimize("Ofast")
//#include "Ants.h"
using namespace std;
typedef long long ll;
#define rad_to_deg(rad) (((rad) / 2 / M_PI) * 360)
#define EPS (1e-7)
#define INF (1e9)
#define PI (acos(-1))
#define rep(i, n) for (int i = 0; i < n; i++)
#define show(s) cout << s << endl
#define chmin(x, y) x = min(x, y)
#define chmax(x, y) x = max(x, y)
#define LINF (1LL << 50)
#define MOD (1e9 + 7)
#define rep1(i, n) for (int i = 1; i <= n; i++)
#define rrep(i, n) for (int i = n - 1; i >= 0; --i)
typedef pair<ll, ll> P;
ll gcd(ll a, ll b) { //最大公約数を求める///最大公倍数a*b/gcd(a,b)
if (b == 0)
return a;
return gcd(b, a % b);
}
ll lcd(ll a, ll b) { //最小公倍数を求める b=0のときaを返す
if (b == 0)
return a;
return (a / gcd(a, b)) * b;
}
vector<int> divnum(ll num) {
int dig;
vector<int> p;
while (num) {
dig = num % 10;
p.push_back(dig);
num /= 10;
}
return p;
}
int digiter(ll num) {
int dig;
vector<int> p;
while (num) {
dig = num % 10;
p.push_back(dig);
num /= 10;
}
return p.size();
}
vector<int> convertstring(string s) {
vector<int> d;
ll n = s.size();
rep(i, n) { d.push_back(s[i] - '0'); }
return d;
}
map<ll, int> prime_factor(ll n) {
map<ll, int> ret;
for (ll i = 2; i * i <= n; i++) {
while (n % i == 0) {
ret[i]++;
n /= i;
}
}
if (n != 1)
ret[n] = 1;
return ret;
}
vector<ll> Enumeration(ll n) {
vector<ll> res;
for (ll i = 1; i * i <= n; i++) {
if (n % i != 0)
continue;
res.push_back(i);
if (i * i != n)
res.push_back(n / i);
}
return res;
}
ll myPow(ll x, ll n, ll m) { // x^n
if (n == 0)
return 1;
if (n % 2 == 0)
return myPow(x * x % m, n / 2, m);
else
return x * myPow(x, n - 1, m) % m;
}
std::vector<int> Eratosthenes(const int N) //素数列挙
{
std::vector<bool> is_prime(N + 1);
for (int i = 0; i <= N; i++) {
is_prime[i] = true;
}
std::vector<int> P;
for (int i = 2; i <= N; i++) {
if (is_prime[i]) {
for (int j = 2 * i; j <= N; j += i) {
is_prime[j] = false;
}
P.emplace_back(i);
}
}
return P;
}
const ll mod = MOD;
struct mint {
ll x; // typedef long long ll;
mint(ll x = 0) : x((x % mod + mod) % mod) {}
mint operator-() const { return mint(-x); }
mint &operator+=(const mint a) {
if ((x += a.x) >= mod)
x -= mod;
return *this;
}
mint &operator-=(const mint a) {
if ((x += mod - a.x) >= mod)
x -= mod;
return *this;
}
mint &operator*=(const mint a) {
(x *= a.x) %= mod;
return *this;
}
mint operator+(const mint a) const { return mint(*this) += a; }
mint operator-(const mint a) const { return mint(*this) -= a; }
mint operator*(const mint a) const { return mint(*this) *= a; }
mint pow(ll t) const {
if (!t)
return 1;
mint a = pow(t >> 1);
a *= a;
if (t & 1)
a *= *this;
return a;
}
// for prime mod
mint inv() const { return pow(mod - 2); }
mint &operator/=(const mint a) { return *this *= a.inv(); }
mint operator/(const mint a) const { return mint(*this) /= a; }
// operator long long() const { return x; }
};
istream &operator>>(istream &is, const mint &a) { return is >> a.x; }
ostream &operator<<(ostream &os, const mint &a) { return os << a.x; }
struct combination { // comb(a,b)でよぶaCb
vector<mint> fact, ifact;
combination(ll n) : fact(n + 1), ifact(n + 1) {
assert(n < mod);
fact[0] = 1;
for (ll i = 1; i <= n; ++i)
fact[i] = fact[i - 1] * i;
ifact[n] = fact[n].inv();
for (ll i = n; i >= 1; --i)
ifact[i - 1] = ifact[i] * i;
}
mint operator()(ll n, ll k) {
if (k < 0 || k > n)
return 0;
return fact[n] * ifact[k] * ifact[n - k];
}
} comb(1000005); // comb貯め
mint f(ll n, ll k) {
if (n < 0)
return 0;
// nPk = nCk * k!
mint res = comb(n, k);
res *= comb.fact[k];
return res;
}
struct SegmentTree {
private:
int n;
vector<int> node;
public:
SegmentTree(vector<int> v) { // SegmentTree seg(vector<int>(N,INF))で呼び出し
int sz = v.size();
n = 1;
while (n < sz)
n *= 2;
node.resize(2 * n - 1, INF);
for (int i = 0; i < sz; i++)
node[i + n - 1] = v[i];
for (int i = n - 2; i >= 0; i--)
node[i] = min(node[2 * i + 1], node[2 * i + 2]);
}
void update(int x, int val) {
x += (n - 1);
node[x] = val;
while (x > 0) {
x = (x - 1) / 2;
node[x] = min(node[2 * x + 1], node[2 * x + 2]);
}
}
int getmin(int a, int b, int k = 0, int l = 0, int r = -1) {
if (r < 0)
r = n;
if (r <= a || b <= l)
return INF;
if (a <= l && r <= b)
return node[k];
int vl = getmin(a, b, 2 * k + 1, l, (l + r) / 2);
int vr = getmin(a, b, 2 * k + 2, (l + r) / 2, r);
return min(vl, vr);
}
};
// 1-indexedなので注意。
struct BIT {
private:
vector<int> bit;
int N;
public:
BIT(int size) {
N = size;
bit.resize(N + 1);
}
// 一点更新です
void add(int a, int w) { // a番目をwに更新
for (int x = a; x <= N; x += x & -x)
bit[x] += w;
}
// 1~Nまでの和を求める。
int sum(int a) {
int ret = 0;
for (int x = a; x > 0; x -= x & -x)
ret += bit[x];
return ret;
}
};
/****Union-Ford-Tree***/
/*int par[int(0x7ffffff)];//Parent
int Rank[int(0x7ffffff)];//Deep_of_the_Tree
//int a[100] = { 4,2,3,1,5 }, m[100] ={3,2,2};
//int n = 0;
//const ll mod = 1000000007;
//n要素で初期化
void init(int n) {
for (int i = 0; i < n; i++) {
par[i] = i;
Rank[i] = 0;
}
}
//木の根探し
int find(int x) {
if (par[x] == x) {
return x;
}
else {
return par[x] = find(par[x]);
}
}
//xとyの属する集合を併合
void unite(int x, int y) {
x = find(x);
y = find(y);
if (x == y)return;
if (Rank[x] < Rank[y]) {
par[x] = y;
}
else {
par[y] = x;
if (Rank[x] == Rank[y])Rank[x]++;
}
}
bool same(int x, int y) {
return find(x) == find(y);
}*/
// queue古い順,stack新しい順
/************************************************************************************/
int N, A, B, C, D;
string S;
int32_t main() {
cin >> N >> A >> B >> C >> D >> S;
S += '#' + S + '#';
auto can_reach = [&](int s, int t) {
for (int i = s; i < t; i++) {
if (S[i] == '#' && S[i] == S[i + 1])
return false;
}
return true;
};
/*if (D > C) {
if (can_reach(A, C) && can_reach(B, D)) {
cout << "Yes" << endl;
}
else cout << "No" << endl;
return 0;
}*/
if (!can_reach(A, C) || !can_reach(B, D)) {
cout << "No" << endl;
return 0;
}
if (C > D) {
bool snuke_can_over = false;
for (int i = B; i <= D; i++) {
if (S[i - 1] == '.' && S[i] == '.' && S[i + 1] == '.') {
snuke_can_over = true;
}
}
if (!snuke_can_over) {
cout << "No" << endl;
return 0;
}
}
cout << "Yes" << endl;
} | // AtCoder.cpp : このファイルには 'main'
// 関数が含まれています。プログラム実行の開始と終了がそこで行われます。
//
// AtCoder.cpp : このファイルには 'main'
// 関数が含まれています。プログラム実行の開始と終了がそこで行われます。
//
#ifndef ONLINE_JUDGE
#endif
#define _USE_MATH_DEFINES
#include <math.h>
//#include<cmath>
#include <algorithm>
#include <array>
#include <assert.h>
#include <bitset>
#include <chrono>
#include <cmath>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <memory>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_set>
#include <vector>
#pragma GCC optimize("Ofast")
//#include "Ants.h"
using namespace std;
typedef long long ll;
#define rad_to_deg(rad) (((rad) / 2 / M_PI) * 360)
#define EPS (1e-7)
#define INF (1e9)
#define PI (acos(-1))
#define rep(i, n) for (int i = 0; i < n; i++)
#define show(s) cout << s << endl
#define chmin(x, y) x = min(x, y)
#define chmax(x, y) x = max(x, y)
#define LINF (1LL << 50)
#define MOD (1e9 + 7)
#define rep1(i, n) for (int i = 1; i <= n; i++)
#define rrep(i, n) for (int i = n - 1; i >= 0; --i)
typedef pair<ll, ll> P;
ll gcd(ll a, ll b) { //最大公約数を求める///最大公倍数a*b/gcd(a,b)
if (b == 0)
return a;
return gcd(b, a % b);
}
ll lcd(ll a, ll b) { //最小公倍数を求める b=0のときaを返す
if (b == 0)
return a;
return (a / gcd(a, b)) * b;
}
vector<int> divnum(ll num) {
int dig;
vector<int> p;
while (num) {
dig = num % 10;
p.push_back(dig);
num /= 10;
}
return p;
}
int digiter(ll num) {
int dig;
vector<int> p;
while (num) {
dig = num % 10;
p.push_back(dig);
num /= 10;
}
return p.size();
}
vector<int> convertstring(string s) {
vector<int> d;
ll n = s.size();
rep(i, n) { d.push_back(s[i] - '0'); }
return d;
}
map<ll, int> prime_factor(ll n) {
map<ll, int> ret;
for (ll i = 2; i * i <= n; i++) {
while (n % i == 0) {
ret[i]++;
n /= i;
}
}
if (n != 1)
ret[n] = 1;
return ret;
}
vector<ll> Enumeration(ll n) {
vector<ll> res;
for (ll i = 1; i * i <= n; i++) {
if (n % i != 0)
continue;
res.push_back(i);
if (i * i != n)
res.push_back(n / i);
}
return res;
}
ll myPow(ll x, ll n, ll m) { // x^n
if (n == 0)
return 1;
if (n % 2 == 0)
return myPow(x * x % m, n / 2, m);
else
return x * myPow(x, n - 1, m) % m;
}
std::vector<int> Eratosthenes(const int N) //素数列挙
{
std::vector<bool> is_prime(N + 1);
for (int i = 0; i <= N; i++) {
is_prime[i] = true;
}
std::vector<int> P;
for (int i = 2; i <= N; i++) {
if (is_prime[i]) {
for (int j = 2 * i; j <= N; j += i) {
is_prime[j] = false;
}
P.emplace_back(i);
}
}
return P;
}
const ll mod = MOD;
struct mint {
ll x; // typedef long long ll;
mint(ll x = 0) : x((x % mod + mod) % mod) {}
mint operator-() const { return mint(-x); }
mint &operator+=(const mint a) {
if ((x += a.x) >= mod)
x -= mod;
return *this;
}
mint &operator-=(const mint a) {
if ((x += mod - a.x) >= mod)
x -= mod;
return *this;
}
mint &operator*=(const mint a) {
(x *= a.x) %= mod;
return *this;
}
mint operator+(const mint a) const { return mint(*this) += a; }
mint operator-(const mint a) const { return mint(*this) -= a; }
mint operator*(const mint a) const { return mint(*this) *= a; }
mint pow(ll t) const {
if (!t)
return 1;
mint a = pow(t >> 1);
a *= a;
if (t & 1)
a *= *this;
return a;
}
// for prime mod
mint inv() const { return pow(mod - 2); }
mint &operator/=(const mint a) { return *this *= a.inv(); }
mint operator/(const mint a) const { return mint(*this) /= a; }
// operator long long() const { return x; }
};
istream &operator>>(istream &is, const mint &a) { return is >> a.x; }
ostream &operator<<(ostream &os, const mint &a) { return os << a.x; }
struct combination { // comb(a,b)でよぶaCb
vector<mint> fact, ifact;
combination(ll n) : fact(n + 1), ifact(n + 1) {
assert(n < mod);
fact[0] = 1;
for (ll i = 1; i <= n; ++i)
fact[i] = fact[i - 1] * i;
ifact[n] = fact[n].inv();
for (ll i = n; i >= 1; --i)
ifact[i - 1] = ifact[i] * i;
}
mint operator()(ll n, ll k) {
if (k < 0 || k > n)
return 0;
return fact[n] * ifact[k] * ifact[n - k];
}
} comb(1000005); // comb貯め
mint f(ll n, ll k) {
if (n < 0)
return 0;
// nPk = nCk * k!
mint res = comb(n, k);
res *= comb.fact[k];
return res;
}
struct SegmentTree {
private:
int n;
vector<int> node;
public:
SegmentTree(vector<int> v) { // SegmentTree seg(vector<int>(N,INF))で呼び出し
int sz = v.size();
n = 1;
while (n < sz)
n *= 2;
node.resize(2 * n - 1, INF);
for (int i = 0; i < sz; i++)
node[i + n - 1] = v[i];
for (int i = n - 2; i >= 0; i--)
node[i] = min(node[2 * i + 1], node[2 * i + 2]);
}
void update(int x, int val) {
x += (n - 1);
node[x] = val;
while (x > 0) {
x = (x - 1) / 2;
node[x] = min(node[2 * x + 1], node[2 * x + 2]);
}
}
int getmin(int a, int b, int k = 0, int l = 0, int r = -1) {
if (r < 0)
r = n;
if (r <= a || b <= l)
return INF;
if (a <= l && r <= b)
return node[k];
int vl = getmin(a, b, 2 * k + 1, l, (l + r) / 2);
int vr = getmin(a, b, 2 * k + 2, (l + r) / 2, r);
return min(vl, vr);
}
};
// 1-indexedなので注意。
struct BIT {
private:
vector<int> bit;
int N;
public:
BIT(int size) {
N = size;
bit.resize(N + 1);
}
// 一点更新です
void add(int a, int w) { // a番目をwに更新
for (int x = a; x <= N; x += x & -x)
bit[x] += w;
}
// 1~Nまでの和を求める。
int sum(int a) {
int ret = 0;
for (int x = a; x > 0; x -= x & -x)
ret += bit[x];
return ret;
}
};
/****Union-Ford-Tree***/
/*int par[int(0x7ffffff)];//Parent
int Rank[int(0x7ffffff)];//Deep_of_the_Tree
//int a[100] = { 4,2,3,1,5 }, m[100] ={3,2,2};
//int n = 0;
//const ll mod = 1000000007;
//n要素で初期化
void init(int n) {
for (int i = 0; i < n; i++) {
par[i] = i;
Rank[i] = 0;
}
}
//木の根探し
int find(int x) {
if (par[x] == x) {
return x;
}
else {
return par[x] = find(par[x]);
}
}
//xとyの属する集合を併合
void unite(int x, int y) {
x = find(x);
y = find(y);
if (x == y)return;
if (Rank[x] < Rank[y]) {
par[x] = y;
}
else {
par[y] = x;
if (Rank[x] == Rank[y])Rank[x]++;
}
}
bool same(int x, int y) {
return find(x) == find(y);
}*/
// queue古い順,stack新しい順
/************************************************************************************/
int N, A, B, C, D;
string S;
int32_t main() {
cin >> N >> A >> B >> C >> D >> S;
S = '#' + S + '#';
auto can_reach = [&](int s, int t) {
for (int i = s; i < t; i++) {
if (S[i] == '#' && S[i] == S[i + 1])
return false;
}
return true;
};
/*if (D > C) {
if (can_reach(A, C) && can_reach(B, D)) {
cout << "Yes" << endl;
}
else cout << "No" << endl;
return 0;
}*/
if (!can_reach(A, C) || !can_reach(B, D)) {
cout << "No" << endl;
return 0;
}
if (C > D) {
bool snuke_can_over = false;
for (int i = B; i <= D; i++) {
if (S[i - 1] == '.' && S[i] == '.' && S[i + 1] == '.') {
snuke_can_over = true;
}
}
if (!snuke_can_over) {
cout << "No" << endl;
return 0;
}
}
cout << "Yes" << endl;
} | [
"assignment.value.change"
] | 839,681 | 839,682 | u338903636 | cpp |
p03017 | #include <bits/stdc++.h>
using namespace std;
//解説AC
int main() {
long long n, a, b, c, d;
cin >> n >> a >> b >> c >> d;
string s;
cin >> s;
if (c == d) {
cout << "No" << endl;
return 0;
}
bool hantei = true;
if (c < d) {
for (long long i = a - 1; i < d - 1; i++) {
if (s[i] == '#' && s[i + 1] == '#') {
hantei = false;
break;
}
}
} else {
hantei = false;
for (long long i = b - 1; i < d - 2; i++) {
if (s[i] == '.' && s[i + 1] == '.' && s[i + 2] == '.') {
hantei = true;
// cout<<i<<endl;
}
}
for (long long i = a - 1; i < c - 1; i++) {
if (s[i] == '#' && s[i + 1] == '#') {
hantei = false;
break;
}
}
}
if (hantei)
cout << "Yes" << endl;
else
cout << "No" << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
//解説AC
int main() {
long long n, a, b, c, d;
cin >> n >> a >> b >> c >> d;
string s;
cin >> s;
if (c == d) {
cout << "No1" << endl;
return 0;
}
bool hantei = true;
if (c < d) {
for (long long i = a - 1; i < d - 1; i++) {
if (s[i] == '#' && s[i + 1] == '#') {
hantei = false;
break;
}
}
} else {
hantei = false;
for (long long i = b - 2; i < d - 1; i++) {
if (s[i] == '.' && s[i + 1] == '.' && s[i + 2] == '.') {
hantei = true;
// cout<<i<<endl;
}
}
for (long long i = a - 1; i < c - 1; i++) {
if (s[i] == '#' && s[i + 1] == '#') {
// cout<<i<<endl;
hantei = false;
break;
}
}
}
if (hantei)
cout << "Yes" << endl;
else
cout << "No" << endl;
return 0;
} | [
"literal.string.change",
"io.output.change",
"literal.number.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"expression.operation.binary.change",
"control_flow.branch.if.condition.change"
] | 839,708 | 839,709 | u406647332 | cpp |
p03017 | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define rrep(i, n) for (int(i) = ((n)-1); (i) >= 0; (i)--)
#define itn int
#define miele(v) min_element(v.begin(), v.end())
#define maele(v) max_element(v.begin(), v.end())
#define SUM(v) accumulate(v.begin(), v.end(), 0LL)
#define lb(a, key) lower_bound(a.begin(), a.end(), key)
#define ub(a, key) upper_bound(a.begin(), a.end(), key)
#define COUNT(a, key) count(a.begin(), a.end(), key)
#define BITCOUNT(x) __builtin_popcount(x)
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define F first
#define S second
using P = pair<int, int>;
using WeightedGraph = vector<vector<P>>;
using UnWeightedGraph = vector<vector<int>>;
using Real = long double;
using Point = complex<Real>; // Point and Vector2d is the same!
using Vector2d = complex<Real>;
const long long INF = 1LL << 60;
const int MOD = 1000000007;
const double EPS = 1e-15;
const double PI = 3.14159265358979323846;
template <typename T> int getIndexOfLowerBound(vector<T> &v, T x) {
return lower_bound(v.begin(), v.end(), x) - v.begin();
}
template <typename T> int getIndexOfUpperBound(vector<T> &v, T x) {
return upper_bound(v.begin(), v.end(), x) - v.begin();
}
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 DUMPOUT cerr
#define repi(itr, ds) for (auto itr = ds.begin(); itr != ds.end(); itr++)
istream &operator>>(istream &is, Point &p) {
Real a, b;
is >> a >> b;
p = Point(a, b);
return is;
}
template <typename T, typename U>
istream &operator>>(istream &is, pair<T, U> &p_var) {
is >> p_var.first >> p_var.second;
return is;
}
template <typename T> istream &operator>>(istream &is, vector<T> &vec) {
for (T &x : vec)
is >> x;
return is;
}
template <typename T, typename U>
ostream &operator<<(ostream &os, pair<T, U> &pair_var) {
DUMPOUT << '{';
os << pair_var.first;
DUMPOUT << ',';
os << " " << pair_var.second;
DUMPOUT << '}';
return os;
}
template <typename T> ostream &operator<<(ostream &os, vector<T> &vec) {
DUMPOUT << '[';
for (int i = 0; i < vec.size(); i++)
os << vec[i] << (i + 1 == vec.size() ? "" : " ");
DUMPOUT << ']';
return os;
}
template <typename T> ostream &operator<<(ostream &os, vector<vector<T>> &df) {
for (auto &vec : df)
os << vec;
return os;
}
template <typename T, typename U>
ostream &operator<<(ostream &os, map<T, U> &map_var) {
DUMPOUT << "{";
repi(itr, map_var) {
os << *itr;
itr++;
if (itr != map_var.end())
DUMPOUT << ", ";
itr--;
}
DUMPOUT << "}";
return os;
}
template <typename T> ostream &operator<<(ostream &os, set<T> &set_var) {
DUMPOUT << "{";
repi(itr, set_var) {
os << *itr;
itr++;
if (itr != set_var.end())
DUMPOUT << ", ";
itr--;
}
DUMPOUT << "}";
return os;
}
void print() { cout << endl; }
template <class Head, class... Tail> void print(Head &&head, Tail &&...tail) {
cout << head;
if (sizeof...(tail) != 0)
cout << " ";
print(forward<Tail>(tail)...);
}
void dump_func() { DUMPOUT << '#' << endl; }
template <typename Head, typename... Tail>
void dump_func(Head &&head, Tail &&...tail) {
DUMPOUT << head;
if (sizeof...(Tail) > 0)
DUMPOUT << ", ";
dump_func(std::move(tail)...);
}
#ifdef DEBUG_
#define DEB
#define dump(...) \
DUMPOUT << " " << string(#__VA_ARGS__) << ": " \
<< "[" << to_string(__LINE__) << ":" << __FUNCTION__ << "]" << endl \
<< " ", \
dump_func(__VA_ARGS__)
#else
#define DEB if (false)
#define dump(...)
#endif
signed main(void) {
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;
if (d < c && d > b) {
for (int i = a; i < c; i++) {
if (s[i] == '#' && s[i + 1] == '#') {
print("No");
return 0;
}
}
bool ok = false;
for (int i = b - 1; i < d - 1; i++) {
if (s[i] == '.' && s[i + 1] == '.' && s[i + 2] == '.') {
ok = true;
}
}
if (ok)
print("Yes");
else
print("No");
} else {
for (int i = a; i < c; i++) {
if (s[i] == '#' && s[i + 1] == '#') {
print("No");
return 0;
}
}
for (int i = b; i < d; i++) {
if (s[i] == '#' && s[i + 1] == '#') {
print("No");
return 0;
}
}
print("Yes");
}
}
| #include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define rrep(i, n) for (int(i) = ((n)-1); (i) >= 0; (i)--)
#define itn int
#define miele(v) min_element(v.begin(), v.end())
#define maele(v) max_element(v.begin(), v.end())
#define SUM(v) accumulate(v.begin(), v.end(), 0LL)
#define lb(a, key) lower_bound(a.begin(), a.end(), key)
#define ub(a, key) upper_bound(a.begin(), a.end(), key)
#define COUNT(a, key) count(a.begin(), a.end(), key)
#define BITCOUNT(x) __builtin_popcount(x)
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define F first
#define S second
using P = pair<int, int>;
using WeightedGraph = vector<vector<P>>;
using UnWeightedGraph = vector<vector<int>>;
using Real = long double;
using Point = complex<Real>; // Point and Vector2d is the same!
using Vector2d = complex<Real>;
const long long INF = 1LL << 60;
const int MOD = 1000000007;
const double EPS = 1e-15;
const double PI = 3.14159265358979323846;
template <typename T> int getIndexOfLowerBound(vector<T> &v, T x) {
return lower_bound(v.begin(), v.end(), x) - v.begin();
}
template <typename T> int getIndexOfUpperBound(vector<T> &v, T x) {
return upper_bound(v.begin(), v.end(), x) - v.begin();
}
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 DUMPOUT cerr
#define repi(itr, ds) for (auto itr = ds.begin(); itr != ds.end(); itr++)
istream &operator>>(istream &is, Point &p) {
Real a, b;
is >> a >> b;
p = Point(a, b);
return is;
}
template <typename T, typename U>
istream &operator>>(istream &is, pair<T, U> &p_var) {
is >> p_var.first >> p_var.second;
return is;
}
template <typename T> istream &operator>>(istream &is, vector<T> &vec) {
for (T &x : vec)
is >> x;
return is;
}
template <typename T, typename U>
ostream &operator<<(ostream &os, pair<T, U> &pair_var) {
DUMPOUT << '{';
os << pair_var.first;
DUMPOUT << ',';
os << " " << pair_var.second;
DUMPOUT << '}';
return os;
}
template <typename T> ostream &operator<<(ostream &os, vector<T> &vec) {
DUMPOUT << '[';
for (int i = 0; i < vec.size(); i++)
os << vec[i] << (i + 1 == vec.size() ? "" : " ");
DUMPOUT << ']';
return os;
}
template <typename T> ostream &operator<<(ostream &os, vector<vector<T>> &df) {
for (auto &vec : df)
os << vec;
return os;
}
template <typename T, typename U>
ostream &operator<<(ostream &os, map<T, U> &map_var) {
DUMPOUT << "{";
repi(itr, map_var) {
os << *itr;
itr++;
if (itr != map_var.end())
DUMPOUT << ", ";
itr--;
}
DUMPOUT << "}";
return os;
}
template <typename T> ostream &operator<<(ostream &os, set<T> &set_var) {
DUMPOUT << "{";
repi(itr, set_var) {
os << *itr;
itr++;
if (itr != set_var.end())
DUMPOUT << ", ";
itr--;
}
DUMPOUT << "}";
return os;
}
void print() { cout << endl; }
template <class Head, class... Tail> void print(Head &&head, Tail &&...tail) {
cout << head;
if (sizeof...(tail) != 0)
cout << " ";
print(forward<Tail>(tail)...);
}
void dump_func() { DUMPOUT << '#' << endl; }
template <typename Head, typename... Tail>
void dump_func(Head &&head, Tail &&...tail) {
DUMPOUT << head;
if (sizeof...(Tail) > 0)
DUMPOUT << ", ";
dump_func(std::move(tail)...);
}
#ifdef DEBUG_
#define DEB
#define dump(...) \
DUMPOUT << " " << string(#__VA_ARGS__) << ": " \
<< "[" << to_string(__LINE__) << ":" << __FUNCTION__ << "]" << endl \
<< " ", \
dump_func(__VA_ARGS__)
#else
#define DEB if (false)
#define dump(...)
#endif
signed main(void) {
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;
if (d < c && d > b) {
for (int i = a; i < c; i++) {
if (s[i] == '#' && s[i + 1] == '#') {
print("No");
return 0;
}
}
bool ok = false;
for (int i = b - 1; i < d; i++) {
if (s[i] == '.' && s[i + 1] == '.' && s[i + 2] == '.') {
ok = true;
}
}
if (ok)
print("Yes");
else
print("No");
} else {
for (int i = a; i < c; i++) {
if (s[i] == '#' && s[i + 1] == '#') {
print("No");
return 0;
}
}
for (int i = b; i < d; i++) {
if (s[i] == '#' && s[i + 1] == '#') {
print("No");
return 0;
}
}
print("Yes");
}
}
| [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 839,716 | 839,717 | u616029737 | cpp |
p03017 | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define rrep(i, n) for (int(i) = ((n)-1); (i) >= 0; (i)--)
#define itn int
#define miele(v) min_element(v.begin(), v.end())
#define maele(v) max_element(v.begin(), v.end())
#define SUM(v) accumulate(v.begin(), v.end(), 0LL)
#define lb(a, key) lower_bound(a.begin(), a.end(), key)
#define ub(a, key) upper_bound(a.begin(), a.end(), key)
#define COUNT(a, key) count(a.begin(), a.end(), key)
#define BITCOUNT(x) __builtin_popcount(x)
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define F first
#define S second
using P = pair<int, int>;
using WeightedGraph = vector<vector<P>>;
using UnWeightedGraph = vector<vector<int>>;
using Real = long double;
using Point = complex<Real>; // Point and Vector2d is the same!
using Vector2d = complex<Real>;
const long long INF = 1LL << 60;
const int MOD = 1000000007;
const double EPS = 1e-15;
const double PI = 3.14159265358979323846;
template <typename T> int getIndexOfLowerBound(vector<T> &v, T x) {
return lower_bound(v.begin(), v.end(), x) - v.begin();
}
template <typename T> int getIndexOfUpperBound(vector<T> &v, T x) {
return upper_bound(v.begin(), v.end(), x) - v.begin();
}
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 DUMPOUT cerr
#define repi(itr, ds) for (auto itr = ds.begin(); itr != ds.end(); itr++)
istream &operator>>(istream &is, Point &p) {
Real a, b;
is >> a >> b;
p = Point(a, b);
return is;
}
template <typename T, typename U>
istream &operator>>(istream &is, pair<T, U> &p_var) {
is >> p_var.first >> p_var.second;
return is;
}
template <typename T> istream &operator>>(istream &is, vector<T> &vec) {
for (T &x : vec)
is >> x;
return is;
}
template <typename T, typename U>
ostream &operator<<(ostream &os, pair<T, U> &pair_var) {
DUMPOUT << '{';
os << pair_var.first;
DUMPOUT << ',';
os << " " << pair_var.second;
DUMPOUT << '}';
return os;
}
template <typename T> ostream &operator<<(ostream &os, vector<T> &vec) {
DUMPOUT << '[';
for (int i = 0; i < vec.size(); i++)
os << vec[i] << (i + 1 == vec.size() ? "" : " ");
DUMPOUT << ']';
return os;
}
template <typename T> ostream &operator<<(ostream &os, vector<vector<T>> &df) {
for (auto &vec : df)
os << vec;
return os;
}
template <typename T, typename U>
ostream &operator<<(ostream &os, map<T, U> &map_var) {
DUMPOUT << "{";
repi(itr, map_var) {
os << *itr;
itr++;
if (itr != map_var.end())
DUMPOUT << ", ";
itr--;
}
DUMPOUT << "}";
return os;
}
template <typename T> ostream &operator<<(ostream &os, set<T> &set_var) {
DUMPOUT << "{";
repi(itr, set_var) {
os << *itr;
itr++;
if (itr != set_var.end())
DUMPOUT << ", ";
itr--;
}
DUMPOUT << "}";
return os;
}
void print() { cout << endl; }
template <class Head, class... Tail> void print(Head &&head, Tail &&...tail) {
cout << head;
if (sizeof...(tail) != 0)
cout << " ";
print(forward<Tail>(tail)...);
}
void dump_func() { DUMPOUT << '#' << endl; }
template <typename Head, typename... Tail>
void dump_func(Head &&head, Tail &&...tail) {
DUMPOUT << head;
if (sizeof...(Tail) > 0)
DUMPOUT << ", ";
dump_func(std::move(tail)...);
}
#ifdef DEBUG_
#define DEB
#define dump(...) \
DUMPOUT << " " << string(#__VA_ARGS__) << ": " \
<< "[" << to_string(__LINE__) << ":" << __FUNCTION__ << "]" << endl \
<< " ", \
dump_func(__VA_ARGS__)
#else
#define DEB if (false)
#define dump(...)
#endif
signed main(void) {
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;
if (d < c && d > b) {
for (int i = a; i < c; i++) {
if (s[i] == '#' && s[i + 1] == '#') {
print("No");
return 0;
}
}
bool ok = false;
for (int i = b; i < d - 1; i++) {
if (s[i] == '.' && s[i + 1] == '.' && s[i + 2] == '.') {
ok = true;
}
}
if (ok)
print("Yes");
else
print("No");
} else {
for (int i = a; i < c; i++) {
if (s[i] == '#' && s[i + 1] == '#') {
print("No");
return 0;
}
}
for (int i = b; i < d; i++) {
if (s[i] == '#' && s[i + 1] == '#') {
print("No");
return 0;
}
}
print("Yes");
}
}
| #include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define rrep(i, n) for (int(i) = ((n)-1); (i) >= 0; (i)--)
#define itn int
#define miele(v) min_element(v.begin(), v.end())
#define maele(v) max_element(v.begin(), v.end())
#define SUM(v) accumulate(v.begin(), v.end(), 0LL)
#define lb(a, key) lower_bound(a.begin(), a.end(), key)
#define ub(a, key) upper_bound(a.begin(), a.end(), key)
#define COUNT(a, key) count(a.begin(), a.end(), key)
#define BITCOUNT(x) __builtin_popcount(x)
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define F first
#define S second
using P = pair<int, int>;
using WeightedGraph = vector<vector<P>>;
using UnWeightedGraph = vector<vector<int>>;
using Real = long double;
using Point = complex<Real>; // Point and Vector2d is the same!
using Vector2d = complex<Real>;
const long long INF = 1LL << 60;
const int MOD = 1000000007;
const double EPS = 1e-15;
const double PI = 3.14159265358979323846;
template <typename T> int getIndexOfLowerBound(vector<T> &v, T x) {
return lower_bound(v.begin(), v.end(), x) - v.begin();
}
template <typename T> int getIndexOfUpperBound(vector<T> &v, T x) {
return upper_bound(v.begin(), v.end(), x) - v.begin();
}
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 DUMPOUT cerr
#define repi(itr, ds) for (auto itr = ds.begin(); itr != ds.end(); itr++)
istream &operator>>(istream &is, Point &p) {
Real a, b;
is >> a >> b;
p = Point(a, b);
return is;
}
template <typename T, typename U>
istream &operator>>(istream &is, pair<T, U> &p_var) {
is >> p_var.first >> p_var.second;
return is;
}
template <typename T> istream &operator>>(istream &is, vector<T> &vec) {
for (T &x : vec)
is >> x;
return is;
}
template <typename T, typename U>
ostream &operator<<(ostream &os, pair<T, U> &pair_var) {
DUMPOUT << '{';
os << pair_var.first;
DUMPOUT << ',';
os << " " << pair_var.second;
DUMPOUT << '}';
return os;
}
template <typename T> ostream &operator<<(ostream &os, vector<T> &vec) {
DUMPOUT << '[';
for (int i = 0; i < vec.size(); i++)
os << vec[i] << (i + 1 == vec.size() ? "" : " ");
DUMPOUT << ']';
return os;
}
template <typename T> ostream &operator<<(ostream &os, vector<vector<T>> &df) {
for (auto &vec : df)
os << vec;
return os;
}
template <typename T, typename U>
ostream &operator<<(ostream &os, map<T, U> &map_var) {
DUMPOUT << "{";
repi(itr, map_var) {
os << *itr;
itr++;
if (itr != map_var.end())
DUMPOUT << ", ";
itr--;
}
DUMPOUT << "}";
return os;
}
template <typename T> ostream &operator<<(ostream &os, set<T> &set_var) {
DUMPOUT << "{";
repi(itr, set_var) {
os << *itr;
itr++;
if (itr != set_var.end())
DUMPOUT << ", ";
itr--;
}
DUMPOUT << "}";
return os;
}
void print() { cout << endl; }
template <class Head, class... Tail> void print(Head &&head, Tail &&...tail) {
cout << head;
if (sizeof...(tail) != 0)
cout << " ";
print(forward<Tail>(tail)...);
}
void dump_func() { DUMPOUT << '#' << endl; }
template <typename Head, typename... Tail>
void dump_func(Head &&head, Tail &&...tail) {
DUMPOUT << head;
if (sizeof...(Tail) > 0)
DUMPOUT << ", ";
dump_func(std::move(tail)...);
}
#ifdef DEBUG_
#define DEB
#define dump(...) \
DUMPOUT << " " << string(#__VA_ARGS__) << ": " \
<< "[" << to_string(__LINE__) << ":" << __FUNCTION__ << "]" << endl \
<< " ", \
dump_func(__VA_ARGS__)
#else
#define DEB if (false)
#define dump(...)
#endif
signed main(void) {
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;
if (d < c && d > b) {
for (int i = a; i < c; i++) {
if (s[i] == '#' && s[i + 1] == '#') {
print("No");
return 0;
}
}
bool ok = false;
for (int i = b - 1; i < d; i++) {
if (s[i] == '.' && s[i + 1] == '.' && s[i + 2] == '.') {
ok = true;
}
}
if (ok)
print("Yes");
else
print("No");
} else {
for (int i = a; i < c; i++) {
if (s[i] == '#' && s[i + 1] == '#') {
print("No");
return 0;
}
}
for (int i = b; i < d; i++) {
if (s[i] == '#' && s[i + 1] == '#') {
print("No");
return 0;
}
}
print("Yes");
}
}
| [
"control_flow.loop.for.initializer.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 839,718 | 839,717 | u616029737 | cpp |
p03017 | #pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<long long, long long>;
constexpr char ln = '\n';
constexpr long long MOD = 1000000007LL;
constexpr long long INF = 1001001001LL;
constexpr long long LINF = 1001001001001001001;
#define all(x) (x).begin(), (x).end()
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rept(i, j, n) for (int i = (j); i < (n); i++)
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
int main() {
int n, a, b, c, d;
cin >> n >> a >> b >> c >> d;
a--, b--, c--, d--;
string s;
cin >> s;
bool renzoku = false;
rept(i, min(a, b), max(c, d)) {
if (s[i] == '#' && s[i + 1] == '#')
renzoku = true;
if (renzoku)
cout << "No" << ln;
else if (c < d)
cout << "Yes" << ln;
else {
bool three = false;
rept(i, b, d + 1) {
if (s[i] == '.' && s[i + 1] == '.' && s[i - 1] == '.')
three = true;
}
if (three)
cout << "Yes" << ln;
else
cout << "No" << ln;
}
}
}
| #pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<long long, long long>;
constexpr char ln = '\n';
constexpr long long MOD = 1000000007LL;
constexpr long long INF = 1001001001LL;
constexpr long long LINF = 1001001001001001001;
#define all(x) (x).begin(), (x).end()
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rept(i, j, n) for (int i = (j); i < (n); i++)
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
int main() {
int n, a, b, c, d;
cin >> n >> a >> b >> c >> d;
a--, b--, c--, d--;
string s;
cin >> s;
bool renzoku = false;
rept(i, min(a, b), max(c, d)) {
if (s[i] == '#' && s[i + 1] == '#')
renzoku = true;
}
if (renzoku)
cout << "No" << ln;
else if (c < d)
cout << "Yes" << ln;
else {
bool three = false;
rept(i, b, d + 1) {
if (s[i] == '.' && s[i + 1] == '.' && s[i - 1] == '.')
three = true;
}
if (three)
cout << "Yes" << ln;
else
cout << "No" << ln;
}
}
| [] | 839,730 | 839,731 | u062736195 | cpp |
p03017 | #include <bits/stdc++.h>
using namespace std;
#define all(a) a.begin(), a.end()
using ll = long long;
const int INF = 1 << 30;
const ll INFll = 1LL << 62;
const int mod = int(1e9) + 7;
using P = pair<ll, ll>;
using ld = long double;
int main() {
int n, a, b, c, d;
cin >> n >> a >> b >> c >> d;
string s;
cin >> s;
a--;
b--;
c--;
d--;
bool sunuke = true;
bool hunuke = true;
int now = 0;
for (int i = 0; i < n; ++i) {
if (i < a)
continue;
if (i > c)
break;
if (s[i] == '#')
now++;
else {
if (now >= 2)
sunuke = false;
now = 0;
}
}
if (now >= 2)
sunuke = false;
swap(a, b);
swap(c, d);
now = 0;
for (int i = 0; i < n; ++i) {
if (i < a)
continue;
if (i > c)
break;
if (s[i] == '#')
now++;
else {
if (now >= 2)
hunuke = false;
now = 0;
}
}
swap(a, b);
swap(c, d);
now = 0;
bool flg = false;
if (c > d) {
for (int i = b - 1; i <= d; ++i) {
if (s[i] == '.')
now++;
else {
if (now >= 3)
flg = true;
now = 0;
}
}
if (now >= 3)
flg = true;
}
if (c < d) {
if (sunuke && hunuke)
puts("Yes");
else
puts("No");
} else {
if (sunuke && hunuke && flg)
puts("Yes");
else
puts("No");
}
}
| #include <bits/stdc++.h>
using namespace std;
#define all(a) a.begin(), a.end()
using ll = long long;
const int INF = 1 << 30;
const ll INFll = 1LL << 62;
const int mod = int(1e9) + 7;
using P = pair<ll, ll>;
using ld = long double;
int main() {
int n, a, b, c, d;
cin >> n >> a >> b >> c >> d;
string s;
cin >> s;
a--;
b--;
c--;
d--;
bool sunuke = true;
bool hunuke = true;
int now = 0;
for (int i = 0; i < n; ++i) {
if (i < a)
continue;
if (i > c)
break;
if (s[i] == '#')
now++;
else {
if (now >= 2)
sunuke = false;
now = 0;
}
}
if (now >= 2)
sunuke = false;
swap(a, b);
swap(c, d);
now = 0;
for (int i = 0; i < n; ++i) {
if (i < a)
continue;
if (i > c)
break;
if (s[i] == '#')
now++;
else {
if (now >= 2)
hunuke = false;
now = 0;
}
}
swap(a, b);
swap(c, d);
now = 0;
bool flg = false;
if (c > d) {
for (int i = b - 1; i <= d + 1; ++i) {
if (s[i] == '.')
now++;
else {
if (now >= 3)
flg = true;
now = 0;
}
}
if (now >= 3)
flg = true;
}
if (c < d) {
if (sunuke && hunuke)
puts("Yes");
else
puts("No");
} else {
if (sunuke && hunuke && flg)
puts("Yes");
else
puts("No");
}
}
| [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 839,738 | 839,739 | u525008368 | cpp |
p03017 | #include <bits/stdc++.h>
using namespace std;
#define all(a) a.begin(), a.end()
using ll = long long;
const int INF = 1 << 30;
const ll INFll = 1LL << 62;
const int mod = int(1e9) + 7;
using P = pair<ll, ll>;
using ld = long double;
int main() {
int n, a, b, c, d;
cin >> n >> a >> b >> c >> d;
string s;
cin >> s;
a--;
b--;
c--;
d--;
bool sunuke = true;
bool hunuke = true;
int now = 0;
for (int i = 0; i < n; ++i) {
if (i < a)
continue;
if (i > c)
break;
if (s[i] == '#')
now++;
else {
if (now >= 2)
sunuke = false;
now = 0;
}
}
if (now >= 2)
sunuke = false;
swap(a, b);
swap(c, d);
now = 0;
for (int i = 0; i < n; ++i) {
if (i < a)
continue;
if (i > c)
break;
if (s[i] == '#')
now++;
else {
if (now >= 2)
hunuke = false;
now = 0;
}
}
swap(a, b);
swap(c, d);
now = 0;
bool flg = false;
if (c > d) {
for (int i = b; i <= c; ++i) {
if (s[i] == '.')
now++;
else {
if (now >= 3)
flg = true;
now = 0;
}
}
if (now >= 3)
flg = true;
}
if (c < d) {
if (sunuke && hunuke)
puts("Yes");
else
puts("No");
} else {
if (sunuke && hunuke && flg)
puts("Yes");
else
puts("No");
}
}
| #include <bits/stdc++.h>
using namespace std;
#define all(a) a.begin(), a.end()
using ll = long long;
const int INF = 1 << 30;
const ll INFll = 1LL << 62;
const int mod = int(1e9) + 7;
using P = pair<ll, ll>;
using ld = long double;
int main() {
int n, a, b, c, d;
cin >> n >> a >> b >> c >> d;
string s;
cin >> s;
a--;
b--;
c--;
d--;
bool sunuke = true;
bool hunuke = true;
int now = 0;
for (int i = 0; i < n; ++i) {
if (i < a)
continue;
if (i > c)
break;
if (s[i] == '#')
now++;
else {
if (now >= 2)
sunuke = false;
now = 0;
}
}
if (now >= 2)
sunuke = false;
swap(a, b);
swap(c, d);
now = 0;
for (int i = 0; i < n; ++i) {
if (i < a)
continue;
if (i > c)
break;
if (s[i] == '#')
now++;
else {
if (now >= 2)
hunuke = false;
now = 0;
}
}
swap(a, b);
swap(c, d);
now = 0;
bool flg = false;
if (c > d) {
for (int i = b - 1; i <= d + 1; ++i) {
if (s[i] == '.')
now++;
else {
if (now >= 3)
flg = true;
now = 0;
}
}
if (now >= 3)
flg = true;
}
if (c < d) {
if (sunuke && hunuke)
puts("Yes");
else
puts("No");
} else {
if (sunuke && hunuke && flg)
puts("Yes");
else
puts("No");
}
}
| [
"control_flow.loop.for.initializer.change",
"identifier.change",
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 839,740 | 839,739 | u525008368 | cpp |
p03017 | #include <bits/stdc++.h>
using namespace std;
#define all(a) a.begin(), a.end()
using ll = long long;
const int INF = 1 << 30;
const ll INFll = 1LL << 62;
const int mod = int(1e9) + 7;
using P = pair<ll, ll>;
using ld = long double;
int main() {
int n, a, b, c, d;
cin >> n >> a >> b >> c >> d;
string s;
cin >> s;
a--;
b--;
c--;
d--;
bool sunuke = true;
bool hunuke = true;
int now = 0;
for (int i = 0; i < n; ++i) {
if (i < a)
continue;
if (i > c)
break;
if (s[i] == '#')
now++;
else {
if (now >= 2)
sunuke = false;
now = 0;
}
}
if (now >= 2)
sunuke = false;
swap(a, b);
swap(c, d);
now = 0;
for (int i = 0; i < n; ++i) {
if (i < a)
continue;
if (i > c)
break;
if (s[i] == '#')
now++;
else {
if (now >= 2)
hunuke = false;
now = 0;
}
}
swap(a, b);
swap(c, d);
now = 0;
bool flg = false;
if (c > d) {
for (int i = b - 1; i <= c; ++i) {
if (s[i] == '.')
now++;
else {
if (now >= 3)
flg = true;
now = 0;
}
}
if (now >= 3)
flg = true;
}
if (c < d) {
if (sunuke && hunuke)
puts("Yes");
else
puts("No");
} else {
if (sunuke && hunuke && flg)
puts("Yes");
else
puts("No");
}
}
| #include <bits/stdc++.h>
using namespace std;
#define all(a) a.begin(), a.end()
using ll = long long;
const int INF = 1 << 30;
const ll INFll = 1LL << 62;
const int mod = int(1e9) + 7;
using P = pair<ll, ll>;
using ld = long double;
int main() {
int n, a, b, c, d;
cin >> n >> a >> b >> c >> d;
string s;
cin >> s;
a--;
b--;
c--;
d--;
bool sunuke = true;
bool hunuke = true;
int now = 0;
for (int i = 0; i < n; ++i) {
if (i < a)
continue;
if (i > c)
break;
if (s[i] == '#')
now++;
else {
if (now >= 2)
sunuke = false;
now = 0;
}
}
if (now >= 2)
sunuke = false;
swap(a, b);
swap(c, d);
now = 0;
for (int i = 0; i < n; ++i) {
if (i < a)
continue;
if (i > c)
break;
if (s[i] == '#')
now++;
else {
if (now >= 2)
hunuke = false;
now = 0;
}
}
swap(a, b);
swap(c, d);
now = 0;
bool flg = false;
if (c > d) {
for (int i = b - 1; i <= d + 1; ++i) {
if (s[i] == '.')
now++;
else {
if (now >= 3)
flg = true;
now = 0;
}
}
if (now >= 3)
flg = true;
}
if (c < d) {
if (sunuke && hunuke)
puts("Yes");
else
puts("No");
} else {
if (sunuke && hunuke && flg)
puts("Yes");
else
puts("No");
}
}
| [
"identifier.change",
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 839,741 | 839,739 | u525008368 | cpp |
p03017 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <numeric>
#include <queue>
#include <regex>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <type_traits>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
#define rep(i, n) for (lint i = 0; i < n; i++)
#define repr(i, n) for (lint i = n - 1; i >= 0; i--)
#define repi(i, ini, n) for (lint i = ini; i < n; i++)
#define repir(i, ini, n) for (lint i = n - 1; i >= ini; i--)
#define repb(i, start, end) for (lint i = start; i <= end; i++)
#define repbr(i, start, end) for (lint i = end; i >= start; i--)
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define rg(v, n) v.begin(), v.begin() + n
#define rrg(v, n) v.rbegin(), v.rbegin() + n
#define ret return 0;
namespace {
using lint = long long;
using ulint = unsigned long long;
using ld = long double;
struct xy {
lint x, y;
xy() : x(0), y(0) {}
xy(lint _x, lint _y) : x(_x), y(_y) {}
xy operator+(const xy &p) const { return xy(x + p.x, y + p.y); }
bool operator<(xy p) const {
if (y == p.y)
return x < p.x;
return y < p.y;
}
};
struct xyd {
ld x, y;
xyd() : x(0), y(0) {}
xyd(long double _x, long double _y) : x(_x), y(_y) {}
};
using vec = vector<lint>;
using vecd = vector<ld>;
using vecs = vector<string>;
using vecp = vector<xy>;
template <class T> using vect = vector<T>;
class vec2 : public vector<vector<lint>> {
public:
vec2() {}
vec2(lint n) : vector(n) {}
vec2(lint h, lint w) : vector(h, vector<lint>(w)) {}
vec2(lint h, lint w, lint v) : vector(h, vector<lint>(w, v)) {}
};
template <class T> using priq = priority_queue<T>;
template <class T> using rpriq = priority_queue<T, vector<T>, greater<T>>;
// const ulint mod = 1000000007;
const ulint mod = 998244353;
const double pi = 3.141592653589793238462;
const lint intmax = 9223372036854775807;
const lint inf = 1100100100100100100LL;
const ld eps = 0.0000001;
const lint alpn = 'z' - 'a' + 1;
template <class It> constexpr auto acc(It begin, It end) {
return accumulate(begin, end, typename It::value_type(0));
}
template <class T> constexpr auto msum(T arg0) { return arg0; }
template <class T, class... Types> constexpr auto msum(T arg0, Types... args) {
static_assert(sizeof...(args) > 0, "arg err");
return arg0 + msum(args...);
}
template <class It> constexpr typename It::value_type mmax(It begin, It end) {
return *max_element(begin, end);
}
template <class It> constexpr typename It::value_type mmin(It begin, It end) {
return *min_element(begin, end);
}
template <class T> constexpr auto mmax(T arg) { return arg; }
template <class T, class... Types> constexpr auto mmax(T arg0, Types... args) {
using promote_t = decltype(msum(arg0, args...));
return max(static_cast<promote_t>(arg0),
static_cast<promote_t>(mmax(args...)));
}
template <class T> constexpr auto mmin(T arg) { return arg; }
template <class T, class... Types> constexpr auto mmin(T arg0, Types... args) {
using promote_t = decltype(msum(arg0, args...));
return min(static_cast<promote_t>(arg0),
static_cast<promote_t>(mmin(args...)));
}
constexpr auto clamp(lint val, lint left, lint right) {
return mmax(mmin(val, right), left);
}
constexpr lint div2(lint p, lint q) { return (p + q - 1) / q; }
lint gcd(lint a, lint b) {
while (1) {
if (a < b)
swap(a, b);
if (!b)
break;
a %= b;
}
return a;
}
lint lcm(lint a, lint b) { return a / gcd(a, b) * b; }
lint powInt(lint a, lint b) {
if (b == 0) {
return 1;
}
if (b == 1) {
return a;
}
lint tmp = powInt(a, b / 2);
return (b % 2 == 1 ? a * tmp * tmp : tmp * tmp);
}
template <class T> T sgn(T val) {
if (val == T(0))
return T(0);
if (val < 0)
return T(-1);
if (val > 0)
return T(1);
}
template <class T> constexpr auto modK_belowN(T k, T MOD, T n) {
return (n + MOD - k - 1) / MOD;
}
template <class It, class T> bool exist(It begin, It end, const T &val) {
return find(begin, end, val) != end;
}
template <class It, class Pr> bool exist_if(It begin, It end, Pr pred) {
return find_if(begin, end, pred) != end;
}
template <class T> bool between(T val, T l, T r) {
return (val >= l) && (val <= r);
}
template <class It> auto carr(It begin, It end) {
vec c;
c.push_back(1);
auto before = *begin;
for (auto it = begin + 1; it != end; it++) {
if (before != *it) {
c.push_back(0);
before = *it;
}
c.back()++;
}
return c;
}
template <class T> struct nval {
lint n;
T val;
nval() : n(0){};
nval(lint _n, T _val) : n(_n), val(_val){};
};
template <class It> auto carr2(It begin, It end) {
using T = nval<remove_reference_t<decltype(*begin)>>;
vect<T> c;
c.push_back(T(1, *begin));
auto before = *begin;
for (auto it = begin + 1; it != end; it++) {
if (before != *it) {
c.push_back(T(0, *it));
before = *it;
}
c.back().n++;
}
return c;
}
template <class It, class... T> void sort2(It begin, It end, T... p) {
using val_t = remove_reference_t<decltype(*begin)>;
sort(begin, end, [p...](val_t a, val_t b) {
bool neq[] = {(a.*p != b.*p)...};
bool sg[] = {(a.*p < b.*p)...};
rep(i, sizeof...(p)) {
if (neq[i]) {
return sg[i];
}
}
return false;
});
}
template <size_t _K, size_t _N, class... Types, size_t... indices>
auto constexpr __ModKtuple_Impl(index_sequence<indices...>,
tuple<Types...> args) {
return make_tuple(get<indices * _N + _K>(args)...);
}
template <size_t K, size_t N, class... Types>
auto constexpr ModKtuple(Types... args) {
return __ModKtuple_Impl<K, N>(
make_index_sequence<modK_belowN(K, N, sizeof...(args))>{},
forward_as_tuple(args...));
}
template <class It, class... T, class... Tsg, size_t... indices>
void __sort3_Impl(It begin, It end, tuple<T...> p, tuple<Tsg...> sgf,
index_sequence<indices...>) {
using val_t = remove_reference_t<decltype(*begin)>;
sort(begin, end, [p, sgf](val_t a, val_t b) {
bool neq[] = {(a.*(get<indices>(p)) != b.*(get<indices>(p)))...};
bool sg[] = {((a.*(get<indices>(p)) < b.*(get<indices>(p))) !=
(get<indices>(sgf)))...};
rep(i, sizeof...(indices)) {
if (neq[i]) {
return sg[i];
}
}
return false;
});
}
template <class It, class... T> void sort3(It begin, It end, T... p) {
using val_t = remove_reference_t<decltype(*begin)>;
auto p_forward = ModKtuple<0, 2>(p...);
auto sgf_forward = ModKtuple<1, 2>(p...);
constexpr auto p_sz = tuple_size<decltype(p_forward)>::value;
constexpr auto sgf_sz = tuple_size<decltype(sgf_forward)>::value;
static_assert(p_sz == sgf_sz, "arg err");
__sort3_Impl(begin, end, p_forward, sgf_forward, make_index_sequence<p_sz>{});
}
char caesar(char s, lint key) {
if (between(s, 'A', 'Z')) {
return (s - 'A' + key) % alpn + 'A';
}
if (between(s, 'a', 'z')) {
return (s - 'a' + key) % alpn + 'a';
}
return s;
}
string caesar(string s, lint key) {
rep(i, s.length()) s[i] = caesar(s[i], key);
return s;
}
template <class It, class It2> auto spacel(It i, It2 end) {
if (i + 1 == end) {
return '\n';
} else {
return ' ';
}
}
template <class It> bool next_comb(lint n, It begin, It end) {
auto rend = make_reverse_iterator(begin);
auto rbegin = make_reverse_iterator(end);
auto rit = rbegin;
for (; rit != rend; rit++) {
if ((rit == rbegin && (*rit) + 1 != n) ||
(rit != rbegin && (*rit) + 1 != *(rit - 1))) {
goto found;
}
}
return false;
found:;
(*rit)++;
for (auto it = rit.base(); it != end; it++) {
(*it) = (*(it - 1)) + 1;
}
return true;
}
ostream &setp(ostream &ost) {
cout << setprecision(60) << fixed;
return ost;
}
#ifdef _LOCAL
auto &dbg = cout;
#else
struct dummy_cout {
template <class T> dummy_cout &operator<<(T &&op) { return *this; }
using endl_t = basic_ostream<char, char_traits<char>>;
dummy_cout &operator<<(endl_t &(*)(endl_t &)) { return *this; }
};
dummy_cout dbg;
#endif
}; // namespace
int main() {
lint n, a, b, c, d;
cin >> n >> a >> b >> c >> d;
a--;
b--;
c--;
d--;
string s;
cin >> s;
bool o = true;
repi(i, a, c - 1) {
if (s[i] == '#' && s[i + 1] == '#')
o = false;
}
repi(i, b, d - 1) {
if (s[i] == '#' && s[i + 1] == '#')
o = false;
}
if (c > d) {
bool k = false;
repi(i, b - 1, d - 1) {
if (s[i] == '.' && s[i + 1] == '.' && s[i + 2] == '.') {
k = true;
}
}
o &= k;
}
if (o) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
return 0;
}
| #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <numeric>
#include <queue>
#include <regex>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <type_traits>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
#define rep(i, n) for (lint i = 0; i < n; i++)
#define repr(i, n) for (lint i = n - 1; i >= 0; i--)
#define repi(i, ini, n) for (lint i = ini; i < n; i++)
#define repir(i, ini, n) for (lint i = n - 1; i >= ini; i--)
#define repb(i, start, end) for (lint i = start; i <= end; i++)
#define repbr(i, start, end) for (lint i = end; i >= start; i--)
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define rg(v, n) v.begin(), v.begin() + n
#define rrg(v, n) v.rbegin(), v.rbegin() + n
#define ret return 0;
namespace {
using lint = long long;
using ulint = unsigned long long;
using ld = long double;
struct xy {
lint x, y;
xy() : x(0), y(0) {}
xy(lint _x, lint _y) : x(_x), y(_y) {}
xy operator+(const xy &p) const { return xy(x + p.x, y + p.y); }
bool operator<(xy p) const {
if (y == p.y)
return x < p.x;
return y < p.y;
}
};
struct xyd {
ld x, y;
xyd() : x(0), y(0) {}
xyd(long double _x, long double _y) : x(_x), y(_y) {}
};
using vec = vector<lint>;
using vecd = vector<ld>;
using vecs = vector<string>;
using vecp = vector<xy>;
template <class T> using vect = vector<T>;
class vec2 : public vector<vector<lint>> {
public:
vec2() {}
vec2(lint n) : vector(n) {}
vec2(lint h, lint w) : vector(h, vector<lint>(w)) {}
vec2(lint h, lint w, lint v) : vector(h, vector<lint>(w, v)) {}
};
template <class T> using priq = priority_queue<T>;
template <class T> using rpriq = priority_queue<T, vector<T>, greater<T>>;
// const ulint mod = 1000000007;
const ulint mod = 998244353;
const double pi = 3.141592653589793238462;
const lint intmax = 9223372036854775807;
const lint inf = 1100100100100100100LL;
const ld eps = 0.0000001;
const lint alpn = 'z' - 'a' + 1;
template <class It> constexpr auto acc(It begin, It end) {
return accumulate(begin, end, typename It::value_type(0));
}
template <class T> constexpr auto msum(T arg0) { return arg0; }
template <class T, class... Types> constexpr auto msum(T arg0, Types... args) {
static_assert(sizeof...(args) > 0, "arg err");
return arg0 + msum(args...);
}
template <class It> constexpr typename It::value_type mmax(It begin, It end) {
return *max_element(begin, end);
}
template <class It> constexpr typename It::value_type mmin(It begin, It end) {
return *min_element(begin, end);
}
template <class T> constexpr auto mmax(T arg) { return arg; }
template <class T, class... Types> constexpr auto mmax(T arg0, Types... args) {
using promote_t = decltype(msum(arg0, args...));
return max(static_cast<promote_t>(arg0),
static_cast<promote_t>(mmax(args...)));
}
template <class T> constexpr auto mmin(T arg) { return arg; }
template <class T, class... Types> constexpr auto mmin(T arg0, Types... args) {
using promote_t = decltype(msum(arg0, args...));
return min(static_cast<promote_t>(arg0),
static_cast<promote_t>(mmin(args...)));
}
constexpr auto clamp(lint val, lint left, lint right) {
return mmax(mmin(val, right), left);
}
constexpr lint div2(lint p, lint q) { return (p + q - 1) / q; }
lint gcd(lint a, lint b) {
while (1) {
if (a < b)
swap(a, b);
if (!b)
break;
a %= b;
}
return a;
}
lint lcm(lint a, lint b) { return a / gcd(a, b) * b; }
lint powInt(lint a, lint b) {
if (b == 0) {
return 1;
}
if (b == 1) {
return a;
}
lint tmp = powInt(a, b / 2);
return (b % 2 == 1 ? a * tmp * tmp : tmp * tmp);
}
template <class T> T sgn(T val) {
if (val == T(0))
return T(0);
if (val < 0)
return T(-1);
if (val > 0)
return T(1);
}
template <class T> constexpr auto modK_belowN(T k, T MOD, T n) {
return (n + MOD - k - 1) / MOD;
}
template <class It, class T> bool exist(It begin, It end, const T &val) {
return find(begin, end, val) != end;
}
template <class It, class Pr> bool exist_if(It begin, It end, Pr pred) {
return find_if(begin, end, pred) != end;
}
template <class T> bool between(T val, T l, T r) {
return (val >= l) && (val <= r);
}
template <class It> auto carr(It begin, It end) {
vec c;
c.push_back(1);
auto before = *begin;
for (auto it = begin + 1; it != end; it++) {
if (before != *it) {
c.push_back(0);
before = *it;
}
c.back()++;
}
return c;
}
template <class T> struct nval {
lint n;
T val;
nval() : n(0){};
nval(lint _n, T _val) : n(_n), val(_val){};
};
template <class It> auto carr2(It begin, It end) {
using T = nval<remove_reference_t<decltype(*begin)>>;
vect<T> c;
c.push_back(T(1, *begin));
auto before = *begin;
for (auto it = begin + 1; it != end; it++) {
if (before != *it) {
c.push_back(T(0, *it));
before = *it;
}
c.back().n++;
}
return c;
}
template <class It, class... T> void sort2(It begin, It end, T... p) {
using val_t = remove_reference_t<decltype(*begin)>;
sort(begin, end, [p...](val_t a, val_t b) {
bool neq[] = {(a.*p != b.*p)...};
bool sg[] = {(a.*p < b.*p)...};
rep(i, sizeof...(p)) {
if (neq[i]) {
return sg[i];
}
}
return false;
});
}
template <size_t _K, size_t _N, class... Types, size_t... indices>
auto constexpr __ModKtuple_Impl(index_sequence<indices...>,
tuple<Types...> args) {
return make_tuple(get<indices * _N + _K>(args)...);
}
template <size_t K, size_t N, class... Types>
auto constexpr ModKtuple(Types... args) {
return __ModKtuple_Impl<K, N>(
make_index_sequence<modK_belowN(K, N, sizeof...(args))>{},
forward_as_tuple(args...));
}
template <class It, class... T, class... Tsg, size_t... indices>
void __sort3_Impl(It begin, It end, tuple<T...> p, tuple<Tsg...> sgf,
index_sequence<indices...>) {
using val_t = remove_reference_t<decltype(*begin)>;
sort(begin, end, [p, sgf](val_t a, val_t b) {
bool neq[] = {(a.*(get<indices>(p)) != b.*(get<indices>(p)))...};
bool sg[] = {((a.*(get<indices>(p)) < b.*(get<indices>(p))) !=
(get<indices>(sgf)))...};
rep(i, sizeof...(indices)) {
if (neq[i]) {
return sg[i];
}
}
return false;
});
}
template <class It, class... T> void sort3(It begin, It end, T... p) {
using val_t = remove_reference_t<decltype(*begin)>;
auto p_forward = ModKtuple<0, 2>(p...);
auto sgf_forward = ModKtuple<1, 2>(p...);
constexpr auto p_sz = tuple_size<decltype(p_forward)>::value;
constexpr auto sgf_sz = tuple_size<decltype(sgf_forward)>::value;
static_assert(p_sz == sgf_sz, "arg err");
__sort3_Impl(begin, end, p_forward, sgf_forward, make_index_sequence<p_sz>{});
}
char caesar(char s, lint key) {
if (between(s, 'A', 'Z')) {
return (s - 'A' + key) % alpn + 'A';
}
if (between(s, 'a', 'z')) {
return (s - 'a' + key) % alpn + 'a';
}
return s;
}
string caesar(string s, lint key) {
rep(i, s.length()) s[i] = caesar(s[i], key);
return s;
}
template <class It, class It2> auto spacel(It i, It2 end) {
if (i + 1 == end) {
return '\n';
} else {
return ' ';
}
}
template <class It> bool next_comb(lint n, It begin, It end) {
auto rend = make_reverse_iterator(begin);
auto rbegin = make_reverse_iterator(end);
auto rit = rbegin;
for (; rit != rend; rit++) {
if ((rit == rbegin && (*rit) + 1 != n) ||
(rit != rbegin && (*rit) + 1 != *(rit - 1))) {
goto found;
}
}
return false;
found:;
(*rit)++;
for (auto it = rit.base(); it != end; it++) {
(*it) = (*(it - 1)) + 1;
}
return true;
}
ostream &setp(ostream &ost) {
cout << setprecision(60) << fixed;
return ost;
}
#ifdef _LOCAL
auto &dbg = cout;
#else
struct dummy_cout {
template <class T> dummy_cout &operator<<(T &&op) { return *this; }
using endl_t = basic_ostream<char, char_traits<char>>;
dummy_cout &operator<<(endl_t &(*)(endl_t &)) { return *this; }
};
dummy_cout dbg;
#endif
}; // namespace
int main() {
lint n, a, b, c, d;
cin >> n >> a >> b >> c >> d;
a--;
b--;
c--;
d--;
string s;
cin >> s;
bool o = true;
repb(i, a, c - 1) {
if (s[i] == '#' && s[i + 1] == '#')
o = false;
}
repb(i, b, d - 1) {
if (s[i] == '#' && s[i + 1] == '#')
o = false;
}
if (c > d) {
bool k = false;
repb(i, b - 1, d - 1) {
if (s[i] == '.' && s[i + 1] == '.' && s[i + 2] == '.') {
k = true;
}
}
o &= k;
}
if (o) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
return 0;
}
| [
"identifier.change",
"call.function.change"
] | 839,744 | 839,745 | u275797573 | cpp |
p03017 | #pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC push_options
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx")
#include <bits/stdc++.h>
#include <immintrin.h>
#include <xmmintrin.h>
using namespace ::std;
__attribute__((constructor)) void init() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(15);
}
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/priority_queue.hpp>
#include <ext/pb_ds/tag_and_trait.hpp>
#include <ext/pb_ds/tree_policy.hpp>
// #include <boost/multiprecision/cpp_dec_float.hpp>
// #include <boost/multiprecision/cpp_int.hpp>
// namespace mp = boost::multiprecision;
// typedef mp::number<mp::cpp_dec_float<0>> cdouble;
// typedef mp::cpp_int cint;
template <typename T>
using pbds =
__gnu_pbds::tree<T, __gnu_pbds::null_type, less<T>, __gnu_pbds::rb_tree_tag,
__gnu_pbds::tree_order_statistics_node_update>;
template <typename T>
using pbds_map =
__gnu_pbds::tree<T, T, less<T>, __gnu_pbds::rb_tree_tag,
__gnu_pbds::tree_order_statistics_node_update>;
template <typename T, typename E>
using hash_map = __gnu_pbds::gp_hash_table<T, E>;
template <typename T>
using pqueue =
__gnu_pbds::priority_queue<T, greater<T>, __gnu_pbds::rc_binomial_heap_tag>;
typedef long long lint;
#define INF (1LL << 60)
#define IINF (1 << 30)
#define LINF (9223372036854775807LL)
#define EPS (1e-10)
#define endl ('\n')
#define MOD 1000000007LL
//#define MOD 998244353LL
//#define MOD 18446744069414584321ULL
typedef vector<lint> vec;
typedef vector<vector<lint>> mat;
typedef vector<vector<vector<lint>>> mat3;
typedef vector<string> svec;
typedef vector<vector<string>> smat;
template <typename T> inline void numout(T t) {
bool f = 0;
for (auto i : t) {
cout << (f ? " " : "") << i < INF / 2 ? i : "INF";
f = 1;
}
cout << endl;
}
template <typename T> inline void numout2(T t) {
for (auto i : t)
numout(i);
}
template <typename T> inline void output(T t) {
bool f = 0;
for (auto i : t) {
cout << (f ? " " : "") << i;
f = 1;
}
cout << endl;
}
template <typename T> inline void output2(T t) {
for (auto i : t)
output(i);
}
template <typename T> inline void _output(T t) {
bool f = 0;
for (lint i = 0; i < t.size(); i++) {
cout << f ? "" : " " << t[i];
f = 1;
}
cout << endl;
}
template <typename T> inline void _output2(T t) {
for (lint i = 0; i < t.size(); i++)
output(t[i]);
}
#define rep(i, n) for (lint i = 0; i < lint(n); ++i)
#define repi(i, a, b) for (lint i = lint(a); i < (lint)(b); ++i)
#define rrep(i, n) for (lint i = lint(n) - 1; i >= 0; --i)
#define rrepi(i, a, b) for (lint i = lint(b) - 1; i >= lint(a); --i)
#define irep(i) for (lint i = 0;; ++i)
#define all(n) begin(n), end(n)
#define dist(a, b, c, d) sqrt(pow(a - c, 2) + pow(b - d, 2))
inline lint gcd(lint A, lint B) { return B ? gcd(B, A % B) : A; }
inline lint lcm(lint A, lint B) { return A / gcd(A, B) * B; }
// inline cint cgcd(cint A,cint B){return B?cgcd(B,A%B):A;}
// inline cint clcm(cint A,cint B){return A/cgcd(A,B)*B;}
bool chmin(auto &s, const auto &t) {
bool res = s > t;
s = min(s, t);
return res;
}
bool chmax(auto &s, const auto &t) {
bool res = s < t;
s = max(s, t);
return res;
}
const vector<lint> dx = {1, 0, -1, 0, 1, 1, -1, -1};
const vector<lint> dy = {0, 1, 0, -1, 1, -1, 1, -1};
#define SUM(v) accumulate(all(v), 0LL)
auto call = [](auto f, auto... args) { return f(f, args...); };
template <typename T, typename... Args>
auto make_vector(T x, int arg, Args... args) {
if constexpr (sizeof...(args) == 0)
return vector<T>(arg, x);
else
return vector(arg, make_vector<T>(x, args...));
}
class mint {
using u64 = std::uint_fast64_t;
public:
u64 a;
constexpr mint(const long long x = 0) noexcept
: a(x >= 0 ? x % get_mod() : get_mod() - (-x) % get_mod()) {}
constexpr u64 &value() noexcept { return a; }
constexpr const u64 &value() const noexcept { return a; }
constexpr mint operator+(const mint rhs) const noexcept {
return mint(*this) += rhs;
}
constexpr mint operator-(const mint rhs) const noexcept {
return mint(*this) -= rhs;
}
constexpr mint operator*(const mint rhs) const noexcept {
return mint(*this) *= rhs;
}
constexpr mint operator/(const mint rhs) const noexcept {
return mint(*this) /= rhs;
}
constexpr mint &operator+=(const mint rhs) noexcept {
a += rhs.a;
if (a >= get_mod())
a -= get_mod();
return *this;
}
constexpr mint &operator-=(const mint rhs) noexcept {
if (a < rhs.a)
a += get_mod();
a -= rhs.a;
return *this;
}
constexpr mint &operator*=(const mint rhs) noexcept {
a = a * rhs.a % get_mod();
return *this;
}
constexpr mint operator++(int n) noexcept {
a += 1;
if (a >= get_mod())
a -= get_mod();
return *this;
}
constexpr mint operator--(int n) noexcept {
if (a < 1)
a += get_mod();
a -= 1;
return *this;
}
constexpr mint &operator/=(mint rhs) noexcept {
u64 exp = get_mod() - 2;
while (exp) {
if (exp % 2) {
*this *= rhs;
}
rhs *= rhs;
exp /= 2;
}
return *this;
}
constexpr bool operator==(mint x) noexcept { return a == x.a; }
constexpr bool operator!=(mint x) noexcept { return a != x.a; }
constexpr bool operator<(mint x) noexcept { return a < x.a; }
constexpr bool operator>(mint x) noexcept { return a > x.a; }
constexpr bool operator<=(mint x) noexcept { return a <= x.a; }
constexpr bool operator>=(mint x) noexcept { return a >= x.a; }
constexpr static int root() {
mint root = 2;
while (root.pow((get_mod() - 1) >> 1).a == 1)
root++;
return root.a;
}
constexpr mint pow(long long n) {
long long x = a;
mint ret = 1;
while (n > 0) {
if (n & 1)
(ret *= x);
(x *= x) %= get_mod();
n >>= 1;
}
return ret;
}
constexpr mint inv() { return pow(get_mod() - 2); }
static vector<mint> fac, ifac;
static bool init;
constexpr static int mx = 10000001;
void build() {
init = 0;
fac.resize(mx);
ifac.resize(mx);
fac[0] = 1, ifac[0] = 1;
for (int i = 1; i < mx; i++)
fac[i] = fac[i - 1] * i;
ifac[mx - 1] = fac[mx - 1].inv();
for (int i = mx - 2; i >= 0; i--)
ifac[i] = ifac[i + 1] * (i + 1);
}
mint comb(lint b) {
if (init)
build();
if (a == 0 && b == 0)
return 1;
if ((lint)a < b || a < 0)
return 0;
return fac[a] * ifac[a - b] * ifac[b];
}
mint fact() {
if (init)
build();
return fac[a];
}
mint fact_inv() {
if (init)
build();
return ifac[a];
}
friend ostream &operator<<(ostream &lhs, const mint &rhs) noexcept {
lhs << rhs.a;
return lhs;
}
friend istream &operator>>(istream &lhs, mint &rhs) noexcept {
lhs >> rhs.a;
return lhs;
}
constexpr static u64 get_mod() { return MOD; }
};
vector<mint> mint::fac;
vector<mint> mint::ifac;
bool mint::init = 1;
int main() {
lint n, a, b, c, d;
string s;
cin >> n >> a >> b >> c >> d >> s;
a--;
b--;
c--;
d--;
repi(i, a, c) {
if (s[i] == '#' && s[i + 1] == '#') {
cout << "No" << endl;
return 0;
}
}
repi(i, b, d) {
if (s[i] == '#' && s[i + 1] == '#') {
cout << "No" << endl;
return 0;
}
}
if (c < d) {
cout << "Yes" << endl;
return 0;
} else {
repi(i, b - 1, c) {
if (s[i] == '.' && s[i + 1] == '.' && s[i + 2] == '.') {
cout << "Yes" << endl;
return 0;
}
}
cout << "No" << endl;
}
} | #pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC push_options
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx")
#include <bits/stdc++.h>
#include <immintrin.h>
#include <xmmintrin.h>
using namespace ::std;
__attribute__((constructor)) void init() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(15);
}
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/priority_queue.hpp>
#include <ext/pb_ds/tag_and_trait.hpp>
#include <ext/pb_ds/tree_policy.hpp>
// #include <boost/multiprecision/cpp_dec_float.hpp>
// #include <boost/multiprecision/cpp_int.hpp>
// namespace mp = boost::multiprecision;
// typedef mp::number<mp::cpp_dec_float<0>> cdouble;
// typedef mp::cpp_int cint;
template <typename T>
using pbds =
__gnu_pbds::tree<T, __gnu_pbds::null_type, less<T>, __gnu_pbds::rb_tree_tag,
__gnu_pbds::tree_order_statistics_node_update>;
template <typename T>
using pbds_map =
__gnu_pbds::tree<T, T, less<T>, __gnu_pbds::rb_tree_tag,
__gnu_pbds::tree_order_statistics_node_update>;
template <typename T, typename E>
using hash_map = __gnu_pbds::gp_hash_table<T, E>;
template <typename T>
using pqueue =
__gnu_pbds::priority_queue<T, greater<T>, __gnu_pbds::rc_binomial_heap_tag>;
typedef long long lint;
#define INF (1LL << 60)
#define IINF (1 << 30)
#define LINF (9223372036854775807LL)
#define EPS (1e-10)
#define endl ('\n')
#define MOD 1000000007LL
//#define MOD 998244353LL
//#define MOD 18446744069414584321ULL
typedef vector<lint> vec;
typedef vector<vector<lint>> mat;
typedef vector<vector<vector<lint>>> mat3;
typedef vector<string> svec;
typedef vector<vector<string>> smat;
template <typename T> inline void numout(T t) {
bool f = 0;
for (auto i : t) {
cout << (f ? " " : "") << i < INF / 2 ? i : "INF";
f = 1;
}
cout << endl;
}
template <typename T> inline void numout2(T t) {
for (auto i : t)
numout(i);
}
template <typename T> inline void output(T t) {
bool f = 0;
for (auto i : t) {
cout << (f ? " " : "") << i;
f = 1;
}
cout << endl;
}
template <typename T> inline void output2(T t) {
for (auto i : t)
output(i);
}
template <typename T> inline void _output(T t) {
bool f = 0;
for (lint i = 0; i < t.size(); i++) {
cout << f ? "" : " " << t[i];
f = 1;
}
cout << endl;
}
template <typename T> inline void _output2(T t) {
for (lint i = 0; i < t.size(); i++)
output(t[i]);
}
#define rep(i, n) for (lint i = 0; i < lint(n); ++i)
#define repi(i, a, b) for (lint i = lint(a); i < (lint)(b); ++i)
#define rrep(i, n) for (lint i = lint(n) - 1; i >= 0; --i)
#define rrepi(i, a, b) for (lint i = lint(b) - 1; i >= lint(a); --i)
#define irep(i) for (lint i = 0;; ++i)
#define all(n) begin(n), end(n)
#define dist(a, b, c, d) sqrt(pow(a - c, 2) + pow(b - d, 2))
inline lint gcd(lint A, lint B) { return B ? gcd(B, A % B) : A; }
inline lint lcm(lint A, lint B) { return A / gcd(A, B) * B; }
// inline cint cgcd(cint A,cint B){return B?cgcd(B,A%B):A;}
// inline cint clcm(cint A,cint B){return A/cgcd(A,B)*B;}
bool chmin(auto &s, const auto &t) {
bool res = s > t;
s = min(s, t);
return res;
}
bool chmax(auto &s, const auto &t) {
bool res = s < t;
s = max(s, t);
return res;
}
const vector<lint> dx = {1, 0, -1, 0, 1, 1, -1, -1};
const vector<lint> dy = {0, 1, 0, -1, 1, -1, 1, -1};
#define SUM(v) accumulate(all(v), 0LL)
auto call = [](auto f, auto... args) { return f(f, args...); };
template <typename T, typename... Args>
auto make_vector(T x, int arg, Args... args) {
if constexpr (sizeof...(args) == 0)
return vector<T>(arg, x);
else
return vector(arg, make_vector<T>(x, args...));
}
class mint {
using u64 = std::uint_fast64_t;
public:
u64 a;
constexpr mint(const long long x = 0) noexcept
: a(x >= 0 ? x % get_mod() : get_mod() - (-x) % get_mod()) {}
constexpr u64 &value() noexcept { return a; }
constexpr const u64 &value() const noexcept { return a; }
constexpr mint operator+(const mint rhs) const noexcept {
return mint(*this) += rhs;
}
constexpr mint operator-(const mint rhs) const noexcept {
return mint(*this) -= rhs;
}
constexpr mint operator*(const mint rhs) const noexcept {
return mint(*this) *= rhs;
}
constexpr mint operator/(const mint rhs) const noexcept {
return mint(*this) /= rhs;
}
constexpr mint &operator+=(const mint rhs) noexcept {
a += rhs.a;
if (a >= get_mod())
a -= get_mod();
return *this;
}
constexpr mint &operator-=(const mint rhs) noexcept {
if (a < rhs.a)
a += get_mod();
a -= rhs.a;
return *this;
}
constexpr mint &operator*=(const mint rhs) noexcept {
a = a * rhs.a % get_mod();
return *this;
}
constexpr mint operator++(int n) noexcept {
a += 1;
if (a >= get_mod())
a -= get_mod();
return *this;
}
constexpr mint operator--(int n) noexcept {
if (a < 1)
a += get_mod();
a -= 1;
return *this;
}
constexpr mint &operator/=(mint rhs) noexcept {
u64 exp = get_mod() - 2;
while (exp) {
if (exp % 2) {
*this *= rhs;
}
rhs *= rhs;
exp /= 2;
}
return *this;
}
constexpr bool operator==(mint x) noexcept { return a == x.a; }
constexpr bool operator!=(mint x) noexcept { return a != x.a; }
constexpr bool operator<(mint x) noexcept { return a < x.a; }
constexpr bool operator>(mint x) noexcept { return a > x.a; }
constexpr bool operator<=(mint x) noexcept { return a <= x.a; }
constexpr bool operator>=(mint x) noexcept { return a >= x.a; }
constexpr static int root() {
mint root = 2;
while (root.pow((get_mod() - 1) >> 1).a == 1)
root++;
return root.a;
}
constexpr mint pow(long long n) {
long long x = a;
mint ret = 1;
while (n > 0) {
if (n & 1)
(ret *= x);
(x *= x) %= get_mod();
n >>= 1;
}
return ret;
}
constexpr mint inv() { return pow(get_mod() - 2); }
static vector<mint> fac, ifac;
static bool init;
constexpr static int mx = 10000001;
void build() {
init = 0;
fac.resize(mx);
ifac.resize(mx);
fac[0] = 1, ifac[0] = 1;
for (int i = 1; i < mx; i++)
fac[i] = fac[i - 1] * i;
ifac[mx - 1] = fac[mx - 1].inv();
for (int i = mx - 2; i >= 0; i--)
ifac[i] = ifac[i + 1] * (i + 1);
}
mint comb(lint b) {
if (init)
build();
if (a == 0 && b == 0)
return 1;
if ((lint)a < b || a < 0)
return 0;
return fac[a] * ifac[a - b] * ifac[b];
}
mint fact() {
if (init)
build();
return fac[a];
}
mint fact_inv() {
if (init)
build();
return ifac[a];
}
friend ostream &operator<<(ostream &lhs, const mint &rhs) noexcept {
lhs << rhs.a;
return lhs;
}
friend istream &operator>>(istream &lhs, mint &rhs) noexcept {
lhs >> rhs.a;
return lhs;
}
constexpr static u64 get_mod() { return MOD; }
};
vector<mint> mint::fac;
vector<mint> mint::ifac;
bool mint::init = 1;
int main() {
lint n, a, b, c, d;
string s;
cin >> n >> a >> b >> c >> d >> s;
a--;
b--;
c--;
d--;
repi(i, a, c) {
if (s[i] == '#' && s[i + 1] == '#') {
cout << "No" << endl;
return 0;
}
}
repi(i, b, d) {
if (s[i] == '#' && s[i + 1] == '#') {
cout << "No" << endl;
return 0;
}
}
if (c < d) {
cout << "Yes" << endl;
return 0;
} else {
repi(i, b - 1, d) {
if (s[i] == '.' && s[i + 1] == '.' && s[i + 2] == '.') {
cout << "Yes" << endl;
return 0;
}
}
cout << "No" << endl;
}
} | [
"identifier.change",
"call.arguments.change"
] | 839,752 | 839,753 | u168579419 | cpp |
p03017 | #include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <ctime>
#include <deque>
#include <float.h>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <type_traits>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
using ll = long long;
unsigned euclidean_gcd(unsigned a, unsigned b) {
if (a < b)
return euclidean_gcd(b, a);
unsigned r;
while ((r = a % b)) {
a = b;
b = r;
}
return b;
}
ll ll_gcd(ll a, ll b) {
if (a < b)
return ll_gcd(b, a);
ll r;
while ((r = a % b)) {
a = b;
b = r;
}
return b;
}
class UnionFind {
public:
vector<ll> par;
vector<ll> siz;
UnionFind(ll sz_) : par(sz_), siz(sz_, 1LL) {
for (ll i = 0; i < sz_; ++i)
par[i] = i;
}
void init(ll sz_) {
par.resize(sz_);
siz.assign(sz_, 1LL);
for (ll i = 0; i < sz_; ++i)
par[i] = i;
}
ll root(ll x) {
while (par[x] != x) {
x = par[x] = par[par[x]];
}
return x;
}
bool merge(ll x, ll y) {
x = root(x);
y = root(y);
if (x == y)
return false;
if (siz[x] < siz[y])
swap(x, y);
siz[x] += siz[y];
par[y] = x;
return true;
}
bool issame(ll x, ll y) { return root(x) == root(y); }
ll size(ll x) { return siz[root(x)]; }
};
long long modpow(long long a, long long n, long long mod) {
long long res = 1;
while (n > 0) {
if (n & 1)
res = res * a % mod;
a = a * a % mod;
n >>= 1;
}
return res;
}
long long modinv(long long a, long long mod) { return modpow(a, mod - 2, mod); }
vector<int> tpsort(vector<vector<int>> &G) {
int V = G.size();
vector<int> sorted_vertices;
queue<int> que;
vector<int> indegree(V);
for (int i = 0; i < V; i++) {
for (int j = 0; j < G[i].size(); j++) {
indegree[G[i][j]]++;
}
}
for (int i = 0; i < V; i++) {
if (indegree[i] == 0) {
que.push(i);
}
}
while (que.empty() == false) {
int v = que.front();
que.pop();
for (int i = 0; i < G[v].size(); i++) {
int u = G[v][i];
indegree[u] -= 1;
if (indegree[u] == 0)
que.push(u);
}
sorted_vertices.push_back(v);
}
return sorted_vertices;
}
struct Point {
double x;
double y;
};
struct LineSegment {
Point start;
Point end;
};
double tenkyori(const LineSegment &line, const Point &point) {
double x0 = point.x, y0 = point.y;
double x1 = line.start.x, y1 = line.start.y;
double x2 = line.end.x, y2 = line.end.y;
double a = x2 - x1;
double b = y2 - y1;
double a2 = a * a;
double b2 = b * b;
double r2 = a2 + b2;
double tt = -(a * (x1 - x0) + b * (y1 - y0));
if (tt < 0)
return sqrt((x1 - x0) * (x1 - x0) + (y1 - y0) * (y1 - y0));
else if (tt > r2)
return sqrt((x2 - x0) * (x2 - x0) + (y2 - y0) * (y2 - y0));
double f1 = a * (y1 - y0) - b * (x1 - x0);
return sqrt((f1 * f1) / r2);
}
int main() {
ll n, a, b, c, d;
cin >> n >> a >> b >> c >> d;
string s;
cin >> s;
string ans = "Yes";
for (int i = a - 1; i < max(c, d) - 2; i++) {
if (s[i] == '#' && s[i + 1] == '#')
ans = "No";
}
ll fl = 0;
if (c < d)
fl = 1;
for (int i = b - 1; i < min(c, d) - 1; i++) {
if (s[i - 1] == '.' && s[i] == '.' && s[i + 1] == '.')
fl = 1;
}
if (fl == 0)
ans = "No";
cout << ans << endl;
} | #include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <ctime>
#include <deque>
#include <float.h>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <type_traits>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
using ll = long long;
unsigned euclidean_gcd(unsigned a, unsigned b) {
if (a < b)
return euclidean_gcd(b, a);
unsigned r;
while ((r = a % b)) {
a = b;
b = r;
}
return b;
}
ll ll_gcd(ll a, ll b) {
if (a < b)
return ll_gcd(b, a);
ll r;
while ((r = a % b)) {
a = b;
b = r;
}
return b;
}
class UnionFind {
public:
vector<ll> par;
vector<ll> siz;
UnionFind(ll sz_) : par(sz_), siz(sz_, 1LL) {
for (ll i = 0; i < sz_; ++i)
par[i] = i;
}
void init(ll sz_) {
par.resize(sz_);
siz.assign(sz_, 1LL);
for (ll i = 0; i < sz_; ++i)
par[i] = i;
}
ll root(ll x) {
while (par[x] != x) {
x = par[x] = par[par[x]];
}
return x;
}
bool merge(ll x, ll y) {
x = root(x);
y = root(y);
if (x == y)
return false;
if (siz[x] < siz[y])
swap(x, y);
siz[x] += siz[y];
par[y] = x;
return true;
}
bool issame(ll x, ll y) { return root(x) == root(y); }
ll size(ll x) { return siz[root(x)]; }
};
long long modpow(long long a, long long n, long long mod) {
long long res = 1;
while (n > 0) {
if (n & 1)
res = res * a % mod;
a = a * a % mod;
n >>= 1;
}
return res;
}
long long modinv(long long a, long long mod) { return modpow(a, mod - 2, mod); }
vector<int> tpsort(vector<vector<int>> &G) {
int V = G.size();
vector<int> sorted_vertices;
queue<int> que;
vector<int> indegree(V);
for (int i = 0; i < V; i++) {
for (int j = 0; j < G[i].size(); j++) {
indegree[G[i][j]]++;
}
}
for (int i = 0; i < V; i++) {
if (indegree[i] == 0) {
que.push(i);
}
}
while (que.empty() == false) {
int v = que.front();
que.pop();
for (int i = 0; i < G[v].size(); i++) {
int u = G[v][i];
indegree[u] -= 1;
if (indegree[u] == 0)
que.push(u);
}
sorted_vertices.push_back(v);
}
return sorted_vertices;
}
struct Point {
double x;
double y;
};
struct LineSegment {
Point start;
Point end;
};
double tenkyori(const LineSegment &line, const Point &point) {
double x0 = point.x, y0 = point.y;
double x1 = line.start.x, y1 = line.start.y;
double x2 = line.end.x, y2 = line.end.y;
double a = x2 - x1;
double b = y2 - y1;
double a2 = a * a;
double b2 = b * b;
double r2 = a2 + b2;
double tt = -(a * (x1 - x0) + b * (y1 - y0));
if (tt < 0)
return sqrt((x1 - x0) * (x1 - x0) + (y1 - y0) * (y1 - y0));
else if (tt > r2)
return sqrt((x2 - x0) * (x2 - x0) + (y2 - y0) * (y2 - y0));
double f1 = a * (y1 - y0) - b * (x1 - x0);
return sqrt((f1 * f1) / r2);
}
int main() {
ll n, a, b, c, d;
cin >> n >> a >> b >> c >> d;
string s;
cin >> s;
string ans = "Yes";
for (int i = a - 1; i < max(c, d) - 2; i++) {
if (s[i] == '#' && s[i + 1] == '#')
ans = "No";
}
ll fl = 0;
if (c < d)
fl = 1;
for (int i = b - 1; i < min(c, d); i++) {
if (s[i - 1] == '.' && s[i] == '.' && s[i + 1] == '.')
fl = 1;
}
if (fl == 0)
ans = "No";
cout << ans << endl;
} | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 839,757 | 839,758 | u577774192 | cpp |
p03017 | #include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <ctime>
#include <deque>
#include <float.h>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <type_traits>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
using ll = long long;
unsigned euclidean_gcd(unsigned a, unsigned b) {
if (a < b)
return euclidean_gcd(b, a);
unsigned r;
while ((r = a % b)) {
a = b;
b = r;
}
return b;
}
ll ll_gcd(ll a, ll b) {
if (a < b)
return ll_gcd(b, a);
ll r;
while ((r = a % b)) {
a = b;
b = r;
}
return b;
}
class UnionFind {
public:
vector<ll> par;
vector<ll> siz;
UnionFind(ll sz_) : par(sz_), siz(sz_, 1LL) {
for (ll i = 0; i < sz_; ++i)
par[i] = i;
}
void init(ll sz_) {
par.resize(sz_);
siz.assign(sz_, 1LL);
for (ll i = 0; i < sz_; ++i)
par[i] = i;
}
ll root(ll x) {
while (par[x] != x) {
x = par[x] = par[par[x]];
}
return x;
}
bool merge(ll x, ll y) {
x = root(x);
y = root(y);
if (x == y)
return false;
if (siz[x] < siz[y])
swap(x, y);
siz[x] += siz[y];
par[y] = x;
return true;
}
bool issame(ll x, ll y) { return root(x) == root(y); }
ll size(ll x) { return siz[root(x)]; }
};
long long modpow(long long a, long long n, long long mod) {
long long res = 1;
while (n > 0) {
if (n & 1)
res = res * a % mod;
a = a * a % mod;
n >>= 1;
}
return res;
}
long long modinv(long long a, long long mod) { return modpow(a, mod - 2, mod); }
vector<int> tpsort(vector<vector<int>> &G) {
int V = G.size();
vector<int> sorted_vertices;
queue<int> que;
vector<int> indegree(V);
for (int i = 0; i < V; i++) {
for (int j = 0; j < G[i].size(); j++) {
indegree[G[i][j]]++;
}
}
for (int i = 0; i < V; i++) {
if (indegree[i] == 0) {
que.push(i);
}
}
while (que.empty() == false) {
int v = que.front();
que.pop();
for (int i = 0; i < G[v].size(); i++) {
int u = G[v][i];
indegree[u] -= 1;
if (indegree[u] == 0)
que.push(u);
}
sorted_vertices.push_back(v);
}
return sorted_vertices;
}
struct Point {
double x;
double y;
};
struct LineSegment {
Point start;
Point end;
};
double tenkyori(const LineSegment &line, const Point &point) {
double x0 = point.x, y0 = point.y;
double x1 = line.start.x, y1 = line.start.y;
double x2 = line.end.x, y2 = line.end.y;
double a = x2 - x1;
double b = y2 - y1;
double a2 = a * a;
double b2 = b * b;
double r2 = a2 + b2;
double tt = -(a * (x1 - x0) + b * (y1 - y0));
if (tt < 0)
return sqrt((x1 - x0) * (x1 - x0) + (y1 - y0) * (y1 - y0));
else if (tt > r2)
return sqrt((x2 - x0) * (x2 - x0) + (y2 - y0) * (y2 - y0));
double f1 = a * (y1 - y0) - b * (x1 - x0);
return sqrt((f1 * f1) / r2);
}
int main() {
ll n, a, b, c, d;
cin >> n >> a >> b >> c >> d;
string s;
cin >> s;
string ans = "Yes";
for (int i = a - 1; i < min(c, d) - 2; i++) {
if (s[i] == '#' && s[i + 1] == '#')
ans = "No";
}
ll fl = 0;
if (c < d)
fl = 1;
for (int i = b - 1; i < min(c, d) - 1; i++) {
if (s[i - 1] == '.' && s[i] == '.' && s[i + 1] == '.')
fl = 1;
}
if (fl == 0)
ans = "No";
cout << ans << endl;
} | #include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <ctime>
#include <deque>
#include <float.h>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <type_traits>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
using ll = long long;
unsigned euclidean_gcd(unsigned a, unsigned b) {
if (a < b)
return euclidean_gcd(b, a);
unsigned r;
while ((r = a % b)) {
a = b;
b = r;
}
return b;
}
ll ll_gcd(ll a, ll b) {
if (a < b)
return ll_gcd(b, a);
ll r;
while ((r = a % b)) {
a = b;
b = r;
}
return b;
}
class UnionFind {
public:
vector<ll> par;
vector<ll> siz;
UnionFind(ll sz_) : par(sz_), siz(sz_, 1LL) {
for (ll i = 0; i < sz_; ++i)
par[i] = i;
}
void init(ll sz_) {
par.resize(sz_);
siz.assign(sz_, 1LL);
for (ll i = 0; i < sz_; ++i)
par[i] = i;
}
ll root(ll x) {
while (par[x] != x) {
x = par[x] = par[par[x]];
}
return x;
}
bool merge(ll x, ll y) {
x = root(x);
y = root(y);
if (x == y)
return false;
if (siz[x] < siz[y])
swap(x, y);
siz[x] += siz[y];
par[y] = x;
return true;
}
bool issame(ll x, ll y) { return root(x) == root(y); }
ll size(ll x) { return siz[root(x)]; }
};
long long modpow(long long a, long long n, long long mod) {
long long res = 1;
while (n > 0) {
if (n & 1)
res = res * a % mod;
a = a * a % mod;
n >>= 1;
}
return res;
}
long long modinv(long long a, long long mod) { return modpow(a, mod - 2, mod); }
vector<int> tpsort(vector<vector<int>> &G) {
int V = G.size();
vector<int> sorted_vertices;
queue<int> que;
vector<int> indegree(V);
for (int i = 0; i < V; i++) {
for (int j = 0; j < G[i].size(); j++) {
indegree[G[i][j]]++;
}
}
for (int i = 0; i < V; i++) {
if (indegree[i] == 0) {
que.push(i);
}
}
while (que.empty() == false) {
int v = que.front();
que.pop();
for (int i = 0; i < G[v].size(); i++) {
int u = G[v][i];
indegree[u] -= 1;
if (indegree[u] == 0)
que.push(u);
}
sorted_vertices.push_back(v);
}
return sorted_vertices;
}
struct Point {
double x;
double y;
};
struct LineSegment {
Point start;
Point end;
};
double tenkyori(const LineSegment &line, const Point &point) {
double x0 = point.x, y0 = point.y;
double x1 = line.start.x, y1 = line.start.y;
double x2 = line.end.x, y2 = line.end.y;
double a = x2 - x1;
double b = y2 - y1;
double a2 = a * a;
double b2 = b * b;
double r2 = a2 + b2;
double tt = -(a * (x1 - x0) + b * (y1 - y0));
if (tt < 0)
return sqrt((x1 - x0) * (x1 - x0) + (y1 - y0) * (y1 - y0));
else if (tt > r2)
return sqrt((x2 - x0) * (x2 - x0) + (y2 - y0) * (y2 - y0));
double f1 = a * (y1 - y0) - b * (x1 - x0);
return sqrt((f1 * f1) / r2);
}
int main() {
ll n, a, b, c, d;
cin >> n >> a >> b >> c >> d;
string s;
cin >> s;
string ans = "Yes";
for (int i = a - 1; i < max(c, d) - 2; i++) {
if (s[i] == '#' && s[i + 1] == '#')
ans = "No";
}
ll fl = 0;
if (c < d)
fl = 1;
for (int i = b - 1; i < min(c, d); i++) {
if (s[i - 1] == '.' && s[i] == '.' && s[i + 1] == '.')
fl = 1;
}
if (fl == 0)
ans = "No";
cout << ans << endl;
} | [
"misc.opposites",
"identifier.change",
"call.function.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 839,759 | 839,758 | u577774192 | cpp |
p03017 | #include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <ctime>
#include <deque>
#include <float.h>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <type_traits>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
using ll = long long;
unsigned euclidean_gcd(unsigned a, unsigned b) {
if (a < b)
return euclidean_gcd(b, a);
unsigned r;
while ((r = a % b)) {
a = b;
b = r;
}
return b;
}
ll ll_gcd(ll a, ll b) {
if (a < b)
return ll_gcd(b, a);
ll r;
while ((r = a % b)) {
a = b;
b = r;
}
return b;
}
class UnionFind {
public:
vector<ll> par;
vector<ll> siz;
UnionFind(ll sz_) : par(sz_), siz(sz_, 1LL) {
for (ll i = 0; i < sz_; ++i)
par[i] = i;
}
void init(ll sz_) {
par.resize(sz_);
siz.assign(sz_, 1LL);
for (ll i = 0; i < sz_; ++i)
par[i] = i;
}
ll root(ll x) {
while (par[x] != x) {
x = par[x] = par[par[x]];
}
return x;
}
bool merge(ll x, ll y) {
x = root(x);
y = root(y);
if (x == y)
return false;
if (siz[x] < siz[y])
swap(x, y);
siz[x] += siz[y];
par[y] = x;
return true;
}
bool issame(ll x, ll y) { return root(x) == root(y); }
ll size(ll x) { return siz[root(x)]; }
};
long long modpow(long long a, long long n, long long mod) {
long long res = 1;
while (n > 0) {
if (n & 1)
res = res * a % mod;
a = a * a % mod;
n >>= 1;
}
return res;
}
long long modinv(long long a, long long mod) { return modpow(a, mod - 2, mod); }
vector<int> tpsort(vector<vector<int>> &G) {
int V = G.size();
vector<int> sorted_vertices;
queue<int> que;
vector<int> indegree(V);
for (int i = 0; i < V; i++) {
for (int j = 0; j < G[i].size(); j++) {
indegree[G[i][j]]++;
}
}
for (int i = 0; i < V; i++) {
if (indegree[i] == 0) {
que.push(i);
}
}
while (que.empty() == false) {
int v = que.front();
que.pop();
for (int i = 0; i < G[v].size(); i++) {
int u = G[v][i];
indegree[u] -= 1;
if (indegree[u] == 0)
que.push(u);
}
sorted_vertices.push_back(v);
}
return sorted_vertices;
}
struct Point {
double x;
double y;
};
struct LineSegment {
Point start;
Point end;
};
double tenkyori(const LineSegment &line, const Point &point) {
double x0 = point.x, y0 = point.y;
double x1 = line.start.x, y1 = line.start.y;
double x2 = line.end.x, y2 = line.end.y;
double a = x2 - x1;
double b = y2 - y1;
double a2 = a * a;
double b2 = b * b;
double r2 = a2 + b2;
double tt = -(a * (x1 - x0) + b * (y1 - y0));
if (tt < 0)
return sqrt((x1 - x0) * (x1 - x0) + (y1 - y0) * (y1 - y0));
else if (tt > r2)
return sqrt((x2 - x0) * (x2 - x0) + (y2 - y0) * (y2 - y0));
double f1 = a * (y1 - y0) - b * (x1 - x0);
return sqrt((f1 * f1) / r2);
}
int main() {
ll n, a, b, c, d;
cin >> n >> a >> b >> c >> d;
string s;
cin >> s;
string ans = "Yes";
for (int i = a - 1; i < min(c, d) - 2; i++) {
if (s[i] == '#' && s[i + 1] == '#')
ans = "No";
}
ll fl = 0;
if (c < d)
fl = 1;
for (int i = b; i < min(c, d) - 1; i++) {
if (s[i - 1] == '.' && s[i] == '.' && s[i + 1] == '.')
fl = 1;
}
if (fl == 0)
ans = "No";
cout << ans << endl;
} | #include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <ctime>
#include <deque>
#include <float.h>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <type_traits>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
using ll = long long;
unsigned euclidean_gcd(unsigned a, unsigned b) {
if (a < b)
return euclidean_gcd(b, a);
unsigned r;
while ((r = a % b)) {
a = b;
b = r;
}
return b;
}
ll ll_gcd(ll a, ll b) {
if (a < b)
return ll_gcd(b, a);
ll r;
while ((r = a % b)) {
a = b;
b = r;
}
return b;
}
class UnionFind {
public:
vector<ll> par;
vector<ll> siz;
UnionFind(ll sz_) : par(sz_), siz(sz_, 1LL) {
for (ll i = 0; i < sz_; ++i)
par[i] = i;
}
void init(ll sz_) {
par.resize(sz_);
siz.assign(sz_, 1LL);
for (ll i = 0; i < sz_; ++i)
par[i] = i;
}
ll root(ll x) {
while (par[x] != x) {
x = par[x] = par[par[x]];
}
return x;
}
bool merge(ll x, ll y) {
x = root(x);
y = root(y);
if (x == y)
return false;
if (siz[x] < siz[y])
swap(x, y);
siz[x] += siz[y];
par[y] = x;
return true;
}
bool issame(ll x, ll y) { return root(x) == root(y); }
ll size(ll x) { return siz[root(x)]; }
};
long long modpow(long long a, long long n, long long mod) {
long long res = 1;
while (n > 0) {
if (n & 1)
res = res * a % mod;
a = a * a % mod;
n >>= 1;
}
return res;
}
long long modinv(long long a, long long mod) { return modpow(a, mod - 2, mod); }
vector<int> tpsort(vector<vector<int>> &G) {
int V = G.size();
vector<int> sorted_vertices;
queue<int> que;
vector<int> indegree(V);
for (int i = 0; i < V; i++) {
for (int j = 0; j < G[i].size(); j++) {
indegree[G[i][j]]++;
}
}
for (int i = 0; i < V; i++) {
if (indegree[i] == 0) {
que.push(i);
}
}
while (que.empty() == false) {
int v = que.front();
que.pop();
for (int i = 0; i < G[v].size(); i++) {
int u = G[v][i];
indegree[u] -= 1;
if (indegree[u] == 0)
que.push(u);
}
sorted_vertices.push_back(v);
}
return sorted_vertices;
}
struct Point {
double x;
double y;
};
struct LineSegment {
Point start;
Point end;
};
double tenkyori(const LineSegment &line, const Point &point) {
double x0 = point.x, y0 = point.y;
double x1 = line.start.x, y1 = line.start.y;
double x2 = line.end.x, y2 = line.end.y;
double a = x2 - x1;
double b = y2 - y1;
double a2 = a * a;
double b2 = b * b;
double r2 = a2 + b2;
double tt = -(a * (x1 - x0) + b * (y1 - y0));
if (tt < 0)
return sqrt((x1 - x0) * (x1 - x0) + (y1 - y0) * (y1 - y0));
else if (tt > r2)
return sqrt((x2 - x0) * (x2 - x0) + (y2 - y0) * (y2 - y0));
double f1 = a * (y1 - y0) - b * (x1 - x0);
return sqrt((f1 * f1) / r2);
}
int main() {
ll n, a, b, c, d;
cin >> n >> a >> b >> c >> d;
string s;
cin >> s;
string ans = "Yes";
for (int i = a - 1; i < max(c, d) - 2; i++) {
if (s[i] == '#' && s[i + 1] == '#')
ans = "No";
}
ll fl = 0;
if (c < d)
fl = 1;
for (int i = b - 1; i < min(c, d); i++) {
if (s[i - 1] == '.' && s[i] == '.' && s[i + 1] == '.')
fl = 1;
}
if (fl == 0)
ans = "No";
cout << ans << endl;
} | [
"misc.opposites",
"identifier.change",
"call.function.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"control_flow.loop.for.initializer.change",
"expression.operation.binary.remove"
] | 839,760 | 839,758 | u577774192 | cpp |
p03017 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, A, B, C, D;
string S;
cin >> N >> A >> B >> C >> D >> S;
for (int i = A - 1; i <= C; i++) {
if (S[i] == '#' && S[i + 1] == '#') {
puts("No");
return 0;
}
}
for (int i = B - 1; i <= D; i++) {
if (S[i] == '#' && S[i + 1] == '#') {
puts("No");
return 0;
}
}
if (C < D) {
puts("Yes");
return 0;
}
for (int i = B - 1; i < D - 2; i++)
if (S[i] == '.' && S[i + 1] == '.' && S[i + 2] == '.') {
puts("Yes");
return 0;
}
puts("No");
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, A, B, C, D;
string S;
cin >> N >> A >> B >> C >> D >> S;
for (int i = A - 1; i < C; i++) {
if (S[i] == '#' && S[i + 1] == '#') {
puts("No");
return 0;
}
}
for (int i = B - 1; i < D; i++) {
if (S[i] == '#' && S[i + 1] == '#') {
puts("No");
return 0;
}
}
if (C < D) {
puts("Yes");
return 0;
}
for (int i = B - 2; i < D - 1; i++)
if (S[i] == '.' && S[i + 1] == '.' && S[i + 2] == '.') {
puts("Yes");
return 0;
}
puts("No");
} | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"literal.number.change",
"control_flow.loop.for.initializer.change"
] | 839,767 | 839,766 | u306482197 | cpp |
p03017 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, A, B, C, D;
string S;
cin >> N >> A >> B >> C >> D >> S;
for (int i = A - 1; i <= C; i++) {
if (S[i] == '#' && S[i + 1] == '#') {
puts("No");
return 0;
}
}
for (int i = B - 1; i <= D; i++) {
if (S[i] == '#' && S[i + 1] == '#') {
puts("No");
return 0;
}
}
if (C < D) {
puts("Yes");
return 0;
}
for (int i = B; i < D + 2; i++)
if (S[i] == '.' && S[i + 1] == '.' && S[i + 2] == '.') {
puts("Yes");
return 0;
}
puts("No");
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, A, B, C, D;
string S;
cin >> N >> A >> B >> C >> D >> S;
for (int i = A - 1; i < C; i++) {
if (S[i] == '#' && S[i + 1] == '#') {
puts("No");
return 0;
}
}
for (int i = B - 1; i < D; i++) {
if (S[i] == '#' && S[i + 1] == '#') {
puts("No");
return 0;
}
}
if (C < D) {
puts("Yes");
return 0;
}
for (int i = B - 2; i < D - 1; i++)
if (S[i] == '.' && S[i + 1] == '.' && S[i + 2] == '.') {
puts("Yes");
return 0;
}
puts("No");
} | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"control_flow.loop.for.initializer.change"
] | 839,768 | 839,766 | u306482197 | cpp |
p03017 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, A, B, C, D;
string S;
cin >> N >> A >> B >> C >> D >> S;
for (int i = A - 1; i <= C; i++) {
if (S[i] == '#' && S[i + 1] == '#') {
puts("No");
return 0;
}
}
for (int i = B - 1; i <= D; i++) {
if (S[i] == '#' && S[i + 1] == '#') {
puts("No");
return 0;
}
}
if (C < D) {
puts("Yes");
return 0;
}
for (int i = B; i < D + 1; i++)
if (S[i] == '.' && S[i + 1] == '.' && S[i + 2] == '.') {
puts("Yes");
return 0;
}
puts("No");
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, A, B, C, D;
string S;
cin >> N >> A >> B >> C >> D >> S;
for (int i = A - 1; i < C; i++) {
if (S[i] == '#' && S[i + 1] == '#') {
puts("No");
return 0;
}
}
for (int i = B - 1; i < D; i++) {
if (S[i] == '#' && S[i + 1] == '#') {
puts("No");
return 0;
}
}
if (C < D) {
puts("Yes");
return 0;
}
for (int i = B - 2; i < D - 1; i++)
if (S[i] == '.' && S[i + 1] == '.' && S[i + 2] == '.') {
puts("Yes");
return 0;
}
puts("No");
} | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"control_flow.loop.for.initializer.change",
"misc.opposites",
"expression.operator.arithmetic.change"
] | 839,769 | 839,766 | u306482197 | cpp |
p03017 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, A, B, C, D;
string S;
cin >> N >> A >> B >> C >> D >> S;
for (int i = A - 1; i <= C; i++) {
if (S[i] == '#' && S[i + 1] == '#') {
puts("No");
return 0;
}
}
for (int i = B - 1; i <= D; i++) {
if (S[i] == '#' && S[i + 1] == '#') {
puts("No");
return 0;
}
}
if (C < D) {
puts("Yes");
return 0;
}
for (int i = B - 2; i < D; i++)
if (S[i] == '.' && S[i + 1] == '.' && S[i + 2] == '.') {
puts("Yes");
return 0;
}
puts("No");
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, A, B, C, D;
string S;
cin >> N >> A >> B >> C >> D >> S;
for (int i = A - 1; i < C; i++) {
if (S[i] == '#' && S[i + 1] == '#') {
puts("No");
return 0;
}
}
for (int i = B - 1; i < D; i++) {
if (S[i] == '#' && S[i + 1] == '#') {
puts("No");
return 0;
}
}
if (C < D) {
puts("Yes");
return 0;
}
for (int i = B - 2; i < D - 1; i++)
if (S[i] == '.' && S[i + 1] == '.' && S[i + 2] == '.') {
puts("Yes");
return 0;
}
puts("No");
} | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"misc.off_by_one"
] | 839,770 | 839,766 | u306482197 | cpp |
p03017 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, A, B, C, D;
string S;
cin >> N >> A >> B >> C >> D >> S;
for (int i = A - 1; i <= C; i++) {
if (S[i] == '#' && S[i + 1] == '#') {
puts("No");
return 0;
}
}
for (int i = B - 1; i <= D; i++) {
if (S[i] == '#' && S[i + 1] == '#') {
puts("No");
return 0;
}
}
if (C < D) {
puts("Yes");
return 0;
}
for (int i = B - 1; i < D; i++)
if (S[i] == '.' && S[i + 1] == '.' && S[i + 2] == '.') {
puts("Yes");
return 0;
}
puts("No");
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, A, B, C, D;
string S;
cin >> N >> A >> B >> C >> D >> S;
for (int i = A - 1; i < C; i++) {
if (S[i] == '#' && S[i + 1] == '#') {
puts("No");
return 0;
}
}
for (int i = B - 1; i < D; i++) {
if (S[i] == '#' && S[i + 1] == '#') {
puts("No");
return 0;
}
}
if (C < D) {
puts("Yes");
return 0;
}
for (int i = B - 2; i < D - 1; i++)
if (S[i] == '.' && S[i + 1] == '.' && S[i + 2] == '.') {
puts("Yes");
return 0;
}
puts("No");
} | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"literal.number.change",
"control_flow.loop.for.initializer.change",
"misc.off_by_one"
] | 839,772 | 839,766 | u306482197 | cpp |
p03017 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, A, B, C, D;
string S;
cin >> N >> A >> B >> C >> D >> S;
for (int i = A - 1; i <= C; i++) {
if (S[i] == '#' && S[i + 1] == '#') {
puts("No");
return 0;
}
}
for (int i = B - 1; i <= D; i++) {
if (S[i] == '#' && S[i + 1] == '#') {
puts("No");
return 0;
}
}
if (C < D) {
puts("Yes");
return 0;
}
for (int i = B - 1; i < D - 1; i++)
if (S[i] == '.' && S[i + 1] == '.' && S[i + 2] == '.') {
puts("Yes");
return 0;
}
puts("No");
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, A, B, C, D;
string S;
cin >> N >> A >> B >> C >> D >> S;
for (int i = A - 1; i < C; i++) {
if (S[i] == '#' && S[i + 1] == '#') {
puts("No");
return 0;
}
}
for (int i = B - 1; i < D; i++) {
if (S[i] == '#' && S[i + 1] == '#') {
puts("No");
return 0;
}
}
if (C < D) {
puts("Yes");
return 0;
}
for (int i = B - 2; i < D - 1; i++)
if (S[i] == '.' && S[i + 1] == '.' && S[i + 2] == '.') {
puts("Yes");
return 0;
}
puts("No");
} | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"literal.number.change",
"control_flow.loop.for.initializer.change"
] | 839,773 | 839,766 | u306482197 | cpp |
p03017 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, A, B, C, D;
string S;
cin >> N >> A >> B >> C >> D >> S;
for (int i = A - 1; i < C - 1; i++) {
if (S[i] == '#' && S[i + 1] == '#') {
puts("No");
return 0;
}
}
for (int i = B - 1; i < D - 1; i++) {
if (S[i] == '#' && S[i + 1] == '#') {
puts("No");
return 0;
}
}
if (C < D) {
puts("Yes");
return 0;
}
for (int i = B - 1; i < D - 1; i++)
if (S[i] == '.' && S[i + 1] == '.' && S[i + 2] == '.') {
puts("Yes");
return 0;
}
puts("No");
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, A, B, C, D;
string S;
cin >> N >> A >> B >> C >> D >> S;
for (int i = A - 1; i < C; i++) {
if (S[i] == '#' && S[i + 1] == '#') {
puts("No");
return 0;
}
}
for (int i = B - 1; i < D; i++) {
if (S[i] == '#' && S[i + 1] == '#') {
puts("No");
return 0;
}
}
if (C < D) {
puts("Yes");
return 0;
}
for (int i = B - 2; i < D - 1; i++)
if (S[i] == '.' && S[i + 1] == '.' && S[i + 2] == '.') {
puts("Yes");
return 0;
}
puts("No");
} | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove",
"literal.number.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 839,774 | 839,766 | u306482197 | cpp |
p03017 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
const ll INF = 1LL << 60;
const double EPS = 1e-10;
const ll mod = 1000000007;
int main(void) {
int n, a, b, c, d;
string s;
cin >> n >> a >> b >> c >> d >> s;
a--, b--, c--, d--;
bool ans = true;
for (int i = a; i < c; i++) {
if (s[i] == '#' && s[i + 1] == '#')
ans = false;
}
for (int i = b; i < d; i++) {
if (s[i] == '#' && s[i + 1] == '#')
ans = false;
}
if (c > d) {
bool kari = false;
for (int i = b; i < d; i++) {
if (s[i] == '.' && s[i + 1] == '.' && s[i + 2] == '.')
kari = true;
}
if (kari == false)
ans = false;
}
if (ans)
cout << "Yes" << endl;
else
cout << "No" << endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
const ll INF = 1LL << 60;
const double EPS = 1e-10;
const ll mod = 1000000007;
int main(void) {
int n, a, b, c, d;
string s;
cin >> n >> a >> b >> c >> d >> s;
a--, b--, c--, d--;
bool ans = true;
for (int i = a; i < c; i++) {
if (s[i] == '#' && s[i + 1] == '#')
ans = false;
}
for (int i = b; i < d; i++) {
if (s[i] == '#' && s[i + 1] == '#')
ans = false;
}
if (c > d) {
bool kari = false;
for (int i = b - 1; i < d; i++) {
if (s[i] == '.' && s[i + 1] == '.' && s[i + 2] == '.')
kari = true;
}
if (kari == false)
ans = false;
}
if (ans)
cout << "Yes" << endl;
else
cout << "No" << endl;
} | [
"control_flow.loop.for.initializer.change"
] | 839,775 | 839,776 | u675509234 | cpp |
p03017 | #include <algorithm>
#include <functional>
#include <iostream>
#include <limits.h>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <unordered_map>
#include <vector>
using namespace std;
#define intmax INT_MAX
#define lmax LONG_MAX
#define uintmax UINT_MAX
#define ulmax ULONG_MAX
#define llmax LLONG_MAX
#define ll long long
#define rep(i, a, N) for ((i) = (a); (i) < (N); (i)++)
#define rrp(i, N, a) for ((i) = (N)-1; (i) >= (a); (i)--)
#define llfor ll i, j, k
#define sc(a) cin >> a
#define pr(a) cout << a << endl
#define pY puts("YES")
#define pN puts("NO")
#define py puts("Yes")
#define pn puts("No")
#define pnn printf("\n")
#define sort(a) sort(a.begin(), a.end())
#define push(a, b) (a).push_back(b)
#define llvec vector<vector<ll>>
#define charvec vector<vector<char>>
#define sizeoof(a, b) (a, vector<ll>(b))
#define llpvec vector<pair<ll, ll>>
/*繰り上げ除算*/ ll cei(ll x, ll y) {
ll ans = x / y;
if (x % y != 0)
ans++;
return ans;
}
/*最大公約数*/ ll gcd(ll x, ll y) { return y ? gcd(y, x % y) : x; }
/*最小公倍数*/ ll lcm(ll x, ll y) { return x / gcd(x, y) * y; }
/*n乗*/ ll llpow(ll x, ll n) {
ll i, ans = 1;
rep(i, 0, n) ans *= x;
return ans;
}
/*階乗*/ ll fact(ll x) {
ll i, ans = 1;
rep(i, 0, x) ans *= (x - i);
return ans;
}
/*nCr*/ ll ncr(ll n, ll r) { return fact(n) / fact(r) / fact(n - r); }
/*nPr*/ ll npr(ll n, ll r) { return fact(n) / fact(n - r); }
/*primejudge*/ bool prime(ll a) {
if (a <= 1)
return false;
ll i;
for (i = 2; i * i <= a; i++) {
if (a % i == 0)
return false;
}
return true;
}
llfor; ///////////////////////////////////////////////////////////
int main() {
ll n, a, b, c, d;
sc(n);
sc(a);
sc(b);
sc(c);
sc(d);
char s[n + 10];
sc(s);
a--;
b--;
c--;
d--;
if (c < d) {
rep(i, a, d - 2) {
if (s[i] == '#' && s[i + 1] == '#') {
pn;
return 0;
}
}
py;
return 0;
}
rep(i, a, c - 1) {
if (s[i] == '#' && s[i + 1] == '#') {
pn;
return 0;
}
}
rep(i, b, d - 1) {
if (s[i] == '#' && s[i + 1] == '#') {
pn;
return 0;
}
}
rep(i, b - 1, d - 1) {
if (s[i] == '.' && s[i + 1] == '.' && s[i + 2] == '.') {
py;
return 0;
}
}
pn;
return 0;
} | #include <algorithm>
#include <functional>
#include <iostream>
#include <limits.h>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <unordered_map>
#include <vector>
using namespace std;
#define intmax INT_MAX
#define lmax LONG_MAX
#define uintmax UINT_MAX
#define ulmax ULONG_MAX
#define llmax LLONG_MAX
#define ll long long
#define rep(i, a, N) for ((i) = (a); (i) < (N); (i)++)
#define rrp(i, N, a) for ((i) = (N)-1; (i) >= (a); (i)--)
#define llfor ll i, j, k
#define sc(a) cin >> a
#define pr(a) cout << a << endl
#define pY puts("YES")
#define pN puts("NO")
#define py puts("Yes")
#define pn puts("No")
#define pnn printf("\n")
#define sort(a) sort(a.begin(), a.end())
#define push(a, b) (a).push_back(b)
#define llvec vector<vector<ll>>
#define charvec vector<vector<char>>
#define sizeoof(a, b) (a, vector<ll>(b))
#define llpvec vector<pair<ll, ll>>
/*繰り上げ除算*/ ll cei(ll x, ll y) {
ll ans = x / y;
if (x % y != 0)
ans++;
return ans;
}
/*最大公約数*/ ll gcd(ll x, ll y) { return y ? gcd(y, x % y) : x; }
/*最小公倍数*/ ll lcm(ll x, ll y) { return x / gcd(x, y) * y; }
/*n乗*/ ll llpow(ll x, ll n) {
ll i, ans = 1;
rep(i, 0, n) ans *= x;
return ans;
}
/*階乗*/ ll fact(ll x) {
ll i, ans = 1;
rep(i, 0, x) ans *= (x - i);
return ans;
}
/*nCr*/ ll ncr(ll n, ll r) { return fact(n) / fact(r) / fact(n - r); }
/*nPr*/ ll npr(ll n, ll r) { return fact(n) / fact(n - r); }
/*primejudge*/ bool prime(ll a) {
if (a <= 1)
return false;
ll i;
for (i = 2; i * i <= a; i++) {
if (a % i == 0)
return false;
}
return true;
}
llfor; ///////////////////////////////////////////////////////////
int main() {
ll n, a, b, c, d;
sc(n);
sc(a);
sc(b);
sc(c);
sc(d);
char s[n + 10];
sc(s);
a--;
b--;
c--;
d--;
if (c < d) {
rep(i, a, d - 2) {
if (s[i] == '#' && s[i + 1] == '#') {
pn;
return 0;
}
}
py;
return 0;
}
rep(i, a, c - 2) {
if (s[i] == '#' && s[i + 1] == '#') {
pn;
return 0;
}
}
rep(i, b, d - 2) {
if (s[i] == '#' && s[i + 1] == '#') {
pn;
return 0;
}
}
rep(i, b - 1, d) {
if (s[i] == '.' && s[i + 1] == '.' && s[i + 2] == '.') {
py;
return 0;
}
}
pn;
return 0;
} | [
"literal.number.change",
"call.arguments.change",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 839,782 | 839,783 | u006717664 | cpp |
p03017 | #include <algorithm>
#include <functional>
#include <iostream>
#include <limits.h>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <unordered_map>
#include <vector>
using namespace std;
#define intmax INT_MAX
#define lmax LONG_MAX
#define uintmax UINT_MAX
#define ulmax ULONG_MAX
#define llmax LLONG_MAX
#define ll long long
#define rep(i, a, N) for ((i) = (a); (i) < (N); (i)++)
#define rrp(i, N, a) for ((i) = (N)-1; (i) >= (a); (i)--)
#define llfor ll i, j, k
#define sc(a) cin >> a
#define pr(a) cout << a << endl
#define pY puts("YES")
#define pN puts("NO")
#define py puts("Yes")
#define pn puts("No")
#define pnn printf("\n")
#define sort(a) sort(a.begin(), a.end())
#define push(a, b) (a).push_back(b)
#define llvec vector<vector<ll>>
#define charvec vector<vector<char>>
#define sizeoof(a, b) (a, vector<ll>(b))
#define llpvec vector<pair<ll, ll>>
/*繰り上げ除算*/ ll cei(ll x, ll y) {
ll ans = x / y;
if (x % y != 0)
ans++;
return ans;
}
/*最大公約数*/ ll gcd(ll x, ll y) { return y ? gcd(y, x % y) : x; }
/*最小公倍数*/ ll lcm(ll x, ll y) { return x / gcd(x, y) * y; }
/*n乗*/ ll llpow(ll x, ll n) {
ll i, ans = 1;
rep(i, 0, n) ans *= x;
return ans;
}
/*階乗*/ ll fact(ll x) {
ll i, ans = 1;
rep(i, 0, x) ans *= (x - i);
return ans;
}
/*nCr*/ ll ncr(ll n, ll r) { return fact(n) / fact(r) / fact(n - r); }
/*nPr*/ ll npr(ll n, ll r) { return fact(n) / fact(n - r); }
/*primejudge*/ bool prime(ll a) {
if (a <= 1)
return false;
ll i;
for (i = 2; i * i <= a; i++) {
if (a % i == 0)
return false;
}
return true;
}
llfor; ///////////////////////////////////////////////////////////
int main() {
ll n, a, b, c, d;
sc(n);
sc(a);
sc(b);
sc(c);
sc(d);
char s[n + 10];
sc(s);
a--;
b--;
c--;
d--;
if (c < d) {
rep(i, a, d - 1) {
if (s[i] == '#' && s[i + 1] == '#') {
pn;
return 0;
}
}
py;
return 0;
}
rep(i, a, c - 1) {
if (s[i] == '#' && s[i + 1] == '#') {
pn;
return 0;
}
}
rep(i, b, d - 1) {
if (s[i] == '#' && s[i + 1] == '#') {
pn;
return 0;
}
}
rep(i, b - 1, d - 1) {
if (s[i] == '.' && s[i + 1] == '.' && s[i + 2] == '.') {
py;
return 0;
}
}
pn;
return 0;
} | #include <algorithm>
#include <functional>
#include <iostream>
#include <limits.h>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <unordered_map>
#include <vector>
using namespace std;
#define intmax INT_MAX
#define lmax LONG_MAX
#define uintmax UINT_MAX
#define ulmax ULONG_MAX
#define llmax LLONG_MAX
#define ll long long
#define rep(i, a, N) for ((i) = (a); (i) < (N); (i)++)
#define rrp(i, N, a) for ((i) = (N)-1; (i) >= (a); (i)--)
#define llfor ll i, j, k
#define sc(a) cin >> a
#define pr(a) cout << a << endl
#define pY puts("YES")
#define pN puts("NO")
#define py puts("Yes")
#define pn puts("No")
#define pnn printf("\n")
#define sort(a) sort(a.begin(), a.end())
#define push(a, b) (a).push_back(b)
#define llvec vector<vector<ll>>
#define charvec vector<vector<char>>
#define sizeoof(a, b) (a, vector<ll>(b))
#define llpvec vector<pair<ll, ll>>
/*繰り上げ除算*/ ll cei(ll x, ll y) {
ll ans = x / y;
if (x % y != 0)
ans++;
return ans;
}
/*最大公約数*/ ll gcd(ll x, ll y) { return y ? gcd(y, x % y) : x; }
/*最小公倍数*/ ll lcm(ll x, ll y) { return x / gcd(x, y) * y; }
/*n乗*/ ll llpow(ll x, ll n) {
ll i, ans = 1;
rep(i, 0, n) ans *= x;
return ans;
}
/*階乗*/ ll fact(ll x) {
ll i, ans = 1;
rep(i, 0, x) ans *= (x - i);
return ans;
}
/*nCr*/ ll ncr(ll n, ll r) { return fact(n) / fact(r) / fact(n - r); }
/*nPr*/ ll npr(ll n, ll r) { return fact(n) / fact(n - r); }
/*primejudge*/ bool prime(ll a) {
if (a <= 1)
return false;
ll i;
for (i = 2; i * i <= a; i++) {
if (a % i == 0)
return false;
}
return true;
}
llfor; ///////////////////////////////////////////////////////////
int main() {
ll n, a, b, c, d;
sc(n);
sc(a);
sc(b);
sc(c);
sc(d);
char s[n + 10];
sc(s);
a--;
b--;
c--;
d--;
if (c < d) {
rep(i, a, d - 2) {
if (s[i] == '#' && s[i + 1] == '#') {
pn;
return 0;
}
}
py;
return 0;
}
rep(i, a, c - 2) {
if (s[i] == '#' && s[i + 1] == '#') {
pn;
return 0;
}
}
rep(i, b, d - 2) {
if (s[i] == '#' && s[i + 1] == '#') {
pn;
return 0;
}
}
rep(i, b - 1, d) {
if (s[i] == '.' && s[i + 1] == '.' && s[i + 2] == '.') {
py;
return 0;
}
}
pn;
return 0;
} | [
"literal.number.change",
"call.arguments.change",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 839,784 | 839,783 | u006717664 | cpp |
p03017 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define repi(i, s, n) for (int i = (s); i < (n); i++)
#ifdef LOCAL
#define INPUT_FILE \
ifstream in("atcoder-problems/agc034_a.txt"); \
cin.rdbuf(in.rdbuf());
#define print_vec(v) \
rep(l, v.size()) { cout << v[l] << " "; } \
cout << endl;
#else
#define INPUT_FILE
#define print_vec(v)
#endif
#define CIN_OPTIMIZE \
cin.tie(0); \
ios::sync_with_stdio(false);
typedef pair<int, int> P;
typedef long long ll;
typedef pair<ll, ll> pl;
const int INF = 100100100;
const ll LINF = 1e18 + 100;
const int MOD = 1e9 + 7;
int main() {
INPUT_FILE CIN_OPTIMIZE;
int N, A, B, C, D;
cin >> N >> A >> B >> C >> D;
A--;
B--;
C--;
D--;
string S;
cin >> S;
repi(i, A, D - 1) {
if (S[i] == '#' && S[i + 1] == '#') {
cout << "No";
return 0;
}
}
if (C > D) {
repi(i, B - 1, D - 1) {
if (S[i] == '.' && S[i + 1] == '.' && S[i + 2] == '.') {
cout << "Yes" << endl;
return 0;
}
}
cout << "No" << endl;
} else {
cout << "Yes" << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define repi(i, s, n) for (int i = (s); i < (n); i++)
#ifdef LOCAL
#define INPUT_FILE \
ifstream in("atcoder-problems/agc034_a.txt"); \
cin.rdbuf(in.rdbuf());
#define print_vec(v) \
rep(l, v.size()) { cout << v[l] << " "; } \
cout << endl;
#else
#define INPUT_FILE
#define print_vec(v)
#endif
#define CIN_OPTIMIZE \
cin.tie(0); \
ios::sync_with_stdio(false);
typedef pair<int, int> P;
typedef long long ll;
typedef pair<ll, ll> pl;
const int INF = 100100100;
const ll LINF = 1e18 + 100;
const int MOD = 1e9 + 7;
int main() {
INPUT_FILE CIN_OPTIMIZE;
int N, A, B, C, D;
cin >> N >> A >> B >> C >> D;
A--;
B--;
C--;
D--;
string S;
cin >> S;
repi(i, A, D - 1) {
if (S[i] == '#' && S[i + 1] == '#') {
cout << "No";
return 0;
}
}
if (C > D) {
repi(i, B - 1, D) {
if (S[i] == '.' && S[i + 1] == '.' && S[i + 2] == '.') {
cout << "Yes" << endl;
return 0;
}
}
cout << "No" << endl;
} else {
cout << "Yes" << endl;
}
} | [
"expression.operation.binary.remove"
] | 839,793 | 839,794 | u513083943 | cpp |
p03017 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define repi(i, s, n) for (int i = (s); i < (n); i++)
#ifdef LOCAL
#define INPUT_FILE \
ifstream in("atcoder-problems/agc034_a.txt"); \
cin.rdbuf(in.rdbuf());
#define print_vec(v) \
rep(l, v.size()) { cout << v[l] << " "; } \
cout << endl;
#else
#define INPUT_FILE
#define print_vec(v)
#endif
#define CIN_OPTIMIZE \
cin.tie(0); \
ios::sync_with_stdio(false);
typedef pair<int, int> P;
typedef long long ll;
typedef pair<ll, ll> pl;
const int INF = 100100100;
const ll LINF = 1e18 + 100;
const int MOD = 1e9 + 7;
int main() {
INPUT_FILE CIN_OPTIMIZE;
int N, A, B, C, D;
cin >> N >> A >> B >> C >> D;
A--;
B--;
C--;
D--;
string S;
cin >> S;
repi(i, A, D - 1) {
if (S[i] == '#' && S[i + 1] == '#') {
cout << "No";
return 0;
}
}
if (C > D) {
repi(i, B - 1, D - 2) {
if (S[i] == '.' && S[i + 1] == '.' && S[i + 2] == '.') {
cout << "Yes" << endl;
return 0;
}
}
cout << "No" << endl;
} else {
cout << "Yes" << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define repi(i, s, n) for (int i = (s); i < (n); i++)
#ifdef LOCAL
#define INPUT_FILE \
ifstream in("atcoder-problems/agc034_a.txt"); \
cin.rdbuf(in.rdbuf());
#define print_vec(v) \
rep(l, v.size()) { cout << v[l] << " "; } \
cout << endl;
#else
#define INPUT_FILE
#define print_vec(v)
#endif
#define CIN_OPTIMIZE \
cin.tie(0); \
ios::sync_with_stdio(false);
typedef pair<int, int> P;
typedef long long ll;
typedef pair<ll, ll> pl;
const int INF = 100100100;
const ll LINF = 1e18 + 100;
const int MOD = 1e9 + 7;
int main() {
INPUT_FILE CIN_OPTIMIZE;
int N, A, B, C, D;
cin >> N >> A >> B >> C >> D;
A--;
B--;
C--;
D--;
string S;
cin >> S;
repi(i, A, D - 1) {
if (S[i] == '#' && S[i + 1] == '#') {
cout << "No";
return 0;
}
}
if (C > D) {
repi(i, B - 1, D) {
if (S[i] == '.' && S[i + 1] == '.' && S[i + 2] == '.') {
cout << "Yes" << endl;
return 0;
}
}
cout << "No" << endl;
} else {
cout << "Yes" << endl;
}
} | [
"expression.operation.binary.remove"
] | 839,795 | 839,794 | u513083943 | cpp |
p03017 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define repi(i, s, n) for (int i = (s); i < (n); i++)
#ifdef LOCAL
#define INPUT_FILE \
ifstream in("atcoder-problems/agc034_a.txt"); \
cin.rdbuf(in.rdbuf());
#define print_vec(v) \
rep(l, v.size()) { cout << v[l] << " "; } \
cout << endl;
#else
#define INPUT_FILE
#define print_vec(v)
#endif
#define CIN_OPTIMIZE \
cin.tie(0); \
ios::sync_with_stdio(false);
typedef pair<int, int> P;
typedef long long ll;
typedef pair<ll, ll> pl;
const int INF = 100100100;
const ll LINF = 1e18 + 100;
const int MOD = 1e9 + 7;
int main() {
INPUT_FILE CIN_OPTIMIZE;
int N, A, B, C, D;
cin >> N >> A >> B >> C >> D;
A--;
B--;
C--;
D--;
string S;
cin >> S;
repi(i, A, D - 1) {
if (S[i] == '#' && S[i + 1] == '#') {
cout << "No";
return 0;
}
}
if (C > D) {
repi(i, B, D - 2) {
if (S[i] == '.' && S[i + 1] == '.' && S[i + 2] == '.') {
cout << "Yes" << endl;
return 0;
}
}
cout << "No" << endl;
} else {
cout << "Yes" << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define repi(i, s, n) for (int i = (s); i < (n); i++)
#ifdef LOCAL
#define INPUT_FILE \
ifstream in("atcoder-problems/agc034_a.txt"); \
cin.rdbuf(in.rdbuf());
#define print_vec(v) \
rep(l, v.size()) { cout << v[l] << " "; } \
cout << endl;
#else
#define INPUT_FILE
#define print_vec(v)
#endif
#define CIN_OPTIMIZE \
cin.tie(0); \
ios::sync_with_stdio(false);
typedef pair<int, int> P;
typedef long long ll;
typedef pair<ll, ll> pl;
const int INF = 100100100;
const ll LINF = 1e18 + 100;
const int MOD = 1e9 + 7;
int main() {
INPUT_FILE CIN_OPTIMIZE;
int N, A, B, C, D;
cin >> N >> A >> B >> C >> D;
A--;
B--;
C--;
D--;
string S;
cin >> S;
repi(i, A, D - 1) {
if (S[i] == '#' && S[i + 1] == '#') {
cout << "No";
return 0;
}
}
if (C > D) {
repi(i, B - 1, D) {
if (S[i] == '.' && S[i + 1] == '.' && S[i + 2] == '.') {
cout << "Yes" << endl;
return 0;
}
}
cout << "No" << endl;
} else {
cout << "Yes" << endl;
}
} | [
"expression.operation.binary.remove"
] | 839,796 | 839,794 | u513083943 | cpp |
p03017 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define repi(i, s, n) for (int i = (s); i < (n); i++)
#ifdef LOCAL
#define INPUT_FILE \
ifstream in("atcoder-problems/agc034_a.txt"); \
cin.rdbuf(in.rdbuf());
#define print_vec(v) \
rep(l, v.size()) { cout << v[l] << " "; } \
cout << endl;
#else
#define INPUT_FILE
#define print_vec(v)
#endif
#define CIN_OPTIMIZE \
cin.tie(0); \
ios::sync_with_stdio(false);
typedef pair<int, int> P;
typedef long long ll;
typedef pair<ll, ll> pl;
const int INF = 100100100;
const ll LINF = 1e18 + 100;
const int MOD = 1e9 + 7;
int main() {
INPUT_FILE CIN_OPTIMIZE;
int N, A, B, C, D;
cin >> N >> A >> B >> C >> D;
A--;
B--;
C--;
D--;
string S;
cin >> S;
repi(i, A, D - 1) {
if (S[i] == '#' && S[i + 1] == '#') {
cout << "No";
return 0;
}
}
if (C > D) {
repi(i, A, C - 2) {
if (S[i] == '.' && S[i + 1] == '.' && S[i + 2] == '.') {
cout << "Yes" << endl;
return 0;
}
}
cout << "No" << endl;
} else {
cout << "Yes" << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define repi(i, s, n) for (int i = (s); i < (n); i++)
#ifdef LOCAL
#define INPUT_FILE \
ifstream in("atcoder-problems/agc034_a.txt"); \
cin.rdbuf(in.rdbuf());
#define print_vec(v) \
rep(l, v.size()) { cout << v[l] << " "; } \
cout << endl;
#else
#define INPUT_FILE
#define print_vec(v)
#endif
#define CIN_OPTIMIZE \
cin.tie(0); \
ios::sync_with_stdio(false);
typedef pair<int, int> P;
typedef long long ll;
typedef pair<ll, ll> pl;
const int INF = 100100100;
const ll LINF = 1e18 + 100;
const int MOD = 1e9 + 7;
int main() {
INPUT_FILE CIN_OPTIMIZE;
int N, A, B, C, D;
cin >> N >> A >> B >> C >> D;
A--;
B--;
C--;
D--;
string S;
cin >> S;
repi(i, A, D - 1) {
if (S[i] == '#' && S[i + 1] == '#') {
cout << "No";
return 0;
}
}
if (C > D) {
repi(i, B - 1, D) {
if (S[i] == '.' && S[i + 1] == '.' && S[i + 2] == '.') {
cout << "Yes" << endl;
return 0;
}
}
cout << "No" << endl;
} else {
cout << "Yes" << endl;
}
} | [
"call.arguments.change",
"literal.number.change",
"expression.operation.binary.change",
"call.arguments.add"
] | 839,797 | 839,794 | u513083943 | cpp |
p03017 | #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, cc, n) for (int i = cc; i < n; ++i)
#define lrep(i, cc, n) for (long long i = cc; i < n; ++i)
#define sqrep(i, cc, n) for (long long i = cc; i * i <= n; ++i)
#define rrep(i, cc, n) for (long i = cc; i > n; --i)
#define pii pair<int, int>
#define pll pair<long long, long long>
using ll = long long;
const vector<int> dx = {1, 0, -1, 0};
const vector<int> dy = {0, 1, 0, -1};
const ll inf = 1001001001;
const ll e9 = 1000000000;
const ll mod = 1000000007;
int main() {
int n, a, b, c, d;
string road;
cin >> n >> a >> b >> c >> d >> road;
a--;
b--;
c--;
d--;
bool q = true;
rep(i, a + 1, c + 1) {
if (road[i] == '#' && road[i - 1] == '#') {
cout << "No" << endl;
return 0;
}
}
rep(i, b + 1, d + 1) {
if (road[i] == '#' && road[i - 1] == '#') {
cout << "No" << endl;
return 0;
}
}
if (c < d) {
cout << "Yes" << endl;
return 0;
} else {
rep(i, b, d + 1) {
if (i - 1 < 0 || i + 1 >= n)
continue;
if (road[i + 1] == '.' && road[i - 1] == '.' && road[i - 1] == '.') {
cout << "Yes" << endl;
return 0;
}
}
}
cout << "No" << endl;
return 0;
} | #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, cc, n) for (int i = cc; i < n; ++i)
#define lrep(i, cc, n) for (long long i = cc; i < n; ++i)
#define sqrep(i, cc, n) for (long long i = cc; i * i <= n; ++i)
#define rrep(i, cc, n) for (long i = cc; i > n; --i)
#define pii pair<int, int>
#define pll pair<long long, long long>
using ll = long long;
const vector<int> dx = {1, 0, -1, 0};
const vector<int> dy = {0, 1, 0, -1};
const ll inf = 1001001001;
const ll e9 = 1000000000;
const ll mod = 1000000007;
int main() {
int n, a, b, c, d;
string road;
cin >> n >> a >> b >> c >> d >> road;
a--;
b--;
c--;
d--;
bool q = true;
rep(i, a + 1, c + 1) {
if (road[i] == '#' && road[i - 1] == '#') {
cout << "No" << endl;
return 0;
}
}
rep(i, b + 1, d + 1) {
if (road[i] == '#' && road[i - 1] == '#') {
cout << "No" << endl;
return 0;
}
}
if (c < d) {
cout << "Yes" << endl;
return 0;
} else {
rep(i, b, d + 1) {
if (i - 1 < 0 || i + 1 >= n)
continue;
if (road[i + 1] == '.' && road[i] == '.' && road[i - 1] == '.') {
cout << "Yes" << endl;
return 0;
}
}
}
cout << "No" << endl;
return 0;
} | [
"expression.operation.binary.remove"
] | 839,798 | 839,799 | u330518333 | cpp |
p03017 | #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, cc, n) for (int i = cc; i < n; ++i)
#define lrep(i, cc, n) for (long long i = cc; i < n; ++i)
#define sqrep(i, cc, n) for (long long i = cc; i * i <= n; ++i)
#define rrep(i, cc, n) for (long i = cc; i > n; --i)
#define pii pair<int, int>
#define pll pair<long long, long long>
using ll = long long;
const vector<int> dx = {1, 0, -1, 0};
const vector<int> dy = {0, 1, 0, -1};
const ll inf = 1001001001;
const ll e9 = 1000000000;
const ll mod = 1000000007;
int main() {
int n, a, b, c, d;
string road;
cin >> n >> a >> b >> c >> d >> road;
a--;
b--;
c--;
d--;
bool q = true;
rep(i, a + 1, c + 1) {
if (road[i] == '#' && road[i - 1] == '#') {
cout << "No" << endl;
return 0;
}
}
rep(i, a + 1, d + 1) {
if (road[i] == '#' && road[i - 1] == '#') {
cout << "No" << endl;
return 0;
}
}
if (c < d) {
cout << "Yes" << endl;
return 0;
} else {
rep(i, b, d + 1) {
if (i - 1 < 0 || i + 1 >= n)
continue;
if (road[i + 1] == '.' && road[i - 1] == '.' && road[i - 1] == '.') {
cout << "Yes" << endl;
return 0;
}
}
}
cout << "No" << endl;
return 0;
} | #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, cc, n) for (int i = cc; i < n; ++i)
#define lrep(i, cc, n) for (long long i = cc; i < n; ++i)
#define sqrep(i, cc, n) for (long long i = cc; i * i <= n; ++i)
#define rrep(i, cc, n) for (long i = cc; i > n; --i)
#define pii pair<int, int>
#define pll pair<long long, long long>
using ll = long long;
const vector<int> dx = {1, 0, -1, 0};
const vector<int> dy = {0, 1, 0, -1};
const ll inf = 1001001001;
const ll e9 = 1000000000;
const ll mod = 1000000007;
int main() {
int n, a, b, c, d;
string road;
cin >> n >> a >> b >> c >> d >> road;
a--;
b--;
c--;
d--;
bool q = true;
rep(i, a + 1, c + 1) {
if (road[i] == '#' && road[i - 1] == '#') {
cout << "No" << endl;
return 0;
}
}
rep(i, b + 1, d + 1) {
if (road[i] == '#' && road[i - 1] == '#') {
cout << "No" << endl;
return 0;
}
}
if (c < d) {
cout << "Yes" << endl;
return 0;
} else {
rep(i, b, d + 1) {
if (i - 1 < 0 || i + 1 >= n)
continue;
if (road[i + 1] == '.' && road[i] == '.' && road[i - 1] == '.') {
cout << "Yes" << endl;
return 0;
}
}
}
cout << "No" << endl;
return 0;
} | [
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 839,800 | 839,799 | u330518333 | cpp |
p03017 | #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, cc, n) for (int i = cc; i < n; ++i)
#define lrep(i, cc, n) for (long long i = cc; i < n; ++i)
#define sqrep(i, cc, n) for (long long i = cc; i * i <= n; ++i)
#define rrep(i, cc, n) for (long i = cc; i > n; --i)
#define pii pair<int, int>
#define pll pair<long long, long long>
using ll = long long;
const vector<int> dx = {1, 0, -1, 0};
const vector<int> dy = {0, 1, 0, -1};
const ll inf = 1001001001;
const ll e9 = 1000000000;
const ll mod = 1000000007;
int main() {
int n, a, b, c, d;
string road;
cin >> n >> a >> b >> c >> d >> road;
a--;
b--;
c--;
d--;
bool q = true;
rep(i, a + 1, c + 1) {
if (road[i] == '#' && road[i - 1] == '#') {
cout << "No" << endl;
return 0;
}
}
rep(i, a + 1, d + 1) {
if (road[i] == '#' && road[i - 1] == '#') {
cout << "No" << endl;
return 0;
}
}
if (c < d) {
cout << "Yes" << endl;
return 0;
} else {
rep(i, b, d + 1) {
if (b - 1 < 0 || d + 1 >= n)
continue;
if (road[i + 1] == '.' && road[i - 1] == '.' && road[i - 1] == '.') {
cout << "Yes" << endl;
return 0;
}
}
}
cout << "No" << endl;
return 0;
} | #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, cc, n) for (int i = cc; i < n; ++i)
#define lrep(i, cc, n) for (long long i = cc; i < n; ++i)
#define sqrep(i, cc, n) for (long long i = cc; i * i <= n; ++i)
#define rrep(i, cc, n) for (long i = cc; i > n; --i)
#define pii pair<int, int>
#define pll pair<long long, long long>
using ll = long long;
const vector<int> dx = {1, 0, -1, 0};
const vector<int> dy = {0, 1, 0, -1};
const ll inf = 1001001001;
const ll e9 = 1000000000;
const ll mod = 1000000007;
int main() {
int n, a, b, c, d;
string road;
cin >> n >> a >> b >> c >> d >> road;
a--;
b--;
c--;
d--;
bool q = true;
rep(i, a + 1, c + 1) {
if (road[i] == '#' && road[i - 1] == '#') {
cout << "No" << endl;
return 0;
}
}
rep(i, b + 1, d + 1) {
if (road[i] == '#' && road[i - 1] == '#') {
cout << "No" << endl;
return 0;
}
}
if (c < d) {
cout << "Yes" << endl;
return 0;
} else {
rep(i, b, d + 1) {
if (i - 1 < 0 || i + 1 >= n)
continue;
if (road[i + 1] == '.' && road[i] == '.' && road[i - 1] == '.') {
cout << "Yes" << endl;
return 0;
}
}
}
cout << "No" << endl;
return 0;
} | [
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change",
"control_flow.branch.if.condition.change",
"expression.operation.binary.remove"
] | 839,801 | 839,799 | u330518333 | cpp |
p03017 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define rrep(i, n) for (int i = n - 1; i >= 0; i--)
using namespace std;
#define INF ((1 << 30) - 1)
#define LINF (1LL << 60)
#define EPS (1e-10)
typedef long long ll;
typedef pair<ll, ll> P;
const int MOD = 1000000007;
const int MOD2 = 998244353;
int main() {
int n, a, b, c, d;
cin >> n >> a >> b >> c >> d;
a--, b--, c--, d--;
string s;
cin >> s;
bool f1 = 1, f2 = 1;
for (int i = a; i < c; i++) {
if (s[i] == '#' && s[i + 1] == '#')
f1 = 0;
}
for (int i = b; i < d; i++) {
if (s[i] == '#' && s[i + 1] == '#')
f2 = 0;
}
if (c < d) {
if (f1 && f2)
cout << "Yes" << endl;
else
cout << "No" << endl;
} else {
bool f3 = 0;
for (int i = b; i < d; i++) {
if (s[i - 1] == '.' && s[i] == '.' && s[i + 1] == '.')
f3 = 1;
}
if (f1 && f2 && f3)
cout << "Yes" << endl;
else
cout << "No" << endl;
}
return 0;
}
| #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define rrep(i, n) for (int i = n - 1; i >= 0; i--)
using namespace std;
#define INF ((1 << 30) - 1)
#define LINF (1LL << 60)
#define EPS (1e-10)
typedef long long ll;
typedef pair<ll, ll> P;
const int MOD = 1000000007;
const int MOD2 = 998244353;
int main() {
int n, a, b, c, d;
cin >> n >> a >> b >> c >> d;
a--, b--, c--, d--;
string s;
cin >> s;
bool f1 = 1, f2 = 1;
for (int i = a; i < c; i++) {
if (s[i] == '#' && s[i + 1] == '#')
f1 = 0;
}
for (int i = b; i < d; i++) {
if (s[i] == '#' && s[i + 1] == '#')
f2 = 0;
}
if (c < d) {
if (f1 && f2)
cout << "Yes" << endl;
else
cout << "No" << endl;
} else {
bool f3 = 0;
for (int i = b; i <= d; i++) {
if (s[i - 1] == '.' && s[i] == '.' && s[i + 1] == '.')
f3 = 1;
}
if (f1 && f2 && f3)
cout << "Yes" << endl;
else
cout << "No" << endl;
}
return 0;
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 839,820 | 839,821 | u501163846 | cpp |
p03017 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define zero_pad(num) setfill('0') << std::right << setw(num)
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<int, int>;
int main() {
int n, a, b, c, d;
cin >> n >> a >> b >> c >> d;
a--;
b--;
c--;
d--;
string s;
cin >> s;
if (c < d) {
for (int i = a; i < d; i++) {
if (s[i] == '#' && s[i + 1] == '#') {
cout << "No" << endl;
return 0;
}
}
cout << "Yes" << endl;
} else {
for (int i = a; i < d; i++) {
if (s[i] == '#' && s[i + 1] == '#') {
cout << "No" << endl;
return 0;
}
}
for (int i = b - 1; i < c; i++) {
if (s[i] == '.' && s[i + 1] == '.' && s[i + 2] == '.') {
cout << "Yes" << endl;
return 0;
}
}
cout << "No" << endl;
}
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define zero_pad(num) setfill('0') << std::right << setw(num)
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<int, int>;
int main() {
int n, a, b, c, d;
cin >> n >> a >> b >> c >> d;
a--;
b--;
c--;
d--;
string s;
cin >> s;
if (c < d) {
for (int i = a; i < d; i++) {
if (s[i] == '#' && s[i + 1] == '#') {
cout << "No" << endl;
return 0;
}
}
cout << "Yes" << endl;
} else {
for (int i = a; i < d; i++) {
if (s[i] == '#' && s[i + 1] == '#') {
cout << "No" << endl;
return 0;
}
}
for (int i = b - 1; i < d; i++) {
if (s[i] == '.' && s[i + 1] == '.' && s[i + 2] == '.') {
cout << "Yes" << endl;
return 0;
}
}
cout << "No" << endl;
}
} | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 839,831 | 839,832 | u068713120 | cpp |
p03017 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define zero_pad(num) setfill('0') << std::right << setw(num)
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<int, int>;
int main() {
int n, a, b, c, d;
cin >> n >> a >> b >> c >> d;
a--;
b--;
c--;
d--;
string s;
cin >> s;
if (c < d) {
for (int i = a; i < d; i++) {
if (s[i] == '#' && s[i + 1] == '#') {
cout << "No" << endl;
return 0;
}
}
cout << "Yes" << endl;
} else {
for (int i = a; i < d; i++) {
if (s[i] == '#' && s[i + 1] == '#') {
cout << "No" << endl;
return 0;
}
}
for (int i = b; i < c; i++) {
if (s[i] == '.' && s[i + 1] == '.' && s[i + 2] == '.') {
cout << "Yes" << endl;
return 0;
}
}
cout << "No" << endl;
}
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define zero_pad(num) setfill('0') << std::right << setw(num)
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<int, int>;
int main() {
int n, a, b, c, d;
cin >> n >> a >> b >> c >> d;
a--;
b--;
c--;
d--;
string s;
cin >> s;
if (c < d) {
for (int i = a; i < d; i++) {
if (s[i] == '#' && s[i + 1] == '#') {
cout << "No" << endl;
return 0;
}
}
cout << "Yes" << endl;
} else {
for (int i = a; i < d; i++) {
if (s[i] == '#' && s[i + 1] == '#') {
cout << "No" << endl;
return 0;
}
}
for (int i = b - 1; i < d; i++) {
if (s[i] == '.' && s[i + 1] == '.' && s[i + 2] == '.') {
cout << "Yes" << endl;
return 0;
}
}
cout << "No" << endl;
}
} | [
"control_flow.loop.for.initializer.change",
"identifier.change",
"control_flow.branch.if.condition.change"
] | 839,833 | 839,832 | u068713120 | cpp |
p03017 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, A, B, C, D;
cin >> N >> A >> B >> C >> D;
A--;
B--;
C--;
D--;
string S;
cin >> S;
bool ok = true;
for (int i = A + 1; i < B - 1; i++) {
if (S[i] == '#' && S[i + 1] == '#') {
ok = false;
}
}
for (int i = C + 1; i < D - 1; i++) {
if (S[i] == '#' && S[i + 1] == '#') {
ok = false;
}
}
if (!ok) {
cout << "No" << endl;
} else {
if (C < D) {
cout << "Yes" << endl;
} else {
ok = false;
for (int i = B; i < D; i++) {
if (S[i - 1] == '.' && S[i] == '.' && S[i + 1] == '.') {
ok = true;
}
}
if (ok) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
}
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, A, B, C, D;
cin >> N >> A >> B >> C >> D;
A--;
B--;
C--;
D--;
string S;
cin >> S;
bool ok = true;
for (int i = A + 1; i < B - 1; i++) {
if (S[i] == '#' && S[i + 1] == '#') {
ok = false;
}
}
for (int i = C + 1; i < D - 1; i++) {
if (S[i] == '#' && S[i + 1] == '#') {
ok = false;
}
}
if (!ok) {
cout << "No" << endl;
} else {
if (C < D) {
cout << "Yes" << endl;
} else {
ok = false;
for (int i = B; i <= D; i++) {
if (S[i - 1] == '.' && S[i] == '.' && S[i + 1] == '.') {
ok = true;
}
}
if (ok) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
}
}
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 839,845 | 839,846 | u424374375 | cpp |
p03017 | #include <bits/stdc++.h>
#define rng(i, a, b) for (int i = int(a); i < int(b); i++)
#define rep(i, b) rng(i, 0, b)
#define gnr(i, a, b) for (int i = int(b) - 1; i >= int(a); i--)
#define per(i, b) gnr(i, 0, b)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int n, a, b, c, d;
string s;
cin >> n >> a >> b >> c >> d >> s;
a--;
b--;
c--;
d--;
bool canGo = true;
bool previousIsIwa = false;
int cnt = 0;
bool canChange = false;
rep(i, n) {
// 岩が並んでいたら駄目
if (i > a && i < d) {
if (s[i] == '#') {
if (previousIsIwa) {
canGo = false;
}
previousIsIwa = true;
} else {
previousIsIwa = false;
}
}
// すぬけ君とふぬけ君の順番変われるか
// c > d の場合のみ考慮
if (i >= b - 1 && i <= d) {
if (s[i] == '.') {
if (cnt >= 2) {
canChange = true;
}
cnt++;
} else {
cnt = 0;
}
}
}
bool ok = canGo;
if (c > d) {
ok = ok && canChange;
}
cout << (ok ? "Yes" : "No") << endl;
return 0;
}
| #include <bits/stdc++.h>
#define rng(i, a, b) for (int i = int(a); i < int(b); i++)
#define rep(i, b) rng(i, 0, b)
#define gnr(i, a, b) for (int i = int(b) - 1; i >= int(a); i--)
#define per(i, b) gnr(i, 0, b)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int n, a, b, c, d;
string s;
cin >> n >> a >> b >> c >> d >> s;
a--;
b--;
c--;
d--;
bool canGo = true;
bool previousIsIwa = false;
int cnt = 0;
bool canChange = false;
rep(i, n) {
// 岩が並んでいたら駄目
if (i > a && i < d) {
if (s[i] == '#') {
if (previousIsIwa) {
canGo = false;
}
previousIsIwa = true;
} else {
previousIsIwa = false;
}
}
// すぬけ君とふぬけ君の順番変われるか
// c > d の場合のみ考慮
if (i >= b - 1 && i <= d + 1) {
if (s[i] == '.') {
if (cnt >= 2) {
canChange = true;
}
cnt++;
} else {
cnt = 0;
}
}
}
bool ok = canGo;
if (c > d) {
ok = ok && canChange;
}
cout << (ok ? "Yes" : "No") << endl;
return 0;
}
| [
"control_flow.branch.if.condition.change"
] | 839,849 | 839,850 | u011438316 | cpp |
p03017 | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
typedef long long ll;
typedef pair<int, int> P;
const int INF = 100100100;
const int MOD = (int)1e9 + 7;
const double EPS = 1e-9;
struct Edge {
ll to;
ll cost;
};
int main() {
int N, A, B, C, D;
cin >> N >> A >> B >> C >> D, A--, B--, C--, D--;
string S;
cin >> S;
for (int i = A; i <= max(C, D) - 1; i++) {
if (S[i] == '#' && S[i + 1] == '#') {
cout << "No" << endl;
return 0;
}
}
if (D < C) {
bool t = false;
for (int i = B - 1; i <= D - 2; i++) {
if (S[i] == '.' && S[i + 1] == '.' && S[i + 2] == '.')
t = true;
}
if (t) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
return 0;
} else {
cout << "Yes" << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
typedef long long ll;
typedef pair<int, int> P;
const int INF = 100100100;
const int MOD = (int)1e9 + 7;
const double EPS = 1e-9;
struct Edge {
ll to;
ll cost;
};
int main() {
int N, A, B, C, D;
cin >> N >> A >> B >> C >> D, A--, B--, C--, D--;
string S;
cin >> S;
for (int i = A; i <= max(C, D); i++) {
if (S[i] == '#' && S[i + 1] == '#') {
cout << "No" << endl;
return 0;
}
}
if (D < C) {
bool t = false;
for (int i = B - 1; i <= D - 1; i++) {
if (S[i] == '.' && S[i + 1] == '.' && S[i + 2] == '.')
t = true;
}
if (t) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
return 0;
} else {
cout << "Yes" << endl;
}
} | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove",
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 839,863 | 839,864 | u893239355 | cpp |
p03017 | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
typedef long long ll;
typedef pair<int, int> P;
const int INF = 100100100;
const int MOD = (int)1e9 + 7;
const double EPS = 1e-9;
struct Edge {
ll to;
ll cost;
};
int main() {
int N, A, B, C, D;
cin >> N >> A >> B >> C >> D, A--, B--, C--, D--;
string S;
cin >> S;
for (int i = A; i < max(C, D) - 1; i++) {
if (S[i] == '#' && S[i + 1] == '#') {
cout << "No" << endl;
return 0;
}
}
if (D < C) {
bool t = false;
for (int i = B - 1; i < D - 2; i++) {
if (S[i] == '.' && S[i + 1] == '.' && S[i + 2] == '.')
t = true;
}
if (t) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
return 0;
} else {
cout << "Yes" << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
typedef long long ll;
typedef pair<int, int> P;
const int INF = 100100100;
const int MOD = (int)1e9 + 7;
const double EPS = 1e-9;
struct Edge {
ll to;
ll cost;
};
int main() {
int N, A, B, C, D;
cin >> N >> A >> B >> C >> D, A--, B--, C--, D--;
string S;
cin >> S;
for (int i = A; i <= max(C, D); i++) {
if (S[i] == '#' && S[i + 1] == '#') {
cout << "No" << endl;
return 0;
}
}
if (D < C) {
bool t = false;
for (int i = B - 1; i <= D - 1; i++) {
if (S[i] == '.' && S[i + 1] == '.' && S[i + 2] == '.')
t = true;
}
if (t) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
return 0;
} else {
cout << "Yes" << endl;
}
} | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"expression.operation.binary.remove",
"control_flow.branch.if.condition.change",
"literal.number.change"
] | 839,866 | 839,864 | u893239355 | cpp |
p03017 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ios::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;
if (C > D) {
int cnt = 0;
for (int i = B - 1; i <= D; i++) {
if (S[i] == '.')
cnt++;
else
cnt = 0;
if (cnt == 3)
break;
}
if (cnt != 3) {
cout << "No\n";
return 0;
}
}
int iwa = 0;
for (int i = 0; i < S.size(); i++) {
if (S[i] == '#')
iwa++;
else
iwa = 0;
if (iwa >= 2) {
if ((A <= i && i <= C) || (B <= i && i <= D)) {
cout << "No\n";
return 0;
}
}
}
cout << "Yes\n";
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ios::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;
if (C > D) {
int cnt = 0;
for (int i = B - 1; i <= D + 1; i++) {
if (S[i] == '.')
cnt++;
else
cnt = 0;
if (cnt == 3)
break;
}
if (cnt != 3) {
cout << "No\n";
return 0;
}
}
int iwa = 0;
for (int i = 0; i < S.size(); i++) {
if (S[i] == '#')
iwa++;
else
iwa = 0;
if (iwa >= 2) {
if ((A <= i && i <= C) || (B <= i && i <= D)) {
cout << "No\n";
return 0;
}
}
}
cout << "Yes\n";
return 0;
}
| [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 839,867 | 839,868 | u175426149 | cpp |
p03017 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ios::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;
if (C > D) {
int cnt = 0;
for (int i = B; i <= D; i++) {
if (S[i] == '.')
cnt++;
else
cnt = 0;
if (cnt == 3)
break;
}
if (cnt != 3) {
cout << "No\n";
return 0;
}
}
int iwa = 0;
for (int i = 0; i < S.size(); i++) {
if (S[i] == '#')
iwa++;
else
iwa = 0;
if (iwa >= 2) {
if ((A <= i && i <= C) || (B <= i && i <= D)) {
cout << "No\n";
return 0;
}
}
}
cout << "Yes\n";
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ios::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;
if (C > D) {
int cnt = 0;
for (int i = B - 1; i <= D + 1; i++) {
if (S[i] == '.')
cnt++;
else
cnt = 0;
if (cnt == 3)
break;
}
if (cnt != 3) {
cout << "No\n";
return 0;
}
}
int iwa = 0;
for (int i = 0; i < S.size(); i++) {
if (S[i] == '#')
iwa++;
else
iwa = 0;
if (iwa >= 2) {
if ((A <= i && i <= C) || (B <= i && i <= D)) {
cout << "No\n";
return 0;
}
}
}
cout << "Yes\n";
return 0;
}
| [
"control_flow.loop.for.initializer.change",
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 839,869 | 839,868 | u175426149 | cpp |
p03017 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
#define allR(v) v.rbegin(), v.rend()
#define PRINT(v) \
for (auto x : (v)) \
cout << x << " "; \
cout << endl;
using namespace std;
using ll = long long;
using Graph = vector<vector<int>>;
typedef pair<int, int> Pi;
const ll MOD = 1000000007;
const ll INF = 10000000000000000;
const int inf = 1001001001;
vector<int> x4 = {0, 1, 0, -1}, x8 = {0, 1, 1, 1, 0, -1, -1, -1};
vector<int> y4 = {1, 0, -1, 0}, y8 = {1, 1, 0, -1, -1, -1, 0, 1};
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;
}
template <class T> inline T powerM(T a, T b) {
if (b == 0)
return 1;
T tmp = powerM(a, b / 2);
if (b % 2 == 0)
return tmp * tmp % MOD;
else
return tmp * tmp % MOD * a % MOD;
}
template <class T> inline T power(T a, T b, T m = numeric_limits<T>::max()) {
if (b == 0)
return 1;
T tmp = power(a, b / 2, m);
if (b % 2 == 0)
return tmp * tmp % m;
else
return tmp * tmp % m * a % m;
}
template <class T> inline T gcd(T a, T b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
template <class T> inline T lcm(T a, T b) { return a / gcd(a, b) * b; }
// ax+by=gcd(a,b)を解く
template <class T> inline T extgcd(T a, T b, T &x, T &y) {
if (b == 0) {
x = 1;
y = 0;
return a;
}
T d = extgcd(b, a % b, y, x);
y -= a / b * x;
return d;
}
void hey() { cout << "hey" << endl; }
template <class T> struct edge {
int to;
T cost;
};
int main() {
int N, A, B, C, D;
cin >> N >> A >> B >> C >> D;
string s;
cin >> s;
A--;
B--;
C--;
D--;
bool ok = true;
for (int i = A; i < max(C, D); i++) {
if (s[i] == '#' && s[i + 1] == '#')
ok = false;
}
if (!ok) {
cout << "No" << endl;
return 0;
}
if (C < D) {
cout << "Yes" << endl;
return 0;
}
ok = false;
for (int i = B; i < D - 1; i++) {
if (s[i] == '.' && s[i + 1] == '.' && s[i + 2] == '.')
ok = true;
}
cout << (ok ? "Yes" : "No") << endl;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
#define allR(v) v.rbegin(), v.rend()
#define PRINT(v) \
for (auto x : (v)) \
cout << x << " "; \
cout << endl;
using namespace std;
using ll = long long;
using Graph = vector<vector<int>>;
typedef pair<int, int> Pi;
const ll MOD = 1000000007;
const ll INF = 10000000000000000;
const int inf = 1001001001;
vector<int> x4 = {0, 1, 0, -1}, x8 = {0, 1, 1, 1, 0, -1, -1, -1};
vector<int> y4 = {1, 0, -1, 0}, y8 = {1, 1, 0, -1, -1, -1, 0, 1};
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;
}
template <class T> inline T powerM(T a, T b) {
if (b == 0)
return 1;
T tmp = powerM(a, b / 2);
if (b % 2 == 0)
return tmp * tmp % MOD;
else
return tmp * tmp % MOD * a % MOD;
}
template <class T> inline T power(T a, T b, T m = numeric_limits<T>::max()) {
if (b == 0)
return 1;
T tmp = power(a, b / 2, m);
if (b % 2 == 0)
return tmp * tmp % m;
else
return tmp * tmp % m * a % m;
}
template <class T> inline T gcd(T a, T b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
template <class T> inline T lcm(T a, T b) { return a / gcd(a, b) * b; }
// ax+by=gcd(a,b)を解く
template <class T> inline T extgcd(T a, T b, T &x, T &y) {
if (b == 0) {
x = 1;
y = 0;
return a;
}
T d = extgcd(b, a % b, y, x);
y -= a / b * x;
return d;
}
void hey() { cout << "hey" << endl; }
template <class T> struct edge {
int to;
T cost;
};
int main() {
int N, A, B, C, D;
cin >> N >> A >> B >> C >> D;
string s;
cin >> s;
A--;
B--;
C--;
D--;
bool ok = true;
for (int i = A; i < max(C, D); i++) {
if (s[i] == '#' && s[i + 1] == '#')
ok = false;
}
if (!ok) {
cout << "No" << endl;
return 0;
}
if (C < D) {
cout << "Yes" << endl;
return 0;
}
ok = false;
for (int i = B - 1; i < D; i++) {
if (s[i] == '.' && s[i + 1] == '.' && s[i + 2] == '.')
ok = true;
}
cout << (ok ? "Yes" : "No") << endl;
} | [
"control_flow.loop.for.initializer.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 839,874 | 839,875 | u195132800 | cpp |
p03017 | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (n); i++)
using namespace std;
int main() {
cin.tie(0)->sync_with_stdio(false);
int n, a, b, c, d;
cin >> n >> a >> b >> c >> d;
a--;
b--;
c--;
d--;
string s;
cin >> s;
int mini = min(a, b);
int maxi = max(c, d);
bool ok = true;
for (int i = mini; i < maxi - 1; i++)
if (s[i] == '#' && s[i + 1] == '#') {
ok = false;
break;
}
if (ok) {
if (c > d) {
bool okD = false;
for (int i = mini; i < maxi - 2; i++)
if (s[i] == '.' && s[i + 1] == '.' && s[i + 2] == '.') {
okD = true;
break;
}
if (!okD)
ok = false;
}
}
if (ok)
cout << "Yes" << '\n';
else
cout << "No" << '\n';
return 0;
}
| #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (n); i++)
using namespace std;
int main() {
cin.tie(0)->sync_with_stdio(false);
int n, a, b, c, d;
cin >> n >> a >> b >> c >> d;
a--;
b--;
c--;
d--;
string s;
cin >> s;
int mini = min(a, b);
int maxi = max(c, d);
bool ok = true;
for (int i = mini; i < maxi - 1; i++)
if (s[i] == '#' && s[i + 1] == '#') {
ok = false;
break;
}
if (ok) {
if (c > d) {
bool okD = false;
for (int i = b - 1; i < d; i++)
if (s[i] == '.' && s[i + 1] == '.' && s[i + 2] == '.') {
okD = true;
break;
}
if (!okD)
ok = false;
}
}
if (ok)
cout << "Yes" << '\n';
else
cout << "No" << '\n';
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"
] | 839,889 | 839,890 | u596385287 | cpp |
p03017 | #include <bits/stdc++.h>
#include <iomanip>
#include <math.h>
#define rep(i, x) for (ll i = 0; i < x; i++)
#define all(a) (a).begin(), (a).end()
using ll = long long;
using ld = long double;
using namespace std;
using dou = double;
const ll INF = 1LL << 60;
const ll mod = 1000000007;
typedef pair<ll, ll> P;
using graph = vector<vector<ll>>;
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;
}
ll gcd(ll a, ll b) {
if (a < b)
swap(a, b);
if (a % b == 0)
return b;
else
return gcd(b, a % b);
}
bool isp(ll n) {
bool res = true;
if (n == 1)
return false;
else {
for (ll i = 2; i * i <= n; i++) {
if (n % i == 0) {
res = false;
break;
}
}
return res;
}
}
// printf("%.10f\n", N);
/*
ll fibo(ll n){
if(memo[n] != 0)return memo[n];
if(n <= 1)return n;
else return memo[n] = fibo(n - 1)+ fibo(n - 2);
}*/
/* vector<ll> vec = {1,2,5,6,8,9,10};
cout << binary_search(all(vec),5) << endl; -> true*/
/*
vector<ll> vec = {1,2,5,6,8,9,10};
auto n = upper_bound(all(vec),4);
cout << *n << endl; -> 5*/
/*
cout << fixed << setprecision(15);
*/
int main() {
ll N, A, B, C, D;
string S;
bool ok = true;
cin >> N >> A >> B >> C >> D >> S;
for (ll i = A - 1; i < max(C, D) - 2; i++) {
if (S[i] == '#' && S[i + 1] == '#')
ok = false;
// cout << S[i] << S[i + 1] << endl;
}
if (ok) {
if (C < D) {
cout << "Yes" << endl;
} else {
bool ans = false;
for (ll i = B - 1; i < D - 1; i++) {
if (S[i] == '.' && S[i - 1] == '.' && S[i + 1] == '.')
ans = true;
}
if (ans)
cout << "Yes" << endl;
else
cout << "No" << endl;
}
} else {
cout << "No" << endl;
}
}
| #include <bits/stdc++.h>
#include <iomanip>
#include <math.h>
#define rep(i, x) for (ll i = 0; i < x; i++)
#define all(a) (a).begin(), (a).end()
using ll = long long;
using ld = long double;
using namespace std;
using dou = double;
const ll INF = 1LL << 60;
const ll mod = 1000000007;
typedef pair<ll, ll> P;
using graph = vector<vector<ll>>;
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;
}
ll gcd(ll a, ll b) {
if (a < b)
swap(a, b);
if (a % b == 0)
return b;
else
return gcd(b, a % b);
}
bool isp(ll n) {
bool res = true;
if (n == 1)
return false;
else {
for (ll i = 2; i * i <= n; i++) {
if (n % i == 0) {
res = false;
break;
}
}
return res;
}
}
// printf("%.10f\n", N);
/*
ll fibo(ll n){
if(memo[n] != 0)return memo[n];
if(n <= 1)return n;
else return memo[n] = fibo(n - 1)+ fibo(n - 2);
}*/
/* vector<ll> vec = {1,2,5,6,8,9,10};
cout << binary_search(all(vec),5) << endl; -> true*/
/*
vector<ll> vec = {1,2,5,6,8,9,10};
auto n = upper_bound(all(vec),4);
cout << *n << endl; -> 5*/
/*
cout << fixed << setprecision(15);
*/
int main() {
ll N, A, B, C, D;
string S;
bool ok = true;
cin >> N >> A >> B >> C >> D >> S;
for (ll i = A - 1; i < max(C, D) - 2; i++) {
if (S[i] == '#' && S[i + 1] == '#')
ok = false;
// cout << S[i] << S[i + 1] << endl;
}
if (ok) {
if (C < D) {
cout << "Yes" << endl;
} else {
bool ans = false;
for (ll i = B - 1; i <= D - 1; i++) {
if (S[i] == '.' && S[i - 1] == '.' && S[i + 1] == '.')
ans = true;
}
if (ans)
cout << "Yes" << endl;
else
cout << "No" << endl;
}
} else {
cout << "No" << endl;
}
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 839,896 | 839,897 | u527652459 | cpp |
p03017 | #include <bits/stdc++.h>
#define rep(i, a, n) for (int i = a; i < n; i++)
#define repr(i, a, n) for (int i = n - 1; i >= a; i--)
using namespace std;
using ll = long long;
using P = pair<int, int>;
template <typename T> void chmin(T &a, T b) { a = min(a, b); }
template <typename T> void chmax(T &a, T b) { a = max(a, b); }
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;
a--, b--, c--, d--;
rep(i, a, c + 1) {
if (s[i - 1] == '#' && s[i] == '#') {
cout << "No" << endl;
return 0;
}
}
rep(i, b, d + 1) {
if (s[i - 1] == '#' && s[i] == '#') {
cout << "No" << endl;
return 0;
}
}
if (c < d) {
cout << "Yes" << endl;
} else {
rep(i, b - 1, d - 2) {
if (s[i] == '.' && s[i + 1] == '.' && s[i + 2] == '.') {
cout << "Yes" << endl;
return 0;
}
}
cout << "No" << endl;
}
}
| #include <bits/stdc++.h>
#define rep(i, a, n) for (int i = a; i < n; i++)
#define repr(i, a, n) for (int i = n - 1; i >= a; i--)
using namespace std;
using ll = long long;
using P = pair<int, int>;
template <typename T> void chmin(T &a, T b) { a = min(a, b); }
template <typename T> void chmax(T &a, T b) { a = max(a, b); }
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;
a--, b--, c--, d--;
rep(i, a, c + 1) {
if (s[i - 1] == '#' && s[i] == '#') {
cout << "No" << endl;
return 0;
}
}
rep(i, b, d + 1) {
if (s[i - 1] == '#' && s[i] == '#') {
cout << "No" << endl;
return 0;
}
}
if (c < d) {
cout << "Yes" << endl;
} else {
rep(i, b - 1, d) {
if (s[i] == '.' && s[i + 1] == '.' && s[i + 2] == '.') {
cout << "Yes" << endl;
return 0;
}
}
cout << "No" << endl;
}
}
| [
"expression.operation.binary.remove"
] | 839,903 | 839,904 | u688789047 | cpp |
p03017 | #include <bits/stdc++.h>
#define rep(i, a, n) for (int i = a; i < n; i++)
#define repr(i, a, n) for (int i = n - 1; i >= a; i--)
using namespace std;
using ll = long long;
using P = pair<int, int>;
template <typename T> void chmin(T &a, T b) { a = min(a, b); }
template <typename T> void chmax(T &a, T b) { a = max(a, b); }
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;
a--, b--, c--, d--;
rep(i, a, c + 1) {
if (s[i - 1] == '#' && s[i] == '#') {
cout << "No" << endl;
return 0;
}
}
rep(i, b, d + 1) {
if (s[i - 1] == '#' && s[i] == '#') {
cout << "No" << endl;
return 0;
}
}
if (c < d) {
cout << "Yes" << endl;
} else {
rep(i, b - 1, n - 2) {
if (s[i] == '.' && s[i + 1] == '.' && s[i + 2] == '.') {
cout << "Yes" << endl;
return 0;
}
}
cout << "No" << endl;
}
}
| #include <bits/stdc++.h>
#define rep(i, a, n) for (int i = a; i < n; i++)
#define repr(i, a, n) for (int i = n - 1; i >= a; i--)
using namespace std;
using ll = long long;
using P = pair<int, int>;
template <typename T> void chmin(T &a, T b) { a = min(a, b); }
template <typename T> void chmax(T &a, T b) { a = max(a, b); }
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;
a--, b--, c--, d--;
rep(i, a, c + 1) {
if (s[i - 1] == '#' && s[i] == '#') {
cout << "No" << endl;
return 0;
}
}
rep(i, b, d + 1) {
if (s[i - 1] == '#' && s[i] == '#') {
cout << "No" << endl;
return 0;
}
}
if (c < d) {
cout << "Yes" << endl;
} else {
rep(i, b - 1, d) {
if (s[i] == '.' && s[i + 1] == '.' && s[i + 2] == '.') {
cout << "Yes" << endl;
return 0;
}
}
cout << "No" << endl;
}
}
| [
"call.arguments.change",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 839,905 | 839,904 | u688789047 | cpp |
p03017 | //#include <bits/stdc++.h>
//#include <stdio.h>
#include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <vector>
using namespace std;
using ll = long long;
using intpair = pair<int, int>;
using intpv = vector<intpair>;
using llpair = pair<ll, ll>;
using llpv = vector<llpair>;
using intvec = vector<int>;
using llvec = vector<ll>;
using intq = queue<int>;
using llq = queue<ll>;
using intmat = vector<intvec>;
using llmat = vector<llvec>;
using pairmat = vector<llpv>;
template <typename T> using matrix = vector<vector<T>>;
template <typename T> using pque = priority_queue<T>;
template <typename T> using lpque = priority_queue<T, vector<T>, greater<T>>;
#define PI 3.141592653589793
#define INTINF 1 << 30
#define LLINF 1LL << 60
#define MPRIME 1000000007
#define MPRIME9 998244353
#define len length()
#define pushb push_back
#define fi first
#define se second
#define setpr fixed << setprecision(15)
#define all(name) name.begin(), name.end()
#define rall(name) name.rbegin(), name.rend()
#define gsort(vbeg, vend) sort(vbeg, vend, greater<>())
#define matin(mat, H, W) \
for (int i__ = 0; i__ < H; i__++) \
for (int j__ = 0; j__ < W; j__++) \
cin >> mat[i__][j__]
#define out(n) cout << n << endl
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;
}
template <class T> inline void outmat(T &a, int y, int x) {
for (int i = 0; i < y; i++) {
for (int j = 0; j < x; j++)
cout << a[i][j] << " ";
cout << endl;
}
}
template <class T> inline void init(T &v) {
for (auto &a__ : v)
cin >> a__;
}
template <class T, class N> inline void init(T &v, N n) {
v.resize(n);
for (auto &a__ : v)
cin >> a__;
}
template <class N> void resiz(N n) {} // empty
template <class N, class T, class... U> void resiz(N n, T &&hd, U &&...tl) {
hd.resize(n);
resiz(n, forward<U>(tl)...);
}
ll GCD(ll a, ll b) { //最大公約数
if (a == 0 || b == 0)
return 0;
if (a < b)
swap(a, b);
ll tmp = a % b;
while (tmp != 0) {
a = b;
b = tmp;
tmp = a % b;
}
return b;
}
ll binpow(ll a, ll ex, ll p) { //繰り返し二乗法
ll result = 1;
while (ex > 0) {
if (ex & 1)
result = result * a % p;
ex >>= 1;
a = a * a % p;
}
return result;
}
ll Fact(ll x, ll p) { //階乗
ll f = 1;
for (ll i = 2; i <= x; i++) {
f *= i;
f %= p;
}
return f;
}
int DigitNum(ll n) { //桁数
int digit = 0;
ll div = 1LL;
while (n / div) {
digit++;
div *= 10;
}
return digit;
}
int N, A, B, C, D;
string S;
void input() {
cin >> N >> A >> B >> C >> D;
A--, B--, C--, D--;
cin >> S;
}
bool check2(int s, int t) {
for (int i = s; i < t; i++) {
if (string(S.begin() + i, S.begin() + i + 2) == "##")
return true;
}
return false;
}
bool check3(int s, int t) {
for (int i = s - 1; i < t - 1; i++) {
if (string(S.begin() + i, S.begin() + i + 3) == "...")
return false;
}
return true;
}
void solve() {
if (S[C] == '#' || S[D] == '#') {
cout << "No" << endl;
return;
}
if (C < B) {
if (check2(A, C) || check2(B, D))
cout << "No" << endl;
else
cout << "Yes" << endl;
return;
}
if (C < D) {
if (check2(A, D))
cout << "No" << endl;
else
cout << "Yes" << endl;
return;
}
// A<B<D<C
if (check2(A, C) || check3(B, D))
cout << "No" << endl;
else
cout << "Yes" << endl;
}
int main() {
while (1) {
input();
solve();
break;
}
}
| //#include <bits/stdc++.h>
//#include <stdio.h>
#include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <vector>
using namespace std;
using ll = long long;
using intpair = pair<int, int>;
using intpv = vector<intpair>;
using llpair = pair<ll, ll>;
using llpv = vector<llpair>;
using intvec = vector<int>;
using llvec = vector<ll>;
using intq = queue<int>;
using llq = queue<ll>;
using intmat = vector<intvec>;
using llmat = vector<llvec>;
using pairmat = vector<llpv>;
template <typename T> using matrix = vector<vector<T>>;
template <typename T> using pque = priority_queue<T>;
template <typename T> using lpque = priority_queue<T, vector<T>, greater<T>>;
#define PI 3.141592653589793
#define INTINF 1 << 30
#define LLINF 1LL << 60
#define MPRIME 1000000007
#define MPRIME9 998244353
#define len length()
#define pushb push_back
#define fi first
#define se second
#define setpr fixed << setprecision(15)
#define all(name) name.begin(), name.end()
#define rall(name) name.rbegin(), name.rend()
#define gsort(vbeg, vend) sort(vbeg, vend, greater<>())
#define matin(mat, H, W) \
for (int i__ = 0; i__ < H; i__++) \
for (int j__ = 0; j__ < W; j__++) \
cin >> mat[i__][j__]
#define out(n) cout << n << endl
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;
}
template <class T> inline void outmat(T &a, int y, int x) {
for (int i = 0; i < y; i++) {
for (int j = 0; j < x; j++)
cout << a[i][j] << " ";
cout << endl;
}
}
template <class T> inline void init(T &v) {
for (auto &a__ : v)
cin >> a__;
}
template <class T, class N> inline void init(T &v, N n) {
v.resize(n);
for (auto &a__ : v)
cin >> a__;
}
template <class N> void resiz(N n) {} // empty
template <class N, class T, class... U> void resiz(N n, T &&hd, U &&...tl) {
hd.resize(n);
resiz(n, forward<U>(tl)...);
}
ll GCD(ll a, ll b) { //最大公約数
if (a == 0 || b == 0)
return 0;
if (a < b)
swap(a, b);
ll tmp = a % b;
while (tmp != 0) {
a = b;
b = tmp;
tmp = a % b;
}
return b;
}
ll binpow(ll a, ll ex, ll p) { //繰り返し二乗法
ll result = 1;
while (ex > 0) {
if (ex & 1)
result = result * a % p;
ex >>= 1;
a = a * a % p;
}
return result;
}
ll Fact(ll x, ll p) { //階乗
ll f = 1;
for (ll i = 2; i <= x; i++) {
f *= i;
f %= p;
}
return f;
}
int DigitNum(ll n) { //桁数
int digit = 0;
ll div = 1LL;
while (n / div) {
digit++;
div *= 10;
}
return digit;
}
int N, A, B, C, D;
string S;
void input() {
cin >> N >> A >> B >> C >> D;
A--, B--, C--, D--;
cin >> S;
}
bool check2(int s, int t) {
for (int i = s; i < t; i++) {
if (string(S.begin() + i, S.begin() + i + 2) == "##")
return true;
}
return false;
}
bool check3(int s, int t) {
for (int i = s - 1; i < t; i++) {
if (string(S.begin() + i, S.begin() + i + 3) == "...")
return false;
}
return true;
}
void solve() {
if (S[C] == '#' || S[D] == '#') {
cout << "No" << endl;
return;
}
if (C < B) {
if (check2(A, C) || check2(B, D))
cout << "No" << endl;
else
cout << "Yes" << endl;
return;
}
if (C < D) {
if (check2(A, D))
cout << "No" << endl;
else
cout << "Yes" << endl;
return;
}
// A<B<D<C
if (check2(A, C) || check3(B, D))
cout << "No" << endl;
else
cout << "Yes" << endl;
}
int main() {
while (1) {
input();
solve();
break;
}
}
| [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 839,916 | 839,917 | u195036695 | cpp |
p03017 | //#include <bits/stdc++.h>
//#include <stdio.h>
#include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <vector>
using namespace std;
using ll = long long;
using intpair = pair<int, int>;
using intpv = vector<intpair>;
using llpair = pair<ll, ll>;
using llpv = vector<llpair>;
using intvec = vector<int>;
using llvec = vector<ll>;
using intq = queue<int>;
using llq = queue<ll>;
using intmat = vector<intvec>;
using llmat = vector<llvec>;
using pairmat = vector<llpv>;
template <typename T> using matrix = vector<vector<T>>;
template <typename T> using pque = priority_queue<T>;
template <typename T> using lpque = priority_queue<T, vector<T>, greater<T>>;
#define PI 3.141592653589793
#define INTINF 1 << 30
#define LLINF 1LL << 60
#define MPRIME 1000000007
#define MPRIME9 998244353
#define len length()
#define pushb push_back
#define fi first
#define se second
#define setpr fixed << setprecision(15)
#define all(name) name.begin(), name.end()
#define rall(name) name.rbegin(), name.rend()
#define gsort(vbeg, vend) sort(vbeg, vend, greater<>())
#define matin(mat, H, W) \
for (int i__ = 0; i__ < H; i__++) \
for (int j__ = 0; j__ < W; j__++) \
cin >> mat[i__][j__]
#define out(n) cout << n << endl
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;
}
template <class T> inline void outmat(T &a, int y, int x) {
for (int i = 0; i < y; i++) {
for (int j = 0; j < x; j++)
cout << a[i][j] << " ";
cout << endl;
}
}
template <class T> inline void init(T &v) {
for (auto &a__ : v)
cin >> a__;
}
template <class T, class N> inline void init(T &v, N n) {
v.resize(n);
for (auto &a__ : v)
cin >> a__;
}
template <class N> void resiz(N n) {} // empty
template <class N, class T, class... U> void resiz(N n, T &&hd, U &&...tl) {
hd.resize(n);
resiz(n, forward<U>(tl)...);
}
ll GCD(ll a, ll b) { //最大公約数
if (a == 0 || b == 0)
return 0;
if (a < b)
swap(a, b);
ll tmp = a % b;
while (tmp != 0) {
a = b;
b = tmp;
tmp = a % b;
}
return b;
}
ll binpow(ll a, ll ex, ll p) { //繰り返し二乗法
ll result = 1;
while (ex > 0) {
if (ex & 1)
result = result * a % p;
ex >>= 1;
a = a * a % p;
}
return result;
}
ll Fact(ll x, ll p) { //階乗
ll f = 1;
for (ll i = 2; i <= x; i++) {
f *= i;
f %= p;
}
return f;
}
int DigitNum(ll n) { //桁数
int digit = 0;
ll div = 1LL;
while (n / div) {
digit++;
div *= 10;
}
return digit;
}
int N, A, B, C, D;
string S;
void input() {
cin >> N >> A >> B >> C >> D;
A--, B--, C--, D--;
cin >> S;
}
bool check2(int s, int t) {
for (int i = s; i < t; i++) {
if (string(S.begin() + i, S.begin() + i + 2) == "##")
return true;
}
return false;
}
bool check3(int s, int t) {
for (int i = s; i < t - 1; i++) {
if (string(S.begin() + i, S.begin() + i + 3) == "...")
return false;
}
return true;
}
void solve() {
if (S[C] == '#' || S[D] == '#') {
cout << "No" << endl;
return;
}
if (C < B) {
if (check2(A, C) || check2(B, D))
cout << "No" << endl;
else
cout << "Yes" << endl;
return;
}
if (C < D) {
if (check2(A, D))
cout << "No" << endl;
else
cout << "Yes" << endl;
return;
}
// A<B<D<C
if (check2(A, C) || check3(B, D))
cout << "No" << endl;
else
cout << "Yes" << endl;
}
int main() {
while (1) {
input();
solve();
break;
}
}
| //#include <bits/stdc++.h>
//#include <stdio.h>
#include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <vector>
using namespace std;
using ll = long long;
using intpair = pair<int, int>;
using intpv = vector<intpair>;
using llpair = pair<ll, ll>;
using llpv = vector<llpair>;
using intvec = vector<int>;
using llvec = vector<ll>;
using intq = queue<int>;
using llq = queue<ll>;
using intmat = vector<intvec>;
using llmat = vector<llvec>;
using pairmat = vector<llpv>;
template <typename T> using matrix = vector<vector<T>>;
template <typename T> using pque = priority_queue<T>;
template <typename T> using lpque = priority_queue<T, vector<T>, greater<T>>;
#define PI 3.141592653589793
#define INTINF 1 << 30
#define LLINF 1LL << 60
#define MPRIME 1000000007
#define MPRIME9 998244353
#define len length()
#define pushb push_back
#define fi first
#define se second
#define setpr fixed << setprecision(15)
#define all(name) name.begin(), name.end()
#define rall(name) name.rbegin(), name.rend()
#define gsort(vbeg, vend) sort(vbeg, vend, greater<>())
#define matin(mat, H, W) \
for (int i__ = 0; i__ < H; i__++) \
for (int j__ = 0; j__ < W; j__++) \
cin >> mat[i__][j__]
#define out(n) cout << n << endl
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;
}
template <class T> inline void outmat(T &a, int y, int x) {
for (int i = 0; i < y; i++) {
for (int j = 0; j < x; j++)
cout << a[i][j] << " ";
cout << endl;
}
}
template <class T> inline void init(T &v) {
for (auto &a__ : v)
cin >> a__;
}
template <class T, class N> inline void init(T &v, N n) {
v.resize(n);
for (auto &a__ : v)
cin >> a__;
}
template <class N> void resiz(N n) {} // empty
template <class N, class T, class... U> void resiz(N n, T &&hd, U &&...tl) {
hd.resize(n);
resiz(n, forward<U>(tl)...);
}
ll GCD(ll a, ll b) { //最大公約数
if (a == 0 || b == 0)
return 0;
if (a < b)
swap(a, b);
ll tmp = a % b;
while (tmp != 0) {
a = b;
b = tmp;
tmp = a % b;
}
return b;
}
ll binpow(ll a, ll ex, ll p) { //繰り返し二乗法
ll result = 1;
while (ex > 0) {
if (ex & 1)
result = result * a % p;
ex >>= 1;
a = a * a % p;
}
return result;
}
ll Fact(ll x, ll p) { //階乗
ll f = 1;
for (ll i = 2; i <= x; i++) {
f *= i;
f %= p;
}
return f;
}
int DigitNum(ll n) { //桁数
int digit = 0;
ll div = 1LL;
while (n / div) {
digit++;
div *= 10;
}
return digit;
}
int N, A, B, C, D;
string S;
void input() {
cin >> N >> A >> B >> C >> D;
A--, B--, C--, D--;
cin >> S;
}
bool check2(int s, int t) {
for (int i = s; i < t; i++) {
if (string(S.begin() + i, S.begin() + i + 2) == "##")
return true;
}
return false;
}
bool check3(int s, int t) {
for (int i = s - 1; i < t; i++) {
if (string(S.begin() + i, S.begin() + i + 3) == "...")
return false;
}
return true;
}
void solve() {
if (S[C] == '#' || S[D] == '#') {
cout << "No" << endl;
return;
}
if (C < B) {
if (check2(A, C) || check2(B, D))
cout << "No" << endl;
else
cout << "Yes" << endl;
return;
}
if (C < D) {
if (check2(A, D))
cout << "No" << endl;
else
cout << "Yes" << endl;
return;
}
// A<B<D<C
if (check2(A, C) || check3(B, D))
cout << "No" << endl;
else
cout << "Yes" << endl;
}
int main() {
while (1) {
input();
solve();
break;
}
}
| [
"control_flow.loop.for.initializer.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 839,918 | 839,917 | u195036695 | cpp |
p03017 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <time.h>
#include <tuple>
#include <utility>
#include <vector>
#define ll long long
#define itn int
#define endl '\n'
#define co(ans) cout << ans << endl
#define COYE cout << "YES" << endl
#define COYe cout << "Yes" << endl
#define COye cout << "yes" << endl
#define CONO cout << "NO" << endl
#define CONo cout << "No" << endl
#define COno cout << "no" << endl
#define FORE(i, a) for (auto &i : a)
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define FFOR(i, a, b) for (int i = (a); i <= (b); ++i)
#define REP(i, n) FOR(i, 0, n)
#define RREP(i, n) FFOR(i, 1, n)
#define PB push_back
#define MP make_pair
#define ALL(V) (V).begin(), (V).end()
#define SORT(V) sort((V).begin(), (V).end())
#define REVERSE(V) reverse((V).begin(), (V).end())
#define EACH(V, i) \
for (typeof((V).begin()) i = (V).begin(); i != (V).end(); ++i)
#define equals(a, b) (fabs((a) - (b)) < EPS)
#define INF ((1LL << 62) - (1LL << 31))
#define EPS 1e-10
#define PI 3.141592653589793238
#define MOD 1000000007
#define MAX 5100000
using namespace std;
using Graph = vector<vector<int>>;
inline int toInt(string s) {
int v;
istringstream sin(s);
sin >> v;
return v;
}
template <class T> inline string toString(T x) {
ostringstream sout;
sout << x;
return sout.str();
}
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef long long LL;
const int dx[4] = {0, 1, 0, -1}, dy[4] = {1, 0, -1, 0};
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
int main() {
int N, A, B, C, D;
string S;
cin >> N >> A >> B >> C >> D >> S;
bool CAN = true;
for (int i = A; i < max(C, D); ++i) {
if (S[i] == '#' && S[i + 1] == '#')
CAN = false;
}
if (C > D) {
bool CAN2 = false;
for (int i = B; i <= D - 1; ++i) {
if (S[i - 1] == '.' && S[i] == '.' && S[i + 1] == '.')
CAN2 = true;
}
if (CAN2 == false)
CAN = false;
}
if (CAN)
COYe;
else
CONo;
return 0;
} | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <time.h>
#include <tuple>
#include <utility>
#include <vector>
#define ll long long
#define itn int
#define endl '\n'
#define co(ans) cout << ans << endl
#define COYE cout << "YES" << endl
#define COYe cout << "Yes" << endl
#define COye cout << "yes" << endl
#define CONO cout << "NO" << endl
#define CONo cout << "No" << endl
#define COno cout << "no" << endl
#define FORE(i, a) for (auto &i : a)
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define FFOR(i, a, b) for (int i = (a); i <= (b); ++i)
#define REP(i, n) FOR(i, 0, n)
#define RREP(i, n) FFOR(i, 1, n)
#define PB push_back
#define MP make_pair
#define ALL(V) (V).begin(), (V).end()
#define SORT(V) sort((V).begin(), (V).end())
#define REVERSE(V) reverse((V).begin(), (V).end())
#define EACH(V, i) \
for (typeof((V).begin()) i = (V).begin(); i != (V).end(); ++i)
#define equals(a, b) (fabs((a) - (b)) < EPS)
#define INF ((1LL << 62) - (1LL << 31))
#define EPS 1e-10
#define PI 3.141592653589793238
#define MOD 1000000007
#define MAX 5100000
using namespace std;
using Graph = vector<vector<int>>;
inline int toInt(string s) {
int v;
istringstream sin(s);
sin >> v;
return v;
}
template <class T> inline string toString(T x) {
ostringstream sout;
sout << x;
return sout.str();
}
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef long long LL;
const int dx[4] = {0, 1, 0, -1}, dy[4] = {1, 0, -1, 0};
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
int main() {
int N, A, B, C, D;
string S;
cin >> N >> A >> B >> C >> D >> S;
bool CAN = true;
for (int i = A; i < max(C, D); ++i) {
if (S[i] == '#' && S[i + 1] == '#')
CAN = false;
}
if (C > D) {
bool CAN2 = false;
for (int i = B - 1; i <= D - 1; ++i) {
if (S[i - 1] == '.' && S[i] == '.' && S[i + 1] == '.')
CAN2 = true;
}
if (CAN2 == false)
CAN = false;
}
if (CAN)
COYe;
else
CONo;
return 0;
} | [
"control_flow.loop.for.initializer.change"
] | 839,938 | 839,939 | u673211643 | cpp |
p03017 | #define _USE_MATH_DEFINES
#include <algorithm>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <stdio.h>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
int main() {
// 入力
ll N, A, B, C, D;
string S;
cin >> N >> A >> B >> C >> D >> S;
string out = "Yes";
rep(i, D - 2) {
if (i > A - 1 && S[i] == '#' && S[i + 1] == '#') {
out = "No";
break;
}
}
if (out == "Yes") {
if (C > D) {
out = "No";
for (ll i = B - 2; i < D; i++) {
if (S[i] == '.' && S[i + 1] == '.' && S[i + 2] == '.')
out = "Yes";
}
}
}
cout << out << endl;
return 0;
}
| #define _USE_MATH_DEFINES
#include <algorithm>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <stdio.h>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
int main() {
// 入力
ll N, A, B, C, D;
string S;
cin >> N >> A >> B >> C >> D >> S;
string out = "Yes";
rep(i, D - 2) {
if (i > A - 1 && S[i] == '#' && S[i + 1] == '#') {
out = "No";
break;
}
}
if (out == "Yes") {
if (C > D) {
out = "No";
for (ll i = B - 2; i < D - 1; i++) {
if (S[i] == '.' && S[i + 1] == '.' && S[i + 2] == '.')
out = "Yes";
}
}
}
cout << out << endl;
return 0;
}
| [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 839,950 | 839,951 | u742595961 | cpp |
p03017 | #define _USE_MATH_DEFINES
#include <algorithm>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <stdio.h>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
int main() {
// 入力
ll N, A, B, C, D;
string S;
cin >> N >> A >> B >> C >> D >> S;
string out = "Yes";
rep(i, D - 2) {
if (i > A - 1 && S[i] == '#' && S[i + 1] == '#') {
out = "No";
break;
}
}
if (out == "Yes") {
if (C > D) {
out = "No";
for (ll i = B - 1; i < C - 2; i++) {
if (S[i] == '.' && S[i + 1] == '.' && S[i + 2] == '.')
out = "Yes";
}
}
}
cout << out << endl;
return 0;
}
| #define _USE_MATH_DEFINES
#include <algorithm>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <stdio.h>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
int main() {
// 入力
ll N, A, B, C, D;
string S;
cin >> N >> A >> B >> C >> D >> S;
string out = "Yes";
rep(i, D - 2) {
if (i > A - 1 && S[i] == '#' && S[i + 1] == '#') {
out = "No";
break;
}
}
if (out == "Yes") {
if (C > D) {
out = "No";
for (ll i = B - 2; i < D - 1; i++) {
if (S[i] == '.' && S[i + 1] == '.' && S[i + 2] == '.')
out = "Yes";
}
}
}
cout << out << endl;
return 0;
}
| [
"literal.number.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"expression.operation.binary.change",
"identifier.change",
"control_flow.branch.if.condition.change"
] | 839,952 | 839,951 | u742595961 | cpp |
p03017 | #define _USE_MATH_DEFINES
#include <algorithm>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <stdio.h>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
int main() {
// 入力
ll N, A, B, C, D;
string S;
cin >> N >> A >> B >> C >> D >> S;
string out = "Yes";
rep(i, D - 2) {
if (i > A - 1 && S[i] == '#' && S[i + 1] == '#') {
out = "No";
break;
}
}
if (out == "Yes") {
if (C > D) {
out = "No";
for (ll i = B - 2; i < D - 2; i++) {
if (S[i] == '.' && S[i + 1] == '.' && S[i + 2] == '.')
out = "Yes";
}
}
}
cout << out << endl;
return 0;
}
| #define _USE_MATH_DEFINES
#include <algorithm>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <stdio.h>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
int main() {
// 入力
ll N, A, B, C, D;
string S;
cin >> N >> A >> B >> C >> D >> S;
string out = "Yes";
rep(i, D - 2) {
if (i > A - 1 && S[i] == '#' && S[i + 1] == '#') {
out = "No";
break;
}
}
if (out == "Yes") {
if (C > D) {
out = "No";
for (ll i = B - 2; i < D - 1; i++) {
if (S[i] == '.' && S[i + 1] == '.' && S[i + 2] == '.')
out = "Yes";
}
}
}
cout << out << endl;
return 0;
}
| [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 839,953 | 839,951 | u742595961 | cpp |
p03017 | #define _USE_MATH_DEFINES
#include <algorithm>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <stdio.h>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
int main() {
// 入力
ll N, A, B, C, D;
string S;
cin >> N >> A >> B >> C >> D >> S;
string out = "Yes";
rep(i, D - 2) {
if (i > A - 1 && S[i] == '#' && S[i + 1] == '#') {
out = "No";
break;
}
}
if (out == "Yes") {
if (C > D) {
out = "No";
for (ll i = B - 1; i < D - 2; i++) {
if (S[i] == '.' && S[i + 1] == '.' && S[i + 2] == '.')
out = "Yes";
}
}
}
cout << out << endl;
return 0;
} | #define _USE_MATH_DEFINES
#include <algorithm>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <stdio.h>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
int main() {
// 入力
ll N, A, B, C, D;
string S;
cin >> N >> A >> B >> C >> D >> S;
string out = "Yes";
rep(i, D - 2) {
if (i > A - 1 && S[i] == '#' && S[i + 1] == '#') {
out = "No";
break;
}
}
if (out == "Yes") {
if (C > D) {
out = "No";
for (ll i = B - 2; i < D - 1; i++) {
if (S[i] == '.' && S[i + 1] == '.' && S[i + 2] == '.')
out = "Yes";
}
}
}
cout << out << 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"
] | 839,954 | 839,951 | u742595961 | cpp |
p03017 | #define _USE_MATH_DEFINES
#include <algorithm>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <stdio.h>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
int main() {
// 入力
ll N, A, B, C, D;
string S;
cin >> N >> A >> B >> C >> D >> S;
string out = "Yes";
rep(i, D - 2) {
if (i > A - 1 && S[i] == '#' && S[i + 1] == '#') {
out = "No";
break;
}
}
if (out == "Yes") {
if (C > D) {
out = "No";
for (ll i = B; i < D - 2; i++) {
if (S[i] == '.' && S[i + 1] == '.' && S[i + 2] == '.')
out = "Yes";
}
}
}
cout << out << endl;
return 0;
}
| #define _USE_MATH_DEFINES
#include <algorithm>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <stdio.h>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
int main() {
// 入力
ll N, A, B, C, D;
string S;
cin >> N >> A >> B >> C >> D >> S;
string out = "Yes";
rep(i, D - 2) {
if (i > A - 1 && S[i] == '#' && S[i + 1] == '#') {
out = "No";
break;
}
}
if (out == "Yes") {
if (C > D) {
out = "No";
for (ll i = B - 2; i < D - 1; i++) {
if (S[i] == '.' && S[i + 1] == '.' && S[i + 2] == '.')
out = "Yes";
}
}
}
cout << out << endl;
return 0;
}
| [
"control_flow.loop.for.initializer.change",
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 839,955 | 839,951 | u742595961 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.