oj.uz

Submission #932647

# Submission time Handle Problem Language Result Execution time Memory
932647 2024-02-24T01:50:09 Z Whisper Index (COCI21_index) C++17
60 / 110
 2500 ms 8804 KB 
#include <bits/stdc++.h>

using namespace std;
using ll = long long;

#define int long long
#define FOR(i, a, b) for ( int i = a ; i <= b ; i++ )
#define FORD(i, a, b) for (int i = b; i >= a; i --)
#define REP(i, n) for (int i = 0; i < n; ++i)
#define REPD(i, n) for (int i = n - 1; i >= 0; --i)
#define pii pair<int , int>
#define Lg(x) 31 - __builtin_clz(x)

#define MASK(i) (1LL << (i))
#define BIT(x, i) (((x) >> (i)) & 1)

constexpr ll LINF = (1ll << 60);
constexpr int INF = (1ll << 30);
constexpr int MAX = 2e5 + 5;
constexpr int Mod = 1e9 + 7;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

void setupIO(){
    #define name "Whisper"
    //Phu Trong from Nguyen Tat Thanh High School for gifted student
    srand(time(NULL));
    cin.tie(nullptr)->sync_with_stdio(false); cout.tie(nullptr);
    //freopen(name".inp", "r", stdin);
    //freopen(name".out", "w", stdout);
    cout << fixed << setprecision(10);
}

template <class X, class Y>
    bool minimize(X &x, const Y &y){
        X eps = 1e-9;
        if (x > y + eps) {x = y; return 1;}
        return 0;
    }

template <class X, class Y>
    bool maximize(X &x, const Y &y){
        X eps = 1e-9;
        if (x + eps < y) {x = y; return 1;}
        return 0;
    }
int nArr, numQuery;
int a[MAX];

#define Block 555

struct Queries{
    int l, r, id;
    Queries(){}
    Queries(int _l, int _r, int _id): l(_l), r(_r), id(_id){}

    bool operator < (const Queries& oth) const{
        if (l / Block == oth.l / Block) return r < oth.r;
        return l / Block < oth.l / Block;
    }
} qs[MAX];
struct FenwickTree{
    int n;
    vector<int> f;
    void init(int _n){
        this -> n = _n;
        f.resize(n + 5);
    }

    void modify(int x, int val){
        for ( ; x > 0; x -= x & (-x)) f[x] += val;
    }
    int query(int x){
        int res = 0;
        for ( ; x <= n; x += x & (-x)) res += f[x];
        return res;
    }
    int query(int l, int r){
        return query(r) - query(l - 1);
    }
} fen;
void add(int x){
    fen.modify(x, 1);
}
void sub(int x){
    fen.modify(x, -1);
}
void Whisper(){
    cin >> nArr >> numQuery;
    int Lim = 0;
    for (int i = 1; i <= nArr; ++i) cin >> a[i], maximize(Lim, a[i]);
    for (int i = 1; i <= numQuery; ++i){
        int l, r; cin >> l >> r;
        qs[i] = Queries(l, r, i);
    }
    fen.init(Lim + 5);
    int L = 1, R = 0;
    for (int i = 1; i <= numQuery; ++i){
        while (L > qs[i].l) add(a[--L]);
        while (L < qs[i].l) sub(a[L++]);
        while (R > qs[i].r) sub(a[R--]);
        while (R < qs[i].r) add(a[++R]);

        int l = 1, r = Lim;
        int ans = 1;
        while (l <= r){
            int mid = (l + r) >> 1;
            if (fen.query(mid) >= mid){
                ans = mid, l = mid + 1;
            }
            else r = mid - 1;
        }
        cout << ans << '\n';
    }
}


signed main(){
    setupIO();
    int Test = 1;
//    cin >> Test;
    for ( int i = 1 ; i <= Test ; i++ ){
        Whisper();
        if (i < Test) cout << '\n';
    }
}

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 600 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 512 KB Output is correct
10 Correct 1 ms 344 KB Output is correct

Subtask #2
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 600 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 512 KB Output is correct
10 Correct 1 ms 344 KB Output is correct
11 Correct 2252 ms 3952 KB Output is correct
12 Correct 2334 ms 3756 KB Output is correct
13 Correct 2335 ms 4012 KB Output is correct
14 Correct 2357 ms 3884 KB Output is correct
15 Correct 2246 ms 4028 KB Output is correct
16 Correct 2334 ms 3796 KB Output is correct
17 Correct 2250 ms 3768 KB Output is correct
18 Correct 2358 ms 3668 KB Output is correct
19 Correct 2396 ms 4152 KB Output is correct
20 Correct 2320 ms 3940 KB Output is correct

Subtask #3
0 / 50.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 600 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 512 KB Output is correct
10 Correct 1 ms 344 KB Output is correct
11 Correct 2252 ms 3952 KB Output is correct
12 Correct 2334 ms 3756 KB Output is correct
13 Correct 2335 ms 4012 KB Output is correct
14 Correct 2357 ms 3884 KB Output is correct
15 Correct 2246 ms 4028 KB Output is correct
16 Correct 2334 ms 3796 KB Output is correct
17 Correct 2250 ms 3768 KB Output is correct
18 Correct 2358 ms 3668 KB Output is correct
19 Correct 2396 ms 4152 KB Output is correct
20 Correct 2320 ms 3940 KB Output is correct
21 Execution timed out 2528 ms 8804 KB Time limit exceeded
22 Halted 0 ms 0 KB -