結果

問題 No.878 Range High-Element Query
ユーザー sntea
提出日時 2019-11-19 11:47:16
言語 C++14
(gcc 13.3.0 + boost 1.87.0)
結果
WA  
実行時間 -
コード長 4,589 bytes
コンパイル時間 2,534 ms
コンパイル使用メモリ 202,992 KB
実行使用メモリ 22,656 KB
最終ジャッジ日時 2024-10-03 06:24:31
合計ジャッジ時間 5,506 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge1
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 1
other WA * 18
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

#ifdef LOCAL111
    #define _GLIBCXX_DEBUG
#else
    #pragma GCC optimize ("O3")
    #define NDEBUG
#endif
// #define _USE_MATH_DEFINES
#include <bits/stdc++.h>
const int INF = 1e9;
using namespace std;
template<typename T, typename U> ostream& operator<< (ostream& os, const pair<T,U>& p) { os << '(' << p.first << ' ' << p.second << ')'; return os; }
#define endl '\n'
#define ALL(a)  (a).begin(),(a).end()
#define SZ(a) int((a).size())
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define RFOR(i,a,b) for (int i=(b)-1;i>=(a);i--)
#define REP(i,n)  FOR(i,0,n)
#define RREP(i,n) for (int i=(n)-1;i>=0;i--)
#ifdef LOCAL111
    #define DEBUG(x) cout<<#x<<": "<<(x)<<endl
    template<typename T> void dpite(T a, T b){ for(T ite = a; ite != b; ite++) cout << (ite == a ? "" : " ") << *ite; cout << endl;}
#else
    #define DEBUG(x) true
    template<typename T> void dpite(T a, T b){ return; }
#endif
#define F first
#define S second
#define SNP string::npos
#define WRC(hoge) cout << "Case #" << (hoge)+1 << ": "
template<typename T> void pite(T a, T b){ for(T ite = a; ite != b; ite++) cout << (ite == a ? "" : " ") << *ite; cout << endl;}
template<typename T> bool chmax(T& a, T b){if(a < b){a = b; return true;} return false;}
template<typename T> bool chmin(T& a, T b){if(a > b){a = b; return true;} return false;}
template<typename T>
vector<T> make_v(size_t a){return vector<T>(a);}
template<typename T,typename... Ts>
auto make_v(size_t a,Ts... ts){
  return vector<decltype(make_v<T>(ts...))>(a,make_v<T>(ts...));
}
template<typename T,typename U,typename... V>
typename enable_if<is_same<T, U>::value!=0>::type
fill_v(U &u,const V... v){u=U(v...);}
template<typename T,typename U,typename... V>
typename enable_if<is_same<T, U>::value==0>::type
fill_v(U &u,const V... v){
  for(auto &e:u) fill_v<T>(e,v...);
}
const array<int, 4> dx = {0, 1, 0, -1};
const array<int, 4> dy = {1, 0, -1, 0};
typedef long long int LL;
typedef unsigned long long ULL;
typedef pair<int,int> P;
void ios_init(){
    //cout.setf(ios::fixed);
    //cout.precision(12);
#ifdef LOCAL111
    return;
#endif
    ios::sync_with_stdio(false); cin.tie(0);
}
// 検証しなおしたい
//library
typedef long long cost_t;
class Edge {
public:
    int to = -1;
    cost_t cost = -1;
    
    Edge(){
    }
    Edge(int x,cost_t y){
        to = x;
        cost = y;
    }
    // Edge(int x, int y, cost_t z){
    //  // from = x;
    //  to = y;
    //  cost = z;
    // }
    // Edge(int x, int y, int r, cost_t z){
    //  // from = x;
    //  to = y;
    //  cost = z;
    //  // rev = r;
    // }
    bool operator< (const Edge& x) const {
        if(cost != x.cost) return cost < x.cost;
        return to < x.to;
    }
    bool operator> (const Edge& x) const {
        if(cost != x.cost) return cost > x.cost;
        return to > x.to;
    }
};
class Graph {
private:
    typedef vector<Edge> Edges;
    //const long long int INF = (long long)1e18;
    vector<Edges> v; 
    int n;
public:
    Graph(int x){
        n = x;
        v = vector<Edges>(x);
    }
    Graph(){}
    Edges& operator[](int x){
        return v[x];
    }
    const Edges& operator[](int x) const {
        return v[x];
    }
    int size() const {
        return n;
    }
    void add_edge(int from, const Edge &e){
        v[from].push_back(e);
    }
    void add_edge(int from, int to, cost_t cost = -1){
        add_edge(from,Edge(to,cost));
    }
    // void add_edge(int from, int to, cost_t cost = -1, int rev = -1){
    //  add_edge(from,Edge(from,to,rev,cost));
    // }
    void add_uedge(int from, int to, cost_t cost = -1){
        add_edge(from,to,cost);
        add_edge(to,from,cost);
    }
};
int main()
{
    ios_init();
    int n, q;
    // GraphVizualizer viz;
    while(cin >> n >> q) {
        vector<LL> a(n);
        REP(i, n) cin >> a[i];
        vector<P> lr(q);
        REP(i, q) {
            int t, l, r;
            cin >> t >> l >> r;
            lr[i] = {l - 1, r};
        }
        
        Graph g(n);
        map<LL ,int> mp;
        RREP(i, n) {
            auto ite = mp.upper_bound(a[i]);
            if(ite != mp.end()) {
                g.add_uedge(i, ite->S);
            }
            mp[a[i]] = i;
        }
        // viz(g);
        vector<vector<P>> qv(n);
        REP(i, q) {
            qv[lr[i].F].emplace_back(lr[i].S, i);
        }
        vector<int> ans(q);
        using heap = priority_queue<P, vector<P>, greater<P>>;
        
        vector<bool> used(n, false);
        function<void(int, int, heap&)> rec = [&](int cur, int dep, heap &qu) {
            if(used[cur]) return;
            used[cur] = true;
            for(auto&& e : g[cur]) {
                rec(e.to, dep + 1, qu);
            }
            DEBUG(cur);
            dpite(ALL(qv[cur]));
            for(auto&& e : qv[cur]) {
                DEBUG(e);
                ans[e.S] += dep;
                qu.push(e);
            }
            while(!qu.empty() and qu.top().F <= cur) {
                DEBUG(qu.top());
                ans[qu.top().S] -= dep; 
                qu.pop();
            }
        };
        RREP(i, n) {
            heap qu;
            rec(i, 0, qu);
        }
        REP(i, q) {
            cout << ans[i] + 1 << endl;
        }
    }
    return 0;
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0