結果

問題 No.878 Range High-Element Query
ユーザー fumiphysfumiphys
提出日時 2019-09-06 22:35:48
言語 C++14
(gcc 13.2.0 + boost 1.83.0)
結果
AC  
実行時間 276 ms / 2,000 ms
コード長 6,246 bytes
コンパイル時間 2,042 ms
コンパイル使用メモリ 184,980 KB
実行使用メモリ 11,084 KB
最終ジャッジ日時 2023-09-07 01:25:32
合計ジャッジ時間 5,084 ms
ジャッジサーバーID
（参考情報） 		judge11 / judge13
このコードへのチャレンジ（β）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 3 ms
5,932 KB
testcase_01 AC 4 ms
5,936 KB
testcase_02 AC 5 ms
5,780 KB
testcase_03 AC 4 ms
5,780 KB
testcase_04 AC 4 ms
5,904 KB
testcase_05 AC 5 ms
5,820 KB
testcase_06 AC 4 ms
5,752 KB
testcase_07 AC 3 ms
5,940 KB
testcase_08 AC 5 ms
5,776 KB
testcase_09 AC 5 ms
5,844 KB
testcase_10 AC 5 ms
5,792 KB
testcase_11 AC 258 ms
10,524 KB
testcase_12 AC 182 ms
10,184 KB
testcase_13 AC 203 ms
9,320 KB
testcase_14 AC 154 ms
8,600 KB
testcase_15 AC 186 ms
9,980 KB
testcase_16 AC 264 ms
11,032 KB
testcase_17 AC 274 ms
11,084 KB
testcase_18 AC 276 ms
11,072 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

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

// macros
#define pb emplace_back
#define mk make_pair
#define FOR(i, a, b) for(int i=(a);i<(b);++i)
#define rep(i, n) FOR(i, 0, n)
#define rrep(i, n) for(int i=((int)(n)-1);i>=0;i--)
#define irep(itr, st) for(auto itr = (st).begin(); itr != (st).end(); ++itr)
#define irrep(itr, st) for(auto itr = (st).rbegin(); itr != (st).rend(); ++itr)
#define all(x) (x).begin(),(x).end()
#define sz(x) ((int)(x).size())
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end())
#define bit(n) (1LL<<(n))
// functions
template <class T>bool chmax(T &a, const T &b){if(a < b){a = b; return 1;} return 0;}
template <class T>bool chmin(T &a, const T &b){if(a > b){a = b; return 1;} return 0;}
template <typename T> istream &operator>>(istream &is, vector<T> &vec){for(auto &v: vec)is >> v; return is;}
template <typename T> ostream &operator<<(ostream &os, const vector<T>& vec){for(int i = 0; i < vec.size(); i++){ os << vec[i]; if(i + 1 != vec.size())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const set<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const unordered_set<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const multiset<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const unordered_multiset<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T1, typename T2> ostream &operator<<(ostream &os, const pair<T1, T2> &p){os << p.first << " " << p.second; return os;}
template <typename T1, typename T2> ostream &operator<<(ostream &os, const map<T1, T2> &mp){for(auto itr = mp.begin(); itr != mp.end(); ++itr){ os << itr->first << ":" << itr->second; auto titr = itr; if(++titr != mp.end())os << " "; } return os;}
template <typename T1, typename T2> ostream &operator<<(ostream &os, const unordered_map<T1, T2> &mp){for(auto itr = mp.begin(); itr != mp.end(); ++itr){ os << itr->first << ":" << itr->second; auto titr = itr; if(++titr != mp.end())os << " "; } return os;}
//  types
using ll = long long int;
using P = pair<int, int>;
// constants
const int inf = 1e9;
const ll linf = 1LL << 50;
const double EPS = 1e-10;
const int mod = 1000000007;
const int dx[4] = {-1, 0, 1, 0};
const int dy[4] = {0, -1, 0, 1};
// io
struct fast_io{
  fast_io(){ios_base::sync_with_stdio(false); cin.tie(0); cout << fixed << setprecision(20);}
} fast_io_;

template<typename T, typename E>
struct SegmentTree_ {
  function<T(T, T)> f; // aggregate function
  function<T(T, E)> g; // update function
  int n;
  T def;
  vector<T> vec;
  SegmentTree_(){}
  SegmentTree_(int n_, function<T(T, T)> f, function<T(T, E)> g, T def, vector<T> v=vector<T>()): f(f), g(g), def(def){

    // initialize vector
    n = 1;
    while(n < n_){
      n *= 2;
    }
    vec = vector<T>(2*n -1, def);

    // initialize segment tree
    for(int i = 0; i < v.size(); i++){
      vec[i + n - 1] = v[i];
    }
    for(int i = n - 2; i >= 0; i--){
      vec[i] = f(vec[2*i+1], vec[2*i+2]);
    }
  }
  void update(int k, const E &val){
    k = k + n - 1;
    vec[k] = g(vec[k], val);
    while(k > 0){
      k = (k - 1) / 2;
      vec[k] = f(vec[2*k+1], vec[2*k+2]);
    }
  }
  // [l, r) -> [a, b) (at k)
  T query(int a, int b, int k, int l, int r){
    if(r <= a || b <= l)return def;
    if(a <= l && r <= b)return vec[k];
    T ld = query(a, b, 2*k+1, l, (l+r)/2);
    T rd = query(a, b, 2*k+2, (l+r)/2, r);
    return f(ld, rd);
  }
  T query(int a, int b){
    return query(a, b, 0, 0, n);
  }
};

template<typename T, typename E>
using SegmentTree = struct SegmentTree_<T, E>;
using SegmentTreeI = SegmentTree<int, int>;
using SegmentTreeL = SegmentTree<long long, long long>;

template<typename T>
struct BIT_{
  int n;
  vector<T> bit;
  BIT_(){}
  BIT_(int n_){
    n = n_;
    bit = vector<T>(n+1, 0);
  }
  void add(int a, T w){
    for(int x = a; x < n; x |= (x + 1)){
      bit[x] += w;
    }
  }
  T sum(int a){
    if(a < 0)return 0;
    T res = 0;
    for(int x = a; x >= 0; x = (x & (x + 1)) - 1){
      res += bit[x];
    }
    return res;
  }
  int lower_bound(T w){
    int x = 0;
    int m = 1;
    while(m <= n)m *= 2;
    for(int k = m; k > 0; k /= 2){
      if(x + k <= n && bit[x+k-1] < w){
        w -= bit[x+k-1];
        x += k;
      }
    }
    return x;
  }
};

typedef struct BIT_<int> BITI;
typedef struct BIT_<long long> BITL;

struct st{
  int i, l, r;
  st(){}
  st(int i, int l, int r): i(i), l(l), r(r){}
};

vector<int> nex[100010];

int main(int argc, char const* argv[])
{
  int n, q;
  cin >> n >> q;
  vector<ll> a(n);
  cin >> a;
  vector<st> qu(q);
  vector<int> ee(n);
  rep(i, n)ee[i] = i;
  sort(all(ee), [&](int i, int j){
                 return a[i] < a[j];
               });
  BITI bt(n);
  rrep(i, n){
    int idx = ee[i];
    int tmp = bt.sum(idx);
    if(tmp > 0){
      int l = -1, r = idx - 1;
      while(r - l > 1){
        int m = (r + l) / 2;
        int t = bt.sum(m);
        if(t == tmp)r = m;
        else l = m;
      }
      nex[r].pb(idx);
    }
    bt.add(idx, 1);
  }
  rep(i, q){
    int c;
    cin >> c >> qu[i].l >> qu[i].r, qu[i].l--, qu[i].r--;
    qu[i].i = i;
  }
  sort(all(qu), [](st &a, st &b){
                  if(a.l != b.l)return a.l < b.l;
                  return a.r < b.r;
                });
  int curr = n - 1;
  SegmentTreeI seg = SegmentTreeI(n, [](int a, int b){return a + b;},
                                  [](int a, int b){return b;}, 0, vector<int>(n, 1));

  vector<int> ans(q, 0);
  rrep(i, q){
    for(; curr >= 0 && qu[i].l <= curr; curr--){
      for(int e: nex[curr]){
        seg.update(e, 0);
      }
    }
    int idx = qu[i].i;
    ans[idx] = seg.query(qu[i].l, qu[i].r + 1);
  }
  rep(i, q){
    cout << ans[i] << endl;
  }
  return 0;
}
0