/ SeriousOJ /

Record Detail

Time Exceeded


  
# Status Time Cost Memory Cost
#1 Accepted 1ms 324.0 KiB
#2 Accepted 1ms 352.0 KiB
#3 Accepted 1ms 320.0 KiB
#4 Accepted 1ms 532.0 KiB
#5 Accepted 4ms 532.0 KiB
#6 Accepted 4ms 348.0 KiB
#7 Accepted 4ms 532.0 KiB
#8 Accepted 4ms 532.0 KiB
#9 Accepted 4ms 340.0 KiB
#10 Accepted 4ms 340.0 KiB
#11 Accepted 4ms 532.0 KiB
#12 Accepted 4ms 532.0 KiB
#13 Accepted 4ms 532.0 KiB
#14 Accepted 4ms 532.0 KiB
#15 Accepted 4ms 532.0 KiB
#16 Accepted 4ms 532.0 KiB
#17 Accepted 4ms 340.0 KiB
#18 Accepted 4ms 320.0 KiB
#19 Accepted 4ms 532.0 KiB
#20 Accepted 4ms 448.0 KiB
#21 Accepted 4ms 532.0 KiB
#22 Accepted 4ms 532.0 KiB
#23 Accepted 4ms 532.0 KiB
#24 Accepted 4ms 532.0 KiB
#25 Accepted 4ms 324.0 KiB
#26 Accepted 4ms 344.0 KiB
#27 Accepted 4ms 532.0 KiB
#28 Accepted 4ms 532.0 KiB
#29 Accepted 4ms 532.0 KiB
#30 Accepted 4ms 532.0 KiB
#31 Accepted 5ms 532.0 KiB
#32 Accepted 5ms 532.0 KiB
#33 Accepted 5ms 532.0 KiB
#34 Accepted 5ms 532.0 KiB
#35 Accepted 4ms 344.0 KiB
#36 Accepted 5ms 532.0 KiB
#37 Accepted 5ms 532.0 KiB
#38 Accepted 5ms 532.0 KiB
#39 Accepted 5ms 532.0 KiB
#40 Accepted 5ms 536.0 KiB
#41 Accepted 15ms 532.0 KiB
#42 Accepted 19ms 588.0 KiB
#43 Accepted 9ms 536.0 KiB
#44 Accepted 11ms 596.0 KiB
#45 Accepted 4ms 532.0 KiB
#46 Accepted 17ms 576.0 KiB
#47 Accepted 20ms 532.0 KiB
#48 Accepted 21ms 532.0 KiB
#49 Accepted 17ms 592.0 KiB
#50 Accepted 20ms 576.0 KiB
#51 Accepted 13ms 536.0 KiB
#52 Accepted 14ms 532.0 KiB
#53 Accepted 14ms 536.0 KiB
#54 Accepted 17ms 596.0 KiB
#55 Accepted 5ms 600.0 KiB
#56 Accepted 15ms 604.0 KiB
#57 Accepted 18ms 532.0 KiB
#58 Accepted 18ms 596.0 KiB
#59 Accepted 8ms 576.0 KiB
#60 Accepted 10ms 636.0 KiB
#61 Accepted 168ms 1.008 MiB
#62 Accepted 178ms 1.043 MiB
#63 Accepted 180ms 1.023 MiB
#64 Accepted 175ms 1.023 MiB
#65 Accepted 4ms 1.02 MiB
#66 Accepted 156ms 1.062 MiB
#67 Accepted 182ms 1.016 MiB
#68 Accepted 174ms 1.023 MiB
#69 Accepted 140ms 1.02 MiB
#70 Accepted 179ms 1.02 MiB
#71 Accepted 626ms 1.348 MiB
#72 Accepted 635ms 1.43 MiB
#73 Accepted 642ms 1.5 MiB
#74 Accepted 618ms 1.332 MiB
#75 Accepted 8ms 1.316 MiB
#76 Accepted 585ms 1.312 MiB
#77 Accepted 623ms 1.445 MiB
#78 Accepted 630ms 1.457 MiB
#79 Accepted 473ms 1.469 MiB
#80 Accepted 616ms 1.473 MiB
#81 Time Exceeded ≥1001ms ≥1.695 MiB
#82 Accepted 996ms 1.676 MiB
#83 Accepted 988ms 1.555 MiB
#84 Time Exceeded ≥1001ms ≥1.676 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;
  vector<int> ans(n,0);
  for(int i=0;i<n;i++){
    int cnt=distance(back1.begin(),back1.upper_bound(arr[i]));
    if(cnt>=arr[i]){
      ans[i]=1;
    }
    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[i]=1;
    }
    back2.insert(arr[i]);
  }
  cout<<accumulate(ans.begin(),ans.end(),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 16:05:28
Judged At
2025-04-06 16:05:28
Judged By
Score
82
Total Time
≥1001ms
Peak Memory
≥1.695 MiB