/ SeriousOJ /

Record Detail

Accepted


  
# Status Time Cost Memory Cost
#1 Accepted 1ms 532.0 KiB
#2 Accepted 1ms 324.0 KiB
#3 Accepted 1ms 376.0 KiB
#4 Accepted 1ms 444.0 KiB
#5 Accepted 1ms 368.0 KiB
#6 Accepted 1ms 424.0 KiB
#7 Accepted 1ms 448.0 KiB
#8 Accepted 1ms 532.0 KiB
#9 Accepted 1ms 532.0 KiB
#10 Accepted 1ms 400.0 KiB
#11 Accepted 1ms 532.0 KiB
#12 Accepted 1ms 532.0 KiB
#13 Accepted 1ms 536.0 KiB
#14 Accepted 1ms 320.0 KiB
#15 Accepted 1ms 532.0 KiB
#16 Accepted 1ms 532.0 KiB
#17 Accepted 1ms 484.0 KiB
#18 Accepted 1ms 348.0 KiB
#19 Accepted 1ms 444.0 KiB
#20 Accepted 1ms 516.0 KiB
#21 Accepted 1ms 568.0 KiB
#22 Accepted 1ms 320.0 KiB
#23 Accepted 1ms 532.0 KiB
#24 Accepted 1ms 532.0 KiB
#25 Accepted 1ms 532.0 KiB
#26 Accepted 1ms 484.0 KiB
#27 Accepted 1ms 532.0 KiB
#28 Accepted 1ms 436.0 KiB
#29 Accepted 1ms 532.0 KiB
#30 Accepted 1ms 328.0 KiB
#31 Accepted 1ms 560.0 KiB
#32 Accepted 1ms 532.0 KiB
#33 Accepted 1ms 384.0 KiB
#34 Accepted 1ms 532.0 KiB
#35 Accepted 1ms 332.0 KiB
#36 Accepted 1ms 384.0 KiB
#37 Accepted 1ms 532.0 KiB
#38 Accepted 1ms 532.0 KiB
#39 Accepted 1ms 344.0 KiB
#40 Accepted 1ms 320.0 KiB
#41 Accepted 2ms 384.0 KiB
#42 Accepted 2ms 604.0 KiB
#43 Accepted 2ms 532.0 KiB
#44 Accepted 2ms 448.0 KiB
#45 Accepted 2ms 512.0 KiB
#46 Accepted 2ms 532.0 KiB
#47 Accepted 2ms 532.0 KiB
#48 Accepted 2ms 576.0 KiB
#49 Accepted 2ms 532.0 KiB
#50 Accepted 3ms 532.0 KiB
#51 Accepted 7ms 532.0 KiB
#52 Accepted 6ms 600.0 KiB
#53 Accepted 6ms 532.0 KiB
#54 Accepted 6ms 536.0 KiB
#55 Accepted 6ms 532.0 KiB
#56 Accepted 6ms 484.0 KiB
#57 Accepted 6ms 532.0 KiB
#58 Accepted 6ms 532.0 KiB
#59 Accepted 6ms 532.0 KiB
#60 Accepted 6ms 532.0 KiB
#61 Accepted 21ms 788.0 KiB
#62 Accepted 9ms 788.0 KiB
#63 Accepted 9ms 852.0 KiB
#64 Accepted 9ms 836.0 KiB
#65 Accepted 13ms 788.0 KiB
#66 Accepted 15ms 956.0 KiB
#67 Accepted 12ms 956.0 KiB
#68 Accepted 14ms 968.0 KiB
#69 Accepted 7ms 788.0 KiB
#70 Accepted 8ms 788.0 KiB
#71 Accepted 21ms 1.02 MiB
#72 Accepted 16ms 1.172 MiB
#73 Accepted 16ms 1.184 MiB
#74 Accepted 16ms 1.023 MiB
#75 Accepted 16ms 1.02 MiB
#76 Accepted 18ms 1.066 MiB
#77 Accepted 10ms 1.07 MiB
#78 Accepted 12ms 1.02 MiB
#79 Accepted 12ms 1.121 MiB
#80 Accepted 13ms 1.02 MiB
#81 Accepted 20ms 1.234 MiB
#82 Accepted 15ms 1.273 MiB
#83 Accepted 17ms 1.355 MiB
#84 Accepted 16ms 1.375 MiB
#85 Accepted 18ms 1.27 MiB
#86 Accepted 22ms 1.234 MiB
#87 Accepted 16ms 1.297 MiB
#88 Accepted 18ms 1.34 MiB
#89 Accepted 14ms 1.27 MiB
#90 Accepted 15ms 1.398 MiB
#91 Accepted 161ms 7.27 MiB
#92 Accepted 127ms 7.316 MiB
#93 Accepted 152ms 7.27 MiB
#94 Accepted 142ms 7.258 MiB
#95 Accepted 127ms 7.27 MiB
#96 Accepted 153ms 7.27 MiB
#97 Accepted 97ms 7.336 MiB
#98 Accepted 129ms 7.27 MiB
#99 Accepted 126ms 7.414 MiB
#100 Accepted 129ms 7.316 MiB

Code

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
 
using namespace std;
using namespace __gnu_pbds;
 
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<ll,ll> pll;
typedef pair<ld,ld> pld;
typedef vector<ll> vll;
typedef vector<ld> vld;
typedef vector<pll> vpll;
typedef vector<pld> vpld;
 
#define int ll
#define all(it) it.begin(),it.end()
#define ord_set(T) tree<T,null_type,less<T>,rb_tree_tag,tree_order_statistics_node_update> 
  


void work(){
    int n;
    cin >> n;
    vll v(n);
    for (auto &c : v) cin >> c;

    ord_set(pll) r,l;

    for (int i=0;i<n;i++) r.insert({v[i],i});

    int res = 0;
    for (int i=0;i<n;i++){
        r.erase({v[i],i});
        if (l.order_of_key({v[i],n+1}) >= v[i] || r.size() - r.order_of_key({v[i],-1}) >= v[i]) res++;
        l.insert({v[i],i});
    }

    cout << res << '\n';
}


int32_t main(){
    cin.tie(NULL);
    ios_base::sync_with_stdio(false);

    work();
    
    return 0;
}

Information

Submit By
Type
Submission
Problem
P1184 The Curious Kid and the Number Game
Language
C++17 (G++ 13.2.0)
Submit At
2025-04-06 22:35:12
Judged At
2025-04-06 22:35:12
Judged By
Score
100
Total Time
161ms
Peak Memory
7.414 MiB