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 |
|---|---|---|---|---|---|---|---|
p02953 | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define INF 2e9
#define ALL(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
int main() {
ll N;
cin >> N;
vector<ll> H(N);
REP(i, N) cin >> H[i];
int flag = 0;
int a = 0;
int flag2 = 0;
REP(i, N - 1) {
if (flag == 0 && H.at(i) > H.at(i + 1)) {
a = H.at(i);
flag = 1;
} else if (flag == 1 && H.at(i) < H.at(i)) {
if (a - H.at(i) >= 2) {
flag2 = 1;
}
flag = 0;
}
if (flag == 1 && i == N - 2 && H.at(i) >= H.at(i + 1)) {
if (a - H.at(i + 1) >= 2) {
flag2 = 1;
}
flag = 0;
}
}
if (flag2 == 0) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
} | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define INF 2e9
#define ALL(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
int main() {
ll N;
cin >> N;
vector<ll> H(N);
REP(i, N) cin >> H[i];
int flag = 0;
int a = 0;
int flag2 = 0;
REP(i, N - 1) {
if (flag == 0 && H.at(i) > H.at(i + 1)) {
a = H.at(i);
flag = 1;
} else if (flag == 1 && H.at(i) < H.at(i + 1)) {
if (a - H.at(i) >= 2) {
flag2 = 1;
}
flag = 0;
}
if (flag == 1 && i == N - 2 && H.at(i) >= H.at(i + 1)) {
if (a - H.at(i + 1) >= 2) {
flag2 = 1;
}
flag = 0;
}
}
if (flag2 == 0) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
} | [
"control_flow.branch.if.condition.change"
] | 756,225 | 756,226 | u135626132 | cpp |
p02953 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
if (n == 1) {
cout << "Yes";
return 0;
}
vector<int> v(n);
for (int i = 0; i < n; i++) {
cin >> v[i];
}
for (int i = n - 1; i > 0; i--) {
if (v[i] < v[i - 1])
v[i]--;
}
for (int i = 0; i < n - 1; i++) {
if (v[i] > v[i + 1]) {
cout << "No";
return 0;
}
}
cout << "Yes";
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
if (n == 1) {
cout << "Yes";
return 0;
}
vector<int> v(n);
for (int i = 0; i < n; i++) {
cin >> v[i];
}
for (int i = n - 1; i > 0; i--) {
if (v[i] < v[i - 1])
v[i - 1]--;
}
for (int i = 0; i < n - 1; i++) {
if (v[i] > v[i + 1]) {
cout << "No";
return 0;
}
}
cout << "Yes";
}
| [
"expression.operation.binary.add"
] | 756,241 | 756,242 | u515923980 | cpp |
p02953 | //#define _GLIBCXX_DEBUG
#include <algorithm>
#include <bitset>
#include <ctime>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
typedef long long ll;
signed main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
ll n;
cin >> n;
vector<ll> a(n);
cin >> a[0];
bool fl = true;
ll mint = a[0] - 1;
for (int i = 1; i < n; ++i) {
cin >> a[i];
if (a[i] < mint) {
fl = false;
}
mint = max(mint, a[i - 1]);
}
if (fl) {
cout << "Yes";
} else {
cout << "No";
}
}
| //#define _GLIBCXX_DEBUG
#include <algorithm>
#include <bitset>
#include <ctime>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
typedef long long ll;
signed main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
ll n;
cin >> n;
vector<ll> a(n);
cin >> a[0];
bool fl = true;
ll mint = a[0] - 1;
for (int i = 1; i < n; ++i) {
cin >> a[i];
if (a[i] < mint) {
fl = false;
}
mint = max(mint, a[i] - 1);
}
if (fl) {
cout << "Yes";
} else {
cout << "No";
}
}
| [
"call.arguments.change"
] | 756,245 | 756,246 | u879223592 | cpp |
p02953 | //#define _GLIBCXX_DEBUG
#include <algorithm>
#include <bitset>
#include <ctime>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
typedef long long ll;
signed main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
ll n;
cin >> n;
vector<ll> a(n);
cin >> a[0];
bool fl = true;
ll mint = a[0];
for (int i = 1; i < n; ++i) {
cin >> a[i];
if (a[i] < mint) {
fl = false;
}
mint = min(mint, a[i - 1]);
}
if (fl) {
cout << "Yes";
} else {
cout << "No";
}
}
| //#define _GLIBCXX_DEBUG
#include <algorithm>
#include <bitset>
#include <ctime>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
typedef long long ll;
signed main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
ll n;
cin >> n;
vector<ll> a(n);
cin >> a[0];
bool fl = true;
ll mint = a[0] - 1;
for (int i = 1; i < n; ++i) {
cin >> a[i];
if (a[i] < mint) {
fl = false;
}
mint = max(mint, a[i] - 1);
}
if (fl) {
cout << "Yes";
} else {
cout << "No";
}
}
| [
"misc.opposites",
"assignment.value.change",
"identifier.change",
"call.function.change",
"call.arguments.change"
] | 756,247 | 756,246 | u879223592 | cpp |
p02953 | #include <algorithm>
#include <iostream>
#include <math.h>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
int main() {
int n;
cin >> n;
vector<ll> H(n);
rep(i, n) { cin >> H[i]; }
for (int i = n - 2; i > 0; i--) {
if (H[i - 1] > H[i]) {
H[i]--;
if (H[i - 1] > H[i]) {
cout << "No" << endl;
return 0;
}
}
}
cout << "Yes" << endl;
return 0;
}
| #include <algorithm>
#include <iostream>
#include <math.h>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
int main() {
int n;
cin >> n;
vector<ll> H(n);
rep(i, n) { cin >> H[i]; }
for (int i = n - 1; i >= 1; i--) {
if (H[i - 1] > H[i]) {
H[i - 1]--;
if (H[i - 1] > H[i]) {
cout << "No" << endl;
return 0;
}
}
}
cout << "Yes" << endl;
return 0;
}
| [
"literal.number.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"expression.operation.binary.change",
"control_flow.loop.for.condition.change"
] | 756,253 | 756,254 | u745267317 | cpp |
p02953 | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
int main(void) {
int n;
cin >> n;
vector<ll> h(n);
for (int i = 0; i < n; i++)
cin >> h.at(i);
ll low = h.at(0);
for (int i = 1; i < n; i++) {
low = max(low, h.at(i) - 1);
if (low - 1 > h.at(i)) {
cout << "No" << endl;
return 0;
}
}
cout << "Yes" << endl;
return 0;
} | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
int main(void) {
int n;
cin >> n;
vector<ll> h(n);
for (int i = 0; i < n; i++)
cin >> h.at(i);
ll low = h.at(0);
for (int i = 1; i < n; i++) {
low = max(low, h.at(i) - 1);
if (low > h.at(i)) {
cout << "No" << endl;
return 0;
}
}
cout << "Yes" << endl;
return 0;
} | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 756,257 | 756,258 | u062198110 | cpp |
p02953 | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
int main(void) {
int n;
cin >> n;
vector<ll> h(n);
for (int i = 0; i < n; i++)
cin >> h.at(i);
ll low = h.at(0);
for (int i = 1; i < n; i++) {
low = max(low, h.at(i) + 1);
if (low - 1 > h.at(i)) {
cout << "No" << endl;
return 0;
}
}
cout << "Yes" << endl;
return 0;
} | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
int main(void) {
int n;
cin >> n;
vector<ll> h(n);
for (int i = 0; i < n; i++)
cin >> h.at(i);
ll low = h.at(0);
for (int i = 1; i < n; i++) {
low = max(low, h.at(i) - 1);
if (low > h.at(i)) {
cout << "No" << endl;
return 0;
}
}
cout << "Yes" << endl;
return 0;
} | [
"misc.opposites",
"expression.operator.arithmetic.change",
"assignment.value.change",
"call.arguments.change",
"expression.operation.binary.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 756,259 | 756,258 | u062198110 | cpp |
p02953 | #include <algorithm>
#include <array>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#define REP(X, Y, Z) for (ll(X) = (Y); (X) < (Z); (X)++)
#define REV(X, Y, Z) for (ll(X) = (Y); (X) > (Z); (X)--)
using namespace std;
using ll = long long;
using dll = deque<ll>;
using pll = pair<ll, ll>;
using qll = queue<ll>;
using usll = unordered_set<ll>;
using umll = unordered_map<ll, ll>;
using sll = stack<int>;
using vll = vector<ll>;
using vvll = vector<vll>;
constexpr ll kMod = 1e9 + 7;
ll gcd(ll a, ll b) {
if (a < b) {
return gcd(b, a);
}
ll c = a % b;
while (c != 0) {
a = b;
b = c;
c = a % b;
}
return b;
}
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
void init() {
cin.tie(nullptr);
ios_base::sync_with_stdio(false);
cout << fixed << setprecision(15);
}
int main() {
init();
ll N;
cin >> N;
vll H(N);
REP(i, 0, N) {
ll h;
cin >> h;
H[i] = h;
}
REV(i, N - 1, -1) {
if (H[i] > H[i + 1]) {
H[i]--;
}
if (H[i] > H[i + 1]) {
cout << "No" << endl;
return 0;
}
}
cout << "Yes" << endl;
return 0;
}
| #include <algorithm>
#include <array>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#define REP(X, Y, Z) for (ll(X) = (Y); (X) < (Z); (X)++)
#define REV(X, Y, Z) for (ll(X) = (Y); (X) > (Z); (X)--)
using namespace std;
using ll = long long;
using dll = deque<ll>;
using pll = pair<ll, ll>;
using qll = queue<ll>;
using usll = unordered_set<ll>;
using umll = unordered_map<ll, ll>;
using sll = stack<int>;
using vll = vector<ll>;
using vvll = vector<vll>;
constexpr ll kMod = 1e9 + 7;
ll gcd(ll a, ll b) {
if (a < b) {
return gcd(b, a);
}
ll c = a % b;
while (c != 0) {
a = b;
b = c;
c = a % b;
}
return b;
}
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
void init() {
cin.tie(nullptr);
ios_base::sync_with_stdio(false);
cout << fixed << setprecision(15);
}
int main() {
init();
ll N;
cin >> N;
vll H(N);
REP(i, 0, N) {
ll h;
cin >> h;
H[i] = h;
}
REV(i, N - 2, -1) {
if (H[i] > H[i + 1]) {
H[i]--;
}
if (H[i] > H[i + 1]) {
cout << "No" << endl;
return 0;
}
}
cout << "Yes" << endl;
return 0;
}
| [
"literal.number.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 756,271 | 756,272 | u840713046 | cpp |
p02953 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
int main() {
int n;
cin >> n;
vector<int> h(n);
rep(i, n) cin >> h[i];
///////////////////////
bool ans = true;
int M;
rep(i, n) {
M = max(h[i], M);
if (M - h[i] >= 2) {
// cout<<i<<endl;
ans = false;
break;
}
}
if (ans)
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;
int main() {
int n;
cin >> n;
vector<int> h(n);
rep(i, n) cin >> h[i];
///////////////////////
bool ans = true;
int M = 0;
rep(i, n) {
M = max(h[i], M);
if (M - h[i] >= 2) {
// cout<<i<<endl;
ans = false;
break;
}
}
if (ans)
cout << "Yes" << endl;
else
cout << "No" << endl;
}
| [
"variable_declaration.value.change"
] | 756,273 | 756,274 | u531461815 | cpp |
p02953 | #include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
void solve(void) {
ll N;
cin >> N;
vector<ll> H(N);
for (ll ni = 0; ni < N; ++ni)
cin >> H[ni];
for (ll ni = N - 2; ni - 1 >= 0; --ni) {
if (H[ni - 1] > H[ni])
H[ni]--;
if (H[ni - 1] > H[ni]) {
cout << "No" << endl;
return;
}
}
cout << "Yes" << endl;
}
int main(void) {
solve();
return 0;
} | #include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
void solve(void) {
ll N;
cin >> N;
vector<ll> H(N);
for (ll ni = 0; ni < N; ++ni)
cin >> H[ni];
for (ll ni = N - 1; ni - 1 >= 0; --ni) {
if (H[ni - 1] > H[ni])
H[ni - 1]--;
if (H[ni - 1] > H[ni]) {
cout << "No" << endl;
return;
}
}
cout << "Yes" << endl;
}
int main(void) {
solve();
return 0;
} | [
"literal.number.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 756,277 | 756,278 | u108377418 | cpp |
p02953 | #include <algorithm>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string.h>
#include <string>
#include <tuple>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
#define _GLIBCXX_DEBUG
using ll = long long;
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;
}
int main() {
int n;
cin >> n;
vector<int> h(n);
rep(i, n) { cin >> h[i]; }
rep(i, n) {
if (i == 0 || h[i - 1] < h[i])
h[i]--;
}
rep(i, n - 1) {
if (h[i] > h[i + 1])
cout << "No" << endl;
return 0;
}
cout << "Yes" << endl;
} | #include <algorithm>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string.h>
#include <string>
#include <tuple>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
#define _GLIBCXX_DEBUG
using ll = long long;
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;
}
int main() {
int n;
cin >> n;
vector<int> h(n);
rep(i, n) { cin >> h[i]; }
rep(i, n) {
if (i == 0 || h[i - 1] < h[i])
h[i]--;
}
rep(i, n - 1) {
if (h[i] > h[i + 1]) {
cout << "No" << endl;
return 0;
}
}
cout << "Yes" << endl;
} | [] | 756,283 | 756,284 | u489823438 | cpp |
p02953 | #include <algorithm>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string.h>
#include <string>
#include <tuple>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
#define _GLIBCXX_DEBUG
using ll = long long;
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;
}
int main() {
int n;
cin >> n;
vector<int> h(n);
rep(i, n) { cin >> h[i]; }
rep(i, n) {
if (i == 0 || h[i - 1] < h[i])
h[i]--;
}
rep(i, n - 2) {
if (h[i] > h[i + 1])
cout << "No" << endl;
return 0;
}
cout << "Yes" << endl;
} | #include <algorithm>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string.h>
#include <string>
#include <tuple>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
#define _GLIBCXX_DEBUG
using ll = long long;
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;
}
int main() {
int n;
cin >> n;
vector<int> h(n);
rep(i, n) { cin >> h[i]; }
rep(i, n) {
if (i == 0 || h[i - 1] < h[i])
h[i]--;
}
rep(i, n - 1) {
if (h[i] > h[i + 1]) {
cout << "No" << endl;
return 0;
}
}
cout << "Yes" << endl;
} | [
"literal.number.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 756,285 | 756,284 | u489823438 | cpp |
p02953 | #include <algorithm>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string.h>
#include <string>
#include <tuple>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
#define _GLIBCXX_DEBUG
using ll = long long;
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;
}
int main() {
int n;
cin >> n;
vector<int> h(n);
rep(i, n) { cin >> h[i]; }
rep(i, n) {
if (i == 0 || h[i - 1] < h[i])
h[i]--;
}
rep(i, n) {
if (h[i] > h[i + 1])
cout << "No" << endl;
return 0;
}
cout << "Yes" << endl;
} | #include <algorithm>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string.h>
#include <string>
#include <tuple>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
#define _GLIBCXX_DEBUG
using ll = long long;
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;
}
int main() {
int n;
cin >> n;
vector<int> h(n);
rep(i, n) { cin >> h[i]; }
rep(i, n) {
if (i == 0 || h[i - 1] < h[i])
h[i]--;
}
rep(i, n - 1) {
if (h[i] > h[i + 1]) {
cout << "No" << endl;
return 0;
}
}
cout << "Yes" << endl;
} | [
"expression.operation.binary.add"
] | 756,286 | 756,284 | u489823438 | cpp |
p02953 | #include <algorithm>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string.h>
#include <string>
#include <tuple>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
#define _GLIBCXX_DEBUG
using ll = long long;
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;
}
int main() {
int n;
cin >> n;
vector<int> h(n);
rep(i, n) { cin >> h[i]; }
rep(i, n) {
if (i == 0 || h[i - 1] > h[i])
h[i]--;
}
rep(i, n) {
if (h[i] > h[i + 1])
cout << "No" << endl;
return 0;
}
cout << "Yes" << endl;
} | #include <algorithm>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string.h>
#include <string>
#include <tuple>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
#define _GLIBCXX_DEBUG
using ll = long long;
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;
}
int main() {
int n;
cin >> n;
vector<int> h(n);
rep(i, n) { cin >> h[i]; }
rep(i, n) {
if (i == 0 || h[i - 1] < h[i])
h[i]--;
}
rep(i, n - 1) {
if (h[i] > h[i + 1]) {
cout << "No" << endl;
return 0;
}
}
cout << "Yes" << endl;
} | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 756,287 | 756,284 | u489823438 | cpp |
p02953 | // abc136_c.cc
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
int n;
cin >> n;
vector<int> h(n);
for (auto &x : h)
cin >> x;
for (int i = n - 1; i >= 0; i--) {
if (h[i] > h[i + 1])
h[i]--;
}
bool ok = true;
for (int i = 0; i < n - 1; i++) {
if (h[i] > h[i + 1]) {
ok = false;
break;
}
}
if (ok)
cout << "Yes\n";
else
cout << "No\n";
} | // abc136_c.cc
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
int n;
cin >> n;
vector<int> h(n);
for (auto &x : h)
cin >> x;
for (int i = n - 2; i >= 0; i--) {
if (h[i] > h[i + 1])
h[i]--;
}
bool ok = true;
for (int i = 0; i < n - 1; i++) {
if (h[i] > h[i + 1]) {
ok = false;
break;
}
}
if (ok)
cout << "Yes\n";
else
cout << "No\n";
} | [
"literal.number.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 756,288 | 756,289 | u349225213 | cpp |
p02953 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> h(n);
for (int i = 0; i < n; ++i)
cin >> h[i];
int pre = -999;
for (int i = 0; i < n; ++i) {
if (pre <= h[i] - 1) {
pre = h[i] - 1;
} else if (pre <= h[i]) {
pre = h[i];
} else
puts("No");
return 0;
}
puts("Yes");
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> h(n);
for (int i = 0; i < n; ++i)
cin >> h[i];
int pre = -999;
for (int i = 0; i < n; ++i) {
if (pre <= h[i] - 1) {
pre = h[i] - 1;
} else if (pre <= h[i]) {
pre = h[i];
} else {
puts("No");
return 0;
}
}
puts("Yes");
return 0;
}
| [] | 756,298 | 756,299 | u348398921 | cpp |
p02953 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> pi;
typedef pair<int, int> vi;
#define F first
#define S second
#define PB push_back
#define MK make_pair
#define REP(i, a, b) for (int i = a; i < b; i++)
bool sort_by(vi c, vi d) { return c.S < d.S; }
int main() {
int N;
cin >> N;
int tmp = 0, num = 0;
string ans = "Yes";
REP(i, 0, N) {
cin >> num;
if (num > tmp)
tmp = num - 1;
else if (tmp < num) {
ans = "No";
break;
}
}
cout << ans;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> pi;
typedef pair<int, int> vi;
#define F first
#define S second
#define PB push_back
#define MK make_pair
#define REP(i, a, b) for (int i = a; i < b; i++)
bool sort_by(vi c, vi d) { return c.S < d.S; }
int main() {
int N;
cin >> N;
int tmp = 0, num = 0;
string ans = "Yes";
REP(i, 0, N) {
cin >> num;
if (num > tmp)
tmp = num - 1;
else if (tmp > num) {
ans = "No";
break;
}
}
cout << ans;
}
| [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 756,300 | 756,301 | u712837698 | cpp |
p02953 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> pi;
typedef pair<int, int> vi;
#define F first
#define S second
#define PB push_back
#define MK make_pair
#define REP(i, a, b) for (int i = a; i < b; i++)
bool sort_by(vi c, vi d) { return c.S < d.S; }
int main() {
int N;
cin >> N;
int tmp = 0, num = 0;
string ans = "Yes";
REP(i, 0, N) {
cin >> num;
if (num > tmp)
tmp = num - 1;
else {
ans = "No";
break;
}
}
cout << ans;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> pi;
typedef pair<int, int> vi;
#define F first
#define S second
#define PB push_back
#define MK make_pair
#define REP(i, a, b) for (int i = a; i < b; i++)
bool sort_by(vi c, vi d) { return c.S < d.S; }
int main() {
int N;
cin >> N;
int tmp = 0, num = 0;
string ans = "Yes";
REP(i, 0, N) {
cin >> num;
if (num > tmp)
tmp = num - 1;
else if (tmp > num) {
ans = "No";
break;
}
}
cout << ans;
}
| [
"control_flow.branch.if.add"
] | 756,302 | 756,301 | u712837698 | cpp |
p02953 | #include <bits/stdc++.h>
#define REP(i, n) for (int(i) = 0; (i) < (n); ++(i))
#define REPV(iter, v) \
for (auto(iter) = (v).begin(); (iter) != (v).end(); ++(iter))
#define ALL(v) (v).begin(), (v).end()
#define MOD 1000000007
using namespace std;
typedef long long ll;
int main() {
ll N;
cin >> N;
vector<ll> H(N);
REP(i, N) cin >> H[i];
bool flag = true;
for (int i = N - 1; i >= 1; --i) {
if (H[i] < H[i - 1]) {
if (H[i - 1] - H[i] == 1) {
H[i - 1]--;
continue;
} else {
flag = false;
break;
}
}
}
string ans = flag ? "Yes" : "N0";
cout << ans << endl;
}
| #include <bits/stdc++.h>
#define REP(i, n) for (int(i) = 0; (i) < (n); ++(i))
#define REPV(iter, v) \
for (auto(iter) = (v).begin(); (iter) != (v).end(); ++(iter))
#define ALL(v) (v).begin(), (v).end()
#define MOD 1000000007
using namespace std;
typedef long long ll;
int main() {
ll N;
cin >> N;
vector<ll> H(N);
REP(i, N) cin >> H[i];
bool flag = true;
for (int i = N - 1; i >= 1; --i) {
if (H[i] < H[i - 1]) {
if (H[i - 1] - H[i] == 1) {
H[i - 1]--;
} else {
flag = false;
break;
}
}
}
string ans = flag ? "Yes" : "No";
cout << ans << endl;
}
| [
"literal.string.change"
] | 756,318 | 756,319 | u188706971 | cpp |
p02953 | #include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < (n); i++)
using namespace std;
using ll = long long;
int main() {
ll n;
cin >> n;
vector<ll> h(n);
rep(i, n) { cin >> h[i]; }
bool ans = 1;
for (ll i = n - 1; i > 0; i++) {
if (h[i] == h[i - 1] - 1)
h[i - 1]--;
else if (h[i] < h[i - 1] - 1) {
ans = 0;
break;
}
}
if (ans)
cout << "Yes" << endl;
else
cout << "No" << endl;
}
| #include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < (n); i++)
using namespace std;
using ll = long long;
int main() {
ll n;
cin >> n;
vector<ll> h(n);
rep(i, n) { cin >> h[i]; }
bool ans = 1;
for (ll i = n - 1; i > 0; i--) {
if (h[i] == h[i - 1] - 1)
h[i - 1]--;
else if (h[i] < h[i - 1] - 1) {
ans = 0;
break;
}
}
if (ans)
cout << "Yes" << endl;
else
cout << "No" << endl;
} | [] | 756,324 | 756,325 | u816145694 | cpp |
p02953 | #include <algorithm>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#define ll long long
using namespace std;
long long MOD = 1000000007;
int main() {
int N;
cin >> N;
int tmp = 0;
for (int i = 0; i < N; i++) {
int h;
cin >> h;
if (tmp <= h) {
tmp = h;
} else if (tmp == h - 1) {
continue;
} else {
cout << "No" << endl;
return 0;
}
}
cout << "Yes" << endl;
} | #include <algorithm>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#define ll long long
using namespace std;
long long MOD = 1000000007;
int main() {
int N;
cin >> N;
int tmp = 0;
for (int i = 0; i < N; i++) {
int h;
cin >> h;
// cout << tmp << ' ' << h << endl;
if (tmp <= h) {
tmp = h;
} else if (tmp == h + 1) {
continue;
} else {
cout << "No" << endl;
return 0;
}
}
cout << "Yes" << endl;
} | [
"misc.opposites",
"expression.operator.arithmetic.change",
"control_flow.branch.if.condition.change"
] | 756,336 | 756,337 | u658993896 | cpp |
p02953 | #include <algorithm>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#define ll long long
using namespace std;
long long MOD = 1000000007;
int main() {
int N;
cin >> N;
int tmp = MOD;
for (int i = 0; i < N; i++) {
int h;
cin >> h;
if (tmp <= h) {
tmp = h;
} else if (tmp == h - 1) {
continue;
} else {
cout << "No" << endl;
return 0;
}
}
cout << "Yes" << endl;
} | #include <algorithm>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#define ll long long
using namespace std;
long long MOD = 1000000007;
int main() {
int N;
cin >> N;
int tmp = 0;
for (int i = 0; i < N; i++) {
int h;
cin >> h;
// cout << tmp << ' ' << h << endl;
if (tmp <= h) {
tmp = h;
} else if (tmp == h + 1) {
continue;
} else {
cout << "No" << endl;
return 0;
}
}
cout << "Yes" << endl;
} | [
"variable_declaration.value.change",
"identifier.replace.remove",
"literal.replace.add",
"misc.opposites",
"expression.operator.arithmetic.change",
"control_flow.branch.if.condition.change"
] | 756,338 | 756,337 | u658993896 | cpp |
p02953 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, a[100005];
string ans;
cin >> n;
bool flag = true;
for (int i = 0; i < n; i++) {
cin >> a[i];
}
for (int i = n - 1; i > 0; i--) {
if (a[i - 1] >= a[i] + 2) {
flag = false;
break;
} else if (a[i - 1] = a[i] + 1) {
a[i - 1]--;
}
}
if (flag)
cout << "Yes";
else
cout << "No";
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n, a[100005];
string ans;
cin >> n;
bool flag = true;
for (int i = 0; i < n; i++) {
cin >> a[i];
}
for (int i = n - 1; i > 0; i--) {
if (a[i - 1] >= a[i] + 2) {
flag = false;
break;
} else if (a[i - 1] == a[i] + 1) {
a[i - 1]--;
}
}
if (flag)
cout << "Yes";
else
cout << "No";
}
| [
"expression.operation.compare.replace.add",
"assignment.replace.remove",
"misc.typo"
] | 756,351 | 756,352 | u732421371 | cpp |
p02953 | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <stdio.h>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
#define all(x) (x).begin(), (x).end()
#define sz(x) (int)(x).size()
#define Cout(s) cout << s << endl
using namespace std;
typedef long long ll;
string Yes(bool b) {
if (b) {
return "Yes";
} else {
return "No";
}
}
string YES(bool b) {
if (b) {
return "YES";
} else {
return "NO";
}
}
//================================================
int gcd(int a, int b) { return b ? gcd(b, a % b) : a; }
int lcm(int a, int b) { return a / gcd(a, b) * b; }
int a = 0, b = 0, c, d, n, k = 0, ans = 0;
string s, t;
int main() {
cin >> n;
vector<ll> x(n);
rep(i, n) cin >> x[i];
ll high = 0;
bool z = true;
rep(i, n - 1) {
high = max(high, x[i]);
if (high - x[i] > 1)
z = false;
}
Cout(Yes(z));
return 0;
}
| #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <stdio.h>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
#define all(x) (x).begin(), (x).end()
#define sz(x) (int)(x).size()
#define Cout(s) cout << s << endl
using namespace std;
typedef long long ll;
string Yes(bool b) {
if (b) {
return "Yes";
} else {
return "No";
}
}
string YES(bool b) {
if (b) {
return "YES";
} else {
return "NO";
}
}
//================================================
int gcd(int a, int b) { return b ? gcd(b, a % b) : a; }
int lcm(int a, int b) { return a / gcd(a, b) * b; }
int a = 0, b = 0, c, d, n, k = 0, ans = 0;
string s, t;
int main() {
cin >> n;
vector<ll> x(n);
rep(i, n) cin >> x[i];
ll high = 0;
bool z = true;
rep(i, n) {
high = max(high, x[i]);
if (high - x[i] > 1)
z = false;
}
Cout(Yes(z));
return 0;
}
| [
"expression.operation.binary.remove"
] | 756,357 | 756,358 | u465760322 | cpp |
p02953 |
#include <bits/stdc++.h>
#include <math.h>
#define REP(i, n) for (int i = 0; i < (n); i++)
#define ALL(v) (v).begin(), (v).end()
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
const int INF = 1001001001;
const int mINF = -1001001001;
// << fixed << setprecision(0) <<
// sort(ALL(),greater<int>());
int main() {
ll n;
cin >> n;
string ans = "Yes";
ll h[n];
REP(i, n) cin >> h[i];
for (int i = n - 1; i > 0; i--) {
if (h[i - 1] - h[i] > 0)
h[i - 1]--;
if (h[i - 1] - h[i] > 1)
ans = "No";
}
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
#include <math.h>
#define REP(i, n) for (int i = 0; i < (n); i++)
#define ALL(v) (v).begin(), (v).end()
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
const int INF = 1001001001;
const int mINF = -1001001001;
// << fixed << setprecision(0) <<
// sort(ALL(),greater<int>());
int main() {
ll n;
cin >> n;
string ans = "Yes";
ll h[n];
REP(i, n) cin >> h[i];
for (int i = n - 1; i > 0; i--) {
if (h[i - 1] - h[i] > 0)
h[i - 1]--;
if (h[i - 1] - h[i] > 0)
ans = "No";
}
cout << ans << endl;
return 0;
}
| [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 756,363 | 756,364 | u281876921 | cpp |
p02953 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<long long> data(n);
for (int i = 0; i < n; i++) {
cin >> data.at(i);
if (i > 0) {
if (i == 1 && data.at(i) < data.at(i - 1)) {
data.at(i - 1)--;
}
if (data.at(i) >= data.at(i - 1)) {
if (data.at(i) - data.at(i - 1) == 1) {
data.at(i)--;
}
} else {
cout << "No" << endl;
return 0;
}
}
}
cout << "Yes" << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<long long> data(n);
for (int i = 0; i < n; i++) {
cin >> data.at(i);
if (i > 0) {
if (i == 1 && data.at(i) < data.at(i - 1)) {
data.at(i - 1)--;
}
if (data.at(i) >= data.at(i - 1)) {
if (data.at(i) - data.at(i - 1) >= 1) {
data.at(i)--;
}
} else {
cout << "No" << endl;
return 0;
}
}
}
cout << "Yes" << endl;
return 0;
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 756,367 | 756,368 | u634967948 | cpp |
p02953 | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = (int)(0); i < (int)(n); ++i)
#define REPS(i, n) for (int i = (int)(1); i <= (int)(n); ++i)
#define RREP(i, n) for (int i = ((int)(n)-1); i >= 0; i--)
#define RREPS(i, n) for (int i = ((int)(n)); i > 0; i--)
#define IREP(i, m, n) for (int i = (int)(m); i < (int)(n); ++i)
#define IREPS(i, m, n) for (int i = (int)(m); i <= (int)(n); ++i)
#define FOR(e, c) for (auto &e : c)
#define SORT(v, n) sort(v, v + n);
#define VSORT(v) sort(v.begin(), v.end());
#define RVISORT(v) sort(v.begin(), v.end(), greater<int>());
#define ALL(v) v.begin(), v.end()
#define MP(n, m) make_pair(n, m);
#define COUT(d) cout << std::setprecision(10) << d << endl;
#define CIN(n) getline(cin, n);
using VI = vector<int>;
using VVI = vector<VI>;
using PII = pair<int, int>;
using ll = long long;
using ul = unsigned long;
typedef long long ll;
template <class T, class C> void chmax(T &a, C b) { a > b ?: a = b; }
template <class T, class C> void chmin(T &a, C b) { a < b ?: a = b; }
const int mod = 1e9 + 7;
void printv(VI &v) {
REP(i, v.size()) cout << v[i] << " ";
cout << endl;
}
void printv(vector<ll> &v) {
REP(i, v.size()) cout << v[i] << " ";
cout << endl;
}
int vtotal(VI &v) {
int total = 0;
REP(i, v.size()) total += v[i];
return total;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
// init(); // mint初期化
int n;
cin >> n;
vector<ll> h;
REP(i, n) {
ll a;
cin >> a;
h.push_back(a);
}
// cout<<LONG_MAX<<endl;
string ans = "Yes";
REP(i, n) {
int index = n - i - 1;
if (index == 0)
break;
int now = h[i];
int before = h[i - 1];
if (before <= now) {
} else {
before--;
if (before > now) {
ans = "No";
break;
}
h[i - 1] = before;
}
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = (int)(0); i < (int)(n); ++i)
#define REPS(i, n) for (int i = (int)(1); i <= (int)(n); ++i)
#define RREP(i, n) for (int i = ((int)(n)-1); i >= 0; i--)
#define RREPS(i, n) for (int i = ((int)(n)); i > 0; i--)
#define IREP(i, m, n) for (int i = (int)(m); i < (int)(n); ++i)
#define IREPS(i, m, n) for (int i = (int)(m); i <= (int)(n); ++i)
#define FOR(e, c) for (auto &e : c)
#define SORT(v, n) sort(v, v + n);
#define VSORT(v) sort(v.begin(), v.end());
#define RVISORT(v) sort(v.begin(), v.end(), greater<int>());
#define ALL(v) v.begin(), v.end()
#define MP(n, m) make_pair(n, m);
#define COUT(d) cout << std::setprecision(10) << d << endl;
#define CIN(n) getline(cin, n);
using VI = vector<int>;
using VVI = vector<VI>;
using PII = pair<int, int>;
using ll = long long;
using ul = unsigned long;
typedef long long ll;
template <class T, class C> void chmax(T &a, C b) { a > b ?: a = b; }
template <class T, class C> void chmin(T &a, C b) { a < b ?: a = b; }
const int mod = 1e9 + 7;
void printv(VI &v) {
REP(i, v.size()) cout << v[i] << " ";
cout << endl;
}
void printv(vector<ll> &v) {
REP(i, v.size()) cout << v[i] << " ";
cout << endl;
}
int vtotal(VI &v) {
int total = 0;
REP(i, v.size()) total += v[i];
return total;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
// init(); // mint初期化
int n;
cin >> n;
vector<ll> h;
REP(i, n) {
ll a;
cin >> a;
h.push_back(a);
}
// cout<<LONG_MAX<<endl;
string ans = "Yes";
REP(i, n) {
int index = n - i - 1;
if (index == 0)
break;
int now = h[index];
int before = h[index - 1];
if (before <= now) {
} else {
before--;
if (before > now) {
ans = "No";
break;
}
h[index - 1] = before;
}
}
cout << ans << endl;
return 0;
} | [
"identifier.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change",
"assignment.variable.change"
] | 756,369 | 756,370 | u530107518 | cpp |
p02953 | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = (int)(0); i < (int)(n); ++i)
#define REPS(i, n) for (int i = (int)(1); i <= (int)(n); ++i)
#define RREP(i, n) for (int i = ((int)(n)-1); i >= 0; i--)
#define RREPS(i, n) for (int i = ((int)(n)); i > 0; i--)
#define IREP(i, m, n) for (int i = (int)(m); i < (int)(n); ++i)
#define IREPS(i, m, n) for (int i = (int)(m); i <= (int)(n); ++i)
#define FOR(e, c) for (auto &e : c)
#define SORT(v, n) sort(v, v + n);
#define VSORT(v) sort(v.begin(), v.end());
#define RVISORT(v) sort(v.begin(), v.end(), greater<int>());
#define ALL(v) v.begin(), v.end()
#define MP(n, m) make_pair(n, m);
#define COUT(d) cout << std::setprecision(10) << d << endl;
#define CIN(n) getline(cin, n);
using VI = vector<int>;
using VVI = vector<VI>;
using PII = pair<int, int>;
using ll = long long;
using ul = unsigned long;
typedef long long ll;
template <class T, class C> void chmax(T &a, C b) { a > b ?: a = b; }
template <class T, class C> void chmin(T &a, C b) { a < b ?: a = b; }
const int mod = 1e9 + 7;
void printv(VI &v) {
REP(i, v.size()) cout << v[i] << " ";
cout << endl;
}
void printv(vector<ll> &v) {
REP(i, v.size()) cout << v[i] << " ";
cout << endl;
}
int vtotal(VI &v) {
int total = 0;
REP(i, v.size()) total += v[i];
return total;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
// init(); // mint初期化
int n;
cin >> n;
vector<ll> h;
REP(i, n) {
ll a;
cin >> a;
h.push_back(a);
}
// cout<<LONG_MAX<<endl;
string ans = "Yes";
REP(i, n) {
int index = n - i;
if (index == 0)
break;
int now = h[i];
int before = h[i - 1];
if (before <= now) {
} else {
before--;
if (before > now) {
ans = "No";
break;
}
h[i - 1] = before;
}
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = (int)(0); i < (int)(n); ++i)
#define REPS(i, n) for (int i = (int)(1); i <= (int)(n); ++i)
#define RREP(i, n) for (int i = ((int)(n)-1); i >= 0; i--)
#define RREPS(i, n) for (int i = ((int)(n)); i > 0; i--)
#define IREP(i, m, n) for (int i = (int)(m); i < (int)(n); ++i)
#define IREPS(i, m, n) for (int i = (int)(m); i <= (int)(n); ++i)
#define FOR(e, c) for (auto &e : c)
#define SORT(v, n) sort(v, v + n);
#define VSORT(v) sort(v.begin(), v.end());
#define RVISORT(v) sort(v.begin(), v.end(), greater<int>());
#define ALL(v) v.begin(), v.end()
#define MP(n, m) make_pair(n, m);
#define COUT(d) cout << std::setprecision(10) << d << endl;
#define CIN(n) getline(cin, n);
using VI = vector<int>;
using VVI = vector<VI>;
using PII = pair<int, int>;
using ll = long long;
using ul = unsigned long;
typedef long long ll;
template <class T, class C> void chmax(T &a, C b) { a > b ?: a = b; }
template <class T, class C> void chmin(T &a, C b) { a < b ?: a = b; }
const int mod = 1e9 + 7;
void printv(VI &v) {
REP(i, v.size()) cout << v[i] << " ";
cout << endl;
}
void printv(vector<ll> &v) {
REP(i, v.size()) cout << v[i] << " ";
cout << endl;
}
int vtotal(VI &v) {
int total = 0;
REP(i, v.size()) total += v[i];
return total;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
// init(); // mint初期化
int n;
cin >> n;
vector<ll> h;
REP(i, n) {
ll a;
cin >> a;
h.push_back(a);
}
// cout<<LONG_MAX<<endl;
string ans = "Yes";
REP(i, n) {
int index = n - i - 1;
if (index == 0)
break;
int now = h[index];
int before = h[index - 1];
if (before <= now) {
} else {
before--;
if (before > now) {
ans = "No";
break;
}
h[index - 1] = before;
}
}
cout << ans << endl;
return 0;
} | [
"identifier.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change",
"assignment.variable.change"
] | 756,371 | 756,370 | u530107518 | cpp |
p02953 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> H(N);
for (int i = 0; i < N; i++)
cin >> H.at(i);
int maxv = -1;
for (int i = 0; i < N - 1; i++) {
if (H.at(i) < H.at(i + 1))
H.at(i + 1)--;
if (H.at(i) - H.at(i + 1) >= 2)
cout << "No" << endl;
}
cout << "Yes" << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> H(N);
for (int i = 0; i < N; i++)
cin >> H.at(i);
int maxv = -1;
for (int i = 0; i < N - 1; i++) {
if (H.at(i) < H.at(i + 1))
H.at(i + 1)--;
if (H.at(i) - H.at(i + 1) >= 1) {
cout << "No" << endl;
return 0;
}
}
cout << "Yes" << endl;
} | [
"literal.number.change",
"control_flow.branch.if.condition.change",
"control_flow.return.add",
"control_flow.return.0.add"
] | 756,382 | 756,383 | u533566373 | cpp |
p02953 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> data(n);
for (int i = 0; i < n; i++) {
cin >> data.at(i);
}
bool ret = false;
int max = 0;
for (int i = 0; i < n; i++) {
if (max - 1 > data.at(i + 1)) {
ret = true;
}
if (max < data.at(i)) {
max = data.at(i);
}
}
cout << (ret ? "No" : "Yes") << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> data(n);
for (int i = 0; i < n; i++) {
cin >> data.at(i);
}
bool ret = false;
int max = 0;
for (int i = 0; i < n; i++) {
if (max - 1 > data.at(i)) {
ret = true;
}
if (max < data.at(i)) {
max = data.at(i);
}
}
cout << (ret ? "No" : "Yes") << endl;
} | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 756,386 | 756,387 | u164352406 | cpp |
p02953 | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
int main() {
int N, H1;
cin >> N;
vector<int> H(N);
cin >> H1;
H[0] = H1 - 1;
bool flag = true;
for (int i = 1; i < N; i++) {
int Hi;
cin >> Hi;
if (Hi > H[i - 1]) {
H[i] = Hi - 1;
} else if (Hi == H[i - 1]) {
H[i] = Hi;
} else {
flag = false;
break;
}
}
if (flag) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
} | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
int main() {
int N, H1;
cin >> N;
vector<int> H(N);
cin >> H1;
H[0] = H1 - 1;
bool flag = true;
for (int i = 1; i < N; i++) {
int Hi;
cin >> Hi;
if (Hi > H[i - 1]) {
H[i] = Hi - 1;
} else if (Hi == H[i - 1]) {
H[i] = Hi;
} else {
flag = false;
break;
}
}
if (flag) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 756,390 | 756,391 | u346629192 | cpp |
p02953 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int a[n];
for (int i = 0; i < n; i++) {
cin >> a[i];
}
bool ans = true;
for (int i = 0; i < n - 1; i++) {
if (a[i] < a[i + 1]) {
a[i + 1]--;
}
}
for (int i = 0; i < n - 1; i++) {
if (a[i] > a[i + 1]) {
ans = false;
}
}
if (ans) {
cout << "YES";
} else {
cout << "NO";
}
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int a[n];
for (int i = 0; i < n; i++) {
cin >> a[i];
}
bool ans = true;
for (int i = 0; i < n - 1; i++) {
if (a[i] < a[i + 1]) {
a[i + 1]--;
}
}
for (int i = 0; i < n - 1; i++) {
if (a[i] > a[i + 1]) {
ans = false;
}
}
if (ans) {
cout << "Yes";
} else {
cout << "No";
}
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 756,394 | 756,395 | u214137532 | cpp |
p02953 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int a[n];
for (int i = 0; i < n; i++) {
cin >> a[i];
}
bool ans = true;
for (int i = 0; i < n - 1; i++) {
if (a[i] < a[i + 1]) {
a[i + 1]--;
}
}
for (int i = 0; i < n - 1; i++) {
if (a[i] > a[i + 1]) {
ans = false;
}
}
if (ans) {
cout << "YES";
} else {
cout << "NO";
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int a[n];
for (int i = 0; i < n; i++) {
cin >> a[i];
}
bool ans = true;
for (int i = 0; i < n - 1; i++) {
if (a[i] < a[i + 1]) {
a[i + 1]--;
}
}
for (int i = 0; i < n - 1; i++) {
if (a[i] > a[i + 1]) {
ans = false;
}
}
if (ans) {
cout << "Yes";
} else {
cout << "No";
}
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 756,396 | 756,395 | u214137532 | cpp |
p02953 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int N;
cin >> N;
vector<ll> H(N);
for (int i = 0; i < N; i++)
cin >> H[i];
string ans = "Yes";
for (int i = N - 1; i >= 0; i--) {
if (H[i - 1] - H[i] >= 2)
ans = "No";
if (H[i - 1] - H[i] == 1)
H[i - 1]--;
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int N;
cin >> N;
vector<ll> H(N);
for (int i = 0; i < N; i++)
cin >> H[i];
string ans = "Yes";
for (int i = N - 1; i >= 1; i--) {
if (H[i - 1] - H[i] >= 2)
ans = "No";
if (H[i - 1] - H[i] == 1)
H[i - 1]--;
}
cout << ans << endl;
return 0;
} | [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 756,397 | 756,398 | u398610336 | cpp |
p02953 | #include <bits/stdc++.h>
#define rep(i, a, b) for (int i = (a); i < (b); i++)
using namespace std;
signed main(void) {
int n;
cin >> n;
int h[n];
int maxi;
cin >> h[0];
rep(i, 1, n - 1) {
cin >> h[i];
if (h[i - 1] <= h[i] - 1)
h[i]--;
}
rep(i, 1, n) {
if (!(h[i - 1] <= h[i])) {
cout << "No" << endl;
return 0;
}
}
cout << "Yes" << endl;
return 0;
}
| #include <bits/stdc++.h>
#define rep(i, a, b) for (int i = (a); i < (b); i++)
using namespace std;
signed main(void) {
int n;
cin >> n;
int h[n];
cin >> h[0];
rep(i, 1, n) {
cin >> h[i];
if (h[i - 1] <= h[i] - 1)
h[i]--;
}
rep(i, 1, n) {
if (!(h[i - 1] <= h[i])) {
cout << "No" << endl;
return 0;
}
}
cout << "Yes" << endl;
return 0;
}
| [
"variable_declaration.remove",
"expression.operation.binary.remove"
] | 756,399 | 756,400 | u890331732 | cpp |
p02953 | #define _CRT_SECURE_NO_WARNINGS
#include <algorithm>
#include <bitset>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <regex>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <string.h>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
#define endl '\n'
#define MOD 1000000
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
typedef pair<int, int> pii;
int dx[] = {0, 1, 0, -1};
int dy[] = {-1, 0, 1, 0};
int dz[] = {0, 0, 0, 0, 1, -1};
const int INF = 1000000000;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int n;
cin >> n;
vector<int> v(n);
for (int i = 0; i < n; i++) {
cin >> v[i];
}
for (int i = n - 1; i > 0; i--) {
if (v[i] >= v[i - 1])
continue;
else if (v[i - 1] - 1 == v[i])
v[i - 1] -= 1;
else {
cout << "NO";
return 0;
}
}
cout << "Yes";
}
| #define _CRT_SECURE_NO_WARNINGS
#include <algorithm>
#include <bitset>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <regex>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <string.h>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
#define endl '\n'
#define MOD 1000000
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
typedef pair<int, int> pii;
int dx[] = {0, 1, 0, -1};
int dy[] = {-1, 0, 1, 0};
int dz[] = {0, 0, 0, 0, 1, -1};
const int INF = 1000000000;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int n;
cin >> n;
vector<int> v(n);
for (int i = 0; i < n; i++) {
cin >> v[i];
}
for (int i = n - 1; i > 0; i--) {
if (v[i] >= v[i - 1]) {
} else {
if (v[i - 1] - 1 == v[i])
v[i - 1] -= 1;
else {
cout << "No";
return 0;
}
}
}
cout << "Yes";
}
| [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 756,401 | 756,402 | u719699113 | cpp |
p02953 | #define _CRT_SECURE_NO_WARNINGS
#include <algorithm>
#include <bitset>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <regex>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <string.h>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
#define endl '\n'
#define MOD 1000000
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
typedef pair<int, int> pii;
int dx[] = {0, 1, 0, -1};
int dy[] = {-1, 0, 1, 0};
int dz[] = {0, 0, 0, 0, 1, -1};
const int INF = 1000000000;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int n;
cin >> n;
vector<int> v(n);
for (int i = 0; i < n; i++) {
cin >> v[i];
}
for (int i = n - 1; i > 0; i--) {
if (v[i] >= v[i - 1]) {
} else if (v[i - 1] - 1 == v[i])
v[i - 1] -= 1;
else {
cout << "NO";
return 0;
}
}
cout << "Yes";
}
| #define _CRT_SECURE_NO_WARNINGS
#include <algorithm>
#include <bitset>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <regex>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <string.h>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
#define endl '\n'
#define MOD 1000000
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
typedef pair<int, int> pii;
int dx[] = {0, 1, 0, -1};
int dy[] = {-1, 0, 1, 0};
int dz[] = {0, 0, 0, 0, 1, -1};
const int INF = 1000000000;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int n;
cin >> n;
vector<int> v(n);
for (int i = 0; i < n; i++) {
cin >> v[i];
}
for (int i = n - 1; i > 0; i--) {
if (v[i] >= v[i - 1]) {
} else {
if (v[i - 1] - 1 == v[i])
v[i - 1] -= 1;
else {
cout << "No";
return 0;
}
}
}
cout << "Yes";
}
| [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 756,403 | 756,402 | u719699113 | cpp |
p02953 | #define _CRT_SECURE_NO_WARNINGS
#include <algorithm>
#include <bitset>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <regex>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <string.h>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
#define endl '\n'
#define MOD 1000000
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
typedef pair<int, int> pii;
int dx[] = {0, 1, 0, -1};
int dy[] = {-1, 0, 1, 0};
int dz[] = {0, 0, 0, 0, 1, -1};
const int INF = 1000000000;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int n;
cin >> n;
vector<int> v(n);
for (int i = 0; i < n; i++) {
cin >> v[i];
}
for (int i = n - 1; i > 0; i--) {
if (v[i] >= v[i - 1])
continue;
else if (v[i - 1] - 1 == v[i])
v[i - 1] -= 1;
else {
cout << "NO";
return 0;
}
}
cout << "Yes";
}
| #define _CRT_SECURE_NO_WARNINGS
#include <algorithm>
#include <bitset>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <regex>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <string.h>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
#define endl '\n'
#define MOD 1000000
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
typedef pair<int, int> pii;
int dx[] = {0, 1, 0, -1};
int dy[] = {-1, 0, 1, 0};
int dz[] = {0, 0, 0, 0, 1, -1};
const int INF = 1000000000;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int n;
cin >> n;
vector<int> v(n);
for (int i = 0; i < n; i++) {
cin >> v[i];
}
for (int i = n - 1; i > 0; i--) {
if (v[i] >= v[i - 1])
continue;
else if (v[i - 1] - 1 == v[i])
v[i - 1] -= 1;
else {
cout << "No";
return 0;
}
}
cout << "Yes";
}
| [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 756,401 | 756,404 | u719699113 | cpp |
p02953 | #define _CRT_SECURE_NO_WARNINGS
#include <algorithm>
#include <bitset>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <regex>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <string.h>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
#define endl '\n'
#define MOD 1000000
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
typedef pair<int, int> pii;
int dx[] = {0, 1, 0, -1};
int dy[] = {-1, 0, 1, 0};
int dz[] = {0, 0, 0, 0, 1, -1};
const int INF = 1000000000;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int n;
cin >> n;
vector<int> v(n);
for (int i = 0; i < n; i++) {
cin >> v[i];
}
for (int i = n - 1; i > 0; i--) {
if (v[i] >= v[i - 1]) {
} else if (v[i - 1] - 1 == v[i])
v[i - 1] -= 1;
else {
cout << "NO";
return 0;
}
}
cout << "Yes";
}
| #define _CRT_SECURE_NO_WARNINGS
#include <algorithm>
#include <bitset>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <regex>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <string.h>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
#define endl '\n'
#define MOD 1000000
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
typedef pair<int, int> pii;
int dx[] = {0, 1, 0, -1};
int dy[] = {-1, 0, 1, 0};
int dz[] = {0, 0, 0, 0, 1, -1};
const int INF = 1000000000;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int n;
cin >> n;
vector<int> v(n);
for (int i = 0; i < n; i++) {
cin >> v[i];
}
for (int i = n - 1; i > 0; i--) {
if (v[i] >= v[i - 1])
continue;
else if (v[i - 1] - 1 == v[i])
v[i - 1] -= 1;
else {
cout << "No";
return 0;
}
}
cout << "Yes";
}
| [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 756,403 | 756,404 | u719699113 | cpp |
p02953 | #include <bits/stdc++.h>
#define rep(i, n) for (int(i) = 0; (i) < (n); ++(i))
#define all(x) (x).begin(), (x).end()
#define dump(x) cout << #x << " = " << (x) << endl
#define YES(n) cout << ((n) ? "YES" : "NO") << endl
#define Yes(n) cout << ((n) ? "Yes" : "No") << endl
#define yes(n) cout << ((n) ? "yes" : "no") << endl
using namespace std;
using ll = long long;
using P = pair<int, int>;
const int INF = 1001001001;
const vector<int> di = {-1, 0, 1, 0};
const vector<int> dj = {0, -1, 0, 1};
void chmin(int &a, int b) {
if (a > b)
a = b;
}
ll GCD(ll a, ll b) {
if (b == 0)
return a;
else
return GCD(b, a % b);
}
ll LCM(ll a, ll b) {
ll g = GCD(a, b);
return a / g * b;
}
int main() {
int n;
cin >> n;
vector<ll> h(n);
rep(i, n) cin >> h[i];
reverse(all(h));
bool ok = true;
for (int i = 1; i < n; ++i) {
if (h[i - 1] < h[i]) {
if (h[i - 1] - h[i] > 1) {
ok = false;
break;
} else {
h[i]--;
}
}
}
Yes(ok);
} | #include <bits/stdc++.h>
#define rep(i, n) for (int(i) = 0; (i) < (n); ++(i))
#define all(x) (x).begin(), (x).end()
#define dump(x) cout << #x << " = " << (x) << endl
#define YES(n) cout << ((n) ? "YES" : "NO") << endl
#define Yes(n) cout << ((n) ? "Yes" : "No") << endl
#define yes(n) cout << ((n) ? "yes" : "no") << endl
using namespace std;
using ll = long long;
using P = pair<int, int>;
const int INF = 1001001001;
const vector<int> di = {-1, 0, 1, 0};
const vector<int> dj = {0, -1, 0, 1};
void chmin(int &a, int b) {
if (a > b)
a = b;
}
ll GCD(ll a, ll b) {
if (b == 0)
return a;
else
return GCD(b, a % b);
}
ll LCM(ll a, ll b) {
ll g = GCD(a, b);
return a / g * b;
}
int main() {
int n;
cin >> n;
vector<ll> h(n);
rep(i, n) cin >> h[i];
reverse(all(h));
bool ok = true;
for (int i = 1; i < n; ++i) {
if (h[i - 1] < h[i]) {
if (h[i - 1] < h[i] - 1) {
ok = false;
break;
} else {
h[i]--;
}
}
}
Yes(ok);
} | [
"control_flow.branch.if.condition.change"
] | 756,407 | 756,408 | u964763428 | cpp |
p02953 | #include <bits/stdc++.h>
#define rep(i, n) for (int(i) = 0; (i) < (n); ++(i))
#define all(x) (x).begin(), (x).end()
#define dump(x) cout << #x << " = " << (x) << endl
#define YES(n) cout << ((n) ? "YES" : "NO") << endl
#define Yes(n) cout << ((n) ? "Yes" : "No") << endl
#define yes(n) cout << ((n) ? "yes" : "no") << endl
using namespace std;
using ll = long long;
using P = pair<int, int>;
const int INF = 1001001001;
const vector<int> di = {-1, 0, 1, 0};
const vector<int> dj = {0, -1, 0, 1};
void chmin(int &a, int b) {
if (a > b)
a = b;
}
ll GCD(ll a, ll b) {
if (b == 0)
return a;
else
return GCD(b, a % b);
}
ll LCM(ll a, ll b) {
ll g = GCD(a, b);
return a / g * b;
}
int main() {
int n;
cin >> n;
vector<ll> h(n);
rep(i, n) cin >> h[i];
reverse(all(h));
bool ok = true;
for (int i = 1; i < n; ++i) {
if (h[i - 1] < h[i]) {
if (h[i - 1] - h[i] != 1) {
ok = false;
break;
} else {
h[i]--;
}
}
}
Yes(ok);
} | #include <bits/stdc++.h>
#define rep(i, n) for (int(i) = 0; (i) < (n); ++(i))
#define all(x) (x).begin(), (x).end()
#define dump(x) cout << #x << " = " << (x) << endl
#define YES(n) cout << ((n) ? "YES" : "NO") << endl
#define Yes(n) cout << ((n) ? "Yes" : "No") << endl
#define yes(n) cout << ((n) ? "yes" : "no") << endl
using namespace std;
using ll = long long;
using P = pair<int, int>;
const int INF = 1001001001;
const vector<int> di = {-1, 0, 1, 0};
const vector<int> dj = {0, -1, 0, 1};
void chmin(int &a, int b) {
if (a > b)
a = b;
}
ll GCD(ll a, ll b) {
if (b == 0)
return a;
else
return GCD(b, a % b);
}
ll LCM(ll a, ll b) {
ll g = GCD(a, b);
return a / g * b;
}
int main() {
int n;
cin >> n;
vector<ll> h(n);
rep(i, n) cin >> h[i];
reverse(all(h));
bool ok = true;
for (int i = 1; i < n; ++i) {
if (h[i - 1] < h[i]) {
if (h[i - 1] < h[i] - 1) {
ok = false;
break;
} else {
h[i]--;
}
}
}
Yes(ok);
} | [
"control_flow.branch.if.condition.change"
] | 756,409 | 756,408 | u964763428 | cpp |
p02953 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
using namespace std;
int main() {
int n;
cin >> n;
vector<ll> h(n);
rep(i, n) cin >> h[i];
int pre = -999;
rep(i, n) {
if (pre < h[i]) {
pre = h[i] - 1;
} else if (pre = h[i]) {
pre = h[i];
} else {
puts("No");
return 0;
}
}
puts("Yes");
}
| #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
using namespace std;
int main() {
int n;
cin >> n;
vector<ll> h(n);
rep(i, n) cin >> h[i];
int pre = -999;
rep(i, n) {
if (pre < h[i]) {
pre = h[i] - 1;
} else if (pre == h[i]) {
pre = h[i];
} else {
puts("No");
return 0;
}
}
puts("Yes");
}
| [
"expression.operation.compare.replace.add",
"assignment.replace.remove",
"misc.typo"
] | 756,415 | 756,416 | u147556624 | cpp |
p02953 | #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
int main() {
int n;
vector<ll> h(n);
for (int i = 0; i < n; i++)
cin >> h[i];
int pre = -10;
for (int i = 0; i < n; i++) {
if (pre < h[i]) {
pre = h[i] - 1;
} else if (pre == h[i]) {
pre = h[i];
} else {
puts("No");
return 0;
}
}
puts("Yes");
}
| #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
int main() {
int n;
cin >> n;
vector<ll> h(n);
for (int i = 0; i < n; i++)
cin >> h[i];
int pre = -10;
for (int i = 0; i < n; i++) {
if (pre < h[i]) {
pre = h[i] - 1;
} else if (pre == h[i]) {
pre = h[i];
} else {
puts("No");
return 0;
}
}
puts("Yes");
}
| [] | 756,417 | 756,418 | u147556624 | cpp |
p02953 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
if (n == 1) {
cout << "Yes";
return 0;
}
int h[n];
for (int i = 0; i < n; i++) {
cin >> h[i];
}
if (h[n - 1] < h[n - 2]) {
h[n - 1]--;
if (h[n - 1] < h[n - 2]) {
cout << "No";
return 0;
}
}
for (int i = n - 2; i > 0; i--) {
if (!(h[i] <= h[i + 1])) {
h[i]--;
if (!(h[i] <= h[i + 1])) {
cout << "No";
return 0;
}
}
}
if (h[0] > h[1]) {
h[0]--;
if (h[0] > h[1]) {
cout << "No";
return 0;
}
}
cout << "Yes";
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
if (n == 1) {
cout << "Yes";
return 0;
}
int h[n];
for (int i = 0; i < n; i++) {
cin >> h[i];
}
if (h[n - 1] < h[n - 2]) {
h[n - 2]--;
if (h[n - 1] < h[n - 2]) {
cout << "No";
return 0;
}
}
for (int i = n - 3; i > 0; i--) {
if (!(h[i] <= h[i + 1])) {
h[i]--;
if (!(h[i] <= h[i + 1])) {
cout << "No";
return 0;
}
}
}
if (h[0] > h[1]) {
h[0]--;
if (h[0] > h[1]) {
cout << "No";
return 0;
}
}
cout << "Yes";
} | [
"literal.number.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 756,423 | 756,424 | u294547216 | cpp |
p02953 | #include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
auto h = vector<int>(n);
for (auto &h_i : h)
cin >> h_i;
auto h_last = 2'000'000'000;
for (int i = n - 1; i >= 0; i++) {
if (h[i] <= h_last) {
h_last = h[i];
continue;
}
if (h[i] - 1 <= h_last) {
h_last = h[i] - 1;
continue;
}
goto fail;
}
cout << "Yes";
return 0;
fail:
cout << "No";
return 0;
}
| #include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
auto h = vector<int>(n);
for (auto &h_i : h)
cin >> h_i;
auto h_last = 2'000'000'000;
for (int i = n - 1; i >= 0; i--) {
if (h[i] <= h_last) {
h_last = h[i];
continue;
}
if (h[i] - 1 <= h_last) {
h_last = h[i] - 1;
continue;
}
goto fail;
}
cout << "Yes";
return 0;
fail:
cout << "No";
return 0;
}
| [] | 756,425 | 756,426 | u723394740 | cpp |
p02953 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rrep(i, n) for (int i = 1; i < (n + 1); ++i)
using namespace std;
using ll = long long;
const int INF = -100100100;
typedef pair<int, int> P;
int main() {
int n;
cin >> n;
vector<ll> h(n);
rep(i, n) cin >> h[i];
int cnt = 0;
vector<int> tm;
bool ans = true;
int prev = -99;
rep(i, n) {
if (prev <= h[i] + 1)
prev = h[i] - 1;
else if (prev == h[i])
prev = h[i];
else {
ans = false;
}
}
if (ans)
cout << "Yes" << endl;
else
cout << "No" << endl;
return 0;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rrep(i, n) for (int i = 1; i < (n + 1); ++i)
using namespace std;
using ll = long long;
const int INF = -100100100;
typedef pair<int, int> P;
int main() {
int n;
cin >> n;
vector<ll> h(n);
rep(i, n) cin >> h[i];
int cnt = 0;
vector<int> tm;
bool ans = true;
int prev = -99;
rep(i, n) {
if (prev <= h[i] - 1)
prev = h[i] - 1;
else if (prev == h[i])
prev = h[i];
else {
ans = false;
}
}
if (ans)
cout << "Yes" << endl;
else
cout << "No" << endl;
return 0;
} | [
"misc.opposites",
"expression.operator.arithmetic.change",
"control_flow.branch.if.condition.change"
] | 756,429 | 756,430 | u412659798 | cpp |
p02953 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <vector>
using namespace std;
#define FOR(I, A, B) for (int I = (A); I < (B); ++I)
#define CLR(mat) memset(mat, 0, sizeof(mat))
typedef long long ll;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int N;
cin >> N;
int mx = 0;
bool ok = true;
FOR(i, 0, N) {
int h;
cin >> h;
if (mx - h >= 2) {
ok = false;
}
mx = max(mx, h);
}
cout << (ok ? "YES" : "NO") << endl;
} | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <vector>
using namespace std;
#define FOR(I, A, B) for (int I = (A); I < (B); ++I)
#define CLR(mat) memset(mat, 0, sizeof(mat))
typedef long long ll;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int N;
cin >> N;
int mx = 0;
bool ok = true;
FOR(i, 0, N) {
int h;
cin >> h;
if (mx - h >= 2) {
ok = false;
}
mx = max(mx, h);
}
cout << (ok ? "Yes" : "No") << endl;
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 756,431 | 756,432 | u310790595 | cpp |
p02953 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cfloat>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <list>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
using namespace std;
#define int long long
#define ll long long
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define P pair<ll, ll>
#define sz(x) (ll) x.size()
#define ALL(x) (x).begin(), (x).end()
#define ALLR(x) (x).rbegin(), (x).rend()
#define VE vector<ll>
#define COUT(x) cout << (x) << endl
#define MA map<ll, ll>
#define SE set<ll>
#define PQ priority_queue<ll>
#define PQR priority_queue<ll, VE, greater<ll>>
#define COUT(x) cout << (x) << endl
#define YES(n) cout << ((n) ? "YES" : "NO") << endl
#define Yes(n) cout << ((n) ? "Yes" : "No") << endl
#define EPS (1e-10)
#define pb push_back
const long long MOD = 1000000007;
// const long long MOD = 998244353;
const long long INF = 1LL << 60;
const double PI = acos(-1.0);
using Graph = vector<VE>;
ll gcd(ll a, ll b) {
if (a < b)
swap(a, b);
if (b == 0)
return a;
unsigned r;
while ((r = a % b)) {
a = b;
b = r;
}
return b;
}
ll lcm(ll a, ll b) {
ll g = gcd(a, b);
return a * b / g;
}
bool prime(ll n) {
for (ll i = 2; i <= sqrt(n); i++) {
if (n % i == 0)
return false;
}
return n != 1;
}
map<ll, ll> prime_factor(ll n) {
map<ll, ll> ret;
for (ll i = 2; i * i <= n; i++) {
while (n % i == 0) {
ret[i]++;
n /= i;
}
}
if (n != 1)
ret[n] = 1;
return ret;
}
ll MODinv(ll a, ll m) {
ll b = m, u = 1, v = 0;
while (b) {
ll t = a / b;
a -= t * b;
swap(a, b);
u -= t * v;
swap(u, v);
}
u %= m;
if (u < 0)
u += m;
return u;
}
vector<pair<char, int>> RunLength(string s) {
if (s.size() == 0)
return {};
vector<pair<char, int>> res(1, pair<char, int>(s[0], 0));
for (char p : s) {
if (res.back().first == p) {
res.back().second++;
} else {
res.emplace_back(p, 1);
}
}
return res;
}
// Digit Count
int GetDigit(int num) { return log10(num) + 1; }
// bit calculation[how many "1"] (= __builtin_popcount())
int bit_count(int n) {
int cnt = 0;
while (n > 0) {
if (n % 2 == 1)
cnt++;
n /= 2;
}
return cnt;
}
struct mint {
ll x; // typedef long long ll;
mint(ll x = 0) : x((x % MOD + MOD) % MOD) {}
mint operator-() const { return mint(-x); }
mint &operator+=(const mint a) {
if ((x += a.x) >= MOD)
x -= MOD;
return *this;
}
mint &operator-=(const mint a) {
if ((x += MOD - a.x) >= MOD)
x -= MOD;
return *this;
}
mint &operator*=(const mint a) {
(x *= a.x) %= MOD;
return *this;
}
mint operator+(const mint a) const {
mint res(*this);
return res += a;
}
mint operator-(const mint a) const {
mint res(*this);
return res -= a;
}
mint operator*(const mint a) const {
mint res(*this);
return res *= a;
}
mint pow(ll t) const {
if (!t)
return 1;
mint a = pow(t >> 1);
a *= a;
if (t & 1)
a *= *this;
return a;
}
// for prime MOD
mint inv() const { return pow(MOD - 2); }
mint &operator/=(const mint a) { return (*this) *= a.inv(); }
mint operator/(const mint a) const {
mint res(*this);
return res /= a;
}
};
struct combination {
vector<mint> fact, ifact;
combination(int n) : fact(n + 1), ifact(n + 1) {
// assert(n < MOD);
fact[0] = 1;
for (int i = 1; i <= n; ++i)
fact[i] = fact[i - 1] * i;
ifact[n] = fact[n].inv();
for (int i = n; i >= 1; --i)
ifact[i - 1] = ifact[i] * i;
}
mint operator()(int n, int k) {
if (k < 0 || k > n)
return 0;
return fact[n] * ifact[k] * ifact[n - k];
}
} com(10);
struct edge {
ll to, cost;
};
signed main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
// cout << fixed << setprecision(15);
int n;
cin >> n;
VE a(n);
rep(i, n) cin >> a[i];
rep(i, n + 1) {
if (a[i + 1] - a[i] > 0) {
if (a[i + 1] - a[i] == 1) {
a[i + 1]--;
} else {
cout << "No" << endl;
return 0;
}
}
}
cout << "Yes" << endl;
return 0;
} | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cfloat>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <list>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
using namespace std;
#define int long long
#define ll long long
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define P pair<ll, ll>
#define sz(x) (ll) x.size()
#define ALL(x) (x).begin(), (x).end()
#define ALLR(x) (x).rbegin(), (x).rend()
#define VE vector<ll>
#define COUT(x) cout << (x) << endl
#define MA map<ll, ll>
#define SE set<ll>
#define PQ priority_queue<ll>
#define PQR priority_queue<ll, VE, greater<ll>>
#define COUT(x) cout << (x) << endl
#define YES(n) cout << ((n) ? "YES" : "NO") << endl
#define Yes(n) cout << ((n) ? "Yes" : "No") << endl
#define EPS (1e-10)
#define pb push_back
const long long MOD = 1000000007;
// const long long MOD = 998244353;
const long long INF = 1LL << 60;
const double PI = acos(-1.0);
using Graph = vector<VE>;
ll gcd(ll a, ll b) {
if (a < b)
swap(a, b);
if (b == 0)
return a;
unsigned r;
while ((r = a % b)) {
a = b;
b = r;
}
return b;
}
ll lcm(ll a, ll b) {
ll g = gcd(a, b);
return a * b / g;
}
bool prime(ll n) {
for (ll i = 2; i <= sqrt(n); i++) {
if (n % i == 0)
return false;
}
return n != 1;
}
map<ll, ll> prime_factor(ll n) {
map<ll, ll> ret;
for (ll i = 2; i * i <= n; i++) {
while (n % i == 0) {
ret[i]++;
n /= i;
}
}
if (n != 1)
ret[n] = 1;
return ret;
}
ll MODinv(ll a, ll m) {
ll b = m, u = 1, v = 0;
while (b) {
ll t = a / b;
a -= t * b;
swap(a, b);
u -= t * v;
swap(u, v);
}
u %= m;
if (u < 0)
u += m;
return u;
}
vector<pair<char, int>> RunLength(string s) {
if (s.size() == 0)
return {};
vector<pair<char, int>> res(1, pair<char, int>(s[0], 0));
for (char p : s) {
if (res.back().first == p) {
res.back().second++;
} else {
res.emplace_back(p, 1);
}
}
return res;
}
// Digit Count
int GetDigit(int num) { return log10(num) + 1; }
// bit calculation[how many "1"] (= __builtin_popcount())
int bit_count(int n) {
int cnt = 0;
while (n > 0) {
if (n % 2 == 1)
cnt++;
n /= 2;
}
return cnt;
}
struct mint {
ll x; // typedef long long ll;
mint(ll x = 0) : x((x % MOD + MOD) % MOD) {}
mint operator-() const { return mint(-x); }
mint &operator+=(const mint a) {
if ((x += a.x) >= MOD)
x -= MOD;
return *this;
}
mint &operator-=(const mint a) {
if ((x += MOD - a.x) >= MOD)
x -= MOD;
return *this;
}
mint &operator*=(const mint a) {
(x *= a.x) %= MOD;
return *this;
}
mint operator+(const mint a) const {
mint res(*this);
return res += a;
}
mint operator-(const mint a) const {
mint res(*this);
return res -= a;
}
mint operator*(const mint a) const {
mint res(*this);
return res *= a;
}
mint pow(ll t) const {
if (!t)
return 1;
mint a = pow(t >> 1);
a *= a;
if (t & 1)
a *= *this;
return a;
}
// for prime MOD
mint inv() const { return pow(MOD - 2); }
mint &operator/=(const mint a) { return (*this) *= a.inv(); }
mint operator/(const mint a) const {
mint res(*this);
return res /= a;
}
};
struct combination {
vector<mint> fact, ifact;
combination(int n) : fact(n + 1), ifact(n + 1) {
// assert(n < MOD);
fact[0] = 1;
for (int i = 1; i <= n; ++i)
fact[i] = fact[i - 1] * i;
ifact[n] = fact[n].inv();
for (int i = n; i >= 1; --i)
ifact[i - 1] = ifact[i] * i;
}
mint operator()(int n, int k) {
if (k < 0 || k > n)
return 0;
return fact[n] * ifact[k] * ifact[n - k];
}
} com(10);
struct edge {
ll to, cost;
};
signed main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
// cout << fixed << setprecision(15);
int n;
cin >> n;
VE a(n);
rep(i, n) cin >> a[i];
rep(i, n - 1) {
if (a[i + 1] - a[i] < 0) {
if (a[i + 1] - a[i] == -1) {
a[i + 1]++;
} else {
cout << "No" << endl;
return 0;
}
}
}
cout << "Yes" << endl;
return 0;
} | [
"misc.opposites",
"expression.operator.arithmetic.change",
"call.arguments.change",
"expression.operation.binary.change",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 756,433 | 756,434 | u809967037 | cpp |
p02953 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define mx 0
#define mn 1e9
#define v(dt) vector<dt>
#define pr(x, y) pair<x, y>
#define loop(x, s, n) for (int x = s; x < n; ++x)
#define in_arr(n) \
loop(i, 0, n) { cin >> a[i]; }
#define out_arr(n) \
loop(i, 0, n) { cout << a[i]; }
const int N = 1e5 + 7;
inline void boost() {
cin.tie(0), cout.tie(0), cin.sync_with_stdio(0), cout.sync_with_stdio(0);
}
int main() {
boost();
ll n;
cin >> n;
v(ll) a(n);
in_arr(n);
bool cond = true;
for (int i = n - 2; i >= 0; --i) {
if (a[i] == a[i + 1] + 1) {
--a[i];
} else if (a[i] > a[i + 1] + 1) {
cond = false;
break;
}
}
if (!cond)
cout << "NO";
else
cout << "YES";
} | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define mx 0
#define mn 1e9
#define v(dt) vector<dt>
#define pr(x, y) pair<x, y>
#define loop(x, s, n) for (int x = s; x < n; ++x)
#define in_arr(n) \
loop(i, 0, n) { cin >> a[i]; }
#define out_arr(n) \
loop(i, 0, n) { cout << a[i]; }
const int N = 1e5 + 7;
inline void boost() {
cin.tie(0), cout.tie(0), cin.sync_with_stdio(0), cout.sync_with_stdio(0);
}
int main() {
boost();
ll n;
cin >> n;
v(ll) a(n);
in_arr(n);
bool cond = true;
for (int i = n - 2; i >= 0; --i) {
if (a[i] == a[i + 1] + 1) {
--a[i];
} else if (a[i] > a[i + 1] + 1) {
cond = false;
break;
}
}
if (!cond)
cout << "No";
else
cout << "Yes";
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 756,441 | 756,442 | u341811631 | cpp |
p02953 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using vi = vector<int>;
using vvi = vector<vi>;
using vll = vector<ll>;
using vvll = vector<vll>;
using vb = vector<bool>;
using vs = vector<string>;
typedef pair<ll, ll> P;
#define bit(n) (1LL << (n))
//#define int long long
#define all(v) v.begin(), v.end()
#define rep(i, n) for (ll i = 0; i < n; i++)
#define REP(i, n) for (ll i = 1; i < n; i++)
#define FOR(i, a, b) for (ll i = (a); i < (b); i++)
#define FORm(i, m) for (auto i = m.begin(); i != m.end(); i++)
template <class T> inline void chmax(T &a, T b) { a = std::max(a, b); }
template <class T> inline void chmin(T &a, T b) { a = std::min(a, b); }
#define mod (ll)(1e9 + 7)
#define INF LLONG_MAX
template <ll ModVal> struct ModInt {
ll x;
ModInt(ll _x = 0) : x((_x % ModVal + ModVal) % ModVal) {}
ModInt operator-() const { return ModInt(-x); }
ModInt &operator+=(const ModInt a) {
x += a.x;
if (x >= ModVal)
x -= ModVal;
return *this;
}
ModInt &operator-=(const ModInt a) {
x = x + ModVal - a.x;
if (x >= ModVal)
x -= ModVal;
return *this;
}
ModInt &operator*=(const ModInt a) {
x *= a.x;
x %= ModVal;
return *this;
}
ll ext_gcd(ll a, ll b, ll &x, ll &y) {
if (b == 0) {
x = 1;
y = 0;
return a;
}
ll tmp = a / b;
ll d = ext_gcd(b, a - b * tmp, y, x);
y -= tmp * x;
return d;
}
// 逆元
ModInt inv(const ModInt a) {
ll u, v;
ext_gcd(a.x, ModVal, u, v);
return ModInt(u);
}
ModInt &operator/=(const ModInt a) { return (*this) *= inv(a); }
ModInt operator+(const ModInt a) const {
ModInt retval(*this);
return retval += a;
}
ModInt operator-(const ModInt a) const {
ModInt retval(*this);
return retval -= a;
}
ModInt operator*(const ModInt a) const {
ModInt retval(*this);
return retval *= a;
}
ModInt operator/(const ModInt a) const {
ModInt retval(*this);
return retval /= a;
}
ModInt pow(ll n) {
ModInt ans(1);
while (n) {
if (n & 1)
ans = ans * x;
*this = (*this) * (*this);
n = n >> 1;
}
return ans;
}
constexpr const ll &value() { return this->x; }
};
template <ll ModVal> ostream &operator<<(ostream &os, const ModInt<ModVal> &a) {
os << a.x;
return os;
}
using mint = ModInt<mod>;
template <typename T> class Combination {
public:
Combination(ll _max_n) : max_n(_max_n), factional(max_n + 1), inv(max_n + 1) {
factional[0] = 1;
inv[0] = 1;
for (ll i = 0; i < max_n; i++) {
factional[i + 1] = factional[i] * (i + 1); // n!(mod M)
inv[i + 1] = inv[i] / (i + 1); // k!^(M-2) (mod M)
}
}
// nCk
T choose(ll n, ll k) {
if (n == 0 && k == 0)
return 1;
if (n < k || n < 0)
return 0;
T tmp = inv[n - k] * inv[k];
return tmp * factional[n];
}
private:
const ll max_n;
std::vector<T> factional;
std::vector<T> inv;
};
using Comb = Combination<mint>;
signed main() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(20);
ll n;
cin >> n;
vll h(n);
rep(i, n) { cin >> h[i]; }
bool ans = true;
for (ll i = n - 2; i >= 0; i--) {
if (h[i] == h[i + 1]) {
h[i]--;
}
if (h[i] > h[i + 1]) {
ans = false;
break;
}
}
cout << (ans ? "Yes" : "No") << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using vi = vector<int>;
using vvi = vector<vi>;
using vll = vector<ll>;
using vvll = vector<vll>;
using vb = vector<bool>;
using vs = vector<string>;
typedef pair<ll, ll> P;
#define bit(n) (1LL << (n))
//#define int long long
#define all(v) v.begin(), v.end()
#define rep(i, n) for (ll i = 0; i < n; i++)
#define REP(i, n) for (ll i = 1; i < n; i++)
#define FOR(i, a, b) for (ll i = (a); i < (b); i++)
#define FORm(i, m) for (auto i = m.begin(); i != m.end(); i++)
template <class T> inline void chmax(T &a, T b) { a = std::max(a, b); }
template <class T> inline void chmin(T &a, T b) { a = std::min(a, b); }
#define mod (ll)(1e9 + 7)
#define INF LLONG_MAX
template <ll ModVal> struct ModInt {
ll x;
ModInt(ll _x = 0) : x((_x % ModVal + ModVal) % ModVal) {}
ModInt operator-() const { return ModInt(-x); }
ModInt &operator+=(const ModInt a) {
x += a.x;
if (x >= ModVal)
x -= ModVal;
return *this;
}
ModInt &operator-=(const ModInt a) {
x = x + ModVal - a.x;
if (x >= ModVal)
x -= ModVal;
return *this;
}
ModInt &operator*=(const ModInt a) {
x *= a.x;
x %= ModVal;
return *this;
}
ll ext_gcd(ll a, ll b, ll &x, ll &y) {
if (b == 0) {
x = 1;
y = 0;
return a;
}
ll tmp = a / b;
ll d = ext_gcd(b, a - b * tmp, y, x);
y -= tmp * x;
return d;
}
// 逆元
ModInt inv(const ModInt a) {
ll u, v;
ext_gcd(a.x, ModVal, u, v);
return ModInt(u);
}
ModInt &operator/=(const ModInt a) { return (*this) *= inv(a); }
ModInt operator+(const ModInt a) const {
ModInt retval(*this);
return retval += a;
}
ModInt operator-(const ModInt a) const {
ModInt retval(*this);
return retval -= a;
}
ModInt operator*(const ModInt a) const {
ModInt retval(*this);
return retval *= a;
}
ModInt operator/(const ModInt a) const {
ModInt retval(*this);
return retval /= a;
}
ModInt pow(ll n) {
ModInt ans(1);
while (n) {
if (n & 1)
ans = ans * x;
*this = (*this) * (*this);
n = n >> 1;
}
return ans;
}
constexpr const ll &value() { return this->x; }
};
template <ll ModVal> ostream &operator<<(ostream &os, const ModInt<ModVal> &a) {
os << a.x;
return os;
}
using mint = ModInt<mod>;
template <typename T> class Combination {
public:
Combination(ll _max_n) : max_n(_max_n), factional(max_n + 1), inv(max_n + 1) {
factional[0] = 1;
inv[0] = 1;
for (ll i = 0; i < max_n; i++) {
factional[i + 1] = factional[i] * (i + 1); // n!(mod M)
inv[i + 1] = inv[i] / (i + 1); // k!^(M-2) (mod M)
}
}
// nCk
T choose(ll n, ll k) {
if (n == 0 && k == 0)
return 1;
if (n < k || n < 0)
return 0;
T tmp = inv[n - k] * inv[k];
return tmp * factional[n];
}
private:
const ll max_n;
std::vector<T> factional;
std::vector<T> inv;
};
using Comb = Combination<mint>;
signed main() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(20);
ll n;
cin >> n;
vll h(n);
rep(i, n) { cin >> h[i]; }
bool ans = true;
for (ll i = n - 2; i >= 0; i--) {
if (h[i] > h[i + 1]) {
h[i]--;
}
if (h[i] > h[i + 1]) {
ans = false;
break;
}
}
cout << (ans ? "Yes" : "No") << endl;
return 0;
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 756,447 | 756,448 | u324825702 | cpp |
p02953 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define REP(i, d, n) for (int i = (d); i < (n); ++i)
#define all(v) v.begin(), v.end()
using ll = long long;
using P = pair<int, int>;
int main() {
int n;
cin >> n;
vector<int> h(n);
rep(i, n) { cin >> h[i]; }
rep(i, n - 1) {
if (h[i] >= h[i + 1]) {
h[i] -= 1;
} else if (i && h[i - 1] < h[i] && h[i] == h[i + 1]) {
h[i] -= 1;
}
}
bool ok = true;
rep(i, n - 1) {
if (h[i] > h[i + 1]) {
ok = false;
break;
}
}
if (ok) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define REP(i, d, n) for (int i = (d); i < (n); ++i)
#define all(v) v.begin(), v.end()
using ll = long long;
using P = pair<int, int>;
int main() {
int n;
cin >> n;
vector<int> h(n);
rep(i, n) { cin >> h[i]; }
rep(i, n - 1) {
if (h[i] > h[i + 1]) {
h[i] -= 1;
} else if (i && h[i - 1] < h[i] && h[i] == h[i + 1]) {
h[i] -= 1;
}
}
bool ok = true;
rep(i, n - 1) {
if (h[i] > h[i + 1]) {
ok = false;
break;
}
}
if (ok) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
return 0;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 756,449 | 756,450 | u561143568 | cpp |
p02953 | #include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
typedef pair<ll, ll> PL;
const ll mod = 1000000007;
const ll MOD = 1000000007;
const ll INF = 1LL << 60;
#define PI (acos(-1))
ll lcm(ll a, ll b) { return a / __gcd(a, b) * b; }
vector<ll> divisor(ll n) {
vector<ll> ret;
for (ll i = 1; i * i <= n; i++) {
if (n % i == 0) {
ret.push_back(i);
if (i * i != n)
ret.push_back(n / i);
}
}
sort(begin(ret), end(ret));
return (ret);
}
const ll MAX = 510000;
ll fac[MAX], finv[MAX], inv[MAX];
// テーブルを作る前処理
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (ll i = 2; i < MAX; i++) {
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
// 二項係数計算
ll COM(ll n, ll k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
struct BIT {
int n;
vector<int> bit;
BIT() { init(); }
BIT(int n) : n(n) { init(); }
void init() {
bit.clear();
bit.resize(n + 1, 0);
}
int sum(int i) {
int s = 0;
while (i > 0) {
s += bit[i];
i -= i & -i;
}
return s;
}
int sum(int x, int y) { return sum(y) - sum(x - 1); }
void add(int i, int x) {
while (i <= n) {
bit[i] += x;
i += i & -i;
}
}
int lower_bound(int w) {
if (w <= 0)
return 0;
int x = 0, r = 1;
while (r < n)
r <<= 1;
for (int k = r; k > 0; k >>= 1) {
if (x + k <= n && bit[x + k] < w) {
w -= bit[x + k];
x += k;
}
}
return x + 1;
}
};
// 文字列t ->整数 atoi(t.c_str());
// 文字列t ->long long整数 stoll(t); ローカルではつかえない
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;
}
// a^{-1} mod を計算する
long long modinv(long long a, long long mod) { return modpow(a, mod - 2, mod); }
struct UnionFind {
vector<int> par;
UnionFind(int n) : par(n, -1) {}
void init(int n) { par.assign(n, -1); }
int root(int x) {
if (par[x] < 0)
return x;
else
return par[x] = root(par[x]);
}
bool issame(int x, int y) { return root(x) == root(y); }
bool merge(int x, int y) {
x = root(x);
y = root(y);
if (x == y)
return false;
if (par[x] > par[y])
swap(x, y); // merge technique
par[x] += par[y];
par[y] = x;
return true;
}
int size(int x) { return -par[root(x)]; }
};
struct LazySegmentTree {
// private:
ll n;
vector<ll> node, lazy;
// public:
LazySegmentTree(vector<ll> v) {
int sz = (int)v.size();
n = 1;
while (n < sz)
n *= 2;
node.resize(2 * n - 1);
lazy.resize(2 * n - 1, 0);
for (int i = 0; i < sz; i++)
node[i + n - 1] = v[i];
for (int i = n - 2; i >= 0; i--)
node[i] = node[i * 2 + 1] + node[i * 2 + 2];
}
void eval(int k, int l, int r) {
if (lazy[k] != 0) {
node[k] += lazy[k];
if (r - l > 1) {
lazy[2 * k + 1] += lazy[k] / 2;
lazy[2 * k + 2] += lazy[k] / 2;
}
lazy[k] = 0;
}
}
void add(int a, int b, ll x, int k = 0, int l = 0, int r = -1) {
if (r < 0)
r = n;
eval(k, l, r);
if (b <= l || r <= a)
return;
if (a <= l && r <= b) {
lazy[k] += (r - l) * x;
eval(k, l, r);
} else {
add(a, b, x, 2 * k + 1, l, (l + r) / 2);
add(a, b, x, 2 * k + 2, (l + r) / 2, r);
node[k] = node[2 * k + 1] + node[2 * k + 2];
}
}
ll getsum(int a, int b, int k = 0, int l = 0, int r = -1) {
if (r < 0)
r = n;
eval(k, l, r);
if (b <= l || r <= a)
return 0;
if (a <= l && r <= b)
return node[k];
ll vl = getsum(a, b, 2 * k + 1, l, (l + r) / 2);
ll vr = getsum(a, b, 2 * k + 2, (l + r) / 2, r);
return vl + vr;
}
};
ll digit_sum(ll v) {
ll ret = 0;
while (v) {
ret += (v % 10);
v /= 10;
}
return ret;
}
ll h[101010];
ll solve() {
ll n;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> h[i];
}
h[0]--;
for (int i = 1; i < n; i++) {
if (h[i] > h[i - 1]) {
h[i]--;
} else if (h[i] == h[i - 1]) {
continue;
} else {
cout << "NO" << endl;
return 0;
}
}
cout << "YES" << endl;
return 0;
}
int main() {
// cout.precision(10);
ios::sync_with_stdio(false);
cin.tie(0);
solve();
}
| #include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
typedef pair<ll, ll> PL;
const ll mod = 1000000007;
const ll MOD = 1000000007;
const ll INF = 1LL << 60;
#define PI (acos(-1))
ll lcm(ll a, ll b) { return a / __gcd(a, b) * b; }
vector<ll> divisor(ll n) {
vector<ll> ret;
for (ll i = 1; i * i <= n; i++) {
if (n % i == 0) {
ret.push_back(i);
if (i * i != n)
ret.push_back(n / i);
}
}
sort(begin(ret), end(ret));
return (ret);
}
const ll MAX = 510000;
ll fac[MAX], finv[MAX], inv[MAX];
// テーブルを作る前処理
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (ll i = 2; i < MAX; i++) {
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
// 二項係数計算
ll COM(ll n, ll k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
struct BIT {
int n;
vector<int> bit;
BIT() { init(); }
BIT(int n) : n(n) { init(); }
void init() {
bit.clear();
bit.resize(n + 1, 0);
}
int sum(int i) {
int s = 0;
while (i > 0) {
s += bit[i];
i -= i & -i;
}
return s;
}
int sum(int x, int y) { return sum(y) - sum(x - 1); }
void add(int i, int x) {
while (i <= n) {
bit[i] += x;
i += i & -i;
}
}
int lower_bound(int w) {
if (w <= 0)
return 0;
int x = 0, r = 1;
while (r < n)
r <<= 1;
for (int k = r; k > 0; k >>= 1) {
if (x + k <= n && bit[x + k] < w) {
w -= bit[x + k];
x += k;
}
}
return x + 1;
}
};
// 文字列t ->整数 atoi(t.c_str());
// 文字列t ->long long整数 stoll(t); ローカルではつかえない
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;
}
// a^{-1} mod を計算する
long long modinv(long long a, long long mod) { return modpow(a, mod - 2, mod); }
struct UnionFind {
vector<int> par;
UnionFind(int n) : par(n, -1) {}
void init(int n) { par.assign(n, -1); }
int root(int x) {
if (par[x] < 0)
return x;
else
return par[x] = root(par[x]);
}
bool issame(int x, int y) { return root(x) == root(y); }
bool merge(int x, int y) {
x = root(x);
y = root(y);
if (x == y)
return false;
if (par[x] > par[y])
swap(x, y); // merge technique
par[x] += par[y];
par[y] = x;
return true;
}
int size(int x) { return -par[root(x)]; }
};
struct LazySegmentTree {
// private:
ll n;
vector<ll> node, lazy;
// public:
LazySegmentTree(vector<ll> v) {
int sz = (int)v.size();
n = 1;
while (n < sz)
n *= 2;
node.resize(2 * n - 1);
lazy.resize(2 * n - 1, 0);
for (int i = 0; i < sz; i++)
node[i + n - 1] = v[i];
for (int i = n - 2; i >= 0; i--)
node[i] = node[i * 2 + 1] + node[i * 2 + 2];
}
void eval(int k, int l, int r) {
if (lazy[k] != 0) {
node[k] += lazy[k];
if (r - l > 1) {
lazy[2 * k + 1] += lazy[k] / 2;
lazy[2 * k + 2] += lazy[k] / 2;
}
lazy[k] = 0;
}
}
void add(int a, int b, ll x, int k = 0, int l = 0, int r = -1) {
if (r < 0)
r = n;
eval(k, l, r);
if (b <= l || r <= a)
return;
if (a <= l && r <= b) {
lazy[k] += (r - l) * x;
eval(k, l, r);
} else {
add(a, b, x, 2 * k + 1, l, (l + r) / 2);
add(a, b, x, 2 * k + 2, (l + r) / 2, r);
node[k] = node[2 * k + 1] + node[2 * k + 2];
}
}
ll getsum(int a, int b, int k = 0, int l = 0, int r = -1) {
if (r < 0)
r = n;
eval(k, l, r);
if (b <= l || r <= a)
return 0;
if (a <= l && r <= b)
return node[k];
ll vl = getsum(a, b, 2 * k + 1, l, (l + r) / 2);
ll vr = getsum(a, b, 2 * k + 2, (l + r) / 2, r);
return vl + vr;
}
};
ll digit_sum(ll v) {
ll ret = 0;
while (v) {
ret += (v % 10);
v /= 10;
}
return ret;
}
ll h[101010];
ll solve() {
ll n;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> h[i];
}
h[0]--;
for (int i = 1; i < n; i++) {
if (h[i] > h[i - 1]) {
h[i]--;
} else if (h[i] == h[i - 1]) {
continue;
} else {
cout << "No" << endl;
return 0;
}
}
cout << "Yes" << endl;
return 0;
}
int main() {
// cout.precision(10);
ios::sync_with_stdio(false);
cin.tie(0);
solve();
}
| [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 756,462 | 756,463 | u644778646 | cpp |
p02953 | #include <bits/stdc++.h>
using namespace std;
#define IOS \
ios::sync_with_stdio(false); \
cin.tie(0);
#define FOR(i, s, n) for (int i = s; i < (n); i++)
#define REP(i, n) FOR(i, 0, n)
#define ALL(n) (n).begin(), (n).end()
#define RALL(n) (n).rbegin(), (n).rend()
#define ATYN(n) cout << ((n) ? "Yes" : "No") << '\n';
#define CFYN(n) cout << ((n) ? "YES" : "NO") << '\n';
#define OUT(n) cout << (n) << '\n';
using ll = long long;
using ull = unsigned long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
int main(void) {
IOS int n;
cin >> n;
vector<int> v(n);
bool ans = true;
bool down = false;
REP(i, n) {
cin >> v[i];
if (i != 0) {
if (v[i - 1] - 2 > v[i])
ans = false;
if (i > 0) {
if (down) {
if (v[i - 1] > v[i])
ans = false;
if (v[i - 1] < v[i])
down = false;
} else {
if (v[i - 1] - 1 == v[i])
down = true;
}
}
}
}
ATYN(ans)
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define IOS \
ios::sync_with_stdio(false); \
cin.tie(0);
#define FOR(i, s, n) for (int i = s; i < (n); i++)
#define REP(i, n) FOR(i, 0, n)
#define ALL(n) (n).begin(), (n).end()
#define RALL(n) (n).rbegin(), (n).rend()
#define ATYN(n) cout << ((n) ? "Yes" : "No") << '\n';
#define CFYN(n) cout << ((n) ? "YES" : "NO") << '\n';
#define OUT(n) cout << (n) << '\n';
using ll = long long;
using ull = unsigned long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
int main(void) {
IOS int n;
cin >> n;
vector<int> v(n);
bool ans = true;
bool down = false;
REP(i, n) {
cin >> v[i];
if (i != 0) {
if (v[i - 1] - 2 >= v[i])
ans = false;
if (i > 0) {
if (down) {
if (v[i - 1] > v[i])
ans = false;
if (v[i - 1] < v[i])
down = false;
} else {
if (v[i - 1] - 1 == v[i])
down = true;
}
}
}
}
ATYN(ans)
return 0;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 756,466 | 756,467 | u330661451 | cpp |
p02953 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <ctime>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
vector<int> a(n);
for (auto &t : a) {
cin >> t;
}
vector<int> vl = {-1, 0};
vector<int> dp = {1, 1};
for (int i = 1; i < n; i++) {
vector<int> ndp(2);
for (int f = 0; f < 2; f++) {
for (int s = 0; s < 2; s++) {
if (a[i - 1] + vl[f] <= a[i] + vl[s]) {
ndp[s] = 1;
}
}
}
dp = ndp;
}
if (dp[0] || dp[1])
cout << "Yes\n";
else
cout << "No\n";
}
| #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <ctime>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
vector<int> a(n);
for (auto &t : a) {
cin >> t;
}
vector<int> vl = {-1, 0};
vector<int> dp = {1, 1};
for (int i = 1; i < n; i++) {
vector<int> ndp(2);
for (int f = 0; f < 2; f++) {
for (int s = 0; s < 2; s++) {
if (a[i - 1] + vl[f] <= a[i] + vl[s] && dp[f]) {
ndp[s] = 1;
}
}
}
dp = ndp;
}
if (dp[0] || dp[1])
cout << "Yes\n";
else
cout << "No\n";
}
| [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 756,493 | 756,494 | u293523151 | cpp |
p02953 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int H[N];
for (int i = 0; i < N; i++) {
cin >> H[i];
}
int maxH = 1;
for (int i = 0; i < N - 1; i++) {
maxH = max(maxH, H[i]);
if (maxH < H[i] + 1) {
cout << "No" << endl;
return 0;
}
}
cout << "Yes" << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int H[N];
for (int i = 0; i < N; i++) {
cin >> H[i];
}
int maxH = 1;
for (int i = 0; i < N; i++) {
maxH = max(maxH, H[i]);
if (maxH > H[i] + 1) {
cout << "No" << endl;
return 0;
}
}
cout << "Yes" << endl;
return 0;
}
| [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove",
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 756,503 | 756,504 | u469315559 | cpp |
p02953 | #include <bits/stdc++.h>
#define FOR(i, a, b) for (int i = (a); i <= (b); i++)
#define RFOR(i, a, b) for (int i = (a); i >= (b); i--)
#define LFOR(i, a, b) for (long long int i = (a); i <= (b); i++)
#define LRFOR(i, a, b) for (long long int i = (a); i >= (b); i--)
#define MOD 1000000007
#define INF 1000000000 // 2000000000
#define LINF 1000000000000000000 // 9000000000000000000
#define DINF 1000000000000000.0
#define PI 3.14159265358979
//.size()はunsigned int 0-1をするとオーバーフローする
using namespace std;
typedef long long int ll;
typedef pair<long long int, long long int> P;
int dy[5] = {-1, 0, 1, 0, 0};
int dx[5] = {0, -1, 0, 1, 0};
int main(void) {
long long int n;
bool flag = true;
cin >> n;
vector<long long int> h(n + 1);
FOR(i, 1, n) { cin >> h[i]; }
FOR(i, 2, n) {
if (h[i - 1] < h[i] + 1) {
flag = false;
} else if (h[i - 1] < h[i]) {
h[i]--;
}
}
if (flag) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
}
| #include <bits/stdc++.h>
#define FOR(i, a, b) for (int i = (a); i <= (b); i++)
#define RFOR(i, a, b) for (int i = (a); i >= (b); i--)
#define LFOR(i, a, b) for (long long int i = (a); i <= (b); i++)
#define LRFOR(i, a, b) for (long long int i = (a); i >= (b); i--)
#define MOD 1000000007
#define INF 1000000000 // 2000000000
#define LINF 1000000000000000000 // 9000000000000000000
#define DINF 1000000000000000.0
#define PI 3.14159265358979
//.size()はunsigned int 0-1をするとオーバーフローする
using namespace std;
typedef long long int ll;
typedef pair<long long int, long long int> P;
int dy[5] = {-1, 0, 1, 0, 0};
int dx[5] = {0, -1, 0, 1, 0};
int main(void) {
long long int n;
bool flag = true;
cin >> n;
vector<long long int> h(n + 1);
FOR(i, 1, n) { cin >> h[i]; }
FOR(i, 2, n) {
if (h[i - 1] > h[i] + 1) {
flag = false;
} else if (h[i - 1] > h[i]) {
h[i]++;
}
}
if (flag) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
}
| [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 756,505 | 756,506 | u057611820 | cpp |
p02953 | #include <bits/stdc++.h>
#define int long long
#define mod 1000000007
#define trace(x) cerr << #x << ": " << x << " " << endl
#define trace2(x, y) cerr << #x << ": " << x << " | " << #y << ": " << y << endl
#define trace3(x, y, z) \
cerr << #x << ":" << x << " | " << #y << ": " << y << " | " << #z << ": " \
<< z << endl
#define trace4(a, b, c, d) \
cerr << #a << ": " << a << " | " << #b << ": " << b << " | " << #c << ": " \
<< c << " | " << #d << ": " << d << endl
#define sa(a, n) \
for (int i = 0; i < n; i++) \
cin >> a[i]
#define max3(a, b, c) max(a, max(b, c))
#define min3(a, b, c) min(a, min(b, c))
#define pb push_back
#define inf 2e18
#define scan() \
int n; \
cin >> n; \
int a[n]; \
for (int i = 0; i < n; i++) \
cin >> a[i]
#define print(a, n) \
for (int i = 0; i < n; i++) \
cout << a[i] << ' '
#define mem(a, v) memset(a, v, sizeof(a))
#define pii pair<int, int>
#define mkp make_pair
using namespace std;
#define N 2e5 + 5
int32_t main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int n;
cin >> n;
int i, a[n + 1];
for (i = 1; i <= n; i++)
cin >> a[i];
int x, y;
for (i = n - 1; i >= 1; i--) {
if (a[i + 1] < a[i]) {
a[i]--;
}
}
for (i = 1; i <= n; i++) {
if (a[i + 1] < a[i]) {
cout << "No" << '\n';
return 0;
}
}
cout << "Yes" << '\n';
return 0;
} | #include <bits/stdc++.h>
#define int long long
#define mod 1000000007
#define trace(x) cerr << #x << ": " << x << " " << endl
#define trace2(x, y) cerr << #x << ": " << x << " | " << #y << ": " << y << endl
#define trace3(x, y, z) \
cerr << #x << ":" << x << " | " << #y << ": " << y << " | " << #z << ": " \
<< z << endl
#define trace4(a, b, c, d) \
cerr << #a << ": " << a << " | " << #b << ": " << b << " | " << #c << ": " \
<< c << " | " << #d << ": " << d << endl
#define sa(a, n) \
for (int i = 0; i < n; i++) \
cin >> a[i]
#define max3(a, b, c) max(a, max(b, c))
#define min3(a, b, c) min(a, min(b, c))
#define pb push_back
#define inf 2e18
#define scan() \
int n; \
cin >> n; \
int a[n]; \
for (int i = 0; i < n; i++) \
cin >> a[i]
#define print(a, n) \
for (int i = 0; i < n; i++) \
cout << a[i] << ' '
#define mem(a, v) memset(a, v, sizeof(a))
#define pii pair<int, int>
#define mkp make_pair
using namespace std;
#define N 2e5 + 5
int32_t main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int n;
cin >> n;
int i, a[n + 1];
for (i = 1; i <= n; i++)
cin >> a[i];
int x, y;
for (i = n - 1; i >= 1; i--) {
if (a[i + 1] < a[i]) {
a[i]--;
}
}
for (i = 1; i < n; i++) {
if (a[i + 1] < a[i]) {
cout << "No" << '\n';
return 0;
}
}
cout << "Yes" << '\n';
return 0;
} | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 756,517 | 756,518 | u125467827 | cpp |
p02953 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main(void) {
int n;
cin >> n;
vector<int> h(n);
rep(i, n) { cin >> h.at(i); }
int left = 0;
string flag = "Yes";
rep(i, n - 1) {
if (left < h.at(i)) {
left = h.at(i);
}
if (abs(left - h.at(i + 1)) > 1) {
flag = "No";
}
}
cout << flag << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main(void) {
int n;
cin >> n;
vector<int> h(n);
rep(i, n) { cin >> h.at(i); }
int left = 0;
string flag = "Yes";
rep(i, n - 1) {
if (left < h.at(i)) {
left = h.at(i);
}
if (left - h.at(i + 1) > 1) {
flag = "No";
}
}
cout << flag << endl;
return 0;
} | [
"control_flow.branch.if.condition.change"
] | 756,521 | 756,522 | u690475097 | cpp |
p02953 | #include <bits/stdc++.h>
using namespace std;
#define int long long int
#define fi first
#define so second
#define ps push_back
#define ld long double
#define mod 1000000007
signed main() {
int n, i, ct = 0;
cin >> n;
int a[n];
for (i = 0; i < n; i++)
cin >> a[i];
for (i = n - 2; i >= 0; i--) {
if (a[i] > a[i + 1] + 1)
break;
if (a[i] == a[i + 1] + 1)
a[i]--;
}
if (i < 0)
cout << "yes";
else
cout << "No";
}
| #include <bits/stdc++.h>
using namespace std;
#define int long long int
#define fi first
#define so second
#define ps push_back
#define ld long double
#define mod 1000000007
signed main() {
int n, i, ct = 0;
cin >> n;
int a[n];
for (i = 0; i < n; i++)
cin >> a[i];
for (i = n - 2; i >= 0; i--) {
if (a[i] > a[i + 1] + 1)
break;
if (a[i] == a[i + 1] + 1)
a[i]--;
}
if (i < 0)
cout << "Yes";
else
cout << "No";
}
| [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 756,532 | 756,533 | u842462845 | cpp |
p02953 | #include <algorithm>
#include <iostream>
#include <list>
#include <queue>
#include <stack>
#include <stdio.h>
#include <string>
#include <utility>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
stack<long> h;
for (int i = 0; i < n; i++) {
long n;
cin >> n;
h.push(n);
}
long bef = h.top();
h.pop();
for (int i = 0; i < n; i++) {
long now = h.top();
h.pop();
if (now <= bef) {
bef = now;
continue;
}
if (now - bef == 1) {
bef = now - 1;
continue;
}
printf("No");
return 0;
}
printf("Yes");
return 0;
}
| #include <algorithm>
#include <iostream>
#include <list>
#include <queue>
#include <stack>
#include <stdio.h>
#include <string>
#include <utility>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
stack<long> h;
for (int i = 0; i < n; i++) {
long n;
cin >> n;
h.push(n);
}
long bef = h.top();
h.pop();
for (int i = 1; i < n; i++) {
long now = h.top();
h.pop();
if (now <= bef) {
bef = now;
continue;
}
if (now - bef == 1) {
bef = now - 1;
continue;
}
printf("No");
return 0;
}
printf("Yes");
return 0;
}
| [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 756,542 | 756,543 | u649220991 | cpp |
p02953 | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i, n) for (int i = 0; i < n; i++)
#define rep1(i, n) for (int i = 1; i <= n; i++)
#define rep2(i, n) for (int i = 0; i <= n; i++)
#define repr(i, a, n) for (int i = a; i < n; i++)
#define all(a) a.begin(), a.end()
#define P pair<long long, long long>
#define double long double
#define INF 1e10
#define MOD 1e9 + 7
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;
}
using Graph = vector<vector<int>>;
signed main() {
int a;
cin >> a;
vector<int> b(a);
rep(i, a) cin >> b[i];
int c = 0;
rep(i, a) {
if (c < b[i])
c = b[i];
if (c - b[i] >= 2) {
cout << "NO";
return 0;
}
}
cout << "YES";
} | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i, n) for (int i = 0; i < n; i++)
#define rep1(i, n) for (int i = 1; i <= n; i++)
#define rep2(i, n) for (int i = 0; i <= n; i++)
#define repr(i, a, n) for (int i = a; i < n; i++)
#define all(a) a.begin(), a.end()
#define P pair<long long, long long>
#define double long double
#define INF 1e10
#define MOD 1e9 + 7
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;
}
using Graph = vector<vector<int>>;
signed main() {
int a;
cin >> a;
vector<int> b(a);
rep(i, a) cin >> b[i];
int c = 0;
rep(i, a) {
if (c < b[i])
c = b[i];
if (c - b[i] >= 2) {
cout << "No";
return 0;
}
}
cout << "Yes";
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 756,544 | 756,545 | u341447450 | cpp |
p02953 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll N;
cin >> N;
if (N == 1) {
cout << "Yes" << endl;
return 0;
}
vector<ll> H(N);
for (ll i = 0; i < N; i++) {
cin >> H.at(i);
}
H[0]--;
for (ll i = 1; i < N - 1; i++) {
if (H[i] > H[i - 1]) {
H[i]--;
} else if (H[i] < H[i - 1]) {
cout << "No" << endl;
return 0;
}
}
cout << "Yes" << endl;
return 0;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll N;
cin >> N;
if (N == 1) {
cout << "Yes" << endl;
return 0;
}
vector<ll> H(N);
for (ll i = 0; i < N; i++) {
cin >> H.at(i);
}
H[0]--;
for (ll i = 1; i < N; i++) {
if (H[i] > H[i - 1]) {
H[i]--;
} else if (H[i] < H[i - 1]) {
cout << "No" << endl;
return 0;
}
}
cout << "Yes" << endl;
return 0;
return 0;
} | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 756,546 | 756,547 | u868205915 | cpp |
p02953 | #include <bits/stdc++.h>
using namespace std;
typedef long long llong;
int main(void) {
int N;
cin >> N;
int H[N];
for (int i = 0; i < N; i++) {
cin >> H[i];
}
bool flag = true;
for (int i = N - 1; i > 0; i--) {
if (H[i - 1] <= H[i])
;
else if (H[i - 1] + 1 == H[i])
H[i - 1] -= 1;
else {
flag = false;
break;
}
}
if (flag)
cout << "Yes" << endl;
else
cout << "No" << endl;
return (0);
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long llong;
int main(void) {
int N;
cin >> N;
int H[N];
for (int i = 0; i < N; i++) {
cin >> H[i];
}
bool flag = true;
for (int i = N - 1; i > 0; i--) {
if (H[i - 1] <= H[i])
;
else if (H[i - 1] - 1 == H[i])
H[i - 1] -= 1;
else {
flag = false;
break;
}
}
if (flag)
cout << "Yes" << endl;
else
cout << "No" << endl;
return (0);
}
| [
"misc.opposites",
"expression.operator.arithmetic.change",
"control_flow.branch.if.condition.change"
] | 756,548 | 756,549 | u616090453 | cpp |
p02953 | #include <bits/stdc++.h>
using namespace std;
typedef long long llong;
int main(void) {
int N;
cin >> N;
int H[N];
for (int i = 0; i < N; i++) {
cin >> H[i];
}
bool flag = true;
for (int i = N - 1; i > 0; i--) {
if (H[i - 1] <= H[i])
;
else if (H[i - 1] + 1 == H[i])
H[i - 1] += 1;
else {
flag = false;
break;
}
}
if (flag)
cout << "Yes" << endl;
else
cout << "No" << endl;
return (0);
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long llong;
int main(void) {
int N;
cin >> N;
int H[N];
for (int i = 0; i < N; i++) {
cin >> H[i];
}
bool flag = true;
for (int i = N - 1; i > 0; i--) {
if (H[i - 1] <= H[i])
;
else if (H[i - 1] - 1 == H[i])
H[i - 1] -= 1;
else {
flag = false;
break;
}
}
if (flag)
cout << "Yes" << endl;
else
cout << "No" << endl;
return (0);
}
| [
"misc.opposites",
"expression.operator.arithmetic.change",
"control_flow.branch.if.condition.change",
"expression.operator.change"
] | 756,550 | 756,549 | u616090453 | cpp |
p02953 | // Author: getharshkumar
#include <bits/stdc++.h>
using namespace std;
#define ll int64_t
const ll N = 1e6 + 6, M = 1e9 + 7;
ll a[N];
int main() {
ios::sync_with_stdio(false), cin.tie(nullptr);
ll n;
cin >> n >> a[0];
a[0]--;
for (ll i = 1; i < n; i++) {
cin >> a[i];
if (a[i] > a[i - 1])
a[i]--;
else if (a[i] < a[i] - 1)
return cout << "No", 0;
}
cout << "Yes";
return 0;
} | // Author: getharshkumar
#include <bits/stdc++.h>
using namespace std;
#define ll int64_t
const ll N = 1e6 + 6, M = 1e9 + 7;
ll a[N];
int main() {
ios::sync_with_stdio(false), cin.tie(nullptr);
ll n;
cin >> n >> a[0];
a[0]--;
for (ll i = 1; i < n; i++) {
cin >> a[i];
if (a[i] > a[i - 1])
a[i]--;
else if (a[i] < a[i - 1])
return cout << "No", 0;
}
cout << "Yes";
return 0;
} | [
"control_flow.branch.if.condition.change"
] | 756,565 | 756,566 | u319625425 | cpp |
p02953 | #include "bits/stdc++.h"
#define MY_ABS(N) ((N > 0) ? N : (-1 * N))
// #pragma GCC optimize("Ofast")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
using namespace std;
struct custom_hash {
static uint64_t splitmix64(uint64_t x) {
// http://xorshift.di.unimi.it/splitmix64.c
x += 0x9e3779b97f4a7c15;
x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9;
x = (x ^ (x >> 27)) * 0x94d049bb133111eb;
return x ^ (x >> 31);
}
size_t operator()(uint64_t x) const {
static const uint64_t FIXED_RANDOM =
chrono::steady_clock::now().time_since_epoch().count();
return splitmix64(x + FIXED_RANDOM);
}
};
int main(int argc, char const *argv[]) {
ios::sync_with_stdio(false);
cin.tie(nullptr);
int N;
cin >> N;
vector<long long> H(N);
for (long long &v : H) {
cin >> v;
}
long long maxH = 1;
bool flgSub = true;
for (int i = 0; i < N; i++) {
// cout << maxH << ' ' << H[i] << endl;
if ((maxH - H[i]) > 1) {
flgSub = false;
break;
}
if (maxH < H[i]) {
maxH = H[i];
}
}
if (!flgSub) {
cout << "NO" << endl;
} else {
cout << "YES" << endl;
}
return 0;
}
| #include "bits/stdc++.h"
#define MY_ABS(N) ((N > 0) ? N : (-1 * N))
// #pragma GCC optimize("Ofast")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
using namespace std;
struct custom_hash {
static uint64_t splitmix64(uint64_t x) {
// http://xorshift.di.unimi.it/splitmix64.c
x += 0x9e3779b97f4a7c15;
x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9;
x = (x ^ (x >> 27)) * 0x94d049bb133111eb;
return x ^ (x >> 31);
}
size_t operator()(uint64_t x) const {
static const uint64_t FIXED_RANDOM =
chrono::steady_clock::now().time_since_epoch().count();
return splitmix64(x + FIXED_RANDOM);
}
};
int main(int argc, char const *argv[]) {
ios::sync_with_stdio(false);
cin.tie(nullptr);
int N;
cin >> N;
vector<long long> H(N);
for (long long &v : H) {
cin >> v;
}
long long maxH = 1;
bool flgSub = true;
for (int i = 0; i < N; i++) {
// cout << maxH << ' ' << H[i] << endl;
if ((maxH - H[i]) > 1) {
flgSub = false;
break;
}
if (maxH < H[i]) {
maxH = H[i];
}
}
if (!flgSub) {
cout << "No" << endl;
} else {
cout << "Yes" << endl;
}
return 0;
}
| [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 756,589 | 756,590 | u585586208 | cpp |
p02953 | #include <iostream>
using namespace std;
int n, x, Max;
int main() {
cin >> n;
Max = 0;
bool flag = true;
for (int i = 0; i < n; i++) {
cin >> x;
if (Max - 1 > x) {
flag = false;
} else {
Max = max(Max, x);
}
}
if (flag == true)
cout << "YES" << endl;
else
cout << "NO" << endl;
return 0;
} | #include <iostream>
using namespace std;
int n, x, Max;
int main() {
cin >> n;
Max = 0;
bool flag = true;
for (int i = 0; i < n; i++) {
cin >> x;
if (Max - 1 > x) {
flag = false;
} else {
Max = max(Max, x);
}
}
if (flag == true)
cout << "Yes" << endl;
else
cout << "No" << endl;
return 0;
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 756,607 | 756,608 | u587292349 | cpp |
p02953 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> H(N);
for (int i = 0; i < N; i++) {
cin >> H[i];
}
for (int i = N - 2; i >= N; i--) {
if (H[i] - 1 > H[i + 1]) {
cout << "No" << endl;
return 0;
}
if (H[i] > H[i + 1]) {
H[i]--;
}
}
cout << "Yes" << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> H(N);
for (int i = 0; i < N; i++) {
cin >> H[i];
}
for (int i = N - 2; i >= 0; i--) {
if (H[i] - 1 > H[i + 1]) {
cout << "No" << endl;
return 0;
}
if (H[i] > H[i + 1]) {
H[i]--;
}
}
cout << "Yes" << endl;
}
| [
"identifier.replace.remove",
"literal.replace.add",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 756,619 | 756,620 | u584139221 | cpp |
p02953 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> h(n);
for (int i = 0; i < n; i++) {
cin >> h.at(i);
}
int max = 0;
bool flag = true;
for (int i = 1; i < n; i++) {
if (max < h.at(i - 1)) {
max = h.at(i - 1);
}
if (1 < h.at(i) - max) {
flag = false;
break;
}
}
cout << (flag ? "Yes" : "No") << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> h(n);
for (int i = 0; i < n; i++) {
cin >> h.at(i);
}
int max = 0;
bool flag = true;
for (int i = 1; i < n; i++) {
if (max < h.at(i - 1)) {
max = h.at(i - 1);
}
if (1 < max - h.at(i)) {
flag = false;
break;
}
}
cout << (flag ? "Yes" : "No") << endl;
} | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 756,632 | 756,633 | u999989620 | cpp |
p02953 | #include "bits/stdc++.h"
typedef long long ll;
using namespace std;
static const int MAX = 100000;
int main() {
int n, H[MAX];
cin >> n;
for (int i = 0; i < n; ++i)
cin >> H[i];
bool can = true;
H[0]--;
for (int i = 1; i < n; ++i) {
if (H[i - 1] + 1 == H[i])
H[i]--;
if (H[i - 1] > H[i]) {
can = false;
break;
}
}
cout << (can ? "Yes" : "No") << endl;
return 0;
}
| #include "bits/stdc++.h"
typedef long long ll;
using namespace std;
static const int MAX = 100000;
int main() {
int n, H[MAX];
cin >> n;
for (int i = 0; i < n; ++i)
cin >> H[i];
bool can = true;
H[0]--;
for (int i = 1; i < n; ++i) {
if (H[i - 1] + 1 <= H[i])
H[i]--;
if (H[i - 1] > H[i]) {
can = false;
break;
}
}
cout << (can ? "Yes" : "No") << endl;
return 0;
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 756,634 | 756,635 | u616461826 | cpp |
p02953 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> H(N);
for (int i = 0; i < N; ++i) {
cin >> H[i];
}
int num = 0;
if (N == 1) {
cout << "Yes" << endl;
} else {
for (int i = 0; i < N - 2; ++i) {
if (H[i] >= H[i + 1] + 2) {
cout << "No" << endl;
return 0;
}
if (H[i] == H[i + 1] + 1) {
num++;
}
if (H[i] < H[i + 1]) {
num = 0;
}
if (num == 2) {
cout << "No" << endl;
}
}
cout << "Yes" << endl;
}
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> H(N);
for (int i = 0; i < N; ++i) {
cin >> H[i];
}
int num = 0;
if (N == 1) {
cout << "Yes" << endl;
} else {
for (int i = 0; i < N - 1; ++i) {
if (H[i] >= H[i + 1] + 2) {
cout << "No" << endl;
return 0;
}
if (H[i] == H[i + 1] + 1) {
num++;
}
if (H[i] < H[i + 1]) {
num = 0;
}
if (num == 2) {
cout << "No" << endl;
return 0;
}
}
cout << "Yes" << endl;
}
}
| [
"literal.number.change",
"control_flow.branch.if.condition.change",
"control_flow.return.add",
"control_flow.return.0.add"
] | 756,638 | 756,637 | u091026689 | cpp |
p02953 | #include <bits/stdc++.h>
using namespace std;
#define EPS (1e-7)
#define INF (1e9)
#define PI (acos(-1))
typedef long long ll;
#define endl '\n'
int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};
const int MOD = 1000000007;
//////////////////////////////////////////
int n;
void Input() { cin >> n; }
void Solve() {
int a[n];
for (int i = 0; i < n; i++) {
cin >> a[i];
}
for (int i = n - 1; i > 0; i--) {
if (a[i - 1] == a[i] + 1)
a[i - 1]--;
else if (a[i - 1] > a[i]) {
cout << "NO" << endl;
return;
}
}
cout << "YES" << endl;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
Input();
Solve();
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define EPS (1e-7)
#define INF (1e9)
#define PI (acos(-1))
typedef long long ll;
#define endl '\n'
int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};
const int MOD = 1000000007;
//////////////////////////////////////////
int n;
void Input() { cin >> n; }
void Solve() {
int a[n];
for (int i = 0; i < n; i++) {
cin >> a[i];
}
for (int i = n - 1; i > 0; i--) {
if (a[i - 1] == a[i] + 1)
a[i - 1]--;
else if (a[i - 1] > a[i]) {
cout << "No" << endl;
return;
}
}
cout << "Yes" << endl;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
Input();
Solve();
return 0;
}
| [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 756,639 | 756,640 | u423831742 | cpp |
p02953 | #include <bits/stdc++.h>
using namespace std;
#define rep0(i, n) for (ll(i) = 0; (i) < (n); ++(i))
#define rrep0(i, n) for (ll(i) = (n)-1; (i) >= 0; --(i))
#define rep1(i, n) for (ll(i) = 1; (i) <= (n); ++(i))
#define rrep1(i, n) for (ll(i) = (n); (i) >= 1; --(i))
#define nfor(i, a, b) for (ll(i) = (a); (i) < (b); ++(i))
#define rfor(i, a, b) for (ll(i) = (a); (i) > (b); --(i))
#define ll long long
#define mod (1000000007)
#define YES cout << "YES" << endl;
#define Yes cout << "Yes" << endl;
#define yes cout << "yes" << endl;
#define NO cout << "NO" << endl;
#define No cout << "No" << endl;
#define no cout << "no" << endl;
#define all(x) (x).begin(), (x).end()
ll gcd(ll a, ll b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
ll lcm(ll a, ll b) {
ll g = gcd(a, b);
return a / g * b;
}
ll fac(ll n) {
ll t = 1;
rep1(i, n + 1) t *= i;
return t;
}
int main() {
int n;
cin >> n;
vector<ll> h(n);
rep0(i, n) cin >> h[i];
--h[0];
rep1(i, n - 1) {
if (h[i - 1] > h[i]) {
No;
return 0;
} else if (h[i - 1] < h[i])
--h[i];
}
yes;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define rep0(i, n) for (ll(i) = 0; (i) < (n); ++(i))
#define rrep0(i, n) for (ll(i) = (n)-1; (i) >= 0; --(i))
#define rep1(i, n) for (ll(i) = 1; (i) <= (n); ++(i))
#define rrep1(i, n) for (ll(i) = (n); (i) >= 1; --(i))
#define nfor(i, a, b) for (ll(i) = (a); (i) < (b); ++(i))
#define rfor(i, a, b) for (ll(i) = (a); (i) > (b); --(i))
#define ll long long
#define mod (1000000007)
#define YES cout << "YES" << endl;
#define Yes cout << "Yes" << endl;
#define yes cout << "yes" << endl;
#define NO cout << "NO" << endl;
#define No cout << "No" << endl;
#define no cout << "no" << endl;
#define all(x) (x).begin(), (x).end()
ll gcd(ll a, ll b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
ll lcm(ll a, ll b) {
ll g = gcd(a, b);
return a / g * b;
}
ll fac(ll n) {
ll t = 1;
rep1(i, n + 1) t *= i;
return t;
}
int main() {
int n;
cin >> n;
vector<ll> h(n);
rep0(i, n) cin >> h[i];
--h[0];
rep1(i, n - 1) {
if (h[i - 1] > h[i]) {
No;
return 0;
} else if (h[i - 1] < h[i])
--h[i];
}
Yes;
return 0;
}
| [
"identifier.change"
] | 756,643 | 756,644 | u801513186 | cpp |
p02953 | #include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int h[n + 1];
for (int i = 0; i < n; i++)
cin >> h[i];
int flag = 0;
for (int i = n - 1; i > 0; i--) {
if (h[i - 1] < h[i])
continue;
else if (h[i - 1] == h[i] + 1)
h[i - 1] = max(h[i - 1] - 1, 1);
else {
flag = 1;
break;
}
}
cout << (flag ? "No" : "Yes") << endl;
} | #include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int h[n + 1];
for (int i = 0; i < n; i++)
cin >> h[i];
int flag = 0;
for (int i = n - 1; i > 0; i--) {
if (h[i - 1] <= h[i])
continue;
else if (h[i - 1] == h[i] + 1)
h[i - 1] = max(h[i - 1] - 1, 1);
else {
flag = 1;
break;
}
}
cout << (flag ? "No" : "Yes") << endl;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 756,656 | 756,657 | u098923136 | cpp |
p02953 | #include <bits/stdc++.h>
using namespace std;
int n, a[123456], c;
int main() {
cin >> n >> a[0];
int m = a[0];
for (int i = 1; i < n; i++) {
cin >> a[i];
a[i] -= m;
if (a[i] < 0)
a[i] += 1;
m += a[i];
}
for (int i = 0; i < (n - 1); i++) {
if (a[i] < 0) { //ここ
if (c == 0)
cout << "No" << endl;
c++;
}
}
if (c == 0)
cout << "Yes" << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int n, a[123456], c;
int main() {
cin >> n >> a[0];
int m = a[0];
for (int i = 1; i < n; i++) {
cin >> a[i];
a[i] -= m;
if (a[i] < 0)
a[i] += 1;
m += a[i];
}
for (int i = 0; i < n; i++) {
if (a[i] < 0) { // why?
if (c == 0)
cout << "No" << endl;
c++;
}
}
if (c == 0)
cout << "Yes" << endl;
}
| [
"control_flow.loop.for.condition.change"
] | 756,660 | 756,661 | u477516105 | cpp |
p02953 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, a[100001];
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
int ok = 0;
for (int i = n; i >= 1; i--) {
if (a[i - 1] > a[i]) {
if (a[i - 1] - a[i] > 1) {
ok = 1;
break;
} else
a[i - 1]--;
}
}
if (ok == 0)
cout << "YES";
else
cout << "NO";
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n, a[100001];
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
int ok = 0;
for (int i = n; i >= 1; i--) {
if (a[i - 1] > a[i]) {
if (a[i - 1] - a[i] > 1) {
ok = 1;
break;
} else
a[i - 1]--;
}
}
if (ok == 0)
cout << "Yes";
else
cout << "No";
return 0;
}
| [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 756,675 | 756,676 | u638965820 | cpp |
p02953 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll inf = 100100100100100;
const ll mod = 1000000007;
int main() {
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; i++)
cin >> a.at(i);
for (int i = 0; i < n - 1; i++) {
if (a.at(i) <= a.at(i + 1))
a.at(i)--;
}
bool check = true;
int now = -1;
for (int i = 0; i < n; i++) {
if (now > a.at(i))
check = false;
now = a.at(i);
}
if (check)
cout << "Yes" << endl;
else
cout << "No" << endl;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll inf = 100100100100100;
const ll mod = 1000000007;
int main() {
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; i++)
cin >> a.at(i);
for (int i = 0; i < n - 1; i++) {
if (a.at(i) < a.at(i + 1))
a.at(i + 1)--;
}
bool check = true;
int now = -1;
for (int i = 0; i < n; i++) {
if (now > a.at(i))
check = false;
now = a.at(i);
}
if (check)
cout << "Yes" << endl;
else
cout << "No" << endl;
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 756,686 | 756,687 | u822169805 | cpp |
p02953 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
int main() {
int n;
cin >> n;
int h[100005];
rep(i, n) cin >> h[i];
bool flag = false;
for (int i = n - 1; i >= 1; i++) {
if (h[i - 1] - h[i] > 1) {
puts("No");
return 0;
}
if (h[i - 1] - h[i] == 1)
h[i - 1]--;
}
puts("Yes");
return 0;
}
| #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
int main() {
int n;
cin >> n;
int h[100005];
rep(i, n) cin >> h[i];
bool flag = false;
for (int i = n - 1; i >= 1; i--) {
if (h[i - 1] - h[i] > 1) {
puts("No");
return 0;
}
if (h[i - 1] - h[i] == 1)
h[i - 1]--;
}
puts("Yes");
return 0;
}
| [] | 756,699 | 756,700 | u620735210 | cpp |
p02953 | #include <bits/stdc++.h>
using namespace std;
int main() {
long long int a;
cin >> a;
long long int b[100010], c;
for (int i = 0; i < a; i++)
cin >> b[i];
c = 0;
for (int i = 0; i < a - 1; i++) {
if (b[i] > b[i + 1] + 1 || b[i] < c) {
cout << "No" << endl;
return 0;
}
else if (b[i] = b[i + 1] + 1) {
b[i]--;
c = max(c, b[i]);
}
}
cout << "Yes" << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
long long int a;
cin >> a;
long long int b[100010], c;
for (int i = 0; i < a; i++)
cin >> b[i];
c = 0;
for (int i = 0; i < a - 1; i++) {
if (b[i] > b[i + 1] + 1 || b[i + 1] < c) {
cout << "No" << endl;
return 0;
}
else if (b[i] == b[i + 1] + 1) {
b[i]--;
c = max(c, b[i]);
}
}
cout << "Yes" << endl;
}
| [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one",
"expression.operation.compare.replace.add",
"assignment.replace.remove",
"misc.typo"
] | 756,705 | 756,706 | u530329977 | cpp |
p02953 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define FOR(i, m, n) for (int(i) = (m); (i) < (n); (i)++)
#define All(v) (v).begin(), (v).end()
typedef long long ll;
int main() {
int N;
cin >> N;
vector<int> H(N);
rep(i, N) cin >> H[i];
for (int i = N - 1; i >= 0; i--) {
if (H[i + 1] < H[i])
H[i]--;
}
rep(i, N - 1) {
if (H[i + 1] < H[i]) {
cout << "No" << endl;
return 0;
}
}
cout << "Yes" << endl;
return 0;
} | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define FOR(i, m, n) for (int(i) = (m); (i) < (n); (i)++)
#define All(v) (v).begin(), (v).end()
typedef long long ll;
int main() {
int N;
cin >> N;
vector<int> H(N);
rep(i, N) cin >> H[i];
for (int i = N - 1; i >= 0; i--) {
if (H[i + 1] + 1 == H[i])
H[i]--;
}
rep(i, N - 1) {
if (H[i + 1] < H[i]) {
cout << "No" << endl;
return 0;
}
}
cout << "Yes" << endl;
return 0;
} | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 756,711 | 756,712 | u917282863 | cpp |
p02953 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
long a[n];
for (int i = 0; i < n; i++)
cin >> a[i];
if (n == 1)
cout << "Yes";
else {
for (int i = n; i > 0; i--) {
int x = a[i - 1] - a[i];
if (x <= 0)
continue;
else {
if (x > 1) {
cout << "No";
return 0;
} else
a[i - 1]--;
}
}
cout << "Yes";
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
long a[n];
for (int i = 0; i < n; i++)
cin >> a[i];
if (n == 1)
cout << "Yes";
else {
for (int i = n - 1; i > 0; i--) {
int x = a[i - 1] - a[i];
if (x <= 0)
continue;
else {
if (x > 1) {
cout << "No";
return 0;
} else
a[i - 1]--;
}
}
cout << "Yes";
}
return 0;
} | [
"control_flow.loop.for.initializer.change"
] | 756,715 | 756,716 | u166896158 | cpp |
p02953 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
long a[n];
for (int i = 0; i < n; i++)
cin >> a[i];
if (n == 1)
cout << "Yes";
else {
for (int i = n; i > 0; i++) {
int x = a[i - 1] - a[i];
if (x <= 0)
continue;
else {
if (x > 1) {
cout << "No";
return 0;
} else
a[i - 1]--;
}
}
cout << "Yes";
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
long a[n];
for (int i = 0; i < n; i++)
cin >> a[i];
if (n == 1)
cout << "Yes";
else {
for (int i = n - 1; i > 0; i--) {
int x = a[i - 1] - a[i];
if (x <= 0)
continue;
else {
if (x > 1) {
cout << "No";
return 0;
} else
a[i - 1]--;
}
}
cout << "Yes";
}
return 0;
} | [
"control_flow.loop.for.initializer.change"
] | 756,717 | 756,716 | u166896158 | cpp |
p02953 | #include <bits/stdc++.h>
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define forn(i, n) for (int i = 0; i < (int)(n); ++i)
#define for1(i, n) for (int i = 1; i <= (int)(n); ++i)
#define ford(i, n) for (int i = (int)(n)-1; i >= 0; --i)
#define fore(i, a, b) for (int i = (int)(a); i <= (int)(b); ++i)
using namespace std;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<pii> vpi;
typedef vector<vi> vvi;
typedef long long ll;
typedef vector<ll> vll;
typedef vector<vll> vvll;
typedef pair<ll, ll> pll;
typedef double ld;
template <class T> bool uin(T &a, T b) { return a > b ? (a = b, true) : false; }
template <class T> bool uax(T &a, T b) { return a < b ? (a = b, true) : false; }
int main() {
int n;
scanf("%d", &n);
int check;
bool ok = true;
scanf("%d", &check);
n--;
check--;
while (ok && n--) {
int input;
scanf("%d", &input);
if (input < check)
ok = false;
else
check = max(input, check - 1);
}
ok ? printf("%s", "Yes") : printf("%s", "No");
return 0;
} | #include <bits/stdc++.h>
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define forn(i, n) for (int i = 0; i < (int)(n); ++i)
#define for1(i, n) for (int i = 1; i <= (int)(n); ++i)
#define ford(i, n) for (int i = (int)(n)-1; i >= 0; --i)
#define fore(i, a, b) for (int i = (int)(a); i <= (int)(b); ++i)
using namespace std;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<pii> vpi;
typedef vector<vi> vvi;
typedef long long ll;
typedef vector<ll> vll;
typedef vector<vll> vvll;
typedef pair<ll, ll> pll;
typedef double ld;
template <class T> bool uin(T &a, T b) { return a > b ? (a = b, true) : false; }
template <class T> bool uax(T &a, T b) { return a < b ? (a = b, true) : false; }
int main() {
int n;
scanf("%d", &n);
int check;
bool ok = true;
scanf("%d", &check);
n--;
check--;
while (ok && n--) {
int input;
scanf("%d", &input);
if (input < check)
ok = false;
else
check = max(input - 1, check);
}
ok ? printf("%s", "Yes") : printf("%s", "No");
return 0;
} | [
"call.arguments.change",
"call.arguments.add"
] | 756,732 | 756,733 | u837233010 | cpp |
p02953 | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
#define int long long
#define endl "\n"
const long long INF = (long long)1e18;
const long long MOD = 1'000'000'007;
string yn(bool f) { return f ? "Yes" : "No"; }
string YN(bool f) { return f ? "YES" : "NO"; }
signed main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
cout << fixed << setprecision(10);
int N;
vector<int> H;
bool flag = true;
cin >> N;
H.resize(N);
for (int i = 0; i < N; i++) {
cin >> H[i];
}
for (int i = N - 2; i >= 0; i--) {
if (H[i - 1] + 1 < H[i]) {
cout << "No" << endl;
return 0;
} else if (H[i - 1] + 1 == H[i]) {
H[i]--;
}
}
cout << "Yes" << endl;
return 0;
} | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
#define int long long
#define endl "\n"
const long long INF = (long long)1e18;
const long long MOD = 1'000'000'007;
string yn(bool f) { return f ? "Yes" : "No"; }
string YN(bool f) { return f ? "YES" : "NO"; }
signed main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
cout << fixed << setprecision(10);
int N;
vector<int> H;
bool flag = true;
cin >> N;
H.resize(N);
for (int i = 0; i < N; i++) {
cin >> H[i];
}
for (int i = N - 2; i >= 0; i--) {
if (H[i + 1] + 1 < H[i]) {
cout << "No" << endl;
return 0;
} else if (H[i + 1] < H[i]) {
H[i]--;
}
// cout<<H[i]<<endl;
}
cout << "Yes" << endl;
return 0;
} | [
"misc.opposites",
"expression.operator.arithmetic.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 756,750 | 756,751 | u233393801 | cpp |
p02953 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
const int INF = 1001001001;
int main() {
int n;
cin >> n;
vector<int> h(n);
rep(i, n) cin >> h[i];
h[0]--;
int flag = 1;
rep(i, n - 1) {
if (h[i] < h[i + 1])
h[i + 1]--;
if (h[i] > h[i + 1])
flag = 0;
}
if (flag == 1)
cout << 'Yes' << endl;
else
cout << 'No' << endl;
return 0;
}
| #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
const int INF = 1001001001;
int main() {
int n;
cin >> n;
vector<int> h(n);
rep(i, n) cin >> h[i];
h[0]--;
int flag = 1;
rep(i, n - 1) {
if (h[i] < h[i + 1])
h[i + 1]--;
if (h[i] > h[i + 1])
flag = 0;
}
if (flag == 1)
cout << "Yes" << endl;
else
cout << "No" << endl;
return 0;
}
| [
"literal.string.change",
"io.output.change"
] | 756,752 | 756,753 | u405620865 | cpp |
p02953 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
int in() {
int x;
scanf("%d", &x);
return x;
}
static const int MAX = 100000;
int main() {
int N = in(), h[MAX], x = 0;
rep(i, N) h[i] = in();
rep(i, N - 1) {
if (h[i + 1] - h[i] == 1)
h[i + 1]--;
else if (h[i + 1] - h[i] > 1) {
cout << "No" << endl;
x = 1;
break;
}
}
if (x == 0)
cout << "Yes" << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
int in() {
int x;
scanf("%d", &x);
return x;
}
static const int MAX = 100000;
int main() {
int N = in(), h[MAX], x = 0;
rep(i, N) h[i] = in();
rep(i, N - 1) {
if (h[i + 1] - h[i] >= 1)
h[i + 1]--;
else if (h[i + 1] - h[i] <= -1) {
cout << "No" << endl;
x = 1;
break;
}
}
if (x == 0)
cout << "Yes" << endl;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 756,754 | 756,755 | u378125390 | cpp |
p02953 | #include <algorithm>
#include <assert.h>
#include <iostream>
#include <vector>
//#include <functional>
int main() {
int32_t N;
std::cin >> N;
int32_t cur = 0;
int32_t peak = 0;
for (int32_t i = 0; i < N; i++) {
std::cin >> cur;
if (peak - cur >= 2) {
std::cout << "No";
return 0;
}
peak = std::max(cur, peak);
}
std::cout << "yes";
return 0;
}
| #include <algorithm>
#include <assert.h>
#include <iostream>
#include <vector>
//#include <functional>
int main() {
int32_t N;
std::cin >> N;
int32_t cur = 0;
int32_t peak = 0;
for (int32_t i = 0; i < N; i++) {
std::cin >> cur;
if (peak - cur >= 2) {
std::cout << "No";
return 0;
}
peak = std::max(cur, peak);
}
std::cout << "Yes";
return 0;
}
| [
"literal.string.change",
"literal.string.case.change",
"expression.operation.binary.change"
] | 756,756 | 756,757 | u775900747 | cpp |
p02953 | #include <algorithm>
#include <functional>
#include <iostream>
#include <stdio.h>
#include <stdlib.h>
using namespace std;
int main() {
int N;
int n[100040];
int time = 0;
cin >> N;
for (int i = 0; i < N; i++) {
cin >> n[i];
}
if (N == 1) {
cout << "Yes";
} else {
for (int i = N - 1; i > 0; i--) {
if (n[i - 1] - 1 > n[i]) {
cout << "No";
} else if (n[i - 1] - 1 == n[i]) {
n[i - 1] = n[i - 1] - 1;
}
if (i == 1) {
cout << "Yes";
}
}
}
} | #include <algorithm>
#include <functional>
#include <iostream>
#include <stdio.h>
#include <stdlib.h>
using namespace std;
int main() {
int N;
int n[100040];
int time = 0;
cin >> N;
for (int i = 0; i < N; i++) {
cin >> n[i];
}
if (N == 1) {
cout << "Yes";
} else {
for (int i = N - 1; i > 0; i--) {
if (n[i - 1] - 1 > n[i]) {
cout << "No";
break;
} else if (n[i - 1] - 1 == n[i]) {
n[i - 1] = n[i - 1] - 1;
}
if (i == 1) {
cout << "Yes";
}
}
}
} | [
"control_flow.break.add"
] | 756,760 | 756,761 | u473116917 | cpp |
p02953 | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int n;
cin >> n;
vector<int> h(n);
for (int i = 0; i < n; i++) {
cin >> h.at(i);
}
for (int i = 0; i < n; i++) {
if (h.at(i) < h.at(i + 1)) {
h.at(i + 1) = h.at(i + 1) - 1;
}
}
for (int i = 0; i < n; i++) {
if (h.at(i) > h.at(i + 1)) {
cout << "No" << endl;
return 0;
}
}
cout << "Yes" << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main(void) {
int n;
cin >> n;
vector<int> h(n);
for (int i = 0; i < n; i++) {
cin >> h.at(i);
}
for (int i = 0; i < n - 1; i++) {
if (h.at(i) < h.at(i + 1)) {
h.at(i + 1) = h.at(i + 1) - 1;
}
}
for (int i = 0; i < n - 1; i++) {
if (h.at(i) > h.at(i + 1)) {
cout << "No" << endl;
return 0;
}
}
cout << "Yes" << endl;
return 0;
}
| [
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 756,772 | 756,773 | u707853565 | cpp |
p02953 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
if (N == 1) {
cout << "Yes" << endl;
return 0;
}
vector<long long> H(N);
for (int i = 0; i < N; i++)
cin >> H.at(i);
bool jdg = true;
for (int i = N - 1; i > 0; i++) {
if (H[i] < H[i - 1]) {
H[i - 1]--;
} else {
continue;
}
if (H[i] < H[i - 1]) {
jdg = false;
break;
}
}
if (jdg)
cout << "Yes" << endl;
else
cout << "No" << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
if (N == 1) {
cout << "Yes" << endl;
return 0;
}
vector<long long> H(N);
for (int i = 0; i < N; i++)
cin >> H.at(i);
bool jdg = true;
for (int i = N - 1; i > 0; i--) {
if (H[i] < H[i - 1]) {
H[i - 1]--;
} else {
continue;
}
if (H[i] < H[i - 1]) {
jdg = false;
break;
}
}
if (jdg)
cout << "Yes" << endl;
else
cout << "No" << endl;
} | [] | 756,786 | 756,787 | u615258936 | cpp |
p02953 | #include <algorithm>
#include <bits/stdc++.h>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <functional>
#include <iostream>
#include <map>
#include <math.h>
#include <memory>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <string>
#include <utility>
#include <vector>
#define REP(i, n) for (int i = 0; i != n; ++i)
#define REPR(i, n) for (int i = n - 1; i != -1; --i)
#define FOR(i, a, b) for (int i = a; i != b; ++i)
#define RBF(i, n) for (auto &i : n)
#define ABS(n) (n < 0 ? -n : n)
#define MIN(a, b) (a < b ? a : b)
#define MAX(a, b) (a > b ? a : b)
#define IN(n) (cin >> n)
#define OUT(n) (cout << n << "\n")
#define INF 1e9
#define ALL(v) (v).begin(), (v).end()
using namespace std;
using ll = long long;
int main() {
cin.tie(0);
ios::sync_with_stdio(false); // cinの高速化
int N;
IN(N);
vector<int> H(N);
REP(i, N) IN(H[i]);
string ans = "Yes";
for (int i = 1; i < N; ++i) {
if (H[i] - H[i - 1] == 1)
--H[i];
else if (H[i] - H[i - 1] < 0) {
ans = "No";
goto for_break;
}
}
for_break:
OUT(ans);
} | #include <algorithm>
#include <bits/stdc++.h>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <functional>
#include <iostream>
#include <map>
#include <math.h>
#include <memory>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <string>
#include <utility>
#include <vector>
#define REP(i, n) for (int i = 0; i != n; ++i)
#define REPR(i, n) for (int i = n - 1; i != -1; --i)
#define FOR(i, a, b) for (int i = a; i != b; ++i)
#define RBF(i, n) for (auto &i : n)
#define ABS(n) (n < 0 ? -n : n)
#define MIN(a, b) (a < b ? a : b)
#define MAX(a, b) (a > b ? a : b)
#define IN(n) (cin >> n)
#define OUT(n) (cout << n << "\n")
#define INF 1e9
#define ALL(v) (v).begin(), (v).end()
using namespace std;
using ll = long long;
int main() {
cin.tie(0);
ios::sync_with_stdio(false); // cinの高速化
ll N;
IN(N);
vector<ll> H(N);
REP(i, N) IN(H[i]);
string ans = "Yes";
for (int i = 1; i < N; ++i) {
if (H[i] - H[i - 1] > 0)
--H[i];
else if (H[i] - H[i - 1] < 0) {
ans = "No";
goto for_break;
}
}
for_break:
OUT(ans);
} | [
"variable_declaration.type.change",
"control_flow.loop.for.condition.change"
] | 756,792 | 756,793 | u431929942 | cpp |
p02953 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
string flag;
vector<int> vec(n);
for (int i = 0; i < n; i++) {
cin >> vec.at(i);
}
for (int i = n - 1; i >= 1; i--) {
cout << i;
if (vec.at(i) <= vec.at(i - 1) - 2) {
flag = "No";
break;
}
if (vec.at(i) == vec.at(i - 1) - 1) {
vec.at(i - 1) += -1;
}
}
if (flag == "No") {
cout << flag;
} else {
cout << "yes";
}
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
string flag;
vector<int> vec(n);
for (int i = 0; i < n; i++) {
cin >> vec.at(i);
}
for (int i = n - 1; i >= 1; i--) {
if (vec.at(i) <= vec.at(i - 1) - 2) {
flag = "No";
break;
}
if (vec.at(i) == vec.at(i - 1) - 1) {
vec.at(i - 1) += -1;
}
}
if (flag == "No") {
cout << flag;
} else {
cout << "Yes";
}
}
| [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 756,804 | 756,805 | u694859623 | cpp |
p02953 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define vct vector<ll>
#define umap map<ll, ll>
int main() {
ll n;
cin >> n;
ll ar[n];
for (ll i = 0; i < n; i++)
cin >> ar[i];
ll flg = 1;
ll mx = ar[n - 1];
for (ll i = n - 2; i >= 0; i--) {
ll cur = ar[i];
if (cur > mx) {
if ((cur - mx) > 1) {
flg = 0;
break;
}
} else {
mx = cur;
}
}
if (flg)
cout << "YES";
else
cout << "NO";
} | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define vct vector<ll>
#define umap map<ll, ll>
int main() {
ll n;
cin >> n;
ll ar[n];
for (ll i = 0; i < n; i++)
cin >> ar[i];
ll flg = 1;
ll mx = ar[n - 1];
for (ll i = n - 2; i >= 0; i--) {
ll cur = ar[i];
if (cur > mx) {
if ((cur - mx) > 1) {
flg = 0;
break;
}
} else {
mx = cur;
}
}
if (flg)
cout << "Yes";
else
cout << "No";
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 756,816 | 756,817 | u176464463 | cpp |
p02953 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int cur, nxt;
cin >> cur;
cur--;
int ar[n - 1];
for (int i = 0; i < n - 1; i++) {
cin >> ar[i];
}
for (int i = 0; i < n - 1; i++) {
nxt = ar[i];
if (cur > nxt) {
nxt--;
}
if (cur < nxt) {
cout << "No";
return 0;
}
cur = nxt;
}
cout << "Yes";
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int cur, nxt;
cin >> cur;
cur--;
int ar[n - 1];
for (int i = 0; i < n - 1; i++) {
cin >> ar[i];
}
for (int i = 0; i < n - 1; i++) {
nxt = ar[i];
if (nxt > cur) {
nxt--;
}
if (cur > nxt) {
cout << "No";
return 0;
}
cur = nxt;
}
cout << "Yes";
return 0;
} | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove",
"control_flow.branch.if.condition.change",
"misc.opposites",
"expression.operator.compare.change"
] | 756,818 | 756,819 | u176464463 | cpp |
p02953 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int64_t> H(n);
for (int i = 0; i < n; i++) {
cin >> H.at(i);
}
if (n == 1) {
cout << "Yes" << endl;
return 0;
}
for (int i = n - 1; i > 0; i--) {
if (H.at(i - 1) + 1 == H.at(i)) {
H.at(i - 1)--;
} else if (H.at(i - 1) + 1 > H.at(i)) {
cout << "No" << endl;
return 0;
}
}
cout << "Yes" << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int64_t> H(n);
for (int i = 0; i < n; i++) {
cin >> H.at(i);
}
if (n == 1) {
cout << "Yes" << endl;
return 0;
}
for (int i = n - 1; i > 0; i--) {
if (H.at(i - 1) - 1 == H.at(i)) {
H.at(i - 1)--;
} else if (H.at(i - 1) > H.at(i)) {
cout << "No" << endl;
return 0;
}
}
cout << "Yes" << endl;
}
| [
"misc.opposites",
"expression.operator.arithmetic.change",
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 756,823 | 756,824 | u596200441 | cpp |
p02953 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int64_t> H(n);
for (int i = 0; i < n; i++) {
cin >> H.at(i);
}
if (n == 1) {
cout << "Yes" << endl;
return 0;
}
for (int i = n - 1; i > 0; i--) {
if (H.at(i - 1) + 1 == H.at(i)) {
H.at(i - 1)--;
} else if (H.at(i - 1) > H.at(i)) {
cout << "No" << endl;
return 0;
}
}
cout << "Yes" << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int64_t> H(n);
for (int i = 0; i < n; i++) {
cin >> H.at(i);
}
if (n == 1) {
cout << "Yes" << endl;
return 0;
}
for (int i = n - 1; i > 0; i--) {
if (H.at(i - 1) - 1 == H.at(i)) {
H.at(i - 1)--;
} else if (H.at(i - 1) > H.at(i)) {
cout << "No" << endl;
return 0;
}
}
cout << "Yes" << endl;
}
| [
"misc.opposites",
"expression.operator.arithmetic.change",
"control_flow.branch.if.condition.change"
] | 756,825 | 756,824 | u596200441 | cpp |
p02953 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int64_t> H(n);
for (int i = 0; i < n; i++) {
cin >> H.at(i);
}
if (n == 1) {
cout << "Yes" << endl;
return 0;
}
for (int i = n; i > 0; i--) {
if (H.at(i - 1) + 1 == H.at(i)) {
H.at(i - 1)--;
} else if (H.at(i - 1) > H.at(i)) {
cout << "No" << endl;
return 0;
}
}
cout << "Yes" << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int64_t> H(n);
for (int i = 0; i < n; i++) {
cin >> H.at(i);
}
if (n == 1) {
cout << "Yes" << endl;
return 0;
}
for (int i = n - 1; i > 0; i--) {
if (H.at(i - 1) - 1 == H.at(i)) {
H.at(i - 1)--;
} else if (H.at(i - 1) > H.at(i)) {
cout << "No" << endl;
return 0;
}
}
cout << "Yes" << endl;
}
| [
"control_flow.loop.for.initializer.change",
"misc.opposites",
"expression.operator.arithmetic.change",
"control_flow.branch.if.condition.change"
] | 756,826 | 756,824 | u596200441 | cpp |
p02953 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> h(n);
for (int i = 0; i < n; i++) {
cin >> h.at(i);
}
for (int i = n - 1; i > 0; i--) {
if (h.at(i - 1) == h.at(i) - 1) {
h.at(i - 1) -= 1;
} else if (h.at(i - 1) > h.at(i)) {
cout << "No" << endl;
return 0;
}
}
cout << "Yes" << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> h(n);
for (int i = 0; i < n; i++) {
cin >> h.at(i);
}
for (int i = n - 1; i > 0; i--) {
if (h.at(i - 1) == h.at(i) + 1) {
h.at(i - 1) -= 1;
} else if (h.at(i - 1) > h.at(i)) {
cout << "No" << endl;
return 0;
}
}
cout << "Yes" << endl;
return 0;
} | [
"misc.opposites",
"expression.operator.arithmetic.change",
"control_flow.branch.if.condition.change"
] | 756,827 | 756,828 | u770009793 | cpp |
p02953 | #include <bits/stdc++.h>
using namespace std;
int main() {
long long N;
cin >> N;
vector<long long> H(N);
for (long long i = 0; i < N; i++) {
cin >> H[i];
}
string ans = "Yes";
for (long long i = 1; i < N; i++) {
if (H[i - 1] <= H[i]) {
H[i] -= 1;
}
}
for (long long i = 0; i < N - 1; i++) {
if (H[i] > H[i + 1]) {
ans = "No";
break;
}
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
long long N;
cin >> N;
vector<long long> H(N);
for (long long i = 0; i < N; i++) {
cin >> H[i];
}
string ans = "Yes";
for (long long i = 1; i < N; i++) {
if (H[i - 1] < H[i]) {
H[i] -= 1;
}
}
for (long long i = 0; i < N - 1; i++) {
if (H[i] > H[i + 1]) {
ans = "No";
break;
}
}
cout << ans << endl;
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 756,853 | 756,854 | u654055742 | cpp |
p02953 | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef long double ld;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
#define MOD 1000000007
#define INF (1e5)
#define PI (acos(-1))
#define print(x) cout << x << endl
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; }
typedef pair<ll, ll> P;
int main() {
ll N;
cin >> N;
vector<ll> H(N);
rep(i, N) { cin >> H[i]; }
for (ll i = N - 1; i > 0; i--) {
if (H[i] < H[i - 1] && H[i - 1] - H[i] == 1) {
H[i - 1]--;
} else {
cout << "No" << endl;
return 0;
}
}
cout << "Yes" << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef long double ld;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
#define MOD 1000000007
#define INF (1e5)
#define PI (acos(-1))
#define print(x) cout << x << endl
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; }
typedef pair<ll, ll> P;
int main() {
ll N;
cin >> N;
vector<ll> H(N);
rep(i, N) { cin >> H[i]; }
for (ll i = N - 1; i > 0; i--) {
if (H[i] < H[i - 1]) {
if (H[i - 1] - H[i] == 1) {
H[i - 1]--;
} else {
cout << "No" << endl;
return 0;
}
}
}
cout << "Yes" << endl;
return 0;
} | [
"control_flow.branch.if.condition.change",
"control_flow.branch.if.add"
] | 756,855 | 756,856 | u802905102 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.