提出 #62020932

---

ソースコード 拡げる

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace std;
using namespace __gnu_pbds;

#define fi first
#define se second
#define pb push_back
#define int long long
#define sz(a) (int)a.size()
#define all(a) begin(a),end(a)
#define uid(a, b) uniform_int_distribution<int>(a, b)(rng)

mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

using ll = long long;
using vi = vector<int>;
using ar2 = array<int,2>;
using ar3 = array<int,3>;

const int mxN = (int)3e5+10;
const int INF = (int)1e9;
const ll LINF = (ll)2e18;
const int MOD = (int)1e9+7;

int a[6];
void solve(){
    for(int i = 0; i < 5; i++) cin >> a[i];
    bool ok = 0;
    for(int i = 0; i < 4; i++){
        if(a[i]>a[i+1]){
            swap(a[i],a[i+1]);
            ok = 1;
            break;
        }
    }
    if(ok and is_sorted(a,a+5)) cout << "Yes";
    else cout << "No";
}

int32_t main(){
    ios_base::sync_with_stdio(false); cin.tie(0);
    int t = 1; //cin >> t;
    while(t--) solve();
}

提出情報

ジャッジ結果