/ SeriousOJ /

Record Detail

Time Exceeded


  
# Status Time Cost Memory Cost
#1 Accepted 1ms 328.0 KiB
#2 Accepted 1ms 320.0 KiB
#3 Accepted 1ms 328.0 KiB
#4 Time Exceeded ≥2064ms ≥556.0 KiB
#5 Time Exceeded ≥2080ms ≥1.27 MiB

Code

/*
 *Copyright (c) Swadheen Islam Robi (SIR01)
 *Created on Thu Oct 03 2024 10:00:57 PM
 */
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define pie 2*(acos(0.0))
#define yes cout<<"YES\n"
#define no cout<<"NO\n"
#define pb push_back
#define endl "\n"
#define lcm(a,b) (a*b)/(__gcd<ll>(a,b))
#define mod 1000000007
#define srt(v) sort(v.begin(),v.end())
#define rsrt(v) sort(v.rbegin(),v.rend())
#define ALLAHU_AKBAR ios::sync_with_stdio(false); cin.tie(nullptr);

void sir()
{
    // int y
    int N;
    cin >> N; 
    vector<int> A(N + 1); 

    for (int i = 1; i <= N; i++) {
        cin >> A[i];
    }

    int q;
    cin >> q; 


    while (q--) {
        int X;
        cin >> X; 

        int c = 0;

        
        for (int i = 1; i < X; i++) {
            for (int j = X + 1; j <= N; j++) {

                if ((A[i] > A[X] && A[X] > A[j]) || (A[i] < A[X] && A[X] < A[j])) {
                    c++;
                }
            }
        }

        cout << c << '\n'; 
    }
    
}

int main() {
    ALLAHU_AKBAR

    ll t = 1;
    cin>>t;
    while(t--)
    {
        sir();
    }
    return 0;
}

Information

Submit By
Type
Submission
Problem
P1079 Roy and Query (Easy Version)
Contest
Brain Booster #6
Language
C++17 (G++ 13.2.0)
Submit At
2024-10-03 17:50:54
Judged At
2024-11-11 02:45:30
Judged By
Score
20
Total Time
≥2080ms
Peak Memory
≥1.27 MiB