/ SeriousOJ /

Record Detail

Time Exceeded


  
# Status Time Cost Memory Cost
#1 Accepted 1ms 540.0 KiB
#2 Accepted 1ms 448.0 KiB
#3 Accepted 1ms 540.0 KiB
#4 Time Exceeded ≥2085ms ≥920.0 KiB
#5 Time Exceeded ≥2032ms ≥1.316 MiB
#6 Time Exceeded ≥2080ms ≥980.0 KiB
#7 Accepted 377ms 832.0 KiB
#8 Time Exceeded ≥2047ms ≥960.0 KiB
#9 Time Exceeded ≥2021ms ≥956.0 KiB
#10 Time Exceeded ≥2058ms ≥1008.0 KiB
#11 Accepted 17ms 592.0 KiB
#12 Accepted 34ms 568.0 KiB
#13 Accepted 2ms 540.0 KiB

Code

#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ALLAHU_AKBAR ios::sync_with_stdio(false); cin.tie(nullptr);

void sir() {
    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 ax = A[X];

        int cL = 0;
        int cG = 0;

        for (int i = 1; i < X; i++) {
            if (A[i] < ax) {
                cL++;
            }
        }

        for (int j = X + 1; j <= N; j++) {
            if (A[j] > ax) {
                cG++;
            }
        }

        int c1 = cL * cG;
        
        cL = 0;
        cG = 0;

        for (int i = 1; i < X; i++) {
            if (A[i] > ax) {
                cL++;
            }
        }

        for (int j = X + 1; j <= N; j++) {
            if (A[j] < ax) {
                cG++;
            }
        }

        int c2 = cL * cG;
        
        cout << c1 + c2 << '\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:58:02
Judged At
2024-10-03 17:58:02
Judged By
Score
52
Total Time
≥2085ms
Peak Memory
≥1.316 MiB