結果

問題 No.924 紲星
ユーザー maroon_kuri
提出日時 2019-11-08 22:00:42
言語 C++14
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 869 ms / 4,000 ms
コード長 4,718 bytes
コンパイル時間 2,173 ms
コンパイル使用メモリ 186,044 KB
実行使用メモリ 24,716 KB
最終ジャッジ日時 2024-09-15 01:28:38
合計ジャッジ時間 10,580 ms
ジャッジサーバーID
（参考情報） 		judge6 / judge2
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 3
other AC * 16
権限があれば一括ダウンロードができます

ソースコード

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

#include <bits/stdc++.h>
using namespace std;
using ll=long long;
#define int ll
#define rng(i,a,b) for(int i=int(a);i<int(b);i++)
#define rep(i,b) rng(i,0,b)
#define gnr(i,a,b) for(int i=int(b)-1;i>=int(a);i--)
#define per(i,b) gnr(i,0,b)
#define pb push_back
#define eb emplace_back
#define a first
#define b second
#define bg begin()
#define ed end()
#define all(x) x.bg,x.ed
#ifdef LOCAL
#define dmp(x) cerr<<__LINE__<<" "<<#x<<" "<<x<<endl
#else
#define dmp(x) void(0)
#endif
template<class t,class u> void chmax(t&a,u b){if(a<b)a=b;}
template<class t,class u> void chmin(t&a,u b){if(b<a)a=b;}
template<class t> using vc=vector<t>;
template<class t> using vvc=vc<vc<t>>;
using pi=pair<int,int>;
using vi=vc<int>;
template<class t,class u>
ostream& operator<<(ostream& os,const pair<t,u>& p){
    return os<<"{"<<p.a<<","<<p.b<<"}";
}
template<class t> ostream& operator<<(ostream& os,const vc<t>& v){
    os<<"{";
    for(auto e:v)os<<e<<",";
    return os<<"}";
}
#define mp make_pair
#define mt make_tuple
#define one(x) memset(x,-1,sizeof(x))
#define zero(x) memset(x,0,sizeof(x))
using uint=unsigned;
using ull=unsigned long long;
template<int i,class T>
void print_tuple(ostream&,const T&){
}
template<int i,class T,class H,class ...Args>
void print_tuple(ostream&os,const T&t){
    if(i)os<<",";
    os<<get<i>(t);
    print_tuple<i+1,T,Args...>(os,t);
}
template<class ...Args>
ostream& operator<<(ostream&os,const tuple<Args...>&t){
    os<<"{";
    print_tuple<0,tuple<Args...>,Args...>(os,t);
    return os<<"}";
}
void print(ll x,int suc=1){
    cout<<x;
    if(suc==1)
        cout<<"\n";
    if(suc==2)
        cout<<" ";
}
ll read(){
    ll i;
    cin>>i;
    return i;
}
vi readvi(int n,int off=0){
    vi v(n);
    rep(i,n)v[i]=read()+off;
    return v;
}
template<class T>
void print(const vector<T>&v,int suc=1){
    rep(i,v.size())
        print(v[i],i==int(v.size())-1?suc:2);
}
string readString(){
    string s;
    cin>>s;
    return s;
}
template<class T>
T sq(const T& t){
    return t*t;
}
//#define CAPITAL
void yes(bool ex=true){
    #ifdef CAPITAL
    cout<<"YES"<<endl;
    #else
    cout<<"Yes"<<endl;
    #endif
    if(ex)exit(0);
}
void no(bool ex=true){
    #ifdef CAPITAL
    cout<<"NO"<<endl;
    #else
    cout<<"No"<<endl;
    #endif
    if(ex)exit(0);
}
constexpr ll ten(int n){
    return n==0?1:ten(n-1)*10;
}
const ll infLL=LLONG_MAX/3;
#ifdef int
const int inf=infLL;
#else
const int inf=INT_MAX/2-100;
#endif
int topbit(signed t){
    return t==0?-1:31-__builtin_clz(t);
}
int topbit(ll t){
    return t==0?-1:63-__builtin_clzll(t);
}
int botbit(signed a){
    return a==0?32:__builtin_ctz(a);
}
int botbit(ll a){
    return a==0?64:__builtin_ctzll(a);
}
int popcount(signed t){
    return __builtin_popcount(t);
}
int popcount(ll t){
    return __builtin_popcountll(t);
}
bool ispow2(int i){
    return i&&(i&-i)==i;
}
int mask(int i){
    return (int(1)<<i)-1;
}
bool inc(int a,int b,int c){
    return a<=b&&b<=c;
}
template<class t> void mkuni(vc<t>&v){
    sort(all(v));
    v.erase(unique(all(v)),v.ed);
}
ll rand_int(ll l, ll r) { //[l, r]
    #ifdef LOCAL
    static mt19937_64 gen;
    #else
    static random_device rd;
    static mt19937_64 gen(rd());
    #endif
    return uniform_int_distribution<ll>(l, r)(gen);
}
struct BIT{
    vi buf;
    int s;
    BIT(int n=0){init(n);}
    void init(int n){buf.assign(s=n,0);}
    void add(int i,int v){
        for(;i<s;i+=(i+1)&(-i-1))
            buf[i]+=v;
    }
    int get(int i){
        int res=0;
        for(;i>=0;i-=(i+1)&(-i-1))
            res+=buf[i];
        return res;
    }
    int sum(int b,int e){
        return get(e-1)-get(b-1);
    }
    int kth(int k){
        int res=0;
        for(int i=topbit(s);i>=0;i--){
            int w=res+(1<<i);
            if(w<=s&&buf[w-1]<=k){
                k-=buf[w-1];
                res=w;
            }
        }
        return res;
    }
};
signed main(){
    cin.tie(0);
    ios::sync_with_stdio(0);
    cout<<fixed<<setprecision(20);
    
    int n,q;cin>>n>>q;
    vi a=readvi(n);
    vi idx(n);
    iota(all(idx),0);
    sort(all(idx),[&](int i,int j){return a[i]<a[j];});
    
    vc<pi> qs;
    rep(_,q){
        int l,r;cin>>l>>r;
        l--;
        qs.eb(l,r);
    }
    
    vi lw(q,-1),up(q,n-1);
    
    while(1){
        vvc<int> z(n);
        bool has=false;
        rep(i,q){
            if(up[i]-lw[i]>1){
                int m=(lw[i]+up[i])/2;
                z[m].pb(i);
                has=true;
            }
        }
        dmp(lw);
        dmp(up);
        if(!has)break;
        BIT bit(n);
        rep(i,n){
            bit.add(idx[i],1);
            for(auto j:z[i]){
                int s=bit.sum(qs[j].a,qs[j].b);
                if(s<(qs[j].b-qs[j].a+1)/2)
                    lw[j]=i;
                else
                    up[j]=i;
            }
        }
    }
    
    vi ans(q);
    {
        vi s(n+1);
        rep(i,n)s[i+1]=s[i]+a[i];
        rep(i,q)
            ans[i]=s[qs[i].b]-s[qs[i].a];
    }
    
    vvc<int> z(n);
    rep(i,q)
        z[up[i]].pb(i);
    BIT bit1(n),bit2(n);
    rep(i,n){
        bit1.add(idx[i],1);
        bit2.add(idx[i],a[idx[i]]);
        for(auto j:z[i]){
            int x=bit1.sum(qs[j].a,qs[j].b);
            int y=qs[j].b-qs[j].a-x;
            ans[j]-=bit2.sum(qs[j].a,qs[j].b)*2;
            ans[j]+=(x-y)*a[idx[i]];
        }
    }
    
    for(auto v:ans)
        cout<<v<<endl;
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0