結果

問題 No.878 Range High-Element Query
ユーザー naoya_tnaoya_t
提出日時 2020-01-03 15:39:16
言語 C++14
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 512 ms / 2,000 ms
コード長 7,044 bytes
コンパイル時間 2,555 ms
コンパイル使用メモリ 193,996 KB
実行使用メモリ 16,608 KB
最終ジャッジ日時 2023-08-14 19:14:02
合計ジャッジ時間 7,683 ms
ジャッジサーバーID
（参考情報） 		judge15 / judge13
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 1 ms
4,380 KB
testcase_01 AC 3 ms
4,380 KB
testcase_02 AC 4 ms
4,384 KB
testcase_03 AC 3 ms
4,380 KB
testcase_04 AC 3 ms
4,380 KB
testcase_05 AC 3 ms
4,380 KB
testcase_06 AC 2 ms
4,388 KB
testcase_07 AC 2 ms
4,384 KB
testcase_08 AC 3 ms
4,380 KB
testcase_09 AC 3 ms
4,388 KB
testcase_10 AC 2 ms
4,384 KB
testcase_11 AC 414 ms
15,448 KB
testcase_12 AC 407 ms
13,128 KB
testcase_13 AC 316 ms
12,568 KB
testcase_14 AC 251 ms
10,572 KB
testcase_15 AC 385 ms
13,184 KB
testcase_16 AC 488 ms
16,248 KB
testcase_17 AC 507 ms
16,608 KB
testcase_18 AC 512 ms
16,520 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

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

#define NDEBUG
#include <cassert>


typedef long long ll;
typedef long double Double;
typedef unsigned long long ull;
typedef pair<int,int> ii;
typedef pair<ll,ll> llll;
typedef pair<double,double> dd;

typedef vector<int> vi;
typedef vector<vector<int>> vvi;
typedef vector<ii> vii;
typedef vector<vector<ii>> vvii;
typedef vector<ll> vll;
typedef vector<vector<ll>> vvll;
typedef vector<llll> vllll;
typedef vector<bool> vb;
typedef vector<string> vs;
typedef vector<double> vd;
typedef vector<long double> vD;

#define sz(a)  int((a).size())
#define pb  push_back
#define eb  emplace_back
#define FOR(var,from,to) for(int var=(from);var<=(to);++var)
#define rep(var,n)  for(int var=0;var<(n);++var)
#define rep1(var,n)  for(int var=1;var<=(n);++var)
#define repC2(vari,varj,n)  for(int vari=0;vari<(n)-1;++vari)for(int varj=vari+1;varj<(n);++varj)
#define repC3(vari,varj,vark,n)  for(int vari=0;vari<(n)-2;++vari)for(int varj=vari+1;varj<(n)-1;++varj)for(int vark=varj+1;vark<(n);++vark)
#define ALL(c)  (c).begin(),(c).end()
#define RALL(c)  (c).rbegin(),(c).rend()
#define tr(i,c)  for(auto i=(c).begin(); i!=(c).end(); ++i)
#define found(s,e)  ((s).find(e)!=(s).end())
#define mset(arr,val)  memset(arr,val,sizeof(arr))
#define mid(x,y) ((x)+((y)-(x))/2)
#define IN(x,a,b) ((a)<=(x)&&(x)<=(b))
#define cons make_pair
#define clamp(v,lo,hi) min(max(v,lo),hi)

template<typename T1, typename T2> inline void amin(T1 & a, T2 const & b) { if (a>b) a=b; }
template<typename T1, typename T2> inline void amax(T1 & a, T2 const & b) { if (a<b) a=b; }
template<typename X, typename T> auto vectors(X x, T a) { return vector<T>(x, a); }
template<typename X, typename Y, typename Z, typename... Zs> auto vectors(X x, Y y, Z z, Zs... zs) { auto cont = vectors(y, z, zs...); return vector<decltype(cont)>(x, cont); }

inline ll square(ll x) { return x * x; }
inline ll gcd(ll a, ll b) { while(a) swap(a, b%=a); return b; }
template <typename T>
inline T mod(T a, T b) { return ((a % b) + b) % b; }

template <typename T>
int find_left(vector<T>& v, T elem) {
    return (int)(upper_bound(v.begin(), v.end(), elem) - v.begin()) - 1;
}
template <typename T>
int find_right(vector<T>& v, T elem) {
    return (int)(lower_bound(v.begin(), v.end(), elem) - v.begin());
}

const ll MOD=1000000007LL;

inline ll ADD(ll x, ll y) { return (x+y) % MOD; }
inline ll SUB(ll x, ll y) { return (x-y+MOD) % MOD; }
inline ll MUL(ll x, ll y) { return x*y % MOD; }
inline ll POW(ll x, ll e) { ll v=1; for(; e; x=MUL(x,x), e>>=1) if (e&1) v = MUL(v,x); return v; }
inline ll INV(ll y) { /*assert(y%MOD!=0);*/ return POW(y, MOD-2); }
inline ll DIV(ll x, ll y) { return MUL(x, INV(y)); }

#define INTSPACE 12
char _buf[INTSPACE*1000000 + 3];

int loadint() {
    if (fgets(_buf, INTSPACE+3, stdin)==NULL) return 0;
    return atoi(_buf);
}

int loadvec(vector<int>& v, int N=-1) {
    if (N == 0) {
        v.clear();
        return 0;
    }
    if (N == -1) {
        N = loadint();
        if (N==0) return 0;
    }
    int bufsize = INTSPACE*N + 3;
    if (fgets(_buf, bufsize, stdin)==NULL) return 0;
    v.resize(N);

    int i=0;
    bool last = false;
    for (char *p=&_buf[0]; ;) {
        char *q = p;
        while (*q > ' ') ++q;
        if (*q == 0x0D || *q == 0x0A) last = true;
        *q = 0;
        v[i++] = atoi(p);
        if (last || i == N) break;
        p = q+1;
    }
    return i;
}
void read_cr() {
    fgets(_buf, 256, stdin);
}

void horizontal(vector<int>& v) {
    int L = v.size();
    for (int i=0; i<L; ++i) {
        printf("%d%c", v[i], (i==L-1)?'\n':' ');
    }
}
void horizontall(vector<long long>& v) {
    int L = v.size();
    for (int i=0; i<L; ++i) {
        printf("%lld%c", v[i], (i==L-1)?'\n':' ');
    }
}

template <typename T>
class SegmentTree {
public:
    int N;
    vector<T> buf_;
    using MERGER = function<T(T,T)>;
    MERGER merge;
    T ident;

    int ceil2(int size) {
        int n = 1;
        while (n < size) n *= 2;
        return n;
    }

    SegmentTree(int size, MERGER merge, T ident) : merge(merge), ident(ident) {
        N = ceil2(size);
        buf_.assign(N*2, ident);
    }
    SegmentTree(vector<T> ar, MERGER merge, T ident) : merge(merge), ident(ident) {
        int size = ar.size();
        N = ceil2(size);
        buf_.assign(N*2, ident);
        for (int i=0; i<size; ++i) update(i, ar[i]);
    }

    void update(int i, T x) {
        i = N + i - 1;

        if (merge(buf_[i], x) != x) return;

        buf_[i] = x;
        while (i > 0) {
			i = (i - 1) / 2;
			buf_[i] = merge(buf_[i*2+1], buf_[i*2+2]);
        }
    }

    T query(int lo, int hi) {
        return query(lo, hi, 0, 0, N);
    }
    T query(int a, int b, int k, int l, int r) {
        if (r <= a || b <= l) return ident;

        if (a <= l && r <= b) {
            return buf_[k];
        } else {
			T lv = query(a, b, 2*k+1, l, (l+r)/2);
			T rb = query(a, b, 2*k+2, (l+r)/2, r);
			return merge(lv, rb);
        }
    }

    void dump() {
    }
};

template <typename T>
class MaxSegmentTree : public SegmentTree<T> {
 public:
    MaxSegmentTree(int size) :
        SegmentTree<T>(size, [](T a,T b){return max(a,b);}, numeric_limits<T>::min()) {}
    MaxSegmentTree(vector<T> ar) :
        SegmentTree<T>(ar, [](T a,T b){return max(a,b);}, numeric_limits<T>::min()) {}
};

template <typename T, int base=0>
class fenwick_tree_0 {
 public:
    vector<T> x;
 public:
    fenwick_tree_0(int n) : x(n+base,0) { }
    void add(int k, T a) { for (; k<x.size(); k|=k+1) x[k] += a; }
    T sum(int i, int j) {
        if (i == base) {
            T S = 0; for (; j>=0; j=(j&(j+1))-1) S += x[j]; return S;
        } else {
            return sum(base, j) - sum(base, i-1);
        }
    }
};


int main() {
    int N, Q; scanf("%d %d%*c", &N, &Q);
    vi a(N); loadvec(a,N);
    priority_queue<vi, vvi, greater<vi>> pq;
    rep(i,Q){
        int op, l, r;
        scanf("%d %d %d%*c", &op, &l, &r); --l; --r;
        pq.push(vi{l,r,i});
    }

    vi ans(Q, 0);

    map<int,int> loc;
    rep(i,N) loc[a[i]] = i;

    MaxSegmentTree<int> st(a);
    vii spans(N, ii(-1,-1));

    fenwick_tree_0<int> ft(N+1);

    rep(i,N){
        int x = a[i];
        if (i == 0 || st.query(0, i) < x) {
            spans[i] = ii(0, i);
        } else {
            int lo=0, hi=i;
            while (lo+1 < hi) {
                int mi = (lo + hi)/2;
                if (st.query(mi, i) < x) {
                    hi = mi;
                } else {
                    lo = mi;
                }
            }
            spans[i] = ii(hi, i);
        }
    }
    sort(ALL(spans));
    rep(i,N){
        int from = spans[i].first, to = spans[i].second;
        while (!pq.empty() && pq.top()[0] < from) {
            vi query = pq.top(); pq.pop();
            int l = query[0], r = query[1], target = query[2];
            int cnt = ft.sum(l, r);
            ans[target] = cnt;
        }

        ft.add(to, 1);
    }

    rep(i,Q){
        printf("%d\n", ans[i]);
    }
    return 0;
}
0