Submission #62026354

Source Code Expand

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define fastio ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
#define nl "\n";
#define inf LLONG_MAX
#define pb push_back
#define pi pair<int, int>
#define mp make_pair
#define ff first
#define ss second
#define show(x) cerr << #x << " is " << x << nl;
#define showw(x, y) cerr << #x << " is " << x << " " << #y << " is " << y << nl;
#define showall(x) cerr << #x << " is "; for (auto i : x) {cerr << i << " ";} cerr << nl;
bool check(int x[]){
  bool pos = true;
  for (int i=0; i<5; i++){
    if(x[i]!=(i+1)) pos = false;
  }
  return pos;
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

#include <bits/stdc++.h>
using namespace std;
#define int long long
#define fastio ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
#define nl "\n";
#define inf LLONG_MAX
#define pb push_back
#define pi pair<int, int>
#define mp make_pair
#define ff first
#define ss second
#define show(x) cerr << #x << " is " << x << nl;
#define showw(x, y) cerr << #x << " is " << x << " " << #y << " is " << y << nl;
#define showall(x) cerr << #x << " is "; for (auto i : x) {cerr << i << " ";} cerr << nl;

bool check(int x[]){
	bool pos = true;
	for (int i=0; i<5; i++){
		if(x[i]!=(i+1)) pos = false;
	}
	return pos;
}

signed main(){
	fastio
	int a[5];
	for (int i=0; i<5; i++) cin >> a[i];
	bool can = false;
	for (int i=0; i<4; i++){
		int temp[5];
		for (int j=0; j<5; j++){
			if(j==i) temp[j] = a[i+1];
			else if(j==i+1) temp[j] = a[i];
			else temp[j] = a[j];
		}
		if(check(temp)) can = true;
	}
	if(can) {
		cout << "Yes" << nl;
	}
	else cout << "No" << nl;
    return 0;
}

Submission Info

Judge Result