Submission #1612176

---

Source Code Expand

#pragma GCC optimize ("O3")
#pragma GCC target ("avx")
#include "bits/stdc++.h" // define macro "/D__MAI"

using namespace std;
typedef long long int ll;

#define xprintf(fmt,...) fprintf(stderr,fmt,__VA_ARGS__)
#define debugv(v) {printf("L%d %s > ",__LINE__,#v);for(auto e:v){cout<<e<<" ";}cout<<endl;}
#define debuga(m,w) {printf("L%d %s > ",__LINE__,#m);for(int x=0;x<(w);x++){cout<<(m)[x]<<" ";}cout<<endl;}
#define debugaa(m,h,w) {printf("L%d %s >\n",__LINE__,#m);for(int y=0;y<(h);y++){for(int x=0;x<(w);x++){cout<<(m)[y][x]<<" ";}cout<<endl;}}
#define ALL(v) (v).begin(),(v).end()
#define repeat(cnt,l) for(auto cnt=0ll;cnt<(l);++cnt)
#define iterate(cnt,b,e) for(auto cnt=(b);cnt!=(e);++cnt)
#define MD 1000000007ll
#define PI 3.1415926535897932384626433832795
#define EPS 1e-12
template<typename T1, typename T2> ostream& operator <<(ostream &o, const pair<T1, T2> p) { o << "(" << p.first << ":" << p.second << ")"; return o; }
template<typename iterator> inline size_t argmin(iterator begin, iterator end) { return distance(begin, min_element(begin, end)); }
template<typename iterator> inline size_t argmax(iterator begin, iterator end) { return distance(begin, max_element(begin, end)); }
template<typename T> T& maxset(T& to, const T& val) { return to = max(to, val); }
template<typename T> T& minset(T& to, const T& val) { return to = min(to, val); }

mt19937_64 randdev(8901016);
inline ll rand_range(ll l, ll h) {
    return uniform_int_distribution<ll>(l, h)(randdev);
}

#ifdef __MAI
#define getchar_unlocked getchar
#define putchar_unlocked putchar
#endif
#ifdef __VSCC
#define getchar_unlocked _getchar_nolock
#define putchar_unlocked _putchar_nolock
#endif
namespace {
#define isvisiblechar(c) (0x21<=(c)&&(c)<=0x7E)
    class MaiScanner {
    public:
        template<typename T> void input_integer(T& var) {
            var = 0;
            T sign = 1;
            int cc = getchar_unlocked();
            for (; cc<'0' || '9'<cc; cc = getchar_unlocked())
                if (cc == '-') sign = -1;
            for (; '0' <= cc&&cc <= '9'; cc = getchar_unlocked())
                var = (var << 3) + (var << 1) + cc - '0';
            var = var*sign;
        }
        inline int c() { return getchar_unlocked(); }
        inline MaiScanner& operator>>(int& var) {
            input_integer<int>(var);
            return *this;
        }
        inline MaiScanner& operator>>(long long& var) {
            input_integer<long long>(var);
            return *this;
        }
        inline MaiScanner& operator>>(string& var) {
            int cc = getchar_unlocked();
            for (; !isvisiblechar(cc); cc = getchar_unlocked());
            for (; isvisiblechar(cc); cc = getchar_unlocked())
                var.push_back(cc);
            return *this;
        }
        template<typename IT> void in(IT begin, IT end) {
            for (auto it = begin; it != end; ++it) *this >> *it;
        }
    };
}
MaiScanner scanner;


template<typename T = ll>
class bitree {
public:
    int size;
    vector<T> data;
    bitree(int size) :size(size + 1), data(size + 1) {}

    // -------------------------------------------------------
    // 和に関するBIT
    // 1..rの範囲の値の和を求める．
    T sum(int r) {
        T s = 0;
        while (r) {
            s += data[r];
            r -= r&-r; //  r&-r と書くことで最下のビットを得る
        }
        return s;
    }
    // idxの要素の値をval増やす
    void add(int idx, T val) {
        while (idx <= size) {
            data[idx] += val;
            idx += idx&-idx;
        }
    }
};

// 境界を探す．func(x)==trueとなるxの中で，最も小さなxを探す．
// func(x):boolとは，ある定数tを持ち，(t<=x)を返す関数である．
// func(x)==falseとなるxの中で，最も大きなxを探す時，コメントアウトのやつ．
template<typename INTEGER>
INTEGER b_search(INTEGER l, INTEGER h, auto func) {
    ++h;
    --l;
    INTEGER c;
    while (l + 1 < h) {
        c = (l + h) / 2;
        if (func(c)) {
            h = c;
        }
        else {
            l = c;
        }
    }
    return h;
    // return l;
}



ll m, n, kei;

ll aa[100010];
ll bb[100010];

int main() {

    scanner >> n >> kei;

    repeat(i, n) {
        int a;
        scanner >> a;
        aa[i] = a;
        bb[a] = i+1;
    }

    int idx = 0;

    bitree<int> bit(n+1);
    for (; idx < kei - 1; ++idx) {
        bit.add(aa[idx], 1);
    }
    //repeat(i, n){printf("%d ",bit.sum(i+1));}cout<<endl;

    for (; idx < n; ++idx) {
        bit.add(aa[idx], 1);
        ll p = b_search(0ll, n, [&](ll x) { return kei <= bit.sum(x); });
        printf("%lld\n", bb[p]);
    }


    return 0;
}

Submission Info

Judge Result