/ 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 43ms 532.0 KiB

Code

#include <bits/stdc++.h>
#define endl '\n'
#define F first
#define S second
using namespace std;
#define ll long long
#define pb push_back
#define mod 1000000007
// #define int long long
#define all(x)      x.begin(),x.end()
#define allr(x)     x.rbegin(),x.rend()
#define CheckBit(x,k)   (x & (1LL << k))
#define SetBit(x,k)     (x |= (1LL << k))
#define ClearBit(x,k)   (x &= ~(1LL << k))
#define toggleBit(x,k)  (x ^= (1LL << k))
#define LSB(mask)       __builtin_ctzll(mask)
#define MSB(mask)       63-__builtin_clzll(mask) 
#define print(x)    cout << #x << " : " << x << endl
#define error1(x)   cerr << #x << " = " << (x) <<endl
#define coutall(v)  for(auto &it: v) cout<<it<<' '; cout<<endl
#define Abid_52     ios::sync_with_stdio(false);cin.tie(0),cin.tie(0)
#define error2(a,b) cerr<<"( "<<#a<<" , "<<#b<<" ) = ( "<<(a)<<" , "<<(b)<<" )\n"
#define UNIQUE(x)   sort(all(x)), x.erase(unique(all(x)), x.end()), x.shrink_to_fit()
template <typename T, typename U> T ceil(T x, U y) {return (x > 0 ? (x + y - 1) / y : x / y);}
template <typename T, typename U> T floor(T x, U y) {return (x > 0 ? x / y : (x - y + 1) / y);}

const int N = 2e5 + 10;

void solve()
{
    int n, m;
    cin >> n;
    vector<int> a(n), b(n);
    for (int i = 0; i < n; i++)
    {
        cin >> a[i];
    }
    for(int i = 0; i < n; i++)
    {
        cin >> b[i];
    }

    sort(all(a));
    sort(all(b));

    if(n == 3)
    {
        if((a[2] > b[0] && a[2] > b[1]) || (b[2] > a[0] && b[2] > a[1]))
        {
            cout << "Yes" << endl;
        }
        else{
            cout << "No" << endl;
        }
        return;
    }
    bool ok = 1, ok1 = 1;
    for(int i = 1; i + 1 < n; i++)
    {
        if(a[i] <= b[i + 1] || a[i] <= b[i - 1])
        {
            ok = 0;
        }
        if(b[i] <= a[i + 1] || b[i] <= a[i - 1])
        {
            ok1 = 0;
        }
    }
    if(ok || ok1)
    {
        cout << "Yes" << endl;
    }
    else{
        cout << "No" << endl;
    }
}

int32_t main()
{
    Abid_52;
    int t = 1;
    cin >> t;
    for (int tc = 1; tc <= t; ++tc)
    {
        // cout << "Case " << tc << ": ";
        solve();
    }
}

Information

Submit By
Type
Submission
Problem
P1193 C. Roy and Peak Array
Language
C++17 (G++ 13.2.0)
Submit At
2025-06-12 11:44:17
Judged At
2025-06-12 11:44:17
Judged By
Score
0
Total Time
43ms
Peak Memory
532.0 KiB