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

Code

#include<bits/stdc++.h>
using namespace std;
int main()
{
    int t;
    cin>>t;
    while(t--)
    {
        int n;
        cin>>n;
        int arrayA[n];
        int arrayB[n];
        for(int i =0; i<n; i++)
            cin>>arrayA[i];
        for(int i = 0; i<n; i++)
            cin>>arrayB[i];
        int tempA;
        int tempB;
        for(int i =0; i<n-1; i++)
        {
            for(int j = 0; j<n-i-1; j++)
            {
                if(arrayA[j]>arrayA[j+1])
                  {
                      tempA = arrayA[j];
                      arrayA[j]=arrayA[j+1];
                      arrayA[j+1]=tempA;
                  }
                if(arrayB[j]<arrayB[j+1])
                {
                      tempB = arrayB[j];
                      arrayB[j]=arrayB[j+1];
                      arrayB[j+1]=tempB;
                }
            }
        }
        int counter = 0;
        int c = n-2;
        for(int i = 1; i<n-1; i++)
        {
            if((arrayA[i]>arrayB[i-1] && arrayA[i]>arrayB[i+1]) || (arrayB[i]>arrayA[i-1] && arrayB[i]>arrayA[i+1]))
            {
                counter++;
            }
        }
        if(counter>=c)
            cout<<"Yes"<<endl;
        else
            cout<<"No"<<endl;
    }
}

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 16:36:12
Judged At
2025-06-13 16:36:12
Judged By
Score
0
Total Time
88ms
Peak Memory
532.0 KiB