/ SeriousOJ /

Record Detail

Time Exceeded


  
# Status Time Cost Memory Cost
#1 Accepted 2ms 328.0 KiB
#2 Wrong Answer 2ms 328.0 KiB
#3 Wrong Answer 2ms 332.0 KiB
#4 Time Exceeded ≥2021ms ≥988.0 KiB
#5 Wrong Answer 1227ms 1.301 MiB
#6 Time Exceeded ≥2098ms ≥984.0 KiB
#7 Wrong Answer 288ms 744.0 KiB
#8 Time Exceeded ≥2059ms ≥964.0 KiB
#9 Time Exceeded ≥2040ms ≥984.0 KiB
#10 Time Exceeded ≥2047ms ≥1.387 MiB
#11 Wrong Answer 29ms 584.0 KiB
#12 Wrong Answer 55ms 796.0 KiB
#13 Wrong Answer 1ms 540.0 KiB

Code

#include<iostream>
using namespace std;
int main()
{
    int t;
    cin>>t;

    while(t--){
        int n;
        cin>>n;

        int a[n];
        for(int i=0; i<n; i++)
        {
            cin>>a[i];
        }
        int q;
        cin>>q;

        while(q--){
            int x;
            cin>>x;
            x--;
            int cls=0, clg=0, crs=0, crg=0;

            for(int i=0; i<x; i++)
        {
           if(a[i]<a[x]){
            cls++;
           }
           else{
            clg++;
           }
        }

         for(int k=x+1; k<n; k++)
        {
           if(a[k]<a[x]){
            crs++;
           }
           else{
            crg++;
           }
        }

        int rst = (clg*crs)+(cls*crg);
        cout<<rst<<endl;

        }
    }
}

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:58:05
Judged At
2024-10-03 17:58:05
Judged By
Score
4
Total Time
≥2098ms
Peak Memory
≥1.387 MiB