1896A - Jagged Swaps - CodeForces Solution

#include <bits/stdc++.h>
#define txt freopen("input.txt","r",stdin);freopen("output.txt","w",stdout);
#define mostafa ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define yes cout << "YES" << endl;
#define no cout << "NO" << endl;
#define ll long long
#define for0(i,n) for(ll i=0;i<n;i++)
#define for1(i,n) for(ll i=1;i<=n;i++)
#define for01(i,n) for(ll i=0;i<=n;i++)
#define forR0(i, n) for(ll i=n-1;i>=0;i--)
#define forR1(i, n) for(ll i=n;i>=1;i--)
#define pp(n) push_back(n)
#define mem(v,x) memset(v,x,sizeof(v));
#define all(a) (a).begin(), (a).end()
#define rall(a) (a).rbegin(), (a).rend()
#define sz(a) a.size()
#define pii pair<ll,ll>
#define vi vector<ll>
#define vv vector<vector<ll>>
#define f first
#define s second
#define init int n ; cin>> n  ; vi v(n); for0(i,n) cin>>v[i] ;

using namespace std;

int main() {
    mostafa
    int t; cin >> t;

    while (t--) {
        init
        if(v[0] == 1 ) yes
        else no
    }

    return 0;
}