oj.uz

답안 #932642

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
932642 2024-02-24T01:44:58 Z Whisper Index (COCI21_index) C++17
20 / 110
 2500 ms 5432 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 444

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];
int frq[MAX];

struct SegTree{
    vector<int> st;
    int n;
    void init(int _n){
        this -> n = _n;
        st.resize((n << 1), 0);
    }
    void modify(int p, int val){
        for (st[p += n] += val; p > 0; p >>= 1){
            st[p >> 1] = st[p] + st[p ^ 1];
        }
    }
    int query(int l, int r){
        int res = 0;
        for (l += n, r += n + 1; l < r; l >>= 1, r >>= 1){
            if (l & 1) res += st[l++];
            if (r & 1) res += st[--r];
        }
        return res;
    }
} st;
void add(int x){
    st.modify(x, 1);
}
void sub(int x){
    st.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);
    }
    st.init(MAX - 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 (st.query(mid, Lim) >= 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

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 3932 KB Output is correct
2 Correct 3 ms 3932 KB Output is correct
3 Correct 3 ms 3932 KB Output is correct
4 Correct 3 ms 4056 KB Output is correct
5 Correct 3 ms 3928 KB Output is correct
6 Correct 3 ms 3932 KB Output is correct
7 Correct 3 ms 3932 KB Output is correct
8 Correct 3 ms 3932 KB Output is correct
9 Correct 3 ms 3932 KB Output is correct
10 Correct 3 ms 3928 KB Output is correct

Subtask #2
0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 3932 KB Output is correct
2 Correct 3 ms 3932 KB Output is correct
3 Correct 3 ms 3932 KB Output is correct
4 Correct 3 ms 4056 KB Output is correct
5 Correct 3 ms 3928 KB Output is correct
6 Correct 3 ms 3932 KB Output is correct
7 Correct 3 ms 3932 KB Output is correct
8 Correct 3 ms 3932 KB Output is correct
9 Correct 3 ms 3932 KB Output is correct
10 Correct 3 ms 3928 KB Output is correct
11 Execution timed out 2555 ms 5432 KB Time limit exceeded
12 Halted 0 ms 0 KB -

Subtask #3
0 / 50.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 3932 KB Output is correct
2 Correct 3 ms 3932 KB Output is correct
3 Correct 3 ms 3932 KB Output is correct
4 Correct 3 ms 4056 KB Output is correct
5 Correct 3 ms 3928 KB Output is correct
6 Correct 3 ms 3932 KB Output is correct
7 Correct 3 ms 3932 KB Output is correct
8 Correct 3 ms 3932 KB Output is correct
9 Correct 3 ms 3932 KB Output is correct
10 Correct 3 ms 3928 KB Output is correct
11 Execution timed out 2555 ms 5432 KB Time limit exceeded
12 Halted 0 ms 0 KB -