結果

問題 No.2077 Get Minimum Algorithm
ユーザー HYEA LEEHYEA LEE
提出日時 2022-01-20 11:57:56
言語 C++17(clang)
(14.0.0 + boost 1.83.0)
結果
AC  
実行時間 1,863 ms / 3,000 ms
コード長 3,021 bytes
コンパイル時間 5,860 ms
コンパイル使用メモリ 130,532 KB
実行使用メモリ 26,508 KB
最終ジャッジ日時 2023-08-23 14:08:13
合計ジャッジ時間 32,848 ms
ジャッジサーバーID
(参考情報)
judge13 / judge12
このコードへのチャレンジ(β)

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
4,944 KB
testcase_01 AC 2 ms
4,952 KB
testcase_02 AC 2 ms
4,952 KB
testcase_03 AC 4 ms
4,792 KB
testcase_04 AC 10 ms
4,952 KB
testcase_05 AC 5 ms
4,956 KB
testcase_06 AC 6 ms
4,956 KB
testcase_07 AC 5 ms
5,020 KB
testcase_08 AC 12 ms
4,952 KB
testcase_09 AC 8 ms
5,016 KB
testcase_10 AC 4 ms
4,888 KB
testcase_11 AC 7 ms
4,884 KB
testcase_12 AC 1,806 ms
26,392 KB
testcase_13 AC 1,793 ms
26,400 KB
testcase_14 AC 1,822 ms
26,380 KB
testcase_15 AC 1,779 ms
26,488 KB
testcase_16 AC 1,826 ms
26,428 KB
testcase_17 AC 1,793 ms
26,456 KB
testcase_18 AC 1,808 ms
26,448 KB
testcase_19 AC 1,863 ms
26,508 KB
testcase_20 AC 1,826 ms
26,480 KB
testcase_21 AC 1,814 ms
26,396 KB
testcase_22 AC 313 ms
26,436 KB
testcase_23 AC 302 ms
26,472 KB
testcase_24 AC 312 ms
26,400 KB
testcase_25 AC 309 ms
26,416 KB
testcase_26 AC 311 ms
26,372 KB
testcase_27 AC 1,002 ms
26,388 KB
testcase_28 AC 713 ms
14,740 KB
testcase_29 AC 332 ms
5,624 KB
testcase_30 AC 862 ms
26,456 KB
testcase_31 AC 820 ms
14,736 KB
testcase_32 AC 421 ms
5,628 KB
testcase_33 AC 117 ms
26,368 KB
testcase_34 AC 95 ms
14,748 KB
testcase_35 AC 73 ms
5,620 KB
testcase_36 AC 309 ms
26,388 KB
testcase_37 AC 1,464 ms
26,396 KB
testcase_38 AC 3 ms
4,948 KB
権限があれば一括ダウンロードができます

ソースコード

diff #

#include<bits/stdc++.h>
using namespace std;

namespace wtree
{
    const int MAXN = 100000 * 2;
    const int INF = 0x3f3f3f3f;
    int sz[MAXN];
    int* wavelet[MAXN];
    int* leftsum[MAXN];
    int lc[MAXN]; //left child
    int rc[MAXN]; //right child
    int sr[MAXN]; //start range
    int er[MAXN]; //end range
    int tp = 0;
    void build(int x)
    {
        int s = sr[x], e = er[x], m = (s+e)>>1, N = sz[x], ls = 0;
        lc[x] = rc[x] = -1;
        leftsum[x] = (int*) malloc(sizeof(int)*(N+1));
        leftsum[x][0] = 0;
        for(int i=1; i<=N; ++i)
        {
            if(wavelet[x][i] <= m) ++ls;
            leftsum[x][i] = ls;
        }
        if(s==e) return;

        lc[x] = tp; sr[tp] = er[tp] = s; sz[tp] = ls;
        wavelet[tp] = (int*) malloc(sizeof(int)*sz[tp]) - 1;
        tp++;
        rc[x] = tp; sr[tp] = er[tp] = e; sz[tp] = N-ls;
        wavelet[tp] = (int*) malloc(sizeof(int)*sz[tp]) - 1;
        tp++;

        int ind1 = 0, ind2 = 0;
        for(int i=1; i<=N; ++i)
        {
            if(wavelet[x][i] <= m)
            {
                wavelet[lc[x]][++ind1] = wavelet[x][i];
                er[lc[x]] = max(er[lc[x]], wavelet[x][i]);
            }
            else
            {
                wavelet[rc[x]][++ind2] = wavelet[x][i];
                sr[rc[x]] = min(sr[rc[x]], wavelet[x][i]);
            }
        }
        build(lc[x]); build(rc[x]);
        free(wavelet[x]+1);
        return;
    }
    int getKth(int s, int e, int k, int idx = 0)
    {
        // cout << s << " " << e << " " << k << " " << idx << endl;
        if(sr[idx]==er[idx]) return sr[idx];
        int lcount = leftsum[idx][e]-leftsum[idx][s-1];
        if(k<=lcount)
            return getKth(leftsum[idx][s-1]+1, leftsum[idx][e], k, lc[idx]);
        else
            return getKth(s-leftsum[idx][s-1], e-leftsum[idx][e], k-lcount, rc[idx]);
    }
}

using namespace wtree;

int main()
{
    ios::sync_with_stdio(false); cin.tie(0);
    int N; cin >> N; int* P = (int*) malloc(sizeof(int)*N)-1;
    sz[tp] = N; wavelet[tp] = (int*) malloc(sizeof(int)*N)-1;
    sr[tp] = INF; er[tp] = -INF;

    int *inv = (int*) malloc(sizeof(int)*N)-1;

    for(int i=1; i<=N; ++i)
    {
        cin >> P[i]; wavelet[tp][i] = P[i]; inv[P[i]] = i;
        sr[tp] = min(sr[tp], P[i]); er[tp] = max(er[tp], P[i]);

    }
    build(tp++);
    int Q; cin >> Q; while(Q--)
    {
        int x, y; cin >> x >> y;
        // P_{x,y} = max(P_y,(x+1th elem of P_1,P_2,...,P_y))
        // first check whether P_{x, inv(y)} = y

        if(inv[y] >= x+1 && getKth(1, inv[y], x+1) <= y) cout << inv[y] << '\n';
        else
        {
            // answer is not in [y, lo], but in [y, hi]
            int lo = max(x, inv[y]), hi = N;
            // cout << lo << " " << hi << endl;
            while(lo+1!=hi)
            {
                int mi = (lo+hi)/2;
                if(getKth(1, mi, x+1) <= y) hi = mi;
                else lo = mi;
            }
            cout << hi << '\n';
        }
    }
}
0