/ SeriousOJ /

Record Detail

Time Exceeded


  
# Status Time Cost Memory Cost
#1 Accepted 2ms 544.0 KiB
#2 Accepted 2ms 540.0 KiB
#3 Accepted 2ms 540.0 KiB
#4 Accepted 2ms 540.0 KiB
#5 Accepted 2ms 540.0 KiB
#6 Accepted 2ms 328.0 KiB
#7 Accepted 2ms 328.0 KiB
#8 Accepted 2ms 540.0 KiB
#9 Accepted 2ms 328.0 KiB
#10 Accepted 2ms 540.0 KiB
#11 Accepted 2ms 540.0 KiB
#12 Accepted 2ms 504.0 KiB
#13 Accepted 2ms 540.0 KiB
#14 Accepted 2ms 512.0 KiB
#15 Accepted 2ms 328.0 KiB
#16 Accepted 2ms 332.0 KiB
#17 Accepted 2ms 332.0 KiB
#18 Accepted 2ms 332.0 KiB
#19 Accepted 2ms 540.0 KiB
#20 Accepted 2ms 332.0 KiB
#21 Accepted 2ms 328.0 KiB
#22 Accepted 2ms 336.0 KiB
#23 Accepted 2ms 544.0 KiB
#24 Accepted 2ms 332.0 KiB
#25 Accepted 2ms 544.0 KiB
#26 Accepted 2ms 332.0 KiB
#27 Accepted 2ms 332.0 KiB
#28 Accepted 2ms 328.0 KiB
#29 Accepted 2ms 324.0 KiB
#30 Accepted 2ms 328.0 KiB
#31 Accepted 2ms 332.0 KiB
#32 Accepted 2ms 332.0 KiB
#33 Accepted 2ms 540.0 KiB
#34 Accepted 2ms 540.0 KiB
#35 Accepted 2ms 328.0 KiB
#36 Accepted 2ms 540.0 KiB
#37 Accepted 2ms 332.0 KiB
#38 Accepted 2ms 328.0 KiB
#39 Accepted 2ms 540.0 KiB
#40 Accepted 2ms 328.0 KiB
#41 Accepted 7ms 572.0 KiB
#42 Accepted 10ms 608.0 KiB
#43 Accepted 9ms 644.0 KiB
#44 Accepted 10ms 600.0 KiB
#45 Accepted 3ms 540.0 KiB
#46 Accepted 8ms 560.0 KiB
#47 Accepted 10ms 576.0 KiB
#48 Accepted 9ms 552.0 KiB
#49 Accepted 8ms 584.0 KiB
#50 Accepted 9ms 628.0 KiB
#51 Accepted 6ms 588.0 KiB
#52 Accepted 9ms 592.0 KiB
#53 Accepted 9ms 572.0 KiB
#54 Accepted 9ms 632.0 KiB
#55 Accepted 2ms 588.0 KiB
#56 Accepted 7ms 584.0 KiB
#57 Accepted 9ms 592.0 KiB
#58 Accepted 9ms 592.0 KiB
#59 Accepted 7ms 884.0 KiB
#60 Accepted 7ms 796.0 KiB
#61 Accepted 148ms 996.0 KiB
#62 Accepted 182ms 1.145 MiB
#63 Accepted 191ms 1.234 MiB
#64 Accepted 194ms 1.098 MiB
#65 Accepted 5ms 1.066 MiB
#66 Accepted 166ms 1.055 MiB
#67 Accepted 193ms 1.305 MiB
#68 Accepted 180ms 984.0 KiB
#69 Accepted 148ms 1.008 MiB
#70 Accepted 193ms 1.316 MiB
#71 Accepted 535ms 1.641 MiB
#72 Accepted 557ms 1.891 MiB
#73 Accepted 598ms 1.746 MiB
#74 Accepted 595ms 1.707 MiB
#75 Accepted 8ms 1.258 MiB
#76 Accepted 460ms 1.652 MiB
#77 Accepted 596ms 2.125 MiB
#78 Accepted 591ms 2.023 MiB
#79 Accepted 485ms 1.871 MiB
#80 Accepted 598ms 2.059 MiB
#81 Accepted 859ms 2.125 MiB
#82 Accepted 901ms 2.473 MiB
#83 Accepted 923ms 2.184 MiB
#84 Accepted 941ms 2.102 MiB
#85 Accepted 10ms 1.52 MiB
#86 Accepted 710ms 1.805 MiB
#87 Accepted 995ms 2.355 MiB
#88 Accepted 887ms 2.172 MiB
#89 Accepted 666ms 1.859 MiB
#90 Accepted 951ms 2.215 MiB
#91 Time Exceeded ≥1100ms ≥1.52 MiB
#92 Time Exceeded ≥1100ms ≥2.27 MiB

Code

#include <bits/stdc++.h>
using namespace std;

int main() {
	// your code goes here
  int n;
  cin>>n;
  vector<int> arr(n);
  for(int i=0;i<n;i++){
    cin>>arr[i];
  }
  multiset<int> back1;
  set<int> ans;
  for(int i=0;i<n;i++){
    int cnt=distance(back1.begin(),back1.upper_bound(arr[i]));
    if(cnt>=arr[i]){
      ans.insert(i);
    }
    back1.insert(arr[i]);
  }
  multiset<int> back2;
  for(int i=n-1;i>=0;i--){
    int cnt=distance(back2.lower_bound(arr[i]),back2.end());
    if(cnt>=arr[i]){
      ans.insert(i);
    }
    back2.insert(arr[i]);
  }
  cout<<ans.size();
}

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 16:02:34
Judged At
2025-04-06 16:02:34
Judged By
Score
90
Total Time
≥1100ms
Peak Memory
≥2.473 MiB