結果
問題 | No.1300 Sum of Inversions |
ユーザー | mugen_1337 |
提出日時 | 2020-11-28 17:23:46 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 753 ms / 2,000 ms |
コード長 | 4,662 bytes |
コンパイル時間 | 3,404 ms |
コンパイル使用メモリ | 208,140 KB |
最終ジャッジ日時 | 2025-01-16 09:29:10 |
ジャッジサーバーID (参考情報) |
judge3 / judge3 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
5,248 KB |
testcase_01 | AC | 2 ms
5,248 KB |
testcase_02 | AC | 2 ms
5,248 KB |
testcase_03 | AC | 516 ms
19,764 KB |
testcase_04 | AC | 464 ms
19,676 KB |
testcase_05 | AC | 329 ms
14,080 KB |
testcase_06 | AC | 503 ms
20,756 KB |
testcase_07 | AC | 496 ms
20,396 KB |
testcase_08 | AC | 546 ms
21,568 KB |
testcase_09 | AC | 527 ms
21,264 KB |
testcase_10 | AC | 309 ms
12,928 KB |
testcase_11 | AC | 276 ms
13,080 KB |
testcase_12 | AC | 499 ms
19,596 KB |
testcase_13 | AC | 527 ms
19,456 KB |
testcase_14 | AC | 753 ms
22,272 KB |
testcase_15 | AC | 657 ms
21,120 KB |
testcase_16 | AC | 483 ms
19,968 KB |
testcase_17 | AC | 257 ms
12,740 KB |
testcase_18 | AC | 387 ms
13,668 KB |
testcase_19 | AC | 425 ms
18,688 KB |
testcase_20 | AC | 466 ms
19,076 KB |
testcase_21 | AC | 384 ms
18,944 KB |
testcase_22 | AC | 362 ms
14,208 KB |
testcase_23 | AC | 605 ms
20,864 KB |
testcase_24 | AC | 480 ms
14,336 KB |
testcase_25 | AC | 337 ms
13,440 KB |
testcase_26 | AC | 342 ms
13,312 KB |
testcase_27 | AC | 389 ms
13,980 KB |
testcase_28 | AC | 508 ms
21,512 KB |
testcase_29 | AC | 386 ms
18,748 KB |
testcase_30 | AC | 564 ms
21,248 KB |
testcase_31 | AC | 367 ms
14,080 KB |
testcase_32 | AC | 340 ms
14,464 KB |
testcase_33 | AC | 47 ms
14,224 KB |
testcase_34 | AC | 54 ms
14,348 KB |
testcase_35 | AC | 287 ms
22,284 KB |
testcase_36 | AC | 281 ms
22,284 KB |
ソースコード
#include<bits/stdc++.h> using namespace std; #define ALL(x) begin(x),end(x) #define rep(i,n) for(int i=0;i<(n);i++) #define debug(v) cout<<#v<<":";for(auto x:v){cout<<x<<' ';}cout<<endl; #define mod 998244353 using ll=long long; const int INF=1000000000; const ll LINF=1001002003004005006ll; int dx[]={1,0,-1,0},dy[]={0,1,0,-1}; // ll gcd(ll a,ll b){return b?gcd(b,a%b):a;} template<class T>bool chmax(T &a,const T &b){if(a<b){a=b;return true;}return false;} template<class T>bool chmin(T &a,const T &b){if(b<a){a=b;return true;}return false;} struct IOSetup{ IOSetup(){ cin.tie(0); ios::sync_with_stdio(0); cout<<fixed<<setprecision(12); } } iosetup; template<typename T> ostream &operator<<(ostream &os,const vector<T>&v){ for(int i=0;i<(int)v.size();i++) os<<v[i]<<(i+1==(int)v.size()?"":" "); return os; } template<typename T> istream &operator>>(istream &is,vector<T>&v){ for(T &x:v)is>>x; return is; } template<ll Mod> struct ModInt{ long long x; ModInt():x(0){} ModInt(long long y):x(y>=0?y%Mod:(Mod-(-y)%Mod)%Mod){} ModInt &operator+=(const ModInt &p){ if((x+=p.x)>=Mod) x-=Mod; return *this; } ModInt &operator-=(const ModInt &p){ if((x+=Mod-p.x)>=Mod)x-=Mod; return *this; } ModInt &operator*=(const ModInt &p){ x=(int)(1ll*x*p.x%Mod); return *this; } ModInt &operator/=(const ModInt &p){ (*this)*=p.inverse(); return *this; } ModInt operator-()const{return ModInt(-x);} ModInt operator+(const ModInt &p)const{return ModInt(*this)+=p;} ModInt operator-(const ModInt &p)const{return ModInt(*this)-=p;} ModInt operator*(const ModInt &p)const{return ModInt(*this)*=p;} ModInt operator/(const ModInt &p)const{return ModInt(*this)/=p;} bool operator==(const ModInt &p)const{return x==p.x;} bool operator!=(const ModInt &p)const{return x!=p.x;} ModInt inverse()const{ int a=x,b=Mod,u=1,v=0,t; while(b>0){ t=a/b; swap(a-=t*b,b);swap(u-=t*v,v); } return ModInt(u); } ModInt pow(long long n)const{ ModInt ret(1),mul(x); while(n>0){ if(n&1) ret*=mul; mul*=mul;n>>=1; } return ret; } friend ostream &operator<<(ostream &os,const ModInt &p){return os<<p.x;} friend istream &operator>>(istream &is,ModInt &a){long long t;is>>t;a=ModInt<Mod>(t);return (is);} static int get_mod(){return Mod;} }; using mint=ModInt<mod>; template<typename Monoid> struct SegmentTree{ using F=function<Monoid(Monoid,Monoid)>; int sz; vector<Monoid> seg; const F f; const Monoid gen; SegmentTree(int n,const F f,const Monoid &gen):f(f),gen(gen){ sz=1; while(sz<n)sz<<=1; seg.assign(2*sz,gen); } void set(int k,const Monoid &x){ seg[k+sz]=x; } void build(){ for(int k=sz-1;k>0;k--) seg[k]=f(seg[2*k],seg[2*k+1]); } void update(int k,const Monoid &x){ k+=sz; seg[k]=x; while(k>>=1) seg[k]=f(seg[2*k],seg[2*k+1]); } // [a,b) Monoid query(int a,int b){ Monoid L=gen,R=gen; for(a+=sz,b+=sz;a<b;a>>=1,b>>=1){ if(a&1) L=f(L,seg[a++]); if(b&1) R=f(seg[--b],R); } return f(L,R); } Monoid operator[](const int &k)const { return seg[k+sz]; } }; mint f(mint a,mint b){ return a+b; } signed main(){ int n;cin>>n; vector<ll> a(n); cin>>a; reverse(ALL(a)); vector<ll> comp=a; sort(ALL(comp)); comp.erase(unique(ALL(comp)),end(comp)); auto mugen=[&](vector<ll> v,vector<mint> &res,vector<mint> &cnt,bool upper=false){ SegmentTree<mint> val((int)comp.size(),f,mint(0)),scn((int)comp.size(),f,mint(0)); val.build();scn.build(); rep(i,n){ int idx=lower_bound(ALL(comp),v[i])-begin(comp); res[i]=(upper?val.query(idx+1,(int)comp.size()):val.query(0,idx)); cnt[i]=(upper?scn.query(idx+1,(int)comp.size()):scn.query(0,idx)); val.update(idx,val[idx]+v[i]); scn.update(idx,scn[idx]+1); } return ; }; vector<mint> lv(n),lc(n),rv(n),rc(n); mugen(a,lv,lc); reverse(ALL(a)); mugen(a,rv,rc,true); reverse(ALL(rv));reverse(ALL(rc)); reverse(ALL(a)); // debug(a); // debug(lc); // debug(rc); // debug(lv); // debug(rv); mint res=0; rep(i,n){ res+=lc[i]*rv[i]; res+=lv[i]*rc[i]; res+=lc[i]*rc[i]*mint(a[i]); } cout<<res<<endl; return 0; }