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 |
|---|---|---|---|---|---|---|---|
p02958 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <queue>
#include <sstream>
#include <string>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> vNum(N, 0);
vector<int> vNumSort(N, 0);
for (int i = 0; i < N; i++) {
int setNum;
cin >> setNum;
vNum[i] = vNumSort[i] = setNum;
}
sort(vNumSort.begin(), vNumSort.end());
int wrongNum = 0;
for (int i = 0; i < N; i++) {
if (vNum[i] != vNumSort[i]) {
++wrongNum;
}
}
if (wrongNum % 2 == 0 || wrongNum == 0) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
return 0;
} | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <queue>
#include <sstream>
#include <string>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> vNum(N, 0);
vector<int> vNumSort(N, 0);
for (int i = 0; i < N; i++) {
int setNum;
cin >> setNum;
vNum[i] = vNumSort[i] = setNum;
}
sort(vNumSort.begin(), vNumSort.end());
int wrongNum = 0;
for (int i = 0; i < N; i++) {
if (vNum[i] != vNumSort[i]) {
++wrongNum;
}
}
if (wrongNum == 2 || wrongNum == 0) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
return 0;
} | [
"expression.operation.binary.remove",
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 765,251 | 765,252 | u376998218 | cpp |
p02958 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <queue>
#include <sstream>
#include <string>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> vNum(N, 0);
vector<int> vNumSort(N, 0);
for (int i = 0; i < N; i++) {
int setNum;
cin >> setNum;
vNum[i] = vNumSort[i] = setNum;
}
sort(vNumSort.begin(), vNumSort.end());
int wrongNum = 0;
for (int i = 0; i < N; i++) {
if (vNum[i] != vNumSort[i]) {
++wrongNum;
}
}
if (wrongNum / 2 == 0 || wrongNum == 0) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
return 0;
} | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <queue>
#include <sstream>
#include <string>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> vNum(N, 0);
vector<int> vNumSort(N, 0);
for (int i = 0; i < N; i++) {
int setNum;
cin >> setNum;
vNum[i] = vNumSort[i] = setNum;
}
sort(vNumSort.begin(), vNumSort.end());
int wrongNum = 0;
for (int i = 0; i < N; i++) {
if (vNum[i] != vNumSort[i]) {
++wrongNum;
}
}
if (wrongNum == 2 || wrongNum == 0) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
return 0;
} | [
"expression.operation.binary.remove",
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 765,253 | 765,252 | u376998218 | cpp |
p02958 | #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;
using ll = long long;
using pi = pair<int, int>;
constexpr ll mod = 1000000007;
void pPRINTl(ostream &ost) { ost << endl; }
template <class T> void pPRINTL(ostream &ost, T t) { ost << t << endl; }
template <class T, class... U> void pPRINTl(ostream &ost, T t, U... u) {
ost << t << " ";
pPRINTl(ost, u...);
}
template <class... T> void PRINTl(T... t) { pPRINTl(cout, t...); }
//#define PRINTl
void pPRINT(ostream &ost) {}
template <class T> void pPRINT(ostream &ost, T t) { ost << t << " "; }
template <class T, class... U> void pPRINT(ostream &ost, T t, U... u) {
ost << t << " ";
pPRINT(ost, u...);
}
template <class... T> void PRINT(T... t) { pPRINT(cout, t...); }
//#define PRINT
//#define DEBUG PRINTl("DEBUG line:",__LINE__)
#define DEBUG
constexpr ll MAX = 1e9;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll n;
cin >> n;
ll a[n];
REP(i, n) cin >> a[i];
bool f = false;
REP(i, n) {
ll truev = i + 1;
if (a[i] != truev) {
// PRINT(a[i]);DEBUG;
if (f == false) {
ll truei = a[i] - 1;
// PRINT(a[truei]);DEBUG;
if (a[truei] == truev) {
f = true;
a[truei] = a[i];
a[i] = truev;
DEBUG;
} else {
DEBUG;
PRINT("No");
return 0;
}
} else {
DEBUG;
PRINT("No");
return 0;
}
}
}
DEBUG;
PRINT("Yes");
return 0;
} | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define INF 2e9
#define ALL(v) v.begin(), v.end()
using namespace std;
using ll = long long;
using pi = pair<int, int>;
constexpr ll mod = 1000000007;
void pPRINTl(ostream &ost) { ost << endl; }
template <class T> void pPRINTL(ostream &ost, T t) { ost << t << endl; }
template <class T, class... U> void pPRINTl(ostream &ost, T t, U... u) {
ost << t << " ";
pPRINTl(ost, u...);
}
template <class... T> void PRINTl(T... t) { pPRINTl(cout, t...); }
//#define PRINTl
void pPRINT(ostream &ost) {}
template <class T> void pPRINT(ostream &ost, T t) { ost << t << " "; }
template <class T, class... U> void pPRINT(ostream &ost, T t, U... u) {
ost << t << " ";
pPRINT(ost, u...);
}
template <class... T> void PRINT(T... t) { pPRINT(cout, t...); }
//#define PRINT
//#define DEBUG PRINTl("DEBUG line:",__LINE__)
#define DEBUG
constexpr ll MAX = 1e9;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll n;
cin >> n;
ll a[n];
REP(i, n) cin >> a[i];
bool f = false;
REP(i, n) {
ll truev = i + 1;
if (a[i] != truev) {
// PRINT(a[i]);DEBUG;
if (f == false) {
ll truei = a[i] - 1;
// PRINT(a[truei]);DEBUG;
if (a[truei] == truev) {
f = true;
a[truei] = a[i];
a[i] = truev;
DEBUG;
} else {
DEBUG;
PRINT("NO");
return 0;
}
} else {
DEBUG;
PRINT("NO");
return 0;
}
}
}
DEBUG;
PRINT("YES");
return 0;
} | [
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 765,256 | 765,257 | u752288070 | cpp |
p02958 | #include <bits/stdc++.h>
#define ll long long
#define lb long double
#define FOR(i, n) for (int i = 0; i < n; i++)
#define DEBUG(x) cout << x
#define RUN \
ios_base::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0);
#define pb push_back
using namespace std;
// Solve
bool flag = 0;
void Solve() {
ll n;
cin >> n;
ll a[n], b[n];
FOR(i, n) {
cin >> a[i];
b[i] == a[i];
}
sort(b, b + n);
ll cnt = 0;
FOR(i, n) {
if (b[i] != a[i])
cnt++;
}
if (cnt == 2 || cnt == 0)
flag = 1;
}
int main() {
RUN;
Solve();
if (flag == 0)
DEBUG("YES");
else
DEBUG("NO");
return 0;
} | #include <bits/stdc++.h>
#define ll long long
#define lb long double
#define FOR(i, n) for (int i = 0; i < n; i++)
#define DEBUG(x) cout << x
#define RUN \
ios_base::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0);
#define pb push_back
using namespace std;
// Solve
bool flag = 0;
void Solve() {
ll n;
cin >> n;
ll a[n], b[n];
FOR(i, n) {
cin >> a[i];
b[i] = a[i];
}
sort(b, b + n);
ll cnt = 0;
FOR(i, n) {
if (b[i] != a[i])
cnt++;
}
if (cnt == 2 || cnt == 0)
flag = 1;
}
int main() {
RUN;
Solve();
if (flag == 1)
DEBUG("YES");
else
DEBUG("NO");
return 0;
} | [
"expression.operation.compare.replace.remove",
"assignment.replace.add",
"misc.typo",
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 765,269 | 765,270 | u494803454 | cpp |
p02958 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, count = 0;
cin >> n;
vector<int> vec1(n, 0);
vector<int> vec2(n, 0);
for (int i = 0; i < n; i++) {
cin >> vec1.at(i);
vec2.at(i) = n - i;
if (vec1.at(i) != vec2.at(i))
count++;
}
if (count == 2 || count == 0)
cout << "YES" << endl;
else
cout << "NO" << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, count = 0;
cin >> n;
vector<int> vec1(n, 0);
vector<int> vec2(n, 0);
for (int i = 0; i < n; i++) {
cin >> vec1.at(i);
vec2.at(i) = i + 1;
if (vec1.at(i) != vec2.at(i))
count++;
}
if (count == 2 || count == 0)
cout << "YES" << endl;
else
cout << "NO" << endl;
} | [
"expression.operation.binary.remove",
"assignment.change"
] | 765,286 | 765,287 | u192280767 | cpp |
p02958 | #include <bits/stdc++.h>
using namespace std;
int N;
vector<int> P;
bool isSorted() {
for (int i = 1; i < N; ++i) {
if (P[i - 1] > P[i]) {
return false;
}
}
return true;
}
int main() {
cin >> N;
P.resize(N);
for (int i = 0; i < N; ++i) {
cin >> P[i];
}
if (isSorted()) {
cout << "Yes" << endl;
return 0;
}
for (int i = 0; i < N; ++i) {
for (int j = i + 1; j < N; ++j) {
swap(P[i], P[j]);
if (isSorted()) {
cout << "Yes" << endl;
return 0;
}
swap(P[i], P[j]);
}
}
cout << "No" << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int N;
vector<int> P;
bool isSorted() {
for (int i = 1; i < N; ++i) {
if (P[i - 1] > P[i]) {
return false;
}
}
return true;
}
int main() {
cin >> N;
P.resize(N);
for (int i = 0; i < N; ++i) {
cin >> P[i];
}
if (isSorted()) {
cout << "YES" << endl;
return 0;
}
for (int i = 0; i < N; ++i) {
for (int j = i + 1; j < N; ++j) {
swap(P[i], P[j]);
if (isSorted()) {
cout << "YES" << endl;
return 0;
}
swap(P[i], P[j]);
}
}
cout << "NO" << endl;
return 0;
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 765,294 | 765,295 | u159619403 | cpp |
p02958 | #include <bits/stdc++.h>
using namespace std;
const int N = 110;
int n, a[N];
int main() {
scanf("%d", &n);
int ans = 0;
for (int i = 1; i <= n; i++) {
scanf("%d", &a[i]);
if (a[i] == i)
continue;
else
ans++;
}
if (ans == 2)
printf("YES\n");
else
printf("NO\n");
return 0;
} | #include <bits/stdc++.h>
using namespace std;
const int N = 110;
int n, a[N];
int main() {
scanf("%d", &n);
int ans = 0;
for (int i = 1; i <= n; i++) {
scanf("%d", &a[i]);
if (a[i] == i)
continue;
else
ans++;
}
if (ans == 2 || ans == 0)
printf("YES\n");
else
printf("NO\n");
return 0;
} | [
"control_flow.branch.if.condition.change"
] | 765,296 | 765,297 | u962383502 | cpp |
p02958 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
scanf("%d", &n);
int cnt = 0;
for (int i = 1; i <= n; i++) {
int t;
scanf("%d", &t);
if (t != i)
cnt++;
}
if (cnt <= 1)
printf("YES");
else
printf("NO");
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
scanf("%d", &n);
int cnt = 0;
for (int i = 1; i <= n; i++) {
int t;
scanf("%d", &t);
if (t != i)
cnt++;
}
if (cnt <= 2)
printf("YES");
else
printf("NO");
return 0;
} | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 765,298 | 765,299 | u098251832 | cpp |
p02958 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> p(N);
for (auto &k : p)
cin >> k;
int check = 0;
for (int i = 0; i < N; i++) {
if (p[i] != i)
check++;
}
if (check == 2 || check == 0)
cout << "YES" << endl;
else
cout << "NO" << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> p(N);
for (auto &k : p)
cin >> k;
int check = 0;
for (int i = 0; i < N; i++) {
if (p[i] != i + 1)
check++;
}
if (check == 2 || check == 0)
cout << "YES" << endl;
else
cout << "NO" << endl;
} | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 765,304 | 765,305 | u507188501 | cpp |
p02958 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> p(n);
for (int i = 0; i < n; i++) {
cin >> p.at(i);
}
vector<int> a(n);
for (int i = 1; i <= n; i++) {
a.at(i) = i;
}
int cnt = 0;
for (int i = 0; i < n; i++) {
if (a.at(i) != p.at(i))
cnt++;
}
if (cnt <= 2)
cout << "YES" << endl;
else
cout << "NO" << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> p(n);
for (int i = 0; i < n; i++) {
cin >> p.at(i);
}
vector<int> a(n);
for (int i = 0; i < n; i++) {
a.at(i) = i + 1;
}
int cnt = 0;
for (int i = 0; i < n; i++) {
if (a.at(i) != p.at(i))
cnt++;
}
if (cnt <= 2)
cout << "YES" << endl;
else
cout << "NO" << endl;
}
| [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"assignment.change"
] | 765,306 | 765,307 | u653482689 | cpp |
p02958 | #include <bits/stdc++.h>
using namespace std;
#define watch(x) cout << (#x) << " is " << (x) << endl
#define fast \
ios_base::sync_with_stdio(false); \
cin.tie(NULL);
#define openfile \
freopen("input.txt", "r", stdin); \
freopen("output.txt", "w", stdout);
#define FOR(n) for (int i(0); i < n; ++i)
#define ASC(i, a, b) for (int i(a); i <= b; ++i)
#define DESC(i, a, b) for (int i(a); i >= b; i--)
#define WL(t) while (t--)
#define SZ(a) int((a).size())
#define PB push_back
#define MP make_pair
#define FF first
#define SS second
#define BB begin()
#define EE end()
#define all(c) c.BB, c.EE
#define present(container, element) (container.find(element) != container.end())
// ^^for set,map etc
#define cpresent(container, element) \
(find(all(container), element) != container.end())
// for vector,array etc
#define tr(container, it) \
for (auto it = container.begin(); it != container.end(); it++)
#define gcd(a, b) __gcd((a), (b))
#define lcm(a, b) ((a) * (b)) / gcd((a), (b))
typedef long long LL;
typedef long double LD;
typedef vector<int> vi;
typedef vector<LL> vl;
typedef map<char, int> mci;
typedef pair<int, int> pii;
typedef map<int, pii> ipii;
const float INF = numeric_limits<float>::infinity();
const int MOD = 1e9 + 7;
const double PI = 3.14159265358979323846264338;
const LL big = 998244353;
#ifdef _DEBUG
freopen(input.txt, "r", stdin);
freopen(output.txt, "w", stdout);
#endif
int nC2(int n) { return (n * (n - 1)) / 2; }
int main() {
int n, cnt = 0;
cin >> n;
int arr[n];
FOR(n) {
cin >> arr[i];
if (arr[i] != (i + 1))
cnt++;
}
if (cnt == 2) {
cout << "YES";
} else {
cout << "NO";
}
} | #include <bits/stdc++.h>
using namespace std;
#define watch(x) cout << (#x) << " is " << (x) << endl
#define fast \
ios_base::sync_with_stdio(false); \
cin.tie(NULL);
#define openfile \
freopen("input.txt", "r", stdin); \
freopen("output.txt", "w", stdout);
#define FOR(n) for (int i(0); i < n; ++i)
#define ASC(i, a, b) for (int i(a); i <= b; ++i)
#define DESC(i, a, b) for (int i(a); i >= b; i--)
#define WL(t) while (t--)
#define SZ(a) int((a).size())
#define PB push_back
#define MP make_pair
#define FF first
#define SS second
#define BB begin()
#define EE end()
#define all(c) c.BB, c.EE
#define present(container, element) (container.find(element) != container.end())
// ^^for set,map etc
#define cpresent(container, element) \
(find(all(container), element) != container.end())
// for vector,array etc
#define tr(container, it) \
for (auto it = container.begin(); it != container.end(); it++)
#define gcd(a, b) __gcd((a), (b))
#define lcm(a, b) ((a) * (b)) / gcd((a), (b))
typedef long long LL;
typedef long double LD;
typedef vector<int> vi;
typedef vector<LL> vl;
typedef map<char, int> mci;
typedef pair<int, int> pii;
typedef map<int, pii> ipii;
const float INF = numeric_limits<float>::infinity();
const int MOD = 1e9 + 7;
const double PI = 3.14159265358979323846264338;
const LL big = 998244353;
#ifdef _DEBUG
freopen(input.txt, "r", stdin);
freopen(output.txt, "w", stdout);
#endif
int nC2(int n) { return (n * (n - 1)) / 2; }
int main() {
int n, cnt = 0;
cin >> n;
int arr[n];
FOR(n) {
cin >> arr[i];
if (arr[i] != (i + 1))
cnt++;
}
if (cnt <= 2) {
cout << "YES";
} else {
cout << "NO";
}
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 765,314 | 765,315 | u544532249 | cpp |
p02958 | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n, c = 0, i;
cin >> n;
long long a[n], b[n];
for (i = 0; i < n; i++) {
cin >> a[i];
b[i] = a[i];
}
sort(b, b + n);
for (i = 0; i < n; i++) {
if (a[i] == b[i])
c++;
}
if (c == n - 2)
cout << "YES" << endl;
else
cout << "NO" << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
long long n, c = 0, i;
cin >> n;
long long a[n], b[n];
for (i = 0; i < n; i++) {
cin >> a[i];
b[i] = a[i];
}
sort(b, b + n);
for (i = 0; i < n; i++) {
if (a[i] == b[i])
c++;
}
if (c == n - 2 || c == n)
cout << "YES" << endl;
else
cout << "NO" << endl;
}
| [
"control_flow.branch.if.condition.change"
] | 765,318 | 765,319 | u304756372 | cpp |
p02958 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
scanf("%d", &n);
int cont = 0;
for (int i = 1; i <= n; i++) {
int x;
scanf("%d", &x);
if (x == i)
cont++;
}
if (cont <= 2)
puts("YES");
else
puts("NO");
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
scanf("%d", &n);
int cont = 0;
for (int i = 1; i <= n; i++) {
int x;
scanf("%d", &x);
if (x != i)
cont++;
}
if (cont <= 2)
puts("YES");
else
puts("NO");
}
| [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 765,322 | 765,323 | u100131109 | cpp |
p02958 | #include <bits/stdc++.h>
#include <cmath>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> p(N);
for (int i = 1; i < N + 1; i++) {
cin >> p.at(i - 1);
}
int count = 0;
for (int i = 1; i < N + 1; i++) {
if (p.at(i - 1) == i) {
count++;
}
}
if (count == N or count == N - 1) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
} | #include <bits/stdc++.h>
#include <cmath>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> p(N);
for (int i = 1; i < N + 1; i++) {
cin >> p.at(i - 1);
}
int count = 0;
for (int i = 1; i < N + 1; i++) {
if (p.at(i - 1) == i) {
count++;
}
}
if (count == N or count == N - 2) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
} | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 765,326 | 765,327 | u944905289 | cpp |
p02958 | #include <iostream>
using namespace std;
int main() {
int n, count = 0;
cin >> n;
for (int i = 0, num; i < n; i++) {
cin >> num;
count += (i != num);
}
cout << (count == 0 || count == 2) ? "YES" : "NO";
return 0;
} | #include <iostream>
using namespace std;
int main() {
int n, count = 0;
cin >> n;
for (int i = 0, num; i < n; i++) {
cin >> num;
count += (i + 1 != num);
}
cout << ((count == 0 || count == 2) ? "YES" : "NO");
return 0;
} | [
"assignment.change"
] | 765,328 | 765,329 | u930860452 | cpp |
p02958 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, tem, p[51], ans = 0;
bool flg;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> p[i];
}
for (int k = 0; k < n; k++) {
// cout<<p[k]<<" ";
if (p[k] != k + 1)
flg = false;
}
if (flg) {
ans = 1;
// cout<<"YES"<<endl;
}
for (int i = 0; i < n; i++) {
for (int j = i + 1; j < n; j++) {
tem = p[j];
p[j] = p[i];
p[i] = tem;
flg = true;
for (int k = 0; k < n; k++) {
// cout<<p[k]<<" ";
if (p[k] != k + 1)
flg = false;
}
if (flg) {
ans = 1;
// cout<<"YES"<<endl;
}
// else cout<<"NO"<<endl;
tem = p[j];
p[j] = p[i];
p[i] = tem;
}
}
cout << ((ans == 1) ? "YES" : "NO") << endl;
;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n, tem, p[51], ans = 0;
bool flg = true;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> p[i];
}
for (int k = 0; k < n; k++) {
// cout<<p[k]<<" ";
if (p[k] != k + 1)
flg = false;
}
if (flg) {
ans = 1;
// cout<<"YES"<<endl;
}
for (int i = 0; i < n; i++) {
for (int j = i + 1; j < n; j++) {
tem = p[j];
p[j] = p[i];
p[i] = tem;
flg = true;
for (int k = 0; k < n; k++) {
// cout<<p[k]<<" ";
if (p[k] != k + 1)
flg = false;
}
if (flg) {
ans = 1;
// cout<<"YES"<<endl;
}
// else cout<<"NO"<<endl;
tem = p[j];
p[j] = p[i];
p[i] = tem;
}
}
cout << ((ans == 1) ? "YES" : "NO") << endl;
;
}
| [
"variable_declaration.value.change"
] | 765,336 | 765,337 | u244391385 | cpp |
p02958 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> p(n), q(n);
for (int i = 0; i < n; ++i) {
cin >> p[i];
q[i] = p[i];
}
sort(p.begin(), p.end());
int cnt = 0;
for (int i = 0; i < n; ++i) {
cnt += p[i] != q[i];
}
if (cnt < 2) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> p(n), q(n);
for (int i = 0; i < n; ++i) {
cin >> p[i];
q[i] = p[i];
}
sort(p.begin(), p.end());
int cnt = 0;
for (int i = 0; i < n; ++i) {
cnt += p[i] != q[i];
}
if (cnt <= 2) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
return 0;
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 765,339 | 765,340 | u005469124 | cpp |
p02958 | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <stack>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <vector>
using namespace std;
#define rep(i, s) for (int i = 0; i < s; ++i)
#define all(v) (v.begin(), v.end())
#define COUT(x) cout << #x << " = " << (x) << " (L" << __LINE__ << ")" << endl
#define EACH(i, s) \
for (__typeof__((s).begin()) i = (s).begin(); i != (s).end(); ++i)
#define VEC(a, n) vector<int> a(n)
#define PQ(a) priority_queue<int> a
#define PQmin(a) priority_queue<int, : vector<int>, greater<int>> a
#define PAIR pair<int, int>
/*
sort(sp.begin(), sp.end(), [](PAIR l, PAIR r){
return l.first<r.first || (l.first==r.first && l.second > r.second);
});
*/
typedef long long ll;
#define EPS (1e-7)
#define INF (1e9)
#define PI (acos(-1))
// int main() {
// int n;
// cin>>n;
// vector<int>p(n);
// vector<int>q(n);
// for(int i=0;i<n;i++){
// cin>>p.at(i);
// q.at(i)=p.at(i);
// }
// sort(q.begin(),q.end());
// int ans=0;
// for(int i=0;i<n;i++){
// if(q.at(i)!=p.at(i)){
// ans++;
// }
// }
// if(ans==0 || ans==2){
// cout<<"YES"<<endl;
// }
// else{
// cout<<"NO"<<endl;
// }
// return 0;
// }
int main() {
int n, tem, p[51], ans = 0;
bool flg;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> p[i];
}
for (int k = 0; k < n; k++) {
// cout<<p[k]<<" ";
if (p[k] != k + 1)
flg = false;
}
if (flg) {
ans = 1;
cout << "YES" << endl;
return 0;
}
for (int i = 0; i < n; i++) {
for (int j = i + 1; j < n; j++) {
tem = p[j];
p[j] = p[i];
p[i] = tem;
flg = true;
for (int k = 0; k < n; k++) {
// cout<<p[k]<<" ";
if (p[k] != k + 1)
flg = false;
}
if (flg) {
ans = 1;
// cout<<"YES"<<endl;
}
// else cout<<"NO"<<endl;
tem = p[j];
p[j] = p[i];
p[i] = tem;
}
}
cout << ((ans == 1) ? "YES" : "NO") << endl;
;
} | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <stack>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <vector>
using namespace std;
#define rep(i, s) for (int i = 0; i < s; ++i)
#define all(v) (v.begin(), v.end())
#define COUT(x) cout << #x << " = " << (x) << " (L" << __LINE__ << ")" << endl
#define EACH(i, s) \
for (__typeof__((s).begin()) i = (s).begin(); i != (s).end(); ++i)
#define VEC(a, n) vector<int> a(n)
#define PQ(a) priority_queue<int> a
#define PQmin(a) priority_queue<int, : vector<int>, greater<int>> a
#define PAIR pair<int, int>
/*
sort(sp.begin(), sp.end(), [](PAIR l, PAIR r){
return l.first<r.first || (l.first==r.first && l.second > r.second);
});
*/
typedef long long ll;
#define EPS (1e-7)
#define INF (1e9)
#define PI (acos(-1))
// int main() {
// int n;
// cin>>n;
// vector<int>p(n);
// vector<int>q(n);
// for(int i=0;i<n;i++){
// cin>>p.at(i);
// q.at(i)=p.at(i);
// }
// sort(q.begin(),q.end());
// int ans=0;
// for(int i=0;i<n;i++){
// if(q.at(i)!=p.at(i)){
// ans++;
// }
// }
// if(ans==0 || ans==2){
// cout<<"YES"<<endl;
// }
// else{
// cout<<"NO"<<endl;
// }
// return 0;
// }
int main() {
int n, tem, p[51], ans = 0;
bool flg = true;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> p[i];
}
for (int k = 0; k < n; k++) {
// cout<<p[k]<<" ";
if (p[k] != k + 1)
flg = false;
}
if (flg) {
ans = 1;
cout << "YES" << endl;
return 0;
}
for (int i = 0; i < n; i++) {
for (int j = i + 1; j < n; j++) {
tem = p[j];
p[j] = p[i];
p[i] = tem;
flg = true;
for (int k = 0; k < n; k++) {
// cout<<p[k]<<" ";
if (p[k] != k + 1)
flg = false;
}
if (flg) {
ans = 1;
// cout<<"YES"<<endl;
}
// else cout<<"NO"<<endl;
tem = p[j];
p[j] = p[i];
p[i] = tem;
}
}
cout << ((ans == 1) ? "YES" : "NO") << endl;
;
}
| [
"variable_declaration.value.change"
] | 765,341 | 765,342 | u275934251 | cpp |
p02958 | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <stack>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <vector>
using namespace std;
#define rep(i, s) for (int i = 0; i < s; ++i)
#define all(v) (v.begin(), v.end())
#define COUT(x) cout << #x << " = " << (x) << " (L" << __LINE__ << ")" << endl
#define EACH(i, s) \
for (__typeof__((s).begin()) i = (s).begin(); i != (s).end(); ++i)
#define VEC(a, n) vector<int> a(n)
#define PQ(a) priority_queue<int> a
#define PQmin(a) priority_queue<int, : vector<int>, greater<int>> a
#define PAIR pair<int, int>
/*
sort(sp.begin(), sp.end(), [](PAIR l, PAIR r){
return l.first<r.first || (l.first==r.first && l.second > r.second);
});
*/
typedef long long ll;
#define EPS (1e-7)
#define INF (1e9)
#define PI (acos(-1))
// int main() {
// int n;
// cin>>n;
// vector<int>p(n);
// vector<int>q(n);
// for(int i=0;i<n;i++){
// cin>>p.at(i);
// q.at(i)=p.at(i);
// }
// sort(q.begin(),q.end());
// int ans=0;
// for(int i=0;i<n;i++){
// if(q.at(i)!=p.at(i)){
// ans++;
// }
// }
// if(ans==0 || ans==2){
// cout<<"YES"<<endl;
// }
// else{
// cout<<"NO"<<endl;
// }
// return 0;
// }
int main() {
int n, tem, p[51], ans = 0;
bool flg;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> p[i];
}
for (int k = 0; k < n; k++) {
// cout<<p[k]<<" ";
if (p[k] != k + 1)
flg = false;
}
if (flg) {
ans = 1;
cout << "YES" << endl;
return 0;
}
for (int i = 0; i < n; i++) {
for (int j = i + 1; j < n; j++) {
tem = p[j];
p[j] = p[i];
p[i] = tem;
flg = true;
for (int k = 0; k < n; k++) {
// cout<<p[k]<<" ";
if (p[k] != k + 1)
flg = false;
}
if (flg) {
ans = 1;
// cout<<"YES"<<endl;
}
// else cout<<"NO"<<endl;
tem = p[j];
p[j] = p[i];
p[i] = tem;
}
}
cout << ((ans == 1) ? "YES" : "NO") << endl;
;
} | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <stack>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <vector>
using namespace std;
#define rep(i, s) for (int i = 0; i < s; ++i)
#define all(v) (v.begin(), v.end())
#define COUT(x) cout << #x << " = " << (x) << " (L" << __LINE__ << ")" << endl
#define EACH(i, s) \
for (__typeof__((s).begin()) i = (s).begin(); i != (s).end(); ++i)
#define VEC(a, n) vector<int> a(n)
#define PQ(a) priority_queue<int> a
#define PQmin(a) priority_queue<int, : vector<int>, greater<int>> a
#define PAIR pair<int, int>
/*
sort(sp.begin(), sp.end(), [](PAIR l, PAIR r){
return l.first<r.first || (l.first==r.first && l.second > r.second);
});
*/
typedef long long ll;
#define EPS (1e-7)
#define INF (1e9)
#define PI (acos(-1))
// int main() {
// int n;
// cin>>n;
// vector<int>p(n);
// vector<int>q(n);
// for(int i=0;i<n;i++){
// cin>>p.at(i);
// q.at(i)=p.at(i);
// }
// sort(q.begin(),q.end());
// int ans=0;
// for(int i=0;i<n;i++){
// if(q.at(i)!=p.at(i)){
// ans++;
// }
// }
// if(ans==0 || ans==2){
// cout<<"YES"<<endl;
// }
// else{
// cout<<"NO"<<endl;
// }
// return 0;
// }
int main() {
int n, tem, p[51], ans = 0;
bool flg = true;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> p[i];
}
for (int k = 0; k < n; k++) {
// cout<<p[k]<<" ";
if (p[k] != k + 1)
flg = false;
}
if (flg) {
ans = 1;
cout << "YES" << endl;
return 0;
}
for (int i = 0; i < n; i++) {
for (int j = i + 1; j < n; j++) {
tem = p[j];
p[j] = p[i];
p[i] = tem;
flg = true;
for (int k = 0; k < n; k++) {
// cout<<p[k]<<" ";
if (p[k] != k + 1)
flg = false;
}
if (flg) {
ans = 1;
// cout<<"YES"<<endl;
}
// else cout<<"NO"<<endl;
tem = p[j];
p[j] = p[i];
p[i] = tem;
}
}
cout << ((ans == 1) ? "YES" : "NO") << endl;
} | [
"variable_declaration.value.change"
] | 765,341 | 765,343 | u275934251 | cpp |
p02958 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
vector<int> p(N);
int c = 0;
for (int i = 0; i < N; i++) {
cin >> p.at(i);
if (p.at(i) != i + 1) {
c++;
}
}
if (c <= 2) {
cout << "YES\n";
} else {
cout << "NO\n";
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> p(N);
int c = 0;
for (int i = 0; i < N; i++) {
cin >> p.at(i);
if (p.at(i) != i + 1) {
c++;
}
}
if (c <= 2) {
cout << "YES\n";
} else {
cout << "NO\n";
}
}
| [] | 765,346 | 765,347 | u602544363 | cpp |
p02958 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <regex>
#include <set>
#include <string>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
int p[50] = {};
int P[50] = {};
for (int i = 0; i < N; i++) {
cin >> p[i];
P[i] = p[i];
}
sort(P, P + N);
int cnt = 0;
for (int i = 0; i < N; i++) {
if (P[i] != p[i]) {
cnt++;
}
}
if (cnt > 2 || cnt == 0) {
cout << "NO" << endl;
} else {
cout << "YES" << endl;
}
return 0;
}
| #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <regex>
#include <set>
#include <string>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
int p[50] = {};
int P[50] = {};
for (int i = 0; i < N; i++) {
cin >> p[i];
P[i] = p[i];
}
sort(P, P + N);
int cnt = 0;
for (int i = 0; i < N; i++) {
if (P[i] != p[i]) {
cnt++;
}
}
if (cnt > 2 || cnt == 1) {
cout << "NO" << endl;
} else {
cout << "YES" << endl;
}
return 0;
}
| [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 765,348 | 765,349 | u451206510 | cpp |
p02958 | #include <bits/stdc++.h>
using namespace std;
const int MAX_N = 100001;
int main() {
int N, a;
int b[MAX_N];
a = 0;
cin >> N;
for (int i = 0; i < N; i++) {
scanf("%d", &b[i]);
}
for (int i = 0; i < N; i++) {
if (b[i] != i + 1) {
a += 1;
}
}
printf((a < 3) ? "Yes\n" : "No\n");
} | #include <bits/stdc++.h>
using namespace std;
const int MAX_N = 100001;
int main() {
int N, a;
int b[MAX_N];
a = 0;
cin >> N;
for (int i = 0; i < N; i++) {
scanf("%d", &b[i]);
}
for (int i = 0; i < N; i++) {
if (b[i] != i + 1) {
a += 1;
}
}
printf((a < 3) ? "YES\n" : "NO\n");
} | [
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 765,350 | 765,351 | u336489291 | cpp |
p02958 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> v(n);
vector<int> c(n);
for (int i = 0; i < n; i++) {
cin >> v[i];
c[i] = v[i];
}
int cnt = 0;
sort(v.begin(), v.end());
for (int i = 0; i < n; i++) {
if (v[i] != c[i])
cnt++;
}
if (cnt > 2)
cout << "No";
else
cout << "Yes";
}
| #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> v(n);
vector<int> c(n);
for (int i = 0; i < n; i++) {
cin >> v[i];
c[i] = v[i];
}
int cnt = 0;
sort(v.begin(), v.end());
for (int i = 0; i < n; i++) {
if (v[i] != c[i])
cnt++;
}
if (cnt > 2)
cout << "NO";
else
cout << "YES";
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 765,352 | 765,353 | u765789766 | cpp |
p02958 | #include <algorithm>
#include <iostream>
#include <tuple>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> P(N);
for (auto &p : P)
cin >> p;
auto test = [&]() {
for (int i = 0; i < N; i++) {
if (P[i] > P[i + 1])
return false;
}
return true;
};
if (test()) {
cout << "YES" << endl;
return 0;
}
for (int i = 0; i < N; i++) {
for (int j = i + 1; j < N; j++) {
swap(P[i], P[j]);
if (test()) {
cout << "YES" << endl;
return 0;
}
swap(P[i], P[j]);
}
}
cout << "NO" << endl;
return 0;
} | #include <algorithm>
#include <iostream>
#include <tuple>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> P(N);
for (auto &p : P)
cin >> p;
auto test = [&]() {
for (int i = 0; i < N - 1; i++) {
if (P[i] > P[i + 1])
return false;
}
return true;
};
if (test()) {
cout << "YES" << endl;
return 0;
}
for (int i = 0; i < N; i++) {
for (int j = i + 1; j < N; j++) {
swap(P[i], P[j]);
if (test()) {
cout << "YES" << endl;
return 0;
}
swap(P[i], P[j]);
}
}
cout << "NO" << endl;
return 0;
} | [
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 765,359 | 765,360 | u587172770 | cpp |
p02958 | #include <bits/stdc++.h>
using namespace std;
template <class T> inline T updmax(T &a, T b) { return a = max(a, b); }
template <class T> inline T updmin(T &a, T b) { return a = min(a, b); }
int main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
int n;
vector<int> a(n, 0);
for (int i = 0; i < n; i++)
cin >> a[i];
int cnt = 0;
for (int i = 0; i < n; i++) {
if (a[i] == i + 1)
cnt++;
}
if (cnt >= n - 2) {
cout << "YES"
<< "\n";
} else {
cout << "NO"
<< "\n";
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
template <class T> inline T updmax(T &a, T b) { return a = max(a, b); }
template <class T> inline T updmin(T &a, T b) { return a = min(a, b); }
int main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
int n;
cin >> n;
vector<int> a(n, 0);
for (int i = 0; i < n; i++)
cin >> a[i];
int cnt = 0;
for (int i = 0; i < n; i++) {
if (a[i] == i + 1)
cnt++;
}
if (cnt >= n - 2) {
cout << "YES"
<< "\n";
} else {
cout << "NO"
<< "\n";
}
return 0;
} | [] | 765,372 | 765,373 | u614497125 | cpp |
p02958 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, ans;
cin >> n;
vector<int> p(n);
for (int i = 0; i < n; i++) {
cin >> p.at(i);
}
for (int j = 0; j < n; j++) {
if (p.at(j) != j + 1) {
ans++;
}
}
if (ans < 3) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n, ans;
cin >> n;
ans = 0;
vector<int> p(n);
for (int i = 0; i < n; i++) {
cin >> p.at(i);
}
for (int j = 0; j < n; j++) {
if (p.at(j) != j + 1) {
ans++;
}
}
if (ans < 3) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
return 0;
} | [
"assignment.add"
] | 765,374 | 765,375 | u536015544 | cpp |
p02958 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, ans;
cin >> n;
vector<int> p(n);
for (int i = 0; i < n; i++) {
cin >> p.at(i);
}
for (int j = 0; j < n; j++) {
if (p.at(j) != j + 1) {
ans++;
}
}
if (ans < 3) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, ans;
cin >> n;
ans = 0;
vector<int> p(n);
for (int i = 0; i < n; i++) {
cin >> p.at(i);
}
for (int j = 0; j < n; j++) {
if (p.at(j) != j + 1) {
ans++;
}
}
if (ans < 3) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
return 0;
} | [
"assignment.add"
] | 765,376 | 765,375 | u536015544 | cpp |
p02958 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, ans;
cin >> n;
vector<int> p(n);
for (int i = 0; i < n; i++) {
cin >> p.at(i);
}
for (int j = 0; j < n; j++) {
if (p.at(j) != j + 1) {
ans++;
}
}
if (ans < 3) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, ans;
cin >> n;
ans = 0;
vector<int> p(n);
for (int i = 0; i < n; i++) {
cin >> p.at(i);
}
for (int j = 0; j < n; j++) {
if (p.at(j) != j + 1) {
ans++;
}
}
if (ans < 3) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
return 0;
} | [
"assignment.add"
] | 765,377 | 765,375 | u536015544 | cpp |
p02958 | #include <algorithm>
#include <iostream>
#include <math.h>
#include <stdio.h>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> p(N), p_sorted(N);
for (int i = 0; i < N; i++) {
cin >> p[i];
p_sorted[i] = p[i];
}
sort(p_sorted.begin(), p_sorted.end());
int cnt = 0;
for (int i = 0; i < N; i++) {
if (p[i] != p_sorted[i]) {
cnt++;
}
}
if (cnt == 2) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
}
| #include <algorithm>
#include <iostream>
#include <math.h>
#include <stdio.h>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> p(N), p_sorted(N);
for (int i = 0; i < N; i++) {
cin >> p[i];
p_sorted[i] = p[i];
}
sort(p_sorted.begin(), p_sorted.end());
int cnt = 0;
for (int i = 0; i < N; i++) {
if (p[i] != p_sorted[i]) {
cnt++;
}
}
if (cnt == 0 || cnt == 2) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
}
| [
"control_flow.branch.if.condition.change"
] | 765,378 | 765,379 | u937950774 | cpp |
p02958 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n, cnt = 0;
cin >> n;
vector<int> p(n);
for (int i = 0; i < n; i++)
cin >> p[i];
if (is_sorted(p.begin(), p.end())) {
cout << "YES\n";
return 0;
}
for (int i = 0; i < n - 1; i++) {
for (int j = i + 1; i < n; j++) {
if (p[i] > p[j]) {
int tmp = p[i];
p[i] = p[j];
p[j] = tmp;
if (is_sorted(p.begin(), p.end())) {
cout << "YES\n";
return 0;
}
tmp = p[i];
p[i] = p[j];
p[j] = tmp;
}
}
}
cout << "NO\n";
return 0;
}
| #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n, cnt = 0;
cin >> n;
vector<int> p(n);
for (int i = 0; i < n; i++)
cin >> p[i];
if (is_sorted(p.begin(), p.end())) {
cout << "YES\n";
return 0;
}
for (int i = 0; i < n - 1; i++) {
for (int j = i + 1; j < n; j++) {
if (p[i] > p[j]) {
int tmp = p[i];
p[i] = p[j];
p[j] = tmp;
if (is_sorted(p.begin(), p.end())) {
cout << "YES\n";
return 0;
}
tmp = p[i];
p[i] = p[j];
p[j] = tmp;
}
}
}
cout << "NO\n";
return 0;
}
| [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 765,384 | 765,385 | u053360288 | cpp |
p02958 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int countDifference = 0;
for (int i = 0; i < N; i++) {
int tmp;
cin >> tmp;
if (tmp != (i + 1))
countDifference++;
}
if (countDifference < 2) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int countDifference = 0;
for (int i = 0; i < N; i++) {
int tmp;
cin >> tmp;
if (tmp != (i + 1))
countDifference++;
}
if (countDifference <= 2) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
return 0;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 765,386 | 765,387 | u016092854 | cpp |
p02958 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int a[n];
int swap, ans = 0;
for (int i = 0; i < n; i++) {
cin >> a[n];
// cout<<a[n]<<endl;
}
for (int i = 0; i < n - 1; i++) {
// cout<<a[i]<<endl;
if (a[i] < a[i + 1])
ans = 1;
else if (a[i] > a[i + 1]) {
ans = 0;
break;
}
// cout<<a[i]<<' '<<a[i+1]<<endl;
}
// cout<<ans<<endl;
if (ans == 1) {
cout << "YES";
return 0;
}
ans = 0;
for (int i = 0; i < n; i++) {
for (int j = i; j < n; j++) {
swap = a[j];
a[j] = a[i];
a[i] = swap;
for (int k = 1; k < n; k++) {
if (a[k] > a[k - 1]) {
ans = 1;
} else {
ans = 0;
break;
}
}
if (ans == 1) {
cout << "YES";
return 0;
}
a[i] = a[j];
a[j] = swap;
}
}
cout << "NO";
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int a[n];
int swap, ans = 0;
for (int i = 0; i < n; i++) {
cin >> a[i];
// cout<<a[i]<<endl;
}
// for(int i=0;i<n;i++) cout<<a[i]<<endl;
for (int i = 0; i < n - 1; i++) {
// cout<<a[i]<<endl;
if (a[i] < a[i + 1])
ans = 1;
else if (a[i] > a[i + 1]) {
ans = 0;
break;
}
// cout<<a[i]<<' '<<a[i+1]<<endl;
}
// cout<<ans<<endl;
if (ans == 1) {
cout << "YES";
return 0;
}
ans = 0;
for (int i = 0; i < n; i++) {
for (int j = i; j < n; j++) {
swap = a[j];
a[j] = a[i];
a[i] = swap;
for (int k = 1; k < n; k++) {
if (a[k] > a[k - 1]) {
ans = 1;
} else {
ans = 0;
break;
}
}
if (ans == 1) {
cout << "YES";
return 0;
}
a[i] = a[j];
a[j] = swap;
}
}
cout << "NO";
return 0;
} | [
"identifier.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change"
] | 765,390 | 765,391 | u236011566 | cpp |
p02958 | #include <bits/stdc++.h>
using namespace std;
int main() {
int i, N, count = 0;
cin >> N;
int a[N], b[N];
for (i = 0; i < N; i++) {
a[i] = i + 1;
}
for (i = 0; i < N; i++) {
cin >> b[i];
if (a[i] == b[i]) {
} else {
count++;
}
}
if (count == 2 || count == 0) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int i, N, count = 0;
cin >> N;
int a[N], b[N];
for (i = 0; i < N; i++) {
a[i] = i + 1;
}
for (i = 0; i < N; i++) {
cin >> b[i];
if (a[i] == b[i]) {
} else {
count++;
}
}
if (count == 2 || count == 0) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 765,395 | 765,396 | u886921509 | cpp |
p02958 | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int N;
cin >> N;
int p[N];
int q[N];
for (int i = 0; i < N; i++) {
cin >> p[i];
q[i] = p[i];
}
sort(p, p + N);
int count = 0;
for (int i = 0; i < N; i++) {
if (q[i] != p[i])
count++;
}
if (count == 2) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
return 0;
} | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int N;
cin >> N;
int p[N];
int q[N];
for (int i = 0; i < N; i++) {
cin >> p[i];
q[i] = p[i];
}
sort(p, p + N);
int count = 0;
for (int i = 0; i < N; i++) {
if (q[i] != p[i])
count++;
}
if (count == 2 || count == 0) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
return 0;
} | [
"control_flow.branch.if.condition.change"
] | 765,399 | 765,400 | u951403082 | cpp |
p02958 | #include <algorithm>
#include <cstdint>
#include <cstring>
#include <functional>
#include <iostream>
#include <math.h>
#include <string>
#include <vector>
#define SIZE_OF_ARRAY(array) (sizeof(array) / sizeof(array[0]))
using namespace std;
int main() {
int N;
cin >> N;
int p[50];
int c[50];
for (int i = 0; i < N; i++) {
cin >> p[i];
}
memcpy(c, p, 50);
sort(p, p + N);
int counter = 100;
for (int i = 0; i < N; i++) {
if (c[i] != p[i]) {
++counter;
}
}
if (counter <= 2) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
// system("pause");
return 0;
} | #include <algorithm>
#include <cstdint>
#include <cstring>
#include <functional>
#include <iostream>
#include <math.h>
#include <string>
#include <vector>
#define SIZE_OF_ARRAY(array) (sizeof(array) / sizeof(array[0]))
using namespace std;
int main() {
int N;
cin >> N;
int p[255];
int c[255];
for (int i = 0; i < N; i++) {
cin >> p[i];
}
memcpy(c, p, 255);
sort(p, p + N);
int counter = 0;
for (int i = 0; i < N; i++) {
// cout << c[i] << "," << p[i] << endl;
if (c[i] != p[i]) {
++counter;
}
}
if (counter <= 2) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
// system("pause");
return 0;
} | [
"literal.number.change",
"variable_declaration.array_dimensions.change",
"call.arguments.change",
"variable_declaration.value.change"
] | 765,409 | 765,408 | u913604515 | cpp |
p02958 | #include <algorithm>
#include <cstdint>
#include <cstring>
#include <functional>
#include <iostream>
#include <math.h>
#include <string>
#include <vector>
#define SIZE_OF_ARRAY(array) (sizeof(array) / sizeof(array[0]))
using namespace std;
int main() {
int N;
cin >> N;
int p[50];
int c[50];
for (int i = 0; i < N; i++) {
cin >> p[i];
}
memcpy(c, p, 50);
sort(p, p + N);
int counter = 0;
for (int i = 0; i < N; i++) {
if (c[i] != p[i]) {
++counter;
}
}
if (counter <= 1) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
// system("pause");
return 0;
} | #include <algorithm>
#include <cstdint>
#include <cstring>
#include <functional>
#include <iostream>
#include <math.h>
#include <string>
#include <vector>
#define SIZE_OF_ARRAY(array) (sizeof(array) / sizeof(array[0]))
using namespace std;
int main() {
int N;
cin >> N;
int p[255];
int c[255];
for (int i = 0; i < N; i++) {
cin >> p[i];
}
memcpy(c, p, 255);
sort(p, p + N);
int counter = 0;
for (int i = 0; i < N; i++) {
// cout << c[i] << "," << p[i] << endl;
if (c[i] != p[i]) {
++counter;
}
}
if (counter <= 2) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
// system("pause");
return 0;
} | [
"literal.number.change",
"variable_declaration.array_dimensions.change",
"call.arguments.change",
"control_flow.branch.if.condition.change"
] | 765,410 | 765,408 | u913604515 | cpp |
p02958 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, cnt;
cnt = 0;
cin >> n;
int a[n], d[n];
for (int i = 0; i < n; i++) {
cin >> a[i];
d[i] = i + 1;
}
for (int i = 0; i < n; i++) {
if (a[i] == d[i])
cnt++;
}
if (cnt == 2)
cout << "YES" << endl;
else
cout << "NO" << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, cnt;
cnt = 0;
cin >> n;
int a[n], d[n];
for (int i = 0; i < n; i++) {
cin >> a[i];
d[i] = i + 1;
}
for (int i = 0; i < n; i++) {
if (a[i] != d[i])
cnt++;
}
if (cnt <= 2)
cout << "YES" << endl;
else
cout << "NO" << endl;
return 0;
} | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 765,417 | 765,418 | u018434698 | cpp |
p02958 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, count = 0, last, a;
cin >> n;
int p[n];
for (int i = 0; i < n; i++) {
cin >> p[i];
}
for (int i = 0; i < n; i++) {
if (p[i] != (i + 1)) {
count++;
if (count == 1) {
a = i + 1;
}
}
}
if (count == 0) {
cout << "Yes" << endl;
}
else if (count == 2) {
cout << "Yes" << endl;
} else {
cout << "NO" << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, count = 0, last, a;
cin >> n;
int p[n];
for (int i = 0; i < n; i++) {
cin >> p[i];
}
for (int i = 0; i < n; i++) {
if (p[i] != (i + 1)) {
count++;
if (count == 1) {
a = i + 1;
}
}
}
if (count == 0) {
cout << "YES" << endl;
}
else if (count == 2) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 765,419 | 765,420 | u779636842 | cpp |
p02958 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> P(N), Q(N);
for (int i = 0; i < N; i++) {
cin >> P.at(i);
Q.at(i) = P.at(i);
}
sort(Q.begin(), Q.end());
int count = 0;
for (int i = 0; i < N; i++) {
if (Q.at(i) == P.at(i)) {
} else
count++;
}
if (count % 2 == 0) {
cout << "YES";
} else
cout << "NO";
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> P(N), Q(N);
for (int i = 0; i < N; i++) {
cin >> P.at(i);
Q.at(i) = P.at(i);
}
sort(Q.begin(), Q.end());
int count = 0;
for (int i = 0; i < N; i++) {
if (Q.at(i) == P.at(i)) {
} else
count++;
}
if (count == 2 || count == 0)
cout << "YES";
else
cout << "NO";
} | [
"control_flow.branch.if.condition.change"
] | 765,431 | 765,432 | u700314924 | cpp |
p02958 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int N;
int diff = 0;
cin >> N;
int p[N];
int sortedP[N];
for (int i = 0; i < N; i++) {
int P;
cin >> P;
p[i] = P;
sortedP[i] = P;
}
sort(sortedP, sortedP + N);
for (int i = 0; i < N; i++) {
if (p[i] != sortedP[i]) {
diff++;
}
}
if (diff == 0 || diff == 2) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
return 0;
}
| #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int N;
int diff = 0;
cin >> N;
int p[N];
int sortedP[N];
for (int i = 0; i < N; i++) {
int P;
cin >> P;
p[i] = P;
sortedP[i] = P;
}
sort(sortedP, sortedP + N);
for (int i = 0; i < N; i++) {
if (p[i] != sortedP[i]) {
diff++;
}
}
if (diff == 0 || diff == 2) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
return 0;
}
| [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 765,445 | 765,446 | u332258971 | cpp |
p02958 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
int count = 0;
for (int i = 0; i < n; ++i) {
int b;
cin >> b;
if (b != n + 1)
count = count + 1;
}
if (count <= 2)
cout << "YES" << endl;
else
cout << "NO" << endl;
return 0;
} | #include <algorithm>
#include <cmath>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
int count = 0;
for (int i = 0; i < n; ++i) {
int b;
cin >> b;
if (b != i + 1)
count = count + 1;
}
if (count <= 2)
cout << "YES" << endl;
else
cout << "NO" << endl;
return 0;
} | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 765,447 | 765,448 | u571305142 | cpp |
p02958 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
int count = 0;
for (int i = 0; i < n; ++i) {
int b;
cin >> b;
if (b != n + 1)
count = count + 1;
}
if (count >= 2)
cout << "YES" << endl;
else
cout << "NO" << endl;
return 0;
} | #include <algorithm>
#include <cmath>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
int count = 0;
for (int i = 0; i < n; ++i) {
int b;
cin >> b;
if (b != i + 1)
count = count + 1;
}
if (count <= 2)
cout << "YES" << endl;
else
cout << "NO" << endl;
return 0;
} | [
"identifier.change",
"control_flow.branch.if.condition.change",
"misc.opposites",
"expression.operator.compare.change"
] | 765,449 | 765,448 | u571305142 | cpp |
p02958 | #include <algorithm>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;
int main() {
int n;
ll ans = 0;
vector<int> a;
cin >> n;
for (int i = 0; i < n; i++) {
int aa;
cin >> aa;
a.push_back(aa);
}
for (int i = 1; i <= n; i++) {
if (a[i - 1] != i) {
int b = a[i - 1];
if (a[b - 1] == i)
ans++;
else
ans = -1;
}
}
(ans == 0 || ans == 2) ? (cout << "YES" << endl) : (cout << "NO" << endl);
}
| #include <algorithm>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;
int main() {
int n;
ll ans = 0;
vector<int> a;
cin >> n;
for (int i = 0; i < n; i++) {
int aa;
cin >> aa;
a.push_back(aa);
}
for (int i = 1; i <= n; i++) {
if (a[i - 1] != i) {
int b = a[i - 1];
if (a[b - 1] == i)
ans++;
else
ans = 100;
}
}
(ans == 0 || ans == 2) ? (cout << "YES" << endl) : (cout << "NO" << endl);
}
| [
"literal.number.change",
"assignment.value.change"
] | 765,468 | 765,469 | u227764848 | cpp |
p02958 | #include <algorithm>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;
int main() {
int n;
ll ans = 0;
vector<int> a;
cin >> n;
for (int i = 0; i < n; i++) {
int aa;
cin >> aa;
a.push_back(aa);
}
for (int i = 1; i <= n; i++) {
if (a[i - 1] != i) {
int b = a[i - 1];
if (a[b - 1] == i)
ans++;
else
ans = -1;
}
}
(ans == 0 || ans == 1) ? (cout << "YES" << endl) : (cout << "NO" << endl);
}
| #include <algorithm>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;
int main() {
int n;
ll ans = 0;
vector<int> a;
cin >> n;
for (int i = 0; i < n; i++) {
int aa;
cin >> aa;
a.push_back(aa);
}
for (int i = 1; i <= n; i++) {
if (a[i - 1] != i) {
int b = a[i - 1];
if (a[b - 1] == i)
ans++;
else
ans = 100;
}
}
(ans == 0 || ans == 2) ? (cout << "YES" << endl) : (cout << "NO" << endl);
}
| [
"literal.number.change",
"assignment.value.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 765,470 | 765,469 | u227764848 | cpp |
p02958 | #include <iostream>
using namespace std;
int main() {
int n, i, count = 0;
cin >> n;
int p[n];
for (i = 0; i < n; i++) {
cin >> p[i];
}
for (i = 0; i < n; i++) {
if (p[i] != i + 1) {
count++;
}
}
if (count <= 2) {
cout << "YES";
} else if (count > 3) {
cout << "NO";
}
return 0;
}
| #include <iostream>
using namespace std;
int main() {
int n, i, count = 0;
cin >> n;
int p[n];
for (i = 0; i < n; i++) {
cin >> p[i];
}
for (i = 0; i < n; i++) {
if (p[i] != i + 1) {
count++;
}
}
if (count <= 2) {
cout << "YES";
} else if (count > 2) {
cout << "NO";
}
return 0;
}
| [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 765,473 | 765,474 | u709752172 | cpp |
p02958 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, i, cnt = 0;
cin >> n;
int a[n];
for (i = 0; i < n; i++) {
cin >> a[i];
}
for (i = 0; i < n; i++) {
if (a[i] != (i + 1)) {
cnt++;
}
}
cout << (cnt > 2 ? "No" : "Yes") << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n, i, cnt = 0;
cin >> n;
int a[n];
for (i = 0; i < n; i++) {
cin >> a[i];
}
for (i = 0; i < n; i++) {
if (a[i] != (i + 1)) {
cnt++;
}
}
cout << (cnt <= 2 ? "YES" : "NO") << endl;
return 0;
}
| [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"io.output.change",
"literal.string.change"
] | 765,475 | 765,476 | u948459352 | cpp |
p02958 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, i, cnt = 0;
cin >> n;
int a[n];
for (i = 0; i < n; i++) {
cin >> a[i];
}
for (i = 0; i < n; i++) {
if (a[i] != i + 1) {
cnt++;
}
}
cout << (cnt > 2 ? "No" : "Yes") << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n, i, cnt = 0;
cin >> n;
int a[n];
for (i = 0; i < n; i++) {
cin >> a[i];
}
for (i = 0; i < n; i++) {
if (a[i] != (i + 1)) {
cnt++;
}
}
cout << (cnt <= 2 ? "YES" : "NO") << endl;
return 0;
}
| [
"control_flow.branch.if.condition.change",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"io.output.change",
"literal.string.change"
] | 765,477 | 765,476 | u948459352 | cpp |
p02958 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define REP(i, n) for (int i = 0; i < (n); i++)
#define REP2(i, x, n) for (int i = x; i < (n); i++)
int gcd(int a, int b) { return b ? gcd(b, a % b) : a; } //最大公約数
int lcm(int a, int b) { return a * b / gcd(a, b); } //最小公倍数
int main() {
int n;
cin >> n;
int a[n];
REP(i, n) { cin >> a[i]; }
int key = 0;
REP(i, n) {
if (a[i] != i + 1)
key++;
if (key > 2)
break;
}
if (key == 2)
cout << "YES" << endl;
else {
cout << "NO" << endl;
}
}
| #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define REP(i, n) for (int i = 0; i < (n); i++)
#define REP2(i, x, n) for (int i = x; i < (n); i++)
int gcd(int a, int b) { return b ? gcd(b, a % b) : a; } //最大公約数
int lcm(int a, int b) { return a * b / gcd(a, b); } //最小公倍数
int main() {
int n;
cin >> n;
int a[n];
REP(i, n) { cin >> a[i]; }
int key = 0;
REP(i, n) {
if (a[i] != i + 1)
key++;
if (key > 2)
break;
}
if (key == 2 || key == 0)
cout << "YES" << endl;
else {
cout << "NO" << endl;
}
}
| [
"control_flow.branch.if.condition.change"
] | 765,482 | 765,483 | u110681742 | cpp |
p02958 | #include <algorithm>
#include <iostream>
#include <tuple>
#include <utility>
#include <vector>
using namespace std;
typedef long long int64;
int main(void) {
int64 N;
cin >> N;
int64 cnt = 0;
vector<int64> p(N);
for (int64 i = 0; i < N; i++) {
cin >> p[i];
if (p[i] != i) {
cnt++;
}
}
if (cnt == 0 || cnt == 2) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
return 0;
} | #include <algorithm>
#include <iostream>
#include <tuple>
#include <utility>
#include <vector>
using namespace std;
typedef long long int64;
int main(void) {
int64 N;
cin >> N;
int64 cnt = 0;
vector<int64> p(N);
for (int64 i = 0; i < N; i++) {
cin >> p[i];
if (p[i] != i + 1) {
cnt++;
}
}
if (cnt == 0 || cnt == 2) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
return 0;
} | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 765,484 | 765,485 | u647569169 | cpp |
p02958 | #include <algorithm>
#include <iostream>
#include <tuple>
#include <utility>
#include <vector>
using namespace std;
typedef long long int64;
int main(void) {
int64 N;
cin >> N;
int64 cnt = 0;
vector<int64> p(N);
for (int64 i = 0; i < N; i++) {
cin >> p[i];
if (p[i] != N - i) {
cnt++;
}
}
if (cnt == 0 || cnt == 2) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
return 0;
} | #include <algorithm>
#include <iostream>
#include <tuple>
#include <utility>
#include <vector>
using namespace std;
typedef long long int64;
int main(void) {
int64 N;
cin >> N;
int64 cnt = 0;
vector<int64> p(N);
for (int64 i = 0; i < N; i++) {
cin >> p[i];
if (p[i] != i + 1) {
cnt++;
}
}
if (cnt == 0 || cnt == 2) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
return 0;
} | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove",
"control_flow.branch.if.condition.change",
"misc.off_by_one"
] | 765,486 | 765,485 | u647569169 | cpp |
p02958 | #include <iostream>
using namespace std;
int main() {
int N, p[60], z = 0;
cin >> N;
for (int i = 0; i < N; i++) {
cin >> p[i];
}
for (int i = 0; i < N; i++) {
if (p[i] == i + 1) {
z = z + 1;
}
}
if (z == N) {
cout << "YES";
}
if (z == N - 2) {
cout << "YES";
} else {
cout << "NO";
}
return 0;
}
| #include <iostream>
using namespace std;
int main() {
int N, p[60], z = 0;
cin >> N;
for (int i = 0; i < N; i++) {
cin >> p[i];
}
for (int i = 0; i < N; i++) {
if (p[i] == i + 1) {
z = z + 1;
}
}
if (z == N) {
cout << "YES";
} else {
if (z == N - 2) {
cout << "YES";
} else {
cout << "NO";
}
}
return 0;
}
| [
"control_flow.branch.else.add"
] | 765,489 | 765,490 | u428229036 | cpp |
p02958 | #include <iostream>
using namespace std;
int main() {
int N, p[60], z = 0;
cin >> N;
for (int i = 0; i < N; i++) {
cin >> p[i];
}
for (int i = 0; i < N; i++) {
if (p[i] == i) {
z = z + 1;
}
}
if (z == N) {
cout << "YES";
}
if (z == N - 2) {
cout << "YES";
} else {
cout << "NO";
}
return 0;
}
| #include <iostream>
using namespace std;
int main() {
int N, p[60], z = 0;
cin >> N;
for (int i = 0; i < N; i++) {
cin >> p[i];
}
for (int i = 0; i < N; i++) {
if (p[i] == i + 1) {
z = z + 1;
}
}
if (z == N) {
cout << "YES";
} else {
if (z == N - 2) {
cout << "YES";
} else {
cout << "NO";
}
}
return 0;
}
| [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one",
"control_flow.branch.else.add"
] | 765,491 | 765,490 | u428229036 | cpp |
p02958 | #include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define N (1000000000 + 7)
#define INF 1e16
typedef pair<int, int> P;
typedef long long ll;
int main(void) {
int n, num = 0;
;
cin >> n;
vector<int> p(n), q(n);
for (int i = 0; i < n; i++)
cin >> p[i];
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
for (int k = 0; k < n; k++)
q[k] = p[k];
if (i != j) {
int tmp = q[i];
q[i] = q[j];
q[j] = tmp;
}
bool flag = true;
for (int l = 0; l < n - 1; l++) {
if (q[l] > q[l + 1]) {
flag = false;
break;
}
}
if (flag) {
cout << "Yes" << endl;
return 0;
}
}
}
cout << "No" << endl;
return 0;
} | #include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define N (1000000000 + 7)
#define INF 1e16
typedef pair<int, int> P;
typedef long long ll;
int main(void) {
int n, num = 0;
;
cin >> n;
vector<int> p(n), q(n);
for (int i = 0; i < n; i++)
cin >> p[i];
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
for (int k = 0; k < n; k++)
q[k] = p[k];
if (i != j) {
int tmp = q[i];
q[i] = q[j];
q[j] = tmp;
}
bool flag = true;
for (int l = 0; l < n - 1; l++) {
if (q[l] > q[l + 1]) {
flag = false;
break;
}
}
if (flag) {
cout << "YES" << endl;
return 0;
}
}
}
cout << "NO" << endl;
return 0;
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 765,496 | 765,497 | u744305661 | cpp |
p02958 | #include <iostream>
#include <numeric>
#include <vector>
using namespace std;
bool judge(const vector<int> &v);
int main() {
size_t n;
cin >> n;
vector<int> p(n);
for (size_t i = 0; i < n; ++i)
cin >> p[i];
cout << (judge(p) ? "YES" : "NO") << std::endl;
return 0;
}
bool judge(const vector<int> &v) {
vector<int> i(v.size());
iota(i.begin(), i.end(), 0);
size_t c = 0;
for (size_t s = 0; s < v.size(); ++s)
c += ((i[s] == v[s]) ? 0 : 1);
return (c == 0 || c == 2);
}
| #include <iostream>
#include <numeric>
#include <vector>
using namespace std;
bool judge(const vector<int> &v);
int main() {
size_t n;
cin >> n;
vector<int> p(n);
for (size_t i = 0; i < n; ++i)
cin >> p[i];
cout << (judge(p) ? "YES" : "NO") << std::endl;
return 0;
}
bool judge(const vector<int> &v) {
vector<int> i(v.size());
iota(i.begin(), i.end(), 1);
size_t c = 0;
for (size_t s = 0; s < v.size(); ++s)
c += ((i[s] == v[s]) ? 0 : 1);
return (c == 0 || c == 2);
}
| [
"literal.number.change",
"call.arguments.change"
] | 765,500 | 765,501 | u937545465 | cpp |
p02958 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn = 1e5 + 10;
int a[maxn];
int b[maxn];
int main() {
int m, n;
cin >> n;
int k = 0;
for (int i = 1; i <= n; i++)
cin >> a[i];
for (int i = 1; i <= n; i++) {
if (a[i] != i)
k++;
}
if (k == 2 || k == 0)
puts("Yes");
else
puts("No");
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn = 1e5 + 10;
int a[maxn];
int b[maxn];
int main() {
int m, n;
cin >> n;
int k = 0;
for (int i = 1; i <= n; i++)
cin >> a[i];
for (int i = 1; i <= n; i++) {
if (a[i] != i)
k++;
}
if (k == 2 || k == 0)
puts("YES");
else
puts("NO");
return 0;
}
| [
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 765,506 | 765,507 | u914135866 | cpp |
p02958 | #include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <bitset> // bitset
#include <cstdint> // int64_t, int*_t
#include <cstdio> // printf
#include <deque> // deque
#include <iostream> // cout, endl, cin
#include <map> // map
#include <queue> // queue, priority_queue
#include <set> // set
#include <stack> // stack
#include <string> // string, to_string, stoi
#include <tuple> // tuple, make_tuple
#include <unordered_map> // unordered_map
#include <unordered_set> // unordered_set
#include <utility> // pair, make_pair
#include <vector> // vector
using namespace std;
int main() {
int a[51], sum, n, flag = 0, m, count = 0;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a[i];
if (a[i] != i + 1)
count++;
}
if (count == 2)
cout << "YES" << endl;
else
cout << "NO" << endl;
return 0;
}
| #include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <bitset> // bitset
#include <cstdint> // int64_t, int*_t
#include <cstdio> // printf
#include <deque> // deque
#include <iostream> // cout, endl, cin
#include <map> // map
#include <queue> // queue, priority_queue
#include <set> // set
#include <stack> // stack
#include <string> // string, to_string, stoi
#include <tuple> // tuple, make_tuple
#include <unordered_map> // unordered_map
#include <unordered_set> // unordered_set
#include <utility> // pair, make_pair
#include <vector> // vector
using namespace std;
int main() {
int a[51], sum, n, flag = 0, m, count = 0;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a[i];
if (a[i] != i + 1)
count++;
}
if (count == 2 || count == 0)
cout << "YES" << endl;
else
cout << "NO" << endl;
return 0;
}
| [
"control_flow.branch.if.condition.change"
] | 765,514 | 765,515 | u384161668 | cpp |
p02958 | #include <cmath>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> P(N, 0);
for (int i = 0; i < N; ++i) {
cin >> P[i];
}
int ans = 0;
for (int i = 0; i < N; ++i) {
if (P[i] != i + 1) {
++ans;
}
}
if (ans >= 3) {
cout << "No" << endl;
} else {
cout << "Yes" << endl;
}
return 0;
} | #include <cmath>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> P(N, 0);
for (int i = 0; i < N; ++i) {
cin >> P[i];
}
int ans = 0;
for (int i = 0; i < N; ++i) {
if (P[i] != i + 1) {
++ans;
}
}
if (ans >= 3) {
cout << "NO" << endl;
} else {
cout << "YES" << endl;
}
return 0;
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 765,518 | 765,519 | u894555185 | cpp |
p02958 | #include <bits/stdc++.h>
#include <cstdio>
#include <iostream>
using namespace std;
int n;
int a[55];
int main() {
// freopen("B.in","r",stdin);
// freopen("B.out","w",stdout);
scanf("%d", &n);
for (int i = 1; i <= n; i++) {
scanf("%d", &a[i]);
}
int cnt = 0;
for (int i = 1; i <= n; i++) {
if (a[i] != i)
cnt++;
}
if (cnt != 2) {
cout << "NO";
} else {
cout << "YES";
}
return 0;
}
| #include <bits/stdc++.h>
#include <cstdio>
#include <iostream>
using namespace std;
int n;
int a[55];
int main() {
// freopen("B.in","r",stdin);
// freopen("B.out","w",stdout);
scanf("%d", &n);
for (int i = 1; i <= n; i++) {
scanf("%d", &a[i]);
}
int cnt = 0;
for (int i = 1; i <= n; i++) {
if (a[i] != i)
cnt++;
}
if (cnt > 2) {
cout << "NO";
} else {
cout << "YES";
}
return 0;
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 765,521 | 765,522 | u275399185 | cpp |
p02958 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> p, p_a;
int num;
for (int i = 0; i < N; i++) {
cin >> num;
p.push_back(num);
p_a.push_back(num);
}
sort(p_a.begin(), p_a.end());
int counter = 0;
for (int i = 0; i < N; i++) {
if (p[i] != p_a[i]) {
counter++;
}
}
if (counter == 0 || counter == 2) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
return 0;
} | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> p, p_a;
int num;
for (int i = 0; i < N; i++) {
cin >> num;
p.push_back(num);
p_a.push_back(num);
}
sort(p_a.begin(), p_a.end());
int counter = 0;
for (int i = 0; i < N; i++) {
if (p[i] != p_a[i]) {
counter++;
}
}
if (counter == 0 || counter == 2) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
return 0;
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 765,534 | 765,535 | u827923574 | cpp |
p02958 | #include <iostream>
using namespace std;
int main() {
int N, cnt = 0;
cin >> N;
int p[N];
for (int i = 0; i < N; i++) {
cin >> p[i];
}
for (int i = 0; i < N; i++) {
if (i + 1 == p[i])
continue;
else {
int num = p[i];
if (i + 1 == p[num]) {
cnt++;
continue;
} else {
cout << "NO\n";
return 0;
}
}
}
if (cnt == 2 || cnt == 0) {
cout << "YES\n";
} else
cout << "NO\n";
return 0;
} | #include <iostream>
using namespace std;
int main() {
int N, cnt = 0;
cin >> N;
int p[N];
for (int i = 0; i < N; i++) {
cin >> p[i];
}
for (int i = 0; i < N; i++) {
if (i + 1 == p[i])
continue;
else {
int num = p[i];
if (i + 1 == p[num - 1]) {
cnt++;
continue;
} else {
cout << "NO\n";
return 0;
}
}
}
if (cnt == 2 || cnt == 0) {
cout << "YES\n";
} else
cout << "NO\n";
return 0;
} | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 765,538 | 765,539 | u267666635 | cpp |
p02958 | #include <iostream>
using namespace std;
int main() {
int N, cnt = 0;
cin >> N;
int p[N];
for (int i = 0; i < N; i++) {
cin >> p[i];
}
for (int i = 0; i < N; i++) {
if (i + 1 == p[i])
continue;
else {
int num = p[i];
if (i + 1 == p[num]) {
cnt++;
continue;
} else {
cout << "NO\n";
return 0;
}
}
}
if (cnt == 1 || cnt == 0) {
cout << "YES\n";
} else
cout << "NO\n";
return 0;
} | #include <iostream>
using namespace std;
int main() {
int N, cnt = 0;
cin >> N;
int p[N];
for (int i = 0; i < N; i++) {
cin >> p[i];
}
for (int i = 0; i < N; i++) {
if (i + 1 == p[i])
continue;
else {
int num = p[i];
if (i + 1 == p[num - 1]) {
cnt++;
continue;
} else {
cout << "NO\n";
return 0;
}
}
}
if (cnt == 2 || cnt == 0) {
cout << "YES\n";
} else
cout << "NO\n";
return 0;
} | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one",
"literal.number.change"
] | 765,540 | 765,539 | u267666635 | cpp |
p02958 | #include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int n, j;
cin >> n;
int p[n];
vector<int> v, v1;
for (int i = 1; i <= n; i++) {
cin >> p[i];
v.push_back(p[i]);
v1.push_back(p[i]);
}
sort(v.begin(), v.end());
int c = 0;
for (int i = 1; i <= n; i++) {
if (v[i] != v1[i]) {
c++;
}
}
c > 10 ? cout << "NO\n" : cout << "YES\n";
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int n, j;
cin >> n;
int p[n];
vector<int> v, v1;
for (int i = 0; i < n; i++) {
cin >> p[i];
v.push_back(p[i]);
v1.push_back(p[i]);
}
sort(v.begin(), v.end());
int c = 0;
for (int i = 0; i < n; i++) {
if (v[i] != v1[i]) {
c++;
}
}
c >= 3 ? cout << "NO\n" : cout << "YES\n";
return 0;
}
| [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 765,543 | 765,544 | u547164704 | cpp |
p02958 | #include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int n, j;
cin >> n;
int p[n];
vector<int> v, v1;
for (int i = 0; i < n; i++) {
cin >> p[i];
v.push_back(p[i]);
v1.push_back(p[i]);
}
sort(v.begin(), v.end());
int c = 0;
for (int i = 1; i <= n; i++) {
if (v[i] != v1[i]) {
c++;
}
}
c >= 3 ? cout << "NO\n" : cout << "YES\n";
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int n, j;
cin >> n;
int p[n];
vector<int> v, v1;
for (int i = 0; i < n; i++) {
cin >> p[i];
v.push_back(p[i]);
v1.push_back(p[i]);
}
sort(v.begin(), v.end());
int c = 0;
for (int i = 0; i < n; i++) {
if (v[i] != v1[i]) {
c++;
}
}
c >= 3 ? cout << "NO\n" : cout << "YES\n";
return 0;
}
| [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 765,545 | 765,544 | u547164704 | cpp |
p02958 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, p, cnt = 0;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> p;
if (i + 1 != p)
cnt++;
}
cout << (cnt > 3 ? "NO" : "YES") << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n, p, cnt = 0;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> p;
if (i + 1 != p)
cnt++;
}
cout << (cnt > 2 ? "NO" : "YES") << endl;
}
| [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"io.output.change"
] | 765,549 | 765,550 | u598050616 | cpp |
p02958 | #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
main() {
int n;
cin >> n;
vector<int> p(n);
for (auto &&s : p) {
cin >> s;
}
int count = 0;
for (int i = 0; i < n; i++) {
if (p.at(i) != i) {
count++;
}
}
if (count == 0 || count == 2) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
}
| #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
main() {
int n;
cin >> n;
vector<int> p(n);
for (auto &&s : p) {
cin >> s;
}
int count = 0;
for (int i = 0; i < n; i++) {
if (p.at(i) != i + 1) {
count++;
}
}
if (count == 0 || count == 2) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
}
| [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 765,553 | 765,554 | u040700157 | cpp |
p02958 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll n;
ll p[100];
ll p2[100];
bool comp2(const ll left, const ll right) { return (left <= right); }
int main() {
cin >> n;
for (ll i = 0; i < n; i++)
cin >> p[i];
for (ll i = 0; i < n; i++)
p2[i] = p[i];
sort(p2, p2 + n, comp2);
ll cnt = 0;
for (ll i = 1; i < n; i++) {
if (p[i] != p2[i])
cnt++;
if (cnt > 2)
break;
}
if (cnt > 2)
cout << "NO" << endl;
else
cout << "YES" << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll n;
ll p[100];
ll p2[100];
bool comp2(const ll left, const ll right) { return (left <= right); }
int main() {
cin >> n;
for (ll i = 0; i < n; i++)
cin >> p[i];
for (ll i = 0; i < n; i++)
p2[i] = p[i];
sort(p2, p2 + n, comp2);
ll cnt = 0;
for (ll i = 0; i < n; i++) {
if (p[i] != p2[i])
cnt++;
if (cnt > 2)
break;
}
if (cnt > 2)
cout << "NO" << endl;
else
cout << "YES" << endl;
return 0;
}
| [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 765,557 | 765,558 | u172369914 | cpp |
p02958 | #include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int arr[n];
int able = 0;
for (int i = 0; i < n; i++)
cin >> arr[i];
for (int i = 0; i < n; i++) {
if (arr[i] != n - i) {
able++;
}
}
if (able == 2 || able == 0)
cout << "YES";
else
cout << "NO";
} | #include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int arr[n];
int able = 0;
for (int i = 0; i < n; i++)
cin >> arr[i];
for (int i = 0; i < n; i++) {
if (arr[i] != i + 1) {
able++;
}
}
if (able == 2 || able == 0)
cout << "YES";
else
cout << "NO";
} | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove",
"control_flow.branch.if.condition.change",
"misc.off_by_one"
] | 765,575 | 765,576 | u222252114 | cpp |
p02958 | #include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int arr[n];
int able = 0;
for (int i = 0; i < n; i++)
cin >> arr[i];
for (int i = 0; i < n; i++) {
if (arr[i] != i + 1) {
able++;
}
}
if (able == 2)
cout << "YES";
else
cout << "NO";
} | #include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int arr[n];
int able = 0;
for (int i = 0; i < n; i++)
cin >> arr[i];
for (int i = 0; i < n; i++) {
if (arr[i] != i + 1) {
able++;
}
}
if (able == 2 || able == 0)
cout << "YES";
else
cout << "NO";
} | [
"control_flow.branch.if.condition.change"
] | 765,577 | 765,576 | u222252114 | cpp |
p02958 | // Created by liszt on 2019/07/27.
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> p(n);
for (int i = 0; i < n; i++)
cin >> p[i];
int cnt = 0;
for (int i = 1; i <= n; i++) {
if (p[i] != i)
cnt++;
}
if (cnt > 2) {
cout << "NO" << endl;
return 0;
}
cout << "YES" << endl;
return 0;
} | // Created by liszt on 2019/07/27.
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> p(n);
for (int i = 0; i < n; i++)
cin >> p[i];
int cnt = 0;
for (int i = 0; i < n; i++) {
if (p[i] != i + 1)
cnt++;
}
if (cnt > 2) {
cout << "NO" << endl;
return 0;
}
cout << "YES" << endl;
return 0;
} | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"control_flow.branch.if.condition.change",
"misc.off_by_one"
] | 765,583 | 765,584 | u370447425 | cpp |
p02958 | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp> // Common file
#include <ext/pb_ds/tree_policy.hpp> // Including tree_order_statistics_node_update
using namespace std;
#pragma comment(linker, "/stack:200000000")
#pragma GCC optimize("O3")
#pragma GCC optimize("O2")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define ll long long
#define pb push_back
#define mp make_pair
#define endl "\n"
#define sz(x) (int)x.size()
#define aint(v) v.begin(), v.end()
#define x first
#define y second
#define in(x) cin >> x;
#define inde(x) \
ll(x); \
cin >> x;
#define rep(ai, j, k) for (ll ai = j; ai < k; ai++)
#define sep(ai, j, k) for (ll ai = j; ai >= k; ai--)
#define ios \
ios_base::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0);
#define inputarr(x, y) \
for (int ai = 0; ai < y; ai++) { \
cin >> x[ai]; \
}
#define inpprefixarr(arr, y) \
cin >> arr[0]; \
for (ll ai = 1; ai < y; ai++) { \
ll temp; \
cin >> temp; \
arr[ai] = temp + arr[ai - 1]; \
}
#define watch(x) cout << (#x) << " is " << (x) << endl
#define watcharrsz(x) \
cout << (#x) << " starts:\n"; \
for (int ai = 0; ai < sz(x); ai++) { \
cout << x[ai] << " "; \
} \
cout << "\n" << (#x) << "ends\n";
#define watcharr(x, n) \
cout << (#x) << " starts:\n"; \
for (int ai = 1; ai <= n; ai++) { \
cout << x[ai] << " "; \
} \
cout << "\n" << (#x) << "ends\n";
#define watchg(x, n, y) \
cout << (#x) << " starts:\n"; \
for (int ai = 0; ai <= n; ai++) { \
cout << (ai) << ":"; \
for (int aj = 0; aj < x[ai].size(); aj++) { \
cout << x[ai][aj] << y; \
} \
cout << "\n"; \
} \
cout << "\n" << (#x) << "ends\n";
#define watch2darr(x, m, n, y) \
cout << (#x) << " starts:\n"; \
for (int ai = 1; ai <= m; ai++) { \
for (int aj = 1; aj <= n; aj++) { \
cout << x[ai][aj] << y; \
} \
cout << "\n"; \
} \
cout << "\n" << (#x) << "ends\n";
#define print(x, y) cout << (x) << y;
#define printarrsz(x, y) \
for (int ai = 0; ai < sz(x); ai++) { \
cout << x[ai] << y; \
} \
cout << "\n";
#define printarr(x, n, y) \
for (int ai = 0; ai < n; ai++) { \
cout << x[ai] << y; \
} \
cout << "\n";
#define print2darr(x, m, n, y) \
for (int ai = 0; ai < m; ai++) { \
for (int aj = 0; aj < n; aj++) { \
cout << x[ai][aj] << y; \
} \
cout << "\n"; \
} \
cout << "\n";
#define mod(x) = (x % m + m) % m;
const ll m = (ll)1000000007;
const ll N = 3e6 + 5;
const ll INF = 1ll << 63;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef set<int> si;
typedef map<int, int> mii;
typedef pair<int, int> pii;
typedef vector<bool> vb;
typedef vector<pii> vpii;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef set<ll> sl;
typedef map<ll, ll> mll;
typedef pair<ll, ll> pll;
typedef vector<pll> vpll;
typedef priority_queue<pll, vpll, greater<pll>> pqg;
/***************************Code Begins Here *****************************/
void solve() {
// Never use x,y here, try to use i,j in loops only
inde(n);
ll p[n];
inputarr(p, n);
ll ok = 0;
rep(i, 0, n) {
if (p[i] == i + 1) {
continue;
} else {
if (p[p[i] - 1] == i + 1 && ok == 0) {
ok = 1;
continue;
} else {
print("NO", endl);
return;
}
}
}
print("YES", endl);
return;
}
signed main() {
ios ll t = 1;
// cin>>t;
// #ifndef ONLINE_JUDGE
// time_t time_t1, time_t2;
// time_t1 = clock();
// #endif
while (t--)
solve();
// #ifndef ONLINE_JUDGE
// time_t2 = clock();
// cout << "time taken :" << time_t2 - time_t1 << endl;
// #endif
return 0;
} | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp> // Common file
#include <ext/pb_ds/tree_policy.hpp> // Including tree_order_statistics_node_update
using namespace std;
#pragma comment(linker, "/stack:200000000")
#pragma GCC optimize("O3")
#pragma GCC optimize("O2")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define ll long long
#define pb push_back
#define mp make_pair
#define endl "\n"
#define sz(x) (int)x.size()
#define aint(v) v.begin(), v.end()
#define x first
#define y second
#define in(x) cin >> x;
#define inde(x) \
ll(x); \
cin >> x;
#define rep(ai, j, k) for (ll ai = j; ai < k; ai++)
#define sep(ai, j, k) for (ll ai = j; ai >= k; ai--)
#define ios \
ios_base::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0);
#define inputarr(x, y) \
for (int ai = 0; ai < y; ai++) { \
cin >> x[ai]; \
}
#define inpprefixarr(arr, y) \
cin >> arr[0]; \
for (ll ai = 1; ai < y; ai++) { \
ll temp; \
cin >> temp; \
arr[ai] = temp + arr[ai - 1]; \
}
#define watch(x) cout << (#x) << " is " << (x) << endl
#define watcharrsz(x) \
cout << (#x) << " starts:\n"; \
for (int ai = 0; ai < sz(x); ai++) { \
cout << x[ai] << " "; \
} \
cout << "\n" << (#x) << "ends\n";
#define watcharr(x, n) \
cout << (#x) << " starts:\n"; \
for (int ai = 1; ai <= n; ai++) { \
cout << x[ai] << " "; \
} \
cout << "\n" << (#x) << "ends\n";
#define watchg(x, n, y) \
cout << (#x) << " starts:\n"; \
for (int ai = 0; ai <= n; ai++) { \
cout << (ai) << ":"; \
for (int aj = 0; aj < x[ai].size(); aj++) { \
cout << x[ai][aj] << y; \
} \
cout << "\n"; \
} \
cout << "\n" << (#x) << "ends\n";
#define watch2darr(x, m, n, y) \
cout << (#x) << " starts:\n"; \
for (int ai = 1; ai <= m; ai++) { \
for (int aj = 1; aj <= n; aj++) { \
cout << x[ai][aj] << y; \
} \
cout << "\n"; \
} \
cout << "\n" << (#x) << "ends\n";
#define print(x, y) cout << (x) << y;
#define printarrsz(x, y) \
for (int ai = 0; ai < sz(x); ai++) { \
cout << x[ai] << y; \
} \
cout << "\n";
#define printarr(x, n, y) \
for (int ai = 0; ai < n; ai++) { \
cout << x[ai] << y; \
} \
cout << "\n";
#define print2darr(x, m, n, y) \
for (int ai = 0; ai < m; ai++) { \
for (int aj = 0; aj < n; aj++) { \
cout << x[ai][aj] << y; \
} \
cout << "\n"; \
} \
cout << "\n";
#define mod(x) = (x % m + m) % m;
const ll m = (ll)1000000007;
const ll N = 3e6 + 5;
const ll INF = 1ll << 63;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef set<int> si;
typedef map<int, int> mii;
typedef pair<int, int> pii;
typedef vector<bool> vb;
typedef vector<pii> vpii;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef set<ll> sl;
typedef map<ll, ll> mll;
typedef pair<ll, ll> pll;
typedef vector<pll> vpll;
typedef priority_queue<pll, vpll, greater<pll>> pqg;
/***************************Code Begins Here *****************************/
void solve() {
// Never use x,y here, try to use i,j in loops only
inde(n);
ll p[n];
inputarr(p, n);
ll ok = 0;
rep(i, 0, n) {
if (p[i] == i + 1) {
continue;
} else {
if (p[p[i] - 1] == i + 1 && ok < 2) {
ok += 1;
continue;
} else {
print("NO", endl);
return;
}
}
}
print("YES", endl);
return;
}
signed main() {
ios ll t = 1;
// cin>>t;
// #ifndef ONLINE_JUDGE
// time_t time_t1, time_t2;
// time_t1 = clock();
// #endif
while (t--)
solve();
// #ifndef ONLINE_JUDGE
// time_t2 = clock();
// cout << "time taken :" << time_t2 - time_t1 << endl;
// #endif
return 0;
} | [
"assignment.value.change"
] | 765,585 | 765,586 | u777824330 | cpp |
p02958 | #include <iostream>
using namespace std;
int main() {
int a[51];
int n;
int sum = 0;
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> a[i];
if (a[i] != i) {
sum++;
}
}
if (sum == 2 || sum == 0) {
cout << "Yes" << endl;
} else {
cout << "NO" << endl;
}
return 0;
} | #include <iostream>
using namespace std;
int main() {
int a[51];
int n;
int sum = 0;
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> a[i];
if (a[i] != i) {
sum++;
}
}
if (sum == 2 || sum == 0) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
return 0;
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 765,590 | 765,591 | u482429476 | cpp |
p02958 | #include <iostream>
using namespace std;
main() {
int n, a[100], k;
bool suc;
cin >> n;
for (int i = 1; i <= n; i++)
cin >> a[i];
k = -1;
suc = 1;
for (int i = 1; i <= n; i++) {
if (a[i] != i) {
if (k == -1)
k = i;
else if (k == -2) {
suc = 0;
break;
} else {
if (a[k] == i && a[i] == k)
k == -2;
else {
suc = 0;
break;
}
}
}
}
if (suc == 1)
cout << "Yes" << endl;
else
cout << "No" << endl;
} | #include <iostream>
using namespace std;
main() {
int n, a[100], k;
bool suc;
cin >> n;
for (int i = 1; i <= n; i++)
cin >> a[i];
k = -1;
suc = 1;
for (int i = 1; i <= n; i++) {
if (a[i] != i) {
if (k == -1)
k = i;
else if (k == -2) {
suc = 0;
break;
} else {
if (a[k] == i && a[i] == k)
k == -2;
else {
suc = 0;
break;
}
}
}
}
if (suc == 1)
cout << "YES" << endl;
else
cout << "NO" << endl;
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 765,595 | 765,596 | u771099984 | cpp |
p02958 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
cin >> N;
K = 0;
std::vector<int> P(N);
for (size_t i = 0; i < N; ++i) {
cin >> P[i];
}
for (size_t t = 0; t < N; ++t) {
if (P[t] != t) {
K += 1;
}
}
if (K <= 2) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
cin >> N;
K = 0;
std::vector<int> P(N);
for (size_t i = 0; i < N; ++i) {
cin >> P[i];
}
for (size_t t = 0; t < N; ++t) {
if (P[t] != t + 1) {
K += 1;
}
}
if (K <= 2) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
return 0;
}
| [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 765,601 | 765,602 | u006521935 | cpp |
p02958 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
int a[n], b[n];
for (int i = 0; i < n; i++) {
cin >> a[i];
b[i] = a[i];
}
sort(b, b + n);
int cnt = 0;
for (int i = 0; i < n; i++) {
if (a[i] != b[i])
cnt++;
}
if (cnt == 0 || cnt == 2)
cout << "YES";
else
cout << "NO";
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int a[n], b[n];
for (int i = 0; i < n; i++) {
cin >> a[i];
b[i] = a[i];
}
sort(b, b + n);
int cnt = 0;
for (int i = 0; i < n; i++) {
if (a[i] != b[i])
cnt++;
}
if (cnt == 0 || cnt == 2)
cout << "YES";
else
cout << "NO";
} | [] | 765,608 | 765,609 | u573529926 | cpp |
p02958 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
bool was = false;
cin >> n;
vector<int> p(n);
for (int i = 0; i < n; i++) {
cin >> p[i];
}
vector<int> cp(n);
for (int i = 0; i < n; i++) {
cp[i] = i + 1;
}
int count = 0;
for (int i = 0; i < n; i++) {
if (p[i] != cp[i])
count++;
}
if (count == 2) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
return 0;
} | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
bool was = false;
cin >> n;
vector<int> p(n);
for (int i = 0; i < n; i++) {
cin >> p[i];
}
vector<int> cp(n);
for (int i = 0; i < n; i++) {
cp[i] = i + 1;
}
int count = 0;
for (int i = 0; i < n; i++) {
if (p[i] != cp[i])
count++;
}
if (count == 2 || count == 0) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
return 0;
} | [
"control_flow.branch.if.condition.change"
] | 765,616 | 765,617 | u224348558 | cpp |
p02958 | #include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int a[n + 1];
int co = 0;
for (int i = 1; i <= n; i++) {
cin >> a[i];
if (a[i] != i) {
co++;
}
}
if (co == 2 || co == 0) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
return 0;
}
| #include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int a[n + 1];
int co = 0;
for (int i = 1; i <= n; i++) {
cin >> a[i];
if (a[i] != i) {
co++;
}
}
if (co == 2 || co == 0) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
return 0;
}
| [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 765,622 | 765,623 | u525008368 | cpp |
p02958 | #include <stdio.h>
int main() {
int N;
int i;
int current;
int cnt = 0;
scanf("%d", &N);
for (i = 0; i < N; i++) {
scanf("%d", ¤t);
if (i != current) {
cnt++;
}
}
if (cnt > 2) {
printf("NO\n");
} else {
printf("YES\n");
}
return 0;
} | #include <stdio.h>
int main() {
int N;
int i;
int current;
int cnt = 0;
scanf("%d", &N);
for (i = 0; i < N; i++) {
scanf("%d", ¤t);
if ((i + 1) != current) {
cnt++;
}
}
if (cnt > 2) {
printf("NO\n");
} else {
printf("YES\n");
}
return 0;
} | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 765,634 | 765,635 | u251610528 | cpp |
p02958 | #include <bits/stdc++.h>
using namespace std;
#define all(a) a.begin(), a.end()
#define fori(i, n) for (int i = 0; i < n; i++)
#define forb(i, s, t) for (int i = s; i < t; i++)
#define fore(e, v) for (auto &e : v)
#define maxv(v) *max_element(all(v))
#define uniques(v) \
si s(all(ais)); \
v.assign(all(s))
#define inp(i) scanf("%i", &i)
#define debug(x) cout << #x << " " << x << endl;
#define start_clock clock_t begin = clock();
#define end_clock cout << double(clock() - begin) / CLOCKS_PER_SEC << endl;
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<pii> vpii;
typedef vector<int> vi;
typedef vector<ll> llv;
typedef set<int> si;
int main() {
int n;
cin >> n;
vi pis(n);
fori(i, n) cin >> pis[i];
int wrong;
fori(i, n) {
if (pis[i] != i + 1) {
wrong++;
}
}
cout << ((wrong == 2 || wrong == 0) ? "YES" : "NO") << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define all(a) a.begin(), a.end()
#define fori(i, n) for (int i = 0; i < n; i++)
#define forb(i, s, t) for (int i = s; i < t; i++)
#define fore(e, v) for (auto &e : v)
#define maxv(v) *max_element(all(v))
#define uniques(v) \
si s(all(ais)); \
v.assign(all(s))
#define inp(i) scanf("%i", &i)
#define debug(x) cout << #x << " " << x << endl;
#define start_clock clock_t begin = clock();
#define end_clock cout << double(clock() - begin) / CLOCKS_PER_SEC << endl;
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<pii> vpii;
typedef vector<int> vi;
typedef vector<ll> llv;
typedef set<int> si;
int main() {
int n;
cin >> n;
vi pis(n);
fori(i, n) cin >> pis[i];
int wrong = 0;
fori(i, n) {
if (pis[i] != i + 1) {
wrong++;
}
}
cout << ((wrong == 2 || wrong == 0) ? "YES" : "NO") << endl;
return 0;
} | [
"variable_declaration.value.change"
] | 765,636 | 765,637 | u041284359 | cpp |
p02958 | // mOzis_
/////*31022618*/////
//****//MONU KUMAR\****//
#include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define ull unsigned long long
#define p1(x) cout << x << "\n"
#define p2(x, y) cout << x << " " << y << "\n"
#define p3(x, y, z) cout << x << " " << y << " " << z << "\n"
#define nL cout << "\n"
#define lp(i, l, r) for (long long int i = l; i < r; i++)
#define mem(a, x) memset(a, x, sizeof(a)) // set elements of array to some value
#define pi 3.1415926535897932384626
#define mod 1000000007
#define pb(x) push_back(x)
#define ff first
#define ss second
#define siz 256 // characters are stored using 8 bit and there can be
bool anagram(char *s1,
char *s2) // 256 possible characters only in lowercase alphabet
{
ll count[siz];
mem(count, 0);
ll i;
for (i = 0; s1[i] && s2[i]; i++) {
count[s1[i]]++;
count[s2[i]]--;
}
if (s1[i] || s2[i]) {
return false;
}
lp(i, 0, siz) {
if (count[i]) {
return false;
}
}
return true;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll t = 0;
// cin>>t;
clock_t launch = clock();
ll n, flag = 0;
cin >> n;
ll a[n];
for (int i = 0; i < n; ++i) {
cin >> a[i];
}
for (int i = 0; i < n; ++i) {
if (a[i] != i + 1) {
t++;
if (t > 3) {
flag = 1;
break;
}
}
}
if (flag) {
cout << "NO"
<< "\n";
} else {
cout << "YES"
<< "\n";
}
clog << ((long double)(clock() - launch) / CLOCKS_PER_SEC) << "\n";
return 0;
}
//////////*********************end of program*********************//////////
| // mOzis_
/////*31022618*/////
//****//MONU KUMAR\****//
#include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define ull unsigned long long
#define p1(x) cout << x << "\n"
#define p2(x, y) cout << x << " " << y << "\n"
#define p3(x, y, z) cout << x << " " << y << " " << z << "\n"
#define nL cout << "\n"
#define lp(i, l, r) for (long long int i = l; i < r; i++)
#define mem(a, x) memset(a, x, sizeof(a)) // set elements of array to some value
#define pi 3.1415926535897932384626
#define mod 1000000007
#define pb(x) push_back(x)
#define ff first
#define ss second
#define siz 256 // characters are stored using 8 bit and there can be
bool anagram(char *s1,
char *s2) // 256 possible characters only in lowercase alphabet
{
ll count[siz];
mem(count, 0);
ll i;
for (i = 0; s1[i] && s2[i]; i++) {
count[s1[i]]++;
count[s2[i]]--;
}
if (s1[i] || s2[i]) {
return false;
}
lp(i, 0, siz) {
if (count[i]) {
return false;
}
}
return true;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll t = 0;
// cin>>t;
clock_t launch = clock();
ll n, flag = 0;
cin >> n;
ll a[n];
for (int i = 0; i < n; ++i) {
cin >> a[i];
}
for (int i = 0; i < n; ++i) {
if (a[i] != i + 1) {
t++;
if (t >= 3) {
flag = 1;
break;
}
}
}
if (flag) {
cout << "NO"
<< "\n";
} else {
cout << "YES"
<< "\n";
}
clog << ((long double)(clock() - launch) / CLOCKS_PER_SEC) << "\n";
return 0;
}
//////////*********************end of program*********************//////////
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 765,642 | 765,643 | u504609235 | cpp |
p02958 | /*
lakshaygpt28
Lakshay Gupta
*/
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
using ll = long long;
using db = double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using vll = vector<ll>;
template <typename T>
using OrderedSet =
tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
template <typename T>
using MinPriorityQueue = priority_queue<T, vector<T>, greater<T>>;
#ifndef ONLINE_JUDGE
#define debug(...) __f(#__VA_ARGS__, __VA_ARGS__)
template <typename Arg1> void __f(const char *name, Arg1 &&arg1) {
cerr << name << " : " << arg1 << std ::endl;
}
template <typename Arg1, typename... Args>
void __f(const char *names, Arg1 &&arg1, Args &&...args) {
const char *comma = strchr(names + 1, ',');
cerr.write(names, comma - names) << " : " << arg1 << " | ";
__f(comma + 1, args...);
}
#else
#define debug(...)
#endif
#define fast_io() \
ios_base ::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0)
#define eb emplace_back
#define mp make_pair
#define pb push_back
#define mt make_tuple
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
const db PI = acos(-1);
const ll LINF = LLONG_MAX;
const int INF = INT_MAX, MOD = 1e9 + 7, N = 1e5 + 10;
ll a[N], b[N];
int main() {
fast_io();
ll n;
cin >> n;
for (ll i = 1; i <= n; i++) {
cin >> a[i];
b[i] = a[i];
}
sort(b, b + n);
ll cnt = 0;
for (ll i = 1; i <= n; i++) {
if (a[i] != b[i]) {
cnt++;
}
}
if (cnt == 0 or cnt == 2) {
cout << "YES\n";
} else {
cout << "NO\n";
}
return 0;
}
| /*
lakshaygpt28
Lakshay Gupta
*/
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
using ll = long long;
using db = double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using vll = vector<ll>;
template <typename T>
using OrderedSet =
tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
template <typename T>
using MinPriorityQueue = priority_queue<T, vector<T>, greater<T>>;
#ifndef ONLINE_JUDGE
#define debug(...) __f(#__VA_ARGS__, __VA_ARGS__)
template <typename Arg1> void __f(const char *name, Arg1 &&arg1) {
cerr << name << " : " << arg1 << std ::endl;
}
template <typename Arg1, typename... Args>
void __f(const char *names, Arg1 &&arg1, Args &&...args) {
const char *comma = strchr(names + 1, ',');
cerr.write(names, comma - names) << " : " << arg1 << " | ";
__f(comma + 1, args...);
}
#else
#define debug(...)
#endif
#define fast_io() \
ios_base ::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0)
#define eb emplace_back
#define mp make_pair
#define pb push_back
#define mt make_tuple
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
const db PI = acos(-1);
const ll LINF = LLONG_MAX;
const int INF = INT_MAX, MOD = 1e9 + 7, N = 1e5 + 10;
ll a[N], b[N];
int main() {
fast_io();
ll n;
cin >> n;
for (ll i = 1; i <= n; i++) {
cin >> a[i];
b[i] = a[i];
}
sort(b + 1, b + n + 1);
ll cnt = 0;
for (ll i = 1; i <= n; i++) {
if (a[i] != b[i]) {
cnt++;
}
}
if (cnt == 0 or cnt == 2) {
cout << "YES\n";
} else {
cout << "NO\n";
}
return 0;
}
| [
"expression.operation.binary.add"
] | 765,661 | 765,662 | u295509734 | cpp |
p02958 |
#include <bits/stdc++.h>
using namespace std;
int a[100];
int main() {
int n;
int now = 0;
cin >> n;
for (int i = 1; i <= n; i++)
cin >> a[i];
for (int i = 1; i <= n; i++) {
if (a[i] != i)
now++;
}
if (now != 2) {
puts("NO");
return 0;
}
puts("YES");
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int a[100];
int main() {
int n;
int now = 0;
cin >> n;
for (int i = 1; i <= n; i++)
cin >> a[i];
for (int i = 1; i <= n; i++) {
if (a[i] != i)
now++;
}
if (now > 2) {
puts("NO");
return 0;
}
puts("YES");
return 0;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 765,663 | 765,664 | u206489571 | cpp |
p02958 | #include <bits/stdc++.h>
#include <random>
using namespace std;
namespace _ {
bool rEOF = 1; //为0表示文件结尾
inline char nc() {
static char buf[100000], *p1 = buf, *p2 = buf;
return p1 == p2 && rEOF &&
(p2 = (p1 = buf) + fread(buf, 1, 100000, stdin), p1 == p2)
? (rEOF = 0, EOF)
: *p1++;
}
template <class _T> inline bool read(_T &num) {
char c = nc(), f = 1;
num = 0;
while (c < '0' || c > '9')
c == '-' && (f = -1), c = nc();
while (c >= '0' && c <= '9')
num = num * 10 + c - '0', c = nc();
return (bool)(num *= f);
}
inline bool need(char &c) {
return c >= 'a' && c <= 'z' || c >= '0' && c <= '9' || c >= 'A' && c <= 'Z';
} //读入的字符范围
inline bool read_str(char *a) {
while ((*a = nc()) && need(*a) && rEOF)
++a;
*a = '\0';
return rEOF;
}
} // namespace _
using namespace _;
int a[500];
int main() {
int n;
cin >> n;
for (int i = 1; i <= n; i++)
cin >> a[i];
int sum = 0;
for (int i = 2; i <= n; i++)
if (a[i] != i)
sum++;
if (sum >= 3)
printf("NO\n");
else
printf("YES\n");
return 0;
}
| #include <bits/stdc++.h>
#include <random>
using namespace std;
namespace _ {
bool rEOF = 1; //为0表示文件结尾
inline char nc() {
static char buf[100000], *p1 = buf, *p2 = buf;
return p1 == p2 && rEOF &&
(p2 = (p1 = buf) + fread(buf, 1, 100000, stdin), p1 == p2)
? (rEOF = 0, EOF)
: *p1++;
}
template <class _T> inline bool read(_T &num) {
char c = nc(), f = 1;
num = 0;
while (c < '0' || c > '9')
c == '-' && (f = -1), c = nc();
while (c >= '0' && c <= '9')
num = num * 10 + c - '0', c = nc();
return (bool)(num *= f);
}
inline bool need(char &c) {
return c >= 'a' && c <= 'z' || c >= '0' && c <= '9' || c >= 'A' && c <= 'Z';
} //读入的字符范围
inline bool read_str(char *a) {
while ((*a = nc()) && need(*a) && rEOF)
++a;
*a = '\0';
return rEOF;
}
} // namespace _
using namespace _;
int a[500];
int main() {
int n;
cin >> n;
for (int i = 1; i <= n; i++)
cin >> a[i];
int sum = 0;
for (int i = 1; i <= n; i++)
if (a[i] != i)
sum++;
if (sum >= 3)
printf("NO\n");
else
printf("YES\n");
return 0;
}
| [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 765,665 | 765,666 | u066917439 | cpp |
p02958 | #include <bits/stdc++.h>
#include <random>
using namespace std;
namespace _ {
bool rEOF = 1; //为0表示文件结尾
inline char nc() {
static char buf[100000], *p1 = buf, *p2 = buf;
return p1 == p2 && rEOF &&
(p2 = (p1 = buf) + fread(buf, 1, 100000, stdin), p1 == p2)
? (rEOF = 0, EOF)
: *p1++;
}
template <class _T> inline bool read(_T &num) {
char c = nc(), f = 1;
num = 0;
while (c < '0' || c > '9')
c == '-' && (f = -1), c = nc();
while (c >= '0' && c <= '9')
num = num * 10 + c - '0', c = nc();
return (bool)(num *= f);
}
inline bool need(char &c) {
return c >= 'a' && c <= 'z' || c >= '0' && c <= '9' || c >= 'A' && c <= 'Z';
} //读入的字符范围
inline bool read_str(char *a) {
while ((*a = nc()) && need(*a) && rEOF)
++a;
*a = '\0';
return rEOF;
}
} // namespace _
using namespace _;
int a[50];
int main() {
int n;
cin >> n;
for (int i = 1; i <= n; i++)
cin >> a[i];
int sum = 0;
for (int i = 2; i <= n; i++)
if (a[i] != i)
sum++;
if (sum >= 3)
printf("NO\n");
else
printf("YES\n");
return 0;
}
| #include <bits/stdc++.h>
#include <random>
using namespace std;
namespace _ {
bool rEOF = 1; //为0表示文件结尾
inline char nc() {
static char buf[100000], *p1 = buf, *p2 = buf;
return p1 == p2 && rEOF &&
(p2 = (p1 = buf) + fread(buf, 1, 100000, stdin), p1 == p2)
? (rEOF = 0, EOF)
: *p1++;
}
template <class _T> inline bool read(_T &num) {
char c = nc(), f = 1;
num = 0;
while (c < '0' || c > '9')
c == '-' && (f = -1), c = nc();
while (c >= '0' && c <= '9')
num = num * 10 + c - '0', c = nc();
return (bool)(num *= f);
}
inline bool need(char &c) {
return c >= 'a' && c <= 'z' || c >= '0' && c <= '9' || c >= 'A' && c <= 'Z';
} //读入的字符范围
inline bool read_str(char *a) {
while ((*a = nc()) && need(*a) && rEOF)
++a;
*a = '\0';
return rEOF;
}
} // namespace _
using namespace _;
int a[500];
int main() {
int n;
cin >> n;
for (int i = 1; i <= n; i++)
cin >> a[i];
int sum = 0;
for (int i = 1; i <= n; i++)
if (a[i] != i)
sum++;
if (sum >= 3)
printf("NO\n");
else
printf("YES\n");
return 0;
}
| [
"literal.number.change",
"variable_declaration.array_dimensions.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 765,667 | 765,666 | u066917439 | cpp |
p02958 | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef vector<ll> vl;
typedef vector<pair<ll, ll>> vp;
#define rep(i, n) for (ll i = 0; i < ll(n); i++)
#define MMOD(i) ((i % MOD) + MOD) % MOD;
#define all(v) v.begin(), v.end()
#define vec(i, j) vector<vector<ll>>(i, vector<ll>(j, 0))
#define input(v, n) \
rep(i, n) { \
ll x; \
cin >> x; \
v.push_back(x); \
}
const ll INF = 99999999999999;
const ll MOD = 1000000007;
const ll MAX_N = 100010;
ll a, b, c, d, e, f, x, y, z, k, m, n, l, h, w, t, p, q, ans = 0;
vl v;
ll solve() {
a = 0;
rep(i, n) {
if (v[i] == i + 1)
a++;
}
if (a == n - 2) {
cout << "YES" << endl;
return 0;
}
cout << "NO" << endl;
return 0;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
cin >> n;
input(v, n);
solve();
} | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef vector<ll> vl;
typedef vector<pair<ll, ll>> vp;
#define rep(i, n) for (ll i = 0; i < ll(n); i++)
#define MMOD(i) ((i % MOD) + MOD) % MOD;
#define all(v) v.begin(), v.end()
#define vec(i, j) vector<vector<ll>>(i, vector<ll>(j, 0))
#define input(v, n) \
rep(i, n) { \
ll x; \
cin >> x; \
v.push_back(x); \
}
const ll INF = 99999999999999;
const ll MOD = 1000000007;
const ll MAX_N = 100010;
ll a, b, c, d, e, f, x, y, z, k, m, n, l, h, w, t, p, q, ans = 0;
vl v;
ll solve() {
a = 0;
rep(i, n) {
if (v[i] == i + 1)
a++;
}
if (a == n - 2 || a == n) {
cout << "YES" << endl;
return 0;
}
cout << "NO" << endl;
return 0;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
cin >> n;
input(v, n);
solve();
} | [
"control_flow.branch.if.condition.change"
] | 765,668 | 765,669 | u268571052 | cpp |
p02958 | #include <bits/stdc++.h>
using namespace std;
#define vi vector<int>
#define vvi vector<vector<int>>
int main(void) {
int n, ans = 0;
cin >> n;
for (int i = 1; i <= n; i++) {
int a;
cin >> a;
if (a != i) {
ans++;
}
}
if (ans == 2) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define vi vector<int>
#define vvi vector<vector<int>>
int main(void) {
int n, ans = 0;
cin >> n;
for (int i = 1; i <= n; i++) {
int a;
cin >> a;
if (a != i) {
ans++;
}
}
if (ans == 2 || ans == 0) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
return 0;
}
| [
"control_flow.branch.if.condition.change"
] | 765,670 | 765,671 | u360441331 | cpp |
p02958 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld double
#define pii pair<ll, ll>
#define vl vector<ll>
#define vb vector<bool>
#define vs vector<string>
#define vp vector<pii>
#define pb push_back
#define mp make_pair
#define sc(a) scanf("%lld", &a);
#define sd(a) scanf("%lf", &a);
#define test() \
ll tt; \
cin >> tt; \
for (ll testcase = 1; testcase <= tt; testcase++)
#define all(v) v.begin(), v.end()
#define vivek_ghosh \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
#define MAX 1000055
#define mod 1000000007
#define ff first
#define ss second
const long long int INF = 0x3f3f3f3f3f3f;
ll power(ll x, ll n, ll M) {
if (n == 0)
return 1;
else if (n % 2 == 0)
return power((x * x) % M, n / 2, M);
else
return (x * power((x * x) % M, (n - 1) / 2, M)) % M;
}
ll modinv(ll a, ll m) {
ll g = __gcd(a, m);
ll res = power(a, m - 2, m);
return res;
}
vb prime(MAX, true);
vl prm;
void sieve() {
prime[0] = prime[1] = false;
for (ll p = 2; p * p < MAX; p++) {
if (prime[p]) {
for (ll i = p * p; i < MAX; i += p)
prime[i] = false;
}
}
for (ll p = 2; p < MAX; p++) {
if (prime[p])
prm.pb(p);
}
}
ll n, m, t, i, j, k, q, x, y, ans = 0, cnt = 0, sum = 0, mx = -1, mn = INT_MAX;
string s;
typedef struct node {
ll x, y, left, up, right, down;
} node;
int main() {
vivek_ghosh;
cin >> n;
vl p(n + 2);
p[0] = 0;
p[n + 1] = 100;
for (i = 1; i <= n; i++) {
cin >> p[i];
}
for (i = 1; i <= n; i++) {
if (p[i] != i)
cnt++;
}
if (cnt > 1)
cout << "NO";
else
cout << "YES";
cout << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld double
#define pii pair<ll, ll>
#define vl vector<ll>
#define vb vector<bool>
#define vs vector<string>
#define vp vector<pii>
#define pb push_back
#define mp make_pair
#define sc(a) scanf("%lld", &a);
#define sd(a) scanf("%lf", &a);
#define test() \
ll tt; \
cin >> tt; \
for (ll testcase = 1; testcase <= tt; testcase++)
#define all(v) v.begin(), v.end()
#define vivek_ghosh \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
#define MAX 1000055
#define mod 1000000007
#define ff first
#define ss second
const long long int INF = 0x3f3f3f3f3f3f;
ll power(ll x, ll n, ll M) {
if (n == 0)
return 1;
else if (n % 2 == 0)
return power((x * x) % M, n / 2, M);
else
return (x * power((x * x) % M, (n - 1) / 2, M)) % M;
}
ll modinv(ll a, ll m) {
ll g = __gcd(a, m);
ll res = power(a, m - 2, m);
return res;
}
vb prime(MAX, true);
vl prm;
void sieve() {
prime[0] = prime[1] = false;
for (ll p = 2; p * p < MAX; p++) {
if (prime[p]) {
for (ll i = p * p; i < MAX; i += p)
prime[i] = false;
}
}
for (ll p = 2; p < MAX; p++) {
if (prime[p])
prm.pb(p);
}
}
ll n, m, t, i, j, k, q, x, y, ans = 0, cnt = 0, sum = 0, mx = -1, mn = INT_MAX;
string s;
typedef struct node {
ll x, y, left, up, right, down;
} node;
int main() {
vivek_ghosh;
cin >> n;
vl p(n + 2);
p[0] = 0;
p[n + 1] = 100;
for (i = 1; i <= n; i++) {
cin >> p[i];
}
for (i = 1; i <= n; i++) {
if (p[i] != i)
cnt++;
}
if (cnt > 2)
cout << "NO";
else
cout << "YES";
cout << endl;
return 0;
}
| [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 765,672 | 765,673 | u378150841 | cpp |
p02958 | #include <algorithm>
#include <cctype>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#define rep(i, p, q) for (ll i = p; i < q; ++i)
#define ll long long
using namespace std;
const int MAX = 510000;
const int MOD = 1000000007;
long long fac[MAX], finv[MAX], inv[MAX];
// テーブルを作る前処理
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < MAX; i++) {
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
// 二項係数計算
long long COM(int n, int k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
ll npk(ll n, ll k) {
ll ret = 1;
if (n < k || n < 0)
return 0;
rep(i, 0, k) {
ret *= (n - i);
ret %= MOD;
}
if (ret < 0)
ret = 0;
return ret;
}
// 135 B
int main(void) {
ll count = 0;
ll n = 0;
cin >> n;
rep(i, 1, n + 1) {
ll j = 0;
cin >> j;
if (i != j)
count++;
}
if (count <= 2)
cout << "Yes" << endl;
else
cout << "No" << endl;
} | #include <algorithm>
#include <cctype>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#define rep(i, p, q) for (ll i = p; i < q; ++i)
#define ll long long
using namespace std;
const int MAX = 510000;
const int MOD = 1000000007;
long long fac[MAX], finv[MAX], inv[MAX];
// テーブルを作る前処理
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < MAX; i++) {
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
// 二項係数計算
long long COM(int n, int k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
ll npk(ll n, ll k) {
ll ret = 1;
if (n < k || n < 0)
return 0;
rep(i, 0, k) {
ret *= (n - i);
ret %= MOD;
}
if (ret < 0)
ret = 0;
return ret;
}
// 135 B
int main(void) {
ll count = 0;
ll n = 0;
cin >> n;
rep(i, 1, n + 1) {
ll j = 0;
cin >> j;
if (i != j)
count++;
}
if (count <= 2)
cout << "YES" << endl;
else
cout << "NO" << endl;
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 765,676 | 765,677 | u693569496 | cpp |
p02958 | #include <algorithm>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <stdio.h>
#include <string>
#include <unordered_map>
#include <vector>
using namespace std;
using ll = long long;
using vec = vector<ll>;
using mat = vector<vec>;
using lst = list<ll>;
ll MAX = 1000000000;
int main() {
int N;
cin >> N;
vec p(N);
for (int i = 0; i < N; ++i) {
cin >> p[i];
}
for (int i = 0; i < N; ++i) {
for (int j = 0; j < N; ++j) {
swap(p[i], p[j]);
bool flag = true;
for (int k = 1; k < N; ++k) {
if (p[k - 1] > p[k])
flag = false;
}
if (flag) {
cout << "Yes" << endl;
return 0;
}
swap(p[i], p[j]);
}
}
cout << "No" << endl;
return 0;
} | #include <algorithm>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <stdio.h>
#include <string>
#include <unordered_map>
#include <vector>
using namespace std;
using ll = long long;
using vec = vector<ll>;
using mat = vector<vec>;
using lst = list<ll>;
ll MAX = 1000000000;
int main() {
int N;
cin >> N;
vec p(N);
for (int i = 0; i < N; ++i) {
cin >> p[i];
}
for (int i = 0; i < N; ++i) {
for (int j = 0; j < N; ++j) {
swap(p[i], p[j]);
bool flag = true;
for (int k = 1; k < N; ++k) {
if (p[k - 1] > p[k])
flag = false;
}
if (flag) {
cout << "YES" << endl;
return 0;
}
swap(p[i], p[j]);
}
}
cout << "NO" << endl;
return 0;
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 765,678 | 765,679 | u765606693 | cpp |
p02958 | #include <algorithm>
#include <assert.h>
#include <bitset>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <fstream>
#include <iomanip>
#include <ios>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <memory>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdlib.h>
#include <time.h>
#include <utility>
#include <vector>
using namespace std;
int n, cnt = 0;
int a[52], b[52];
int main() {
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a[i];
b[i] = a[i];
}
sort(a, a + n);
for (int i = 0; i < n; i++)
if (a[i] != b[i])
cnt++;
if (cnt > 2)
cout << "No";
else
cout << "Yes";
} | #include <algorithm>
#include <assert.h>
#include <bitset>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <fstream>
#include <iomanip>
#include <ios>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <memory>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdlib.h>
#include <time.h>
#include <utility>
#include <vector>
using namespace std;
int n, cnt = 0;
int a[52], b[52];
int main() {
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a[i];
b[i] = a[i];
}
sort(a, a + n);
for (int i = 0; i < n; i++)
if (a[i] != b[i])
cnt++;
if (cnt > 2)
cout << "NO";
else
cout << "YES";
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 765,682 | 765,683 | u937608388 | cpp |
p02958 | #include <bits/stdc++.h>
//#pragma GCC optimize("O3")
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#pragma GCC optimize("unroll-loops")
#define pb push_back
#define IOS \
ios_base::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0); \
cout << fixed << setprecision(16);
#define ll long long int
#define ld long double
#define el '\n'
#define El '\n'
#define PI (ld)3.141592653589793238462643383279502884197169399375105820974944
#define inf (ll)1000000000
#define mod (ll)1000000007
#define mod1 (ll)998244353
#define fo(i, n) for (long long i = 0; i < n; i++)
#define pll pair<ll, ll>
#define ml map<ll, ll>
#define vpl vector<pll>
#define vvl vector<vector<ll>>
#define vvpl vector<vector<pll>>
#define ff first
#define ss second
#define pqueue priority_queue<ll>
#define pdqueue priority_queue<ll, vl, greater<ll>>
#define mem(a, b) memset(a, b, sizeof(a));
// mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
#define sz(a) (ll) a.size()
#define f(i, a, b) for (ll i = a; i < b; i++)
#define fd(i, a, b) for (ll i = a; i >= b; i--)
#define all(a) a.begin(), a.end()
#define vl vector<ll>
//#define x ff
//#define y ss
#define pt(a) \
for (auto it : a) \
cout << it << " "; \
cout << endl;
unsigned seed = std::chrono::system_clock::now().time_since_epoch().count();
using namespace std;
// vector
template <class T> istream &operator>>(istream &is, vector<T> &v) {
for (T &a : v)
is >> a;
return is;
}
template <class T> ostream &operator<<(ostream &os, const vector<T> &v) {
for (const T &t : v)
os << t << " ";
return os << endl;
}
// pair
template <class T, class U>
ostream &operator<<(ostream &os, const pair<T, U> &v) {
return os << v.first << " " << v.second;
}
double gcd(double a, double b) { return a < 0.01 ? b : gcd(fmod(b, a), a); }
long long bpow(long long a, long long b, long long m) {
a %= m;
long long res = 1;
while (b > 0) {
if (b & 1)
res = res * a % m;
a = a * a % m;
b >>= 1;
}
return res;
}
ll kv;
ll t, n, x, y, h, k, z, p, q, w, m;
string s[1000], s1, s2;
// vvl v;
// vl vis,d;
int main() {
IOS;
cin >> n;
vl v, a;
cin >> v;
a = v;
sort(all(a));
if (v == a)
return cout << "YES", 0;
for (int i = 0; i < n; i++) {
for (int j = i + 1; j < n; j++) {
swap(v[i], v[j]);
if (v == a)
return cout << "YES", 0;
swap(v[i], v[j]);
}
}
cout << "NO";
return 0;
}
| #include <bits/stdc++.h>
//#pragma GCC optimize("O3")
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#pragma GCC optimize("unroll-loops")
#define pb push_back
#define IOS \
ios_base::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0); \
cout << fixed << setprecision(16);
#define ll long long int
#define ld long double
#define el '\n'
#define El '\n'
#define PI (ld)3.141592653589793238462643383279502884197169399375105820974944
#define inf (ll)1000000000
#define mod (ll)1000000007
#define mod1 (ll)998244353
#define fo(i, n) for (long long i = 0; i < n; i++)
#define pll pair<ll, ll>
#define ml map<ll, ll>
#define vpl vector<pll>
#define vvl vector<vector<ll>>
#define vvpl vector<vector<pll>>
#define ff first
#define ss second
#define pqueue priority_queue<ll>
#define pdqueue priority_queue<ll, vl, greater<ll>>
#define mem(a, b) memset(a, b, sizeof(a));
// mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
#define sz(a) (ll) a.size()
#define f(i, a, b) for (ll i = a; i < b; i++)
#define fd(i, a, b) for (ll i = a; i >= b; i--)
#define all(a) a.begin(), a.end()
#define vl vector<ll>
//#define x ff
//#define y ss
#define pt(a) \
for (auto it : a) \
cout << it << " "; \
cout << endl;
unsigned seed = std::chrono::system_clock::now().time_since_epoch().count();
using namespace std;
// vector
template <class T> istream &operator>>(istream &is, vector<T> &v) {
for (T &a : v)
is >> a;
return is;
}
template <class T> ostream &operator<<(ostream &os, const vector<T> &v) {
for (const T &t : v)
os << t << " ";
return os << endl;
}
// pair
template <class T, class U>
ostream &operator<<(ostream &os, const pair<T, U> &v) {
return os << v.first << " " << v.second;
}
double gcd(double a, double b) { return a < 0.01 ? b : gcd(fmod(b, a), a); }
long long bpow(long long a, long long b, long long m) {
a %= m;
long long res = 1;
while (b > 0) {
if (b & 1)
res = res * a % m;
a = a * a % m;
b >>= 1;
}
return res;
}
ll kv;
ll t, n, x, y, h, k, z, p, q, w, m;
string s[1000], s1, s2;
// vvl v;
// vl vis,d;
int main() {
IOS;
cin >> n;
vl v(n), a;
cin >> v;
a = v;
sort(all(a));
if (v == a)
return cout << "YES", 0;
for (int i = 0; i < n; i++) {
for (int j = i + 1; j < n; j++) {
swap(v[i], v[j]);
if (v == a)
return cout << "YES", 0;
swap(v[i], v[j]);
}
}
cout << "NO";
return 0;
}
| [] | 765,685 | 765,686 | u524492594 | cpp |
p02958 | #include <bits/stdc++.h>
using namespace std;
int n, a[100], b[100], c = 0;
int main() {
cin >> n;
for (int i = 0; i < n; i++)
cin >> a[i], b[i] = a[i];
sort(a, a + n);
for (int i = 0; i < n; i++)
if (a[i] != b[i])
c++;
if (c == 2)
cout << "YES";
else
cout << "NO";
} | #include <bits/stdc++.h>
using namespace std;
int n, a[100], b[100], c = 0;
int main() {
cin >> n;
for (int i = 0; i < n; i++)
cin >> a[i], b[i] = a[i];
sort(a, a + n);
for (int i = 0; i < n; i++)
if (a[i] != b[i])
c++;
if (c <= 2)
cout << "YES";
else
cout << "NO";
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 765,689 | 765,690 | u709966987 | cpp |
p02958 | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (n); i++)
#define ALL(a) a.begin(), a.end()
#define RALL(a) a.rbegin(), a.rend()
using namespace std;
using ll = long long;
const ll MOD = 1000000007;
const ll INF = MOD * MOD;
int main() {
int n, cnt = 0;
cin >> n;
vector<int> a(n);
REP(i, n) {
cin >> a[i];
if (a[i] != i)
cnt++;
}
if (cnt == 0 || cnt == 2)
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 ALL(a) a.begin(), a.end()
#define RALL(a) a.rbegin(), a.rend()
using namespace std;
using ll = long long;
const ll MOD = 1000000007;
const ll INF = MOD * MOD;
int main() {
int n, cnt = 0;
cin >> n;
vector<int> a(n);
REP(i, n) {
cin >> a[i];
if (a[i] != i + 1)
cnt++;
}
if (cnt == 0 || cnt == 2)
cout << "YES" << endl;
else
cout << "NO" << endl;
return 0;
} | [
"control_flow.branch.if.condition.change"
] | 765,691 | 765,692 | u538125576 | cpp |
p02958 | #include <bits/stdc++.h>
using namespace std;
int main() {
int f[55], p[55];
int n;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> f[i];
p[i] = f[i];
}
sort(&f[0], &f[n]);
int cnt = 0;
for (int i = 0; i < n; i++) {
if (f[i] != p[i])
cnt++;
}
cout << (cnt <= 1 ? "YES" : "NO") << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int f[55], p[55];
int n;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> f[i];
p[i] = f[i];
}
sort(&f[0], &f[n]);
int cnt = 0;
for (int i = 0; i < n; i++) {
if (f[i] != p[i])
cnt++;
}
cout << (cnt <= 2 ? "YES" : "NO") << endl;
} | [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"io.output.change"
] | 765,693 | 765,694 | u354271781 | cpp |
p02958 | #include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rrep(i, n) for (int i = 1; i <= (n); ++i)
#define drep(i, n) for (int i = (n)-1; i >= 0; --i)
#define srep(i, s, t) for (int i = s; i < t; ++i)
#define rng(a) a.begin(), a.end()
#define rrng(a) a.rbegin(), a.rend()
#define maxs(x, y) (x = max(x, y))
#define mins(x, y) (x = min(x, y))
#define limit(x, l, r) max(l, min(x, r))
#define lims(x, l, r) (x = max(l, min(x, r)))
#define isin(x, l, r) ((l) <= (x) && (x) < (r))
#define pb push_back
#define eb emplace_back
#define sz(x) (int)(x).size()
#define pcnt __builtin_popcountll
#define uni(x) x.erase(unique(rng(x)), x.end())
#define snuke srand((unsigned)clock() + (unsigned)time(NULL));
#define show(x) cout << #x << " = " << x << endl;
#define PQ(T) priority_queue<T, v(T), greater<T>>
#define bn(x) ((1 << x) - 1)
#define dup(x, y) (((x) + (y)-1) / (y))
#define newline puts("")
#define v(T) vector<T>
#define vv(T) v(v(T))
using namespace std;
typedef long long int ll;
typedef unsigned uint;
typedef unsigned long long ull;
typedef pair<int, int> P;
typedef tuple<int, int, int> T;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vl;
typedef vector<P> vp;
typedef vector<T> vt;
// inline int in() { int x; scanf("%d",&x); return x;}
inline ll in() {
ll x;
cin >> x;
return x;
}
template <typename T> inline istream &operator>>(istream &i, v(T) & v) {
rep(j, sz(v)) i >> v[j];
return i;
}
template <typename T> string join(const v(T) & v) {
stringstream s;
rep(i, sz(v)) s << ' ' << v[i];
return s.str().substr(1);
}
template <typename T> inline ostream &operator<<(ostream &o, const v(T) & v) {
if (sz(v))
o << join(v);
return o;
}
template <typename T1, typename T2>
inline istream &operator>>(istream &i, pair<T1, T2> &v) {
return i >> v.fi >> v.se;
}
template <typename T1, typename T2>
inline ostream &operator<<(ostream &o, const pair<T1, T2> &v) {
return o << v.fi << "," << v.se;
}
template <typename T> inline ll suma(const v(T) & a) {
ll res(0);
for (auto &&x : a)
res += x;
return res;
}
const double eps = 1e-10;
const ll LINF = 1001002003004005006ll;
const int INF = 1001001001;
#define dame \
{ \
puts("-1"); \
return 0; \
}
#define yn \
{ puts("YES"); } \
else { \
puts("NO"); \
}
const int MX = 200005;
int main() {
int n = in();
int cnt = 0;
rep(i, n) if (i != in()) cnt++;
if (cnt == 2 || cnt == 0) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
// ll s = in();
// ll x1 = 1e9, x2 = 1;
// ll y2 = dup(s,x1), y1 = x1*y2-s;
// vl ans;
// ans.pb(0); ans.pb(0);
// ans.pb(x1); ans.pb(y1);
// ans.pb(x2); ans.pb(y2);
// cout<<ans<<endl;
return 0;
}
| #include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rrep(i, n) for (int i = 1; i <= (n); ++i)
#define drep(i, n) for (int i = (n)-1; i >= 0; --i)
#define srep(i, s, t) for (int i = s; i < t; ++i)
#define rng(a) a.begin(), a.end()
#define rrng(a) a.rbegin(), a.rend()
#define maxs(x, y) (x = max(x, y))
#define mins(x, y) (x = min(x, y))
#define limit(x, l, r) max(l, min(x, r))
#define lims(x, l, r) (x = max(l, min(x, r)))
#define isin(x, l, r) ((l) <= (x) && (x) < (r))
#define pb push_back
#define eb emplace_back
#define sz(x) (int)(x).size()
#define pcnt __builtin_popcountll
#define uni(x) x.erase(unique(rng(x)), x.end())
#define snuke srand((unsigned)clock() + (unsigned)time(NULL));
#define show(x) cout << #x << " = " << x << endl;
#define PQ(T) priority_queue<T, v(T), greater<T>>
#define bn(x) ((1 << x) - 1)
#define dup(x, y) (((x) + (y)-1) / (y))
#define newline puts("")
#define v(T) vector<T>
#define vv(T) v(v(T))
using namespace std;
typedef long long int ll;
typedef unsigned uint;
typedef unsigned long long ull;
typedef pair<int, int> P;
typedef tuple<int, int, int> T;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vl;
typedef vector<P> vp;
typedef vector<T> vt;
// inline int in() { int x; scanf("%d",&x); return x;}
inline ll in() {
ll x;
cin >> x;
return x;
}
template <typename T> inline istream &operator>>(istream &i, v(T) & v) {
rep(j, sz(v)) i >> v[j];
return i;
}
template <typename T> string join(const v(T) & v) {
stringstream s;
rep(i, sz(v)) s << ' ' << v[i];
return s.str().substr(1);
}
template <typename T> inline ostream &operator<<(ostream &o, const v(T) & v) {
if (sz(v))
o << join(v);
return o;
}
template <typename T1, typename T2>
inline istream &operator>>(istream &i, pair<T1, T2> &v) {
return i >> v.fi >> v.se;
}
template <typename T1, typename T2>
inline ostream &operator<<(ostream &o, const pair<T1, T2> &v) {
return o << v.fi << "," << v.se;
}
template <typename T> inline ll suma(const v(T) & a) {
ll res(0);
for (auto &&x : a)
res += x;
return res;
}
const double eps = 1e-10;
const ll LINF = 1001002003004005006ll;
const int INF = 1001001001;
#define dame \
{ \
puts("-1"); \
return 0; \
}
#define yn \
{ puts("YES"); } \
else { \
puts("NO"); \
}
const int MX = 200005;
int main() {
int n = in();
int cnt = 0;
rep(i, n) if (i + 1 != in()) cnt++;
if (cnt == 2 || cnt == 0) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
// ll s = in();
// ll x1 = 1e9, x2 = 1;
// ll y2 = dup(s,x1), y1 = x1*y2-s;
// vl ans;
// ans.pb(0); ans.pb(0);
// ans.pb(x1); ans.pb(y1);
// ans.pb(x2); ans.pb(y2);
// cout<<ans<<endl;
return 0;
}
| [
"control_flow.branch.if.condition.change"
] | 765,697 | 765,698 | u526630579 | cpp |
p02958 | #include <algorithm>/*toupperとかが入っている*/
#include <cmath>
#include <iostream>
#include <string>
#include <vector>/*可変長配列vectorのインクルード*/
const int MOD =
1000000007; /* 1,000,000,007 で割った余りを出力する のとき使う*/
using namespace std; /*標準名前空間を利用する。cinやcoutはこれによって利用可能になる*/
int N;
int P[55];
long long int A, B;
int main(void) {
cin >> N;
for (int i = 0; i < N; i++) {
cin >> P[i];
}
int count = 0;
for (int i = 0; i < N; i++) {
if (P[i] == i + 1)
count++;
}
if (count == N || count == N - 2) {
cout << "YES" << endl;
} else {
cout << "No" << endl;
}
return 0;
}
| #include <algorithm>/*toupperとかが入っている*/
#include <cmath>
#include <iostream>
#include <string>
#include <vector>/*可変長配列vectorのインクルード*/
const int MOD =
1000000007; /* 1,000,000,007 で割った余りを出力する のとき使う*/
using namespace std; /*標準名前空間を利用する。cinやcoutはこれによって利用可能になる*/
int N;
int P[55];
long long int A, B;
int main(void) {
cin >> N;
for (int i = 0; i < N; i++) {
cin >> P[i];
}
int count = 0;
for (int i = 0; i < N; i++) {
if (P[i] == i + 1)
count++;
}
if (count == N || count == N - 2) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
return 0;
}
| [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 765,699 | 765,700 | u607444339 | cpp |
p02958 | #include <algorithm>
#include <climits>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
int main() {
int n;
cin >> n;
vector<int> p(n);
rep(i, n) cin >> p[i];
bool ans = false;
int cnt = 0;
for (int i = 1; i <= n; ++i) {
if (p[i - 1] != i)
cnt++;
}
if (cnt == 0 || cnt == 2) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
}
| #include <algorithm>
#include <climits>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
int main() {
int n;
cin >> n;
vector<int> p(n);
rep(i, n) cin >> p[i];
bool ans = false;
int cnt = 0;
for (int i = 1; i <= n; ++i) {
if (p[i - 1] != i)
cnt++;
}
if (cnt == 0 || cnt == 2) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
}
| [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 765,706 | 765,707 | u239409893 | cpp |
p02958 | #include <bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
#pragma comment(linker, "/stack:200000000")
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define start_routine() int begtime = clock();
#define end_routine() \
int endtime = clock(); \
cerr << endl \
<< "Time elapsed: " << (endtime - begtime) * 1000 / CLOCKS_PER_SEC \
<< " ms"; \
return 0
#define speed() cin.tie(0), cout.tie(0), ios_base::sync_with_stdio(false)
// #define exit(a, b) return cout << a, b;
#define loop(i, a, b) for (ll i = a; i < b; i++)
#define all(v) v.begin(), v.end()
#define print(stuff) cout << stuff << endl
#define printc(stuff) \
for (auto x : stuff) \
cout << x << " "; \
cout << endl;
#define printPrec(stuff) cout << fixed << setprecision(15) << stuff << endl;
#define debug(stuff) cout << #stuff << ": " << stuff << endl
#define debugc(stuff) \
cout << #stuff << ": "; \
for (auto x : stuff) \
cout << x << " "; \
cout << endl;
#define len length
#define ret0 return 0
#define ret return
#define ll long long
#define ld long double
#define fi first
#define endl '\n'
#define se second
#define pb push_back
#define mp make_pair
#define lb lower_bound
#define ub upper_bound
#define fill(ar, x) memset(ar, x, sizeof ar)
#define vl vector<ll>
#define sl set<ll>
#define pll pair<ll, ll>
#define mll map<ll, ll>
#define pq priority_queue<ll>
// typedef tree<ll,null_type,less<ll>,rb_tree_tag,
// tree_order_statistics_node_update> indexed_set;
#define inf (long long int)1e18
#define eps 0.000001
#define mod 1000000007
#define mod1 998244353
#define MAXN (ll)1e5 + 5
ll f(ll a[], ll n) {
bool b = 1;
loop(i, 0, n - 1) {
if (a[i] > a[i + 1]) {
ret 0;
}
}
ret 1;
}
void solve() {
ll n;
cin >> n;
ll p[n];
loop(i, 0, n) { cin >> p[i]; }
if (f(p, n)) {
print("YES");
} else {
ll b[n];
loop(i, 0, n) {
loop(j, i + 1, n) {
loop(k, 0, n) { b[i] = p[i]; }
swap(b[i], b[j]);
if (f(b, n)) {
print("YES");
ret;
}
}
}
print("NO");
}
}
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
ll t = 1;
// cin>>t;
while (t--) {
solve();
}
}
| #include <bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
#pragma comment(linker, "/stack:200000000")
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define start_routine() int begtime = clock();
#define end_routine() \
int endtime = clock(); \
cerr << endl \
<< "Time elapsed: " << (endtime - begtime) * 1000 / CLOCKS_PER_SEC \
<< " ms"; \
return 0
#define speed() cin.tie(0), cout.tie(0), ios_base::sync_with_stdio(false)
// #define exit(a, b) return cout << a, b;
#define loop(i, a, b) for (ll i = a; i < b; i++)
#define all(v) v.begin(), v.end()
#define print(stuff) cout << stuff << endl
#define printc(stuff) \
for (auto x : stuff) \
cout << x << " "; \
cout << endl;
#define printPrec(stuff) cout << fixed << setprecision(15) << stuff << endl;
#define debug(stuff) cout << #stuff << ": " << stuff << endl
#define debugc(stuff) \
cout << #stuff << ": "; \
for (auto x : stuff) \
cout << x << " "; \
cout << endl;
#define len length
#define ret0 return 0
#define ret return
#define ll long long
#define ld long double
#define fi first
#define endl '\n'
#define se second
#define pb push_back
#define mp make_pair
#define lb lower_bound
#define ub upper_bound
#define fill(ar, x) memset(ar, x, sizeof ar)
#define vl vector<ll>
#define sl set<ll>
#define pll pair<ll, ll>
#define mll map<ll, ll>
#define pq priority_queue<ll>
// typedef tree<ll,null_type,less<ll>,rb_tree_tag,
// tree_order_statistics_node_update> indexed_set;
#define inf (long long int)1e18
#define eps 0.000001
#define mod 1000000007
#define mod1 998244353
#define MAXN (ll)1e5 + 5
ll f(ll a[], ll n) {
bool b = 1;
loop(i, 0, n - 1) {
if (a[i] > a[i + 1]) {
ret 0;
}
}
ret 1;
}
void solve() {
ll n;
cin >> n;
ll p[n];
loop(i, 0, n) { cin >> p[i]; }
if (f(p, n)) {
print("YES");
} else {
ll b[n];
loop(i, 0, n) {
loop(j, i + 1, n) {
loop(k, 0, n) { b[k] = p[k]; }
swap(b[i], b[j]);
if (f(b, n)) {
// debugc(b);
// print(i<<" "<<j);
print("YES");
ret;
}
}
}
print("NO");
}
}
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
ll t = 1;
// cin>>t;
while (t--) {
solve();
}
}
| [
"assignment.variable.change",
"identifier.change",
"variable_access.subscript.index.change",
"assignment.value.change"
] | 765,716 | 765,717 | u851993789 | cpp |
p02958 |
#include <algorithm>
#include <iostream>
#include <math.h>
#include <string>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> vec(N, 0);
for (int i = 0; i < N; i++) {
cin >> vec[i];
}
int res = 0;
for (int j = 0; j < N; j++) {
if (vec[j] != j + 1) {
res++;
}
}
if (res == 2 || res == 0) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
} |
#include <algorithm>
#include <iostream>
#include <math.h>
#include <string>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> vec(N, 0);
for (int i = 0; i < N; i++) {
cin >> vec[i];
}
int res = 0;
for (int j = 0; j < N; j++) {
if (vec[j] != j + 1) {
res++;
}
}
if (res == 2 || res == 0) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 765,718 | 765,719 | u910757347 | cpp |
p02958 | #include <bits/stdc++.h>
#define mp make_pair
#define F first
#define S second
#define ll long long
using namespace std;
const int LIM = 3e5 + 3;
int cost[LIM + 3], d[LIM + 3];
ll INF = 1e18;
ll Ans = 0;
void solve(int l, int r) {
if (l >= r)
return;
int mid = (l + r) / 2;
vector<pair<int, ll>> V, W;
int mx = 0;
ll cur = 0;
for (int i = mid + 1; i <= r; i++) {
cur += cost[i];
if (abs(d[i] - d[i - 1]) > mx)
mx = abs(d[i] - d[i - 1]), V.push_back(mp(mx, cur));
else
V[V.size() - 1].S = min(V.back().S, cur);
}
for (int i = 1; i < V.size(); i++)
V[i].S = min(V[i].S, V[i - 1].S);
mx = 0, cur = cost[mid];
W.push_back(mp(0, cur));
for (int i = mid - 1; i >= l; i--) {
cur += cost[i];
if (abs(d[i + 1] - d[i]) > mx)
mx = abs(d[i + 1] - d[i]), W.push_back(mp(mx, cur));
else
W[W.size() - 1].S = min(W.back().S, cur);
int ind = upper_bound(V.begin(), V.end(), mp(mx, 0ll)) - V.begin();
ind--;
if (ind < 0)
continue;
Ans = min(Ans, cur + 1ll * mx * mx + V[ind].S);
}
for (int i = 1; i < W.size(); i++)
W[i].S = min(W[i].S, W[i - 1].S);
mx = 0, cur = 0;
for (int i = mid + 1; i <= r; i++) {
cur += cost[i];
mx = max(mx, abs(d[i] - d[i - 1]));
int ind = upper_bound(W.begin(), W.end(), mp(mx, 0ll)) - W.begin();
ind--;
if (ind < 0)
continue;
Ans = min(Ans, cur + 1ll * mx * mx + W[ind].S);
}
solve(l, mid);
solve(mid + 1, r);
}
int arr[LIM + 3];
int main() {
int n;
cin >> n;
for (int i = 0; i < n; i++)
cin >> arr[i];
for (int i = 0; i < n; i++)
for (int j = i + 1; j < n; j++) {
swap(arr[i], arr[j]);
bool ok = true;
for (int i = 1; i < n; i++)
if (arr[i] <= arr[i - 1])
ok = false;
if (ok) {
puts("YES");
return 0;
}
swap(arr[i], arr[j]);
}
puts("NO");
} | #include <bits/stdc++.h>
#define mp make_pair
#define F first
#define S second
#define ll long long
using namespace std;
const int LIM = 3e5 + 3;
int cost[LIM + 3], d[LIM + 3];
ll INF = 1e18;
ll Ans = 0;
void solve(int l, int r) {
if (l >= r)
return;
int mid = (l + r) / 2;
vector<pair<int, ll>> V, W;
int mx = 0;
ll cur = 0;
for (int i = mid + 1; i <= r; i++) {
cur += cost[i];
if (abs(d[i] - d[i - 1]) > mx)
mx = abs(d[i] - d[i - 1]), V.push_back(mp(mx, cur));
else
V[V.size() - 1].S = min(V.back().S, cur);
}
for (int i = 1; i < V.size(); i++)
V[i].S = min(V[i].S, V[i - 1].S);
mx = 0, cur = cost[mid];
W.push_back(mp(0, cur));
for (int i = mid - 1; i >= l; i--) {
cur += cost[i];
if (abs(d[i + 1] - d[i]) > mx)
mx = abs(d[i + 1] - d[i]), W.push_back(mp(mx, cur));
else
W[W.size() - 1].S = min(W.back().S, cur);
int ind = upper_bound(V.begin(), V.end(), mp(mx, 0ll)) - V.begin();
ind--;
if (ind < 0)
continue;
Ans = min(Ans, cur + 1ll * mx * mx + V[ind].S);
}
for (int i = 1; i < W.size(); i++)
W[i].S = min(W[i].S, W[i - 1].S);
mx = 0, cur = 0;
for (int i = mid + 1; i <= r; i++) {
cur += cost[i];
mx = max(mx, abs(d[i] - d[i - 1]));
int ind = upper_bound(W.begin(), W.end(), mp(mx, 0ll)) - W.begin();
ind--;
if (ind < 0)
continue;
Ans = min(Ans, cur + 1ll * mx * mx + W[ind].S);
}
solve(l, mid);
solve(mid + 1, r);
}
int arr[LIM + 3];
int main() {
int n;
cin >> n;
for (int i = 0; i < n; i++)
cin >> arr[i];
for (int i = 0; i < n; i++)
for (int j = i; j < n; j++) {
swap(arr[i], arr[j]);
bool ok = true;
for (int i = 1; i < n; i++)
if (arr[i] <= arr[i - 1])
ok = false;
if (ok) {
puts("YES");
return 0;
}
swap(arr[i], arr[j]);
}
puts("NO");
} | [
"control_flow.loop.for.initializer.change",
"expression.operation.binary.remove"
] | 765,727 | 765,728 | u540045035 | cpp |
p02958 | #include <algorithm>
#include <iostream>
#include <math.h>
#include <stdio.h>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); i++)
typedef long long ll;
using namespace std;
#define MOD 1000000007
#define EPS 10e-8
int main() {
int N, p[100], c;
cin >> N;
rep(i, N) {
cin >> p[i];
if (p[i] != i + 1) {
c++;
}
}
if (c == 0 || c == 2)
cout << "Yes" << endl;
else
cout << "No" << endl;
return 0;
} | #include <algorithm>
#include <iostream>
#include <math.h>
#include <stdio.h>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); i++)
typedef long long ll;
using namespace std;
#define MOD 1000000007
#define EPS 10e-8
int main() {
int N, p[100], c;
cin >> N;
rep(i, N) {
cin >> p[i];
if (p[i] != i + 1) {
c++;
}
}
if (c == 0 || c == 2)
cout << "YES" << endl;
else
cout << "NO" << endl;
return 0;
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 765,729 | 765,730 | u008229752 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.