/ SeriousOJ /

Record Detail

Wrong Answer


  
# Status Time Cost Memory Cost
#1 Wrong Answer 1ms 532.0 KiB
#2 Wrong Answer 1ms 536.0 KiB

Code

#include<bits/stdc++.h>
using namespace std;

int main()
{
    long int t;
    cin >> t;
    while(t--){
        long int n, flag=0;
        cin >> n;
        long 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];
        }
        if(n<2){
            for(int i=0;i<n;i++){
                if(a[i]==b[i]){
                    flag=1;
                    break;
                }
                else{
                    flag=0;
                }
            }
        }
        else{
            for(int i=2;i<=n-1;i++){
                if( a[i] > a[i-1] && a[i] > b[i+1]){
                    flag=1;
                    break;
                }
                else if( b[i] > a[i-1] && b[i] > a[i+1]){
                    flag=1;
                    break;
                }
                else{
                    flag=0;
                }
            }
        }
        if(flag==1){
            cout << "Yes" << endl;
        }
        else {
            cout << "No" << endl;
        }
    }
    return 0;
}

Information

Submit By
Type
Submission
Problem
P1193 C. Roy and Peak Array
Contest
Brain Booster #10
Language
C++11 (G++ 13.2.0)
Submit At
2025-06-13 17:31:29
Judged At
2025-06-13 17:31:29
Judged By
Score
0
Total Time
1ms
Peak Memory
536.0 KiB