/ SeriousOJ /

Record Detail

Time Exceeded


  
# Status Time Cost Memory Cost
#1 Accepted 1ms 540.0 KiB
#2 Accepted 1ms 540.0 KiB
#3 Accepted 1ms 540.0 KiB
#4 Accepted 1ms 348.0 KiB
#5 Accepted 1ms 540.0 KiB
#6 Accepted 1ms 540.0 KiB
#7 Accepted 1ms 600.0 KiB
#8 Accepted 1ms 600.0 KiB
#9 Accepted 1ms 540.0 KiB
#10 Accepted 1ms 540.0 KiB
#11 Accepted 1ms 540.0 KiB
#12 Accepted 1ms 604.0 KiB
#13 Accepted 1ms 588.0 KiB
#14 Accepted 1ms 540.0 KiB
#15 Accepted 1ms 540.0 KiB
#16 Accepted 1ms 540.0 KiB
#17 Accepted 1ms 328.0 KiB
#18 Accepted 1ms 400.0 KiB
#19 Accepted 1ms 512.0 KiB
#20 Accepted 1ms 540.0 KiB
#21 Accepted 1ms 540.0 KiB
#22 Accepted 1ms 332.0 KiB
#23 Accepted 1ms 548.0 KiB
#24 Accepted 1ms 584.0 KiB
#25 Accepted 1ms 540.0 KiB
#26 Accepted 1ms 540.0 KiB
#27 Accepted 1ms 592.0 KiB
#28 Accepted 1ms 540.0 KiB
#29 Accepted 1ms 540.0 KiB
#30 Accepted 1ms 540.0 KiB
#31 Accepted 1ms 584.0 KiB
#32 Accepted 1ms 540.0 KiB
#33 Accepted 1ms 540.0 KiB
#34 Accepted 1ms 552.0 KiB
#35 Accepted 1ms 684.0 KiB
#36 Accepted 1ms 540.0 KiB
#37 Accepted 1ms 584.0 KiB
#38 Accepted 1ms 580.0 KiB
#39 Accepted 1ms 772.0 KiB
#40 Accepted 1ms 516.0 KiB
#41 Accepted 3ms 540.0 KiB
#42 Accepted 2ms 504.0 KiB
#43 Accepted 2ms 560.0 KiB
#44 Accepted 2ms 556.0 KiB
#45 Accepted 2ms 540.0 KiB
#46 Accepted 2ms 540.0 KiB
#47 Accepted 2ms 552.0 KiB
#48 Accepted 2ms 588.0 KiB
#49 Accepted 2ms 540.0 KiB
#50 Accepted 2ms 540.0 KiB
#51 Accepted 3ms 600.0 KiB
#52 Accepted 2ms 540.0 KiB
#53 Accepted 2ms 556.0 KiB
#54 Accepted 2ms 540.0 KiB
#55 Accepted 2ms 560.0 KiB
#56 Accepted 2ms 716.0 KiB
#57 Accepted 2ms 540.0 KiB
#58 Accepted 2ms 768.0 KiB
#59 Accepted 2ms 588.0 KiB
#60 Accepted 3ms 504.0 KiB
#61 Accepted 62ms 328.0 KiB
#62 Accepted 20ms 560.0 KiB
#63 Accepted 20ms 564.0 KiB
#64 Accepted 21ms 556.0 KiB
#65 Accepted 33ms 588.0 KiB
#66 Accepted 24ms 560.0 KiB
#67 Accepted 20ms 564.0 KiB
#68 Accepted 21ms 540.0 KiB
#69 Accepted 23ms 540.0 KiB
#70 Accepted 20ms 564.0 KiB
#71 Accepted 186ms 572.0 KiB
#72 Accepted 58ms 568.0 KiB
#73 Accepted 59ms 540.0 KiB
#74 Accepted 59ms 540.0 KiB
#75 Accepted 97ms 540.0 KiB
#76 Accepted 70ms 580.0 KiB
#77 Accepted 58ms 580.0 KiB
#78 Accepted 59ms 540.0 KiB
#79 Accepted 67ms 580.0 KiB
#80 Accepted 58ms 580.0 KiB
#81 Accepted 285ms 592.0 KiB
#82 Accepted 87ms 592.0 KiB
#83 Accepted 88ms 728.0 KiB
#84 Accepted 88ms 796.0 KiB
#85 Accepted 147ms 540.0 KiB
#86 Accepted 107ms 588.0 KiB
#87 Accepted 87ms 588.0 KiB
#88 Accepted 89ms 628.0 KiB
#89 Accepted 100ms 540.0 KiB
#90 Accepted 88ms 816.0 KiB
#91 Time Exceeded ≥1099ms ≥796.0 KiB
#92 Time Exceeded ≥1100ms ≥796.0 KiB

Code

#include <iostream>
#include <vector>
using namespace std;

int main() {
    int n;
    cin >> n;
    vector<int> a(n);

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

    int specialCount = 0;

    for (int i = 0; i < n; i++) {
        int greaterOrEqualRight = 0;
        int smallerOrEqualLeft = 0;

        // Count greater or equal elements on the right
        for (int j = i + 1; j < n; j++) {
            if (a[j] >= a[i])
                greaterOrEqualRight++;
        }

        // Count smaller or equal elements on the left
        for (int j = 0; j < i; j++) {
            if (a[j] <= a[i])
                smallerOrEqualLeft++;
        }

        // Check if any of the two conditions are satisfied
        if (greaterOrEqualRight >= a[i] || smallerOrEqualLeft >= a[i])
            specialCount++;
    }

    cout << specialCount << endl;
    return 0;
}

Information

Submit By
Type
Submission
Problem
P1184 The Curious Kid and the Number Game
Contest
Brain Booster #9
Language
C++17 (G++ 13.2.0)
Submit At
2025-04-06 15:56:30
Judged At
2025-04-06 15:56:30
Judged By
Score
90
Total Time
≥1100ms
Peak Memory
≥816.0 KiB