/ SeriousOJ /

Record Detail

Wrong Answer


  
# Status Time Cost Memory Cost
#1 Accepted 1ms 532.0 KiB
#2 Wrong Answer 1ms 532.0 KiB
#3 Wrong Answer 20ms 532.0 KiB

Code


#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define YES cout<<"Yes\n"
#define NO cout<<"No\n"
#define sp " "
#define br "\n"
#define vin(v) for(auto &x: v) cin >> x
#define vout(v) for(int i=0;i<v.size();i++) cout << v[i] << " "
#define all(v) v.begin(),v.end()
const ll MOD = 1e9+7, N = 2e5+7;

bool isValid(vector<ll> &a, vector<ll> &b, ll n) {
    for (int i = 1; i < n-1; i++) {
        if (!((a[i] > b[i - 1] && a[i] > b[i + 1]) || (b[i] > a[i - 1] && b[i] > a[i + 1]))) {
            return false;
        }
    }
    return true;
}

void solve()
{
    ll n;
    cin >> n;
    vector<ll> a(n), b(n);
    vin(a);
    vin(b);
    sort(all(a));
    sort(all(b));
    if(isValid(a, b, n) || isValid(b, a, n))
    {
        YES;
        return;
    }
    reverse(all(b));
    if(isValid(a, b, n) || isValid(b, a, n))
    {
        YES;
        return;
    }
    NO;
    return;
}

int main()
{
    ios_base::sync_with_stdio(false);cin.tie(0);
    ll t=1; cin >> t;
    for(int i=1;i<=t;i++)
    {
        //cout << "Case " << i << ": ";
        solve();
    }
    return 0;
}

Information

Submit By
Type
Submission
Problem
P1193 C. Roy and Peak Array
Language
C++17 (G++ 13.2.0)
Submit At
2025-06-13 19:30:04
Judged At
2025-06-13 19:30:04
Judged By
Score
0
Total Time
20ms
Peak Memory
532.0 KiB