oj.uz

답안 #486461

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
486461 2021-11-11T17:34:44 Z davi_bart Index (COCI21_index) C++14
60 / 110
 2500 ms 54028 KB 
#pragma GCC optimize("O3")
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define int ll
#define fi first
#define se second
#define ld long double
#define pb push_back
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
struct segment {
    const int dim = 1 << 18;
    struct node {
        vector<int> v;
    };
    vector<node> s = vector<node>(2 * dim);
    void upd(int pos, int l, int r, int p, int val) {
        if (p < l || r < p) return;
        s[pos].v.pb(val);
        if (l == r) return;
        int m = (l + r) / 2;
        upd(2 * pos, l, m, p, val);
        upd(2 * pos + 1, m + 1, r, p, val);
    }
    void upd(int p, int val) {
        upd(1, 0, dim - 1, p, val);
    }
    void init() {
        for (auto &k : s) {
            sort(k.v.begin(), k.v.end());
        }
    }
    vector<int> nodes;
    void query(int pos, int l, int r, int a, int b) {
        if (b < l || r < a) return;
        if (a <= l && r <= b) {
            nodes.pb(pos);
            return;
        }
        int m = (l + r) / 2;
        query(2 * pos, l, m, a, b);
        query(2 * pos + 1, m + 1, r, a, b);
    }
    int query(int a, int b) {
        nodes.clear();
        query(1, 0, dim - 1, a, b);
        // cout << "k: ";
        // for (int x : nodes) {
        //     for (int y : s[x].v) cout << y << " ";
        //     cout << endl;
        // }
        // cout << endl;
        int l = 1, r = 1e6;
        while (l < r - 1) {
            int m = (l + r) / 2;

            int tot = 0;
            for (int i : nodes) {
                tot += s[i].v.size() - (lower_bound(s[i].v.begin(), s[i].v.end(), m) - s[i].v.begin());
            }
            if (tot >= m)
                l = m;
            else
                r = m;
        }
        return l;
    }
} seg;
signed main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    int N, Q;
    cin >> N >> Q;
    for (int i = 0; i < N; i++) {
        int u;
        cin >> u;
        seg.upd(i, u);
    }
    seg.init();
    for (int i = 0; i < Q; i++) {
        int a, b;
        cin >> a >> b;
        cout << seg.query(a - 1, b - 1) << '\n';
    }
}

Subtask #1
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 11 ms 12748 KB Output is correct
2 Correct 12 ms 12748 KB Output is correct
3 Correct 12 ms 12812 KB Output is correct
4 Correct 13 ms 12748 KB Output is correct
5 Correct 13 ms 12876 KB Output is correct
6 Correct 14 ms 12852 KB Output is correct
7 Correct 12 ms 12848 KB Output is correct
8 Correct 12 ms 12748 KB Output is correct
9 Correct 12 ms 12748 KB Output is correct
10 Correct 11 ms 12780 KB Output is correct

Subtask #2
40.0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Correct 11 ms 12748 KB Output is correct
2 Correct 12 ms 12748 KB Output is correct
3 Correct 12 ms 12812 KB Output is correct
4 Correct 13 ms 12748 KB Output is correct
5 Correct 13 ms 12876 KB Output is correct
6 Correct 14 ms 12852 KB Output is correct
7 Correct 12 ms 12848 KB Output is correct
8 Correct 12 ms 12748 KB Output is correct
9 Correct 12 ms 12748 KB Output is correct
10 Correct 11 ms 12780 KB Output is correct
11 Correct 585 ms 23092 KB Output is correct
12 Correct 588 ms 23072 KB Output is correct
13 Correct 579 ms 23140 KB Output is correct
14 Correct 578 ms 23340 KB Output is correct
15 Correct 567 ms 23084 KB Output is correct
16 Correct 592 ms 23084 KB Output is correct
17 Correct 607 ms 23232 KB Output is correct
18 Correct 555 ms 23288 KB Output is correct
19 Correct 585 ms 23212 KB Output is correct
20 Correct 616 ms 23292 KB Output is correct

Subtask #3
0 / 50.0

# 결과 실행 시간 메모리 Grader output
1 Correct 11 ms 12748 KB Output is correct
2 Correct 12 ms 12748 KB Output is correct
3 Correct 12 ms 12812 KB Output is correct
4 Correct 13 ms 12748 KB Output is correct
5 Correct 13 ms 12876 KB Output is correct
6 Correct 14 ms 12852 KB Output is correct
7 Correct 12 ms 12848 KB Output is correct
8 Correct 12 ms 12748 KB Output is correct
9 Correct 12 ms 12748 KB Output is correct
10 Correct 11 ms 12780 KB Output is correct
11 Correct 585 ms 23092 KB Output is correct
12 Correct 588 ms 23072 KB Output is correct
13 Correct 579 ms 23140 KB Output is correct
14 Correct 578 ms 23340 KB Output is correct
15 Correct 567 ms 23084 KB Output is correct
16 Correct 592 ms 23084 KB Output is correct
17 Correct 607 ms 23232 KB Output is correct
18 Correct 555 ms 23288 KB Output is correct
19 Correct 585 ms 23212 KB Output is correct
20 Correct 616 ms 23292 KB Output is correct
21 Execution timed out 2584 ms 54028 KB Time limit exceeded
22 Halted 0 ms 0 KB -