제출 #1182395

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1182395		Zbyszek99	Fire (JOI20_ho_t5)	C++20	0 / 100	556 ms	70200 KiB

ho_t5

#include <bits/stdc++.h>
#define ll long long
#define ld long double
#define ff first
#define ss second
#define vl vector<long long>
#define vi vector<int>
#define pii pair<int,int>
#define pll pair<long long, long long>
#define pb push_back
#define rep(i, b) for(int i = 0; i < (b); ++i)
#define rep2(i,a,b) for(int i = a; i <= (b); ++i)
#define rep3(i,a,b,c) for(int i = a; i <= (b); i+=c)
#define count_bits(x) __builtin_popcountll((x))
#define all(x) (x).begin(),(x).end()
#define siz(x) (int)(x).size()
#define forall(it,x) for(auto& it:(x))
using namespace std;
#define int long long
//mt19937 mt;void random(){mt.seed(chrono::time_point_cast<chrono::milliseconds>(chrono::high_resolution_clock::now()).time_since_epoch().count());}
//ll rand(ll a, ll b) {return a + (mt() % (b-a+1));}
const int INF = 1e9+50;
const ll INF_L = 1e18+40;
const ll MOD = 1e9+7;

ll query_ans[200'001];

const int tree_siz = 1024*1024-1;

struct seg_tree
{
    ll drzewo[tree_siz+1];
    ll sp[tree_siz+1];
    seg_tree()
    {
        rep2(i,1,tree_siz)
        {
            drzewo[i] = 0;
            sp[i] = 0;
        }
    }
    void spych(int akt, ll s)
    {
        s/=2;
        drzewo[akt*2] += sp[akt] * s;
        drzewo[akt*2+1] += sp[akt] * s;
        sp[akt*2] += sp[akt];
        sp[akt*2+1] += sp[akt];
        sp[akt] = 0;
    }
    ll get_sum(int akt, int p1, int p2, int s1, int s2)
    {
        if(p2 < s1 || p1 > s2) return 0;
        if(p1 >= s1 && p2 <= s2) 
        {
    //        cout << p1 << " " << p2 << " " << drzewo[akt] << " get\n";
            return drzewo[akt];
        }
        spych(akt,p2-p1+1);
        return get_sum(akt*2,p1,(p1+p2)/2,s1,s2) + get_sum(akt*2+1,(p1+p2)/2+1,p2,s1,s2);
    }
    void add_seg(int akt, int p1, int p2, int s1, int s2, ll w)
    {
        if(p2 < s1 || p1 > s2) return;
        if(p1 >= s1 && p2 <= s2)
        {
            drzewo[akt] += w * (ll)(p2-p1+1);
            sp[akt] += w;
            return;
        }
        spych(akt,p2-p1+1);
        add_seg(akt*2,p1,(p1+p2)/2,s1,s2,w);
        add_seg(akt*2+1,(p1+p2)/2+1,p2,s1,s2,w);
        drzewo[akt] = drzewo[akt*2] + drzewo[akt*2+1];
    }
};

seg_tree tree1;
seg_tree tree2;
ll prev_[200'001];
ll nxt_[200'001];
ll arr[200'001];

signed main()
{
    ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
    //random();
    int n,q;
    cin >> n >> q;
    rep(i,n) cin >> arr[i];
    stack<int> st;
    rep(i,n)
    {   
        while(siz(st) > 0 && arr[st.top()] < arr[i])
        {
            st.pop();
        }
        if(siz(st) == 0) prev_[i] = -n;
        else prev_[i] = st.top();
        st.push(i);
    }    
    while(!st.empty()) st.pop();
    for(int i = n-1; i >= 0; i--)
    {   
        while(siz(st) > 0 && arr[st.top()] <= arr[i])
        {
            st.pop();
        }
        if(siz(st) == 0) nxt_[i] = n;
        else nxt_[i] = st.top();
        st.push(i);
    }    
    vector<pair<pii,ll>> add_points;
    vector<pair<pii,pii>> queries;
    rep(i,n)
    {
        //if(i != 1) continue;
       // cout << nxt_[i] << " " << prev_[i] << " " << i << " nxt\n";
        if(i != 0) add_points.pb({{i-prev_[i]-2,i-1+3},-arr[i]});
        if(i-prev_[i]-2 == 38)
        {
            cout << i << " xd\n";
        }
        add_points.pb({{nxt_[i]-i-2,nxt_[i]-1+3},-arr[i]});
        if(nxt_[i]-1-2 == 38)
        {
            cout << i << " xd2\n";
        }
        add_points.pb({{nxt_[i]-1 - prev_[i]-1,nxt_[i]-1+3},arr[i]});
       // if(nxt_[i] == n && i == 0)
       // {
       //     add_points[siz(add_points)-1].ff.ff++;
       // }
        // if(nxt_[i]-1-prev_[i]-1 == 38)
        // {
        //     cout << add_points[siz(add_points)-1].ff.ff << " " << add_points[siz(add_points)-1].ff.ss << " pointxdddddd\n";
        //     cout << i << " " << nxt_[i] << " xd3\n";
        // }
    }
    rep(i,q)
    {
        int t,l,r;
        cin >> t >> l >> r;
        if(t == n) t--;
        l--;
        r--;
        queries.pb({{t,i},{l+3,r+3}});
    }
    forall(it,add_points)
    {
        tree1.add_seg(1,0,tree_siz/2,0,it.ff.ss,it.ss);
    }
    sort(all(add_points));
    sort(all(queries));
    int cur_p = 0;
    forall(it,queries)
    {
        while(cur_p < siz(add_points) && add_points[cur_p].ff.ff < it.ff.ff)
        {
   //         cout << add_points[cur_p].ff.ff << " " << add_points[cur_p].ff.ss << " " << add_points[cur_p].ss << " del\n";
            tree1.add_seg(1,0,tree_siz/2,0,add_points[cur_p].ff.ss,-add_points[cur_p].ss);
            cur_p++;
        }
   //     rep(i,3) cout << i << " " << tree1.get_sum(1,0,tree_siz/2,i,i) << " get_sum\n";
    //    cout << it.ss.ff << " " << it.ss.ss << " seg\n";
        query_ans[it.ff.ss] += tree1.get_sum(1,0,tree_siz/2,it.ss.ff,it.ss.ss);
    }
   // cout << query_ans[0] << " pot_ans\n";
    rep(i,siz(add_points))
    {
        add_points[i].ff.ss--;
        add_points[i].ff = {add_points[i].ff.ff,add_points[i].ff.ss - add_points[i].ff.ff + n+5};
        add_points[i].ss *= -1;
    //    cout << add_points[i].ff.ff << " " << add_points[i].ff.ss << " " << add_points[i].ss << " point\n";
      //  if(add_points[i].ff.ff == 38) add_points[i].ss = 0;
    }
    rep(i,siz(queries))
    {
        queries[i].ss = {queries[i].ss.ff - queries[i].ff.ff + n+5,5+queries[i].ss.ss - queries[i].ff.ff + n};
    }
   // cout << queries[0].ss.ff << " " << queries[0].ss.ss << " query_seg\n";
    // cout << "rot_points:\n";
    //  forall(it,add_points)
    //  {
    //      cout << "y: " << it.ff.ff << " x: " << it.ff.ss << " cost: " << it.ss << " add\n";
    //  }
    // // cout << queries[0].ss.ff << " " << queries[0].ss.ss << " que\n";
    

    forall(it,add_points)
    {
        tree2.add_seg(1,0,tree_siz/2,0,it.ff.ss,it.ss);
    }
    sort(all(add_points));
    sort(all(queries));
    cur_p = 0;
    forall(it,queries)
    {
        while(cur_p < siz(add_points) && add_points[cur_p].ff.ff < it.ff.ff)
        {
            tree2.add_seg(1,0,tree_siz/2,0,add_points[cur_p].ff.ss,-add_points[cur_p].ss);
            cur_p++;
        }
        query_ans[it.ff.ss] += tree2.get_sum(1,0,tree_siz/2,it.ss.ff,it.ss.ss);
    }
    rep(i,q) cout << query_ans[i] << "\n";
}

• Subtask 1: 0 / 1
• Subtask 2: 0 / 6
• Subtask 3: 0 / 7
• Subtask 4: 0 / 6
• Subtask 5: 0 / 80