結果

問題 No.1300 Sum of Inversions
ユーザー hamamuhamamu
提出日時 2020-11-27 22:25:11
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 295 ms / 2,000 ms
コード長 11,704 bytes
コンパイル時間 2,518 ms
コンパイル使用メモリ 217,092 KB
実行使用メモリ 26,704 KB
最終ジャッジ日時 2024-07-26 18:41:59
合計ジャッジ時間 11,374 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge2
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
6,816 KB
testcase_01 AC 2 ms
6,940 KB
testcase_02 AC 2 ms
6,944 KB
testcase_03 AC 215 ms
21,312 KB
testcase_04 AC 205 ms
20,872 KB
testcase_05 AC 158 ms
17,820 KB
testcase_06 AC 237 ms
23,508 KB
testcase_07 AC 234 ms
22,600 KB
testcase_08 AC 265 ms
24,552 KB
testcase_09 AC 260 ms
24,356 KB
testcase_10 AC 122 ms
15,184 KB
testcase_11 AC 131 ms
15,516 KB
testcase_12 AC 229 ms
20,936 KB
testcase_13 AC 204 ms
20,432 KB
testcase_14 AC 295 ms
26,364 KB
testcase_15 AC 265 ms
24,260 KB
testcase_16 AC 218 ms
21,684 KB
testcase_17 AC 112 ms
14,832 KB
testcase_18 AC 135 ms
16,732 KB
testcase_19 AC 177 ms
18,904 KB
testcase_20 AC 184 ms
19,264 KB
testcase_21 AC 181 ms
19,348 KB
testcase_22 AC 158 ms
17,804 KB
testcase_23 AC 251 ms
23,472 KB
testcase_24 AC 181 ms
18,344 KB
testcase_25 AC 146 ms
16,204 KB
testcase_26 AC 131 ms
15,952 KB
testcase_27 AC 157 ms
17,436 KB
testcase_28 AC 279 ms
25,092 KB
testcase_29 AC 180 ms
19,060 KB
testcase_30 AC 269 ms
24,448 KB
testcase_31 AC 159 ms
18,008 KB
testcase_32 AC 158 ms
18,432 KB
testcase_33 AC 67 ms
12,536 KB
testcase_34 AC 74 ms
12,540 KB
testcase_35 AC 149 ms
26,704 KB
testcase_36 AC 153 ms
26,700 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include "bits/stdc++.h"
using namespace std;
using     ll=long long;     using   dd=double;     
using    vll=vector<   ll>; using  vdd=vector< dd>;
using   vvll=vector<  vll>; using vvdd=vector<vdd>;
using  vvvll=vector< vvll>; using vvvdd=vector<vvdd>;
using vvvvll=vector<vvvll>;
using   pll=pair<ll,ll>;  using   tll=tuple<ll,ll,ll>; using   qll=tuple<ll,ll,ll,ll>;
using  vpll=vector< pll>; using  vtll=vector< tll>;    using  vqll=vector< qll>;
using vvpll=vector<vpll>; using vvtll=vector<vtll>;    using vvqll=vector<vqll>;
constexpr ll INF = 1LL << 60;
struct Fast{ Fast(){ cin.tie(0); ios::sync_with_stdio(false); cout<<fixed<<setprecision(numeric_limits<double>::max_digits10); } } fast;
#define REPS(i, S, E) for (ll i = (S); i <= (E); i++)
#define REP(i, N) REPS(i, 0, (N)-1)
#define DEPS(i, S, E) for (ll i = (E); i >= (S); i--)
#define DEP(i, N) DEPS(i, 0, (N)-1)
#define rep(i, S, E)  for (ll i = (S); i <= (E); i++)
#define dep(i, E, S)  for (ll i = (E); i >= (S); i--)
#define each(e, v) for (auto&& e : v)
#define ALL(v) (v).begin(), (v).end()
#define RALL(v) (v).rbegin(), (v).rend()
template<class T> inline bool chmax(T &a, T b) { if (a < b) { a = b; return true; }return false; }
template<class T> inline bool chmin(T &a, T b) { if (a > b) { a = b; return true; }return false; }
template<class T> inline T MaxE(vector<T>&v,ll S,ll E){ T m=v[S]; rep(i,S,E)chmax(m,v[i]); return m; }
template<class T> inline T MinE(vector<T>&v,ll S,ll E){ T m=v[S]; rep(i,S,E)chmin(m,v[i]); return m; }
template<class T> inline T MaxE(vector<T> &v) { return MaxE(v,0,(ll)v.size()-1); }
template<class T> inline T MinE(vector<T> &v) { return MinE(v,0,(ll)v.size()-1); }
template<class T> inline T Sum(vector<T> &v,ll S,ll E){ T s=T(); rep(i,S,E)s+=v[i]; return s; }
template<class T> inline T Sum(vector<T> &v) { return Sum(v,0,v.size()-1); }
template<class T> inline ll sz(T &v){ return (ll)v.size(); }
inline ll CEIL(ll a,ll b){ return (a<0) ? -(-a/b) : (a+b-1)/b; }
inline ll FLOOR(ll a,ll b){ return -CEIL(-a,b); }

//pair用テンプレート
using  vpll=vector< pll>;
using vvpll=vector<vpll>;
template<class T,class S> inline pair<T,S>& operator+=(pair<T,S> &a,const pair<T,S> &b){ a.first+=b.first; a.second+=b.second; return a; }
template<class T,class S> inline pair<T,S>& operator-=(pair<T,S> &a,const pair<T,S> &b){ a.first-=b.first; a.second-=b.second; return a; }
template<class T,class S> inline pair<T,S>& operator*=(pair<T,S> &a,const pair<T,S> &b){ a.first*=b.first; a.second*=b.second; return a; }
template<class T,class S> inline pair<T,S>& operator/=(pair<T,S> &a,const pair<T,S> &b){ a.first/=b.first; a.second/=b.second; return a; }
template<class T,class S> inline pair<T,S>& operator%=(pair<T,S> &a,const pair<T,S> &b){ a.first%=b.first; a.second%=b.second; return a; }
template<class T,class S,class R> inline pair<T,S>& operator+=(pair<T,S> &a,R b){ a.first+=b; a.second+=b; return a; }
template<class T,class S,class R> inline pair<T,S>& operator-=(pair<T,S> &a,R b){ a.first-=b; a.second-=b; return a; }
template<class T,class S,class R> inline pair<T,S>& operator*=(pair<T,S> &a,R b){ a.first*=b; a.second*=b; return a; }
template<class T,class S,class R> inline pair<T,S>& operator/=(pair<T,S> &a,R b){ a.first/=b; a.second/=b; return a; }
template<class T,class S,class R> inline pair<T,S>& operator%=(pair<T,S> &a,R b){ a.first%=b; a.second%=b; return a; }
template<class T,class S,class R> inline pair<T,S> operator+(const pair<T,S> &a,R b){ pair<T,S> c=a; return c+=b; }
template<class T,class S,class R> inline pair<T,S> operator-(const pair<T,S> &a,R b){ pair<T,S> c=a; return c-=b; }
template<class T,class S,class R> inline pair<T,S> operator*(const pair<T,S> &a,R b){ pair<T,S> c=a; return c*=b; }
template<class T,class S,class R> inline pair<T,S> operator/(const pair<T,S> &a,R b){ pair<T,S> c=a; return c/=b; }
template<class T,class S,class R> inline pair<T,S> operator%(const pair<T,S> &a,R b){ pair<T,S> c=a; return c%=b; }
template<class T,class S,class R> inline pair<T,S> operator-(R b,const pair<T,S> &a){ pair<T,S> c=-a; return c+=b; }
template<class T,class S> inline pair<T,S> operator-(const pair<T,S> &a){ pair<T,S> c=a; return c*=(-1); }
template<class T,class S> inline ostream &operator<<(ostream &os,const pair<T,S> &a){ return os << a.first << ' ' << a.second; }

//vector用テンプレート
template<class T> inline vector<T>& operator+=(vector<T> &a,const vector<T> &b){ for (ll i=0; i<(ll)a.size(); i++) a[i]+=b[i];  return a; }
template<class T> inline vector<T>& operator-=(vector<T> &a,const vector<T> &b){ for (ll i=0; i<(ll)a.size(); i++) a[i]-=b[i];  return a; }
template<class T> inline vector<T>& operator*=(vector<T> &a,const vector<T> &b){ for (ll i=0; i<(ll)a.size(); i++) a[i]*=b[i];  return a; }
template<class T> inline vector<T>& operator/=(vector<T> &a,const vector<T> &b){ for (ll i=0; i<(ll)a.size(); i++) a[i]/=b[i];  return a; }
template<class T> inline vector<T>& operator%=(vector<T> &a,const vector<T> &b){ for (ll i=0; i<(ll)a.size(); i++) a[i]%=b[i];  return a; }
template<class T,class S> inline vector<T>& operator+=(vector<T> &a,S b){ for (T &e: a) e+=b;  return a; }
template<class T,class S> inline vector<T>& operator-=(vector<T> &a,S b){ for (T &e: a) e-=b;  return a; }
template<class T,class S> inline vector<T>& operator*=(vector<T> &a,S b){ for (T &e: a) e*=b;  return a; }
template<class T,class S> inline vector<T>& operator/=(vector<T> &a,S b){ for (T &e: a) e/=b;  return a; }
template<class T,class S> inline vector<T>& operator%=(vector<T> &a,S b){ for (T &e: a) e%=b;  return a; }
template<class T,class S> inline vector<T> operator+(const vector<T> &a,S b){ vector<T> c=a; return c+=b; }
template<class T,class S> inline vector<T> operator-(const vector<T> &a,S b){ vector<T> c=a; return c-=b; }
template<class T,class S> inline vector<T> operator*(const vector<T> &a,S b){ vector<T> c=a; return c*=b; }
template<class T,class S> inline vector<T> operator/(const vector<T> &a,S b){ vector<T> c=a; return c/=b; }
template<class T,class S> inline vector<T> operator%(const vector<T> &a,S b){ vector<T> c=a; return c%=b; }
template<class T,class S> inline vector<T> operator-(S b,const vector<T> &a){ vector<T> c=-a; return c+=b; }
template<class T> inline vector<T> operator-(const vector<T> &a){ vector<T> c=a; return c*=(-1); }
template<class T> inline ostream &operator<<(ostream &os,const vector<T> &a){ for (ll i=0; i<(ll)a.size(); i++) os<<(i>0?" ":"")<<a[i];  return os; }

template<ll MOD> struct mll_{
	ll val;
	mll_(ll v = 0): val(v % MOD){ if (val < 0) val += MOD; }
	mll_ operator - () const { return -val; }
	mll_ operator + (const mll_ &b) const { return val + b.val; }
	mll_ operator - (const mll_ &b) const { return val - b.val; }
	mll_ operator * (const mll_ &b) const { return val * b.val; }
	mll_ operator / (const mll_ &b) const { return mll_(*this) /= b; }
	mll_ operator + (ll b) const { return *this + mll_(b); }
	mll_ operator - (ll b) const { return *this - mll_(b); }
	mll_ operator * (ll b) const { return *this * mll_(b); }
	friend mll_ operator + (ll a,const mll_ &b) { return b + a; }
	friend mll_ operator - (ll a,const mll_ &b) { return -b + a; }
	friend mll_ operator * (ll a,const mll_ &b) { return b * a; }
	friend mll_ operator / (ll a,const mll_ &b) { return mll_(a)/b; }
	mll_ &operator += (const mll_ &b) { val=(val+b.val)%MOD; return *this; }
	mll_ &operator -= (const mll_ &b) { val=(val+MOD-b.val)%MOD; return *this; }
	mll_ &operator *= (const mll_ &b) { val=(val*b.val)%MOD; return *this; }
	mll_ &operator /= (const mll_ &b) {
		ll c=b.val,d=MOD,u=1,v=0;
		while (d){
			ll t = c / d;
			c -= t * d; swap(c,d);
			u -= t * v; swap(u,v);
		}
		val = val * u % MOD;
		if (val < 0) val += MOD;
		return *this;
	}
	mll_ &operator += (ll b) { return *this += mll_(b); }
	mll_ &operator -= (ll b) { return *this -= mll_(b); }
	mll_ &operator *= (ll b) { return *this *= mll_(b); }
	mll_ &operator /= (ll b) { return *this /= mll_(b); }
	bool operator == (const mll_ &b) const { return val == b.val; }
	bool operator != (const mll_ &b) const { return val != b.val; }
	bool operator == (ll b) const { return *this == mll_(b); }
	bool operator != (ll b) const { return *this != mll_(b); }
	friend bool operator == (ll a,const mll_ &b) { return mll_(a) == b.val; }
	friend bool operator != (ll a,const mll_ &b) { return mll_(a) != b.val; }
	friend ostream &operator << (ostream &os,const mll_ &a) { return os << a.val; }
	friend istream &operator >> (istream &is,mll_ &a) { return is >> a.val; }
	static mll_ Combination(ll a,ll b){
		chmin(b,a-b);
		if (b<0) return mll_(0);
		mll_ c = 1;
		rep(i,0,b-1) c *= a-i;
		rep(i,0,b-1) c /= i+1;
		return c;
	}
};
//using mll = mll_<1000000007LL>;
using mll = mll_<998244353LL>;
using vmll    = std::vector<mll>;
using vvmll   = std::vector<vmll>;
using vvvmll  = std::vector<vvmll>;
using vvvvmll = std::vector<vvvmll>;


#if 0
#include <atcoder/all>
using namespace atcoder;
#endif

struct coordinateCompression{
	map<ll, ll> val2idx;
	vll idx2val;
	coordinateCompression(){}
	void add(ll val){
		val2idx[val]=0;
	}
	void add(vll v){
		each(e, v) val2idx[e]=0;
	}
	void compress(){
		ll cnt=0;
		each(e, val2idx){
			idx2val.push_back(e.first);
			e.second=cnt++;
		}
	}
	ll size(){
		return (ll)idx2val.size();
	}
	ll v2i(ll v){ return val2idx[v]; }
	ll i2v(ll i){ return idx2val[i]; }
};


template <class T> struct BIT_{
	vector<T> v; ll N;
	BIT_(){}
	BIT_(ll N) { Init(N); }
	void Init(ll N) { v.resize(N+1); this->N = N; }
	void add(ll i, T x) { for (i++; i<=N; i+=i&(-i)) v[i]+=x; }
	T sum(ll i) { T s=0;  for (i++; i>0; i-=i&(-i)) s+=v[i];  return s; }
	T sum(ll i, ll j) { return sum(j)-sum(i-1); }
	ll lower_bound(T s){
		ll i=0,l=1;  while (l<N) l<<=1;
		for(; l>0; l>>=1) if(i+l<=N && v[i+l]<s) s-=v[i+=l];
		return i;
	}
	void Dump() { rep(i,0,N-1) cerr<<setw(3)<< i <<" "<<setw(5)<< sum(i,i) <<'\n'; }
};
using BIT = BIT_<ll>;

void solve()
{
	ll n;  cin >> n;
	vector<ll> a(n);  rep(i,0,n-1){ ll a__; cin>>a__; a[i]=a__; }
	
	coordinateCompression co;
	co.add(a);
	co.compress();
	vll aa;
	each(e,a){
		ll id=co.val2idx[e];
		aa.push_back(id);
	}
#if 0
	BIT bitl(n);
	BIT bitr(n);
	BIT bitlq(n);
	BIT bitrq(n);
	rep(i,0,n-1){
		ll id=aa[i];
		bitr.add(id,1);
	}
	rep(id,0,n-1){
		ll nm=bitr.sum(id,id);
		if (nm>=1){
			bitrq.add(id,1);
		}
	}

	mll ans=0;
	rep(i,0,n-1){
		ll x=a[i];
		ll id=aa[i];
		bitr.add(id,-1);
		ll nm=bitr.sum(id,id);
		if (nm==0){
			bitrq.add(id,-1);
		}

		ll p =bitl .sum(id+1,n-1);//idより大の個数
		ll pp=bitlq.sum(id+1,n-1);
		ll q =bitr .sum(0,id-1);
		ll qq=bitrq.sum(0,id-1);
		mll kiyo=p*q+pp*(pp-1)/2 + qq*(qq-1)/2;
		ans+=kiyo*x;

		bitl.add(id,1);
		if (bitlq.sum(id,id)==0){
			bitlq.add(id,1);
		}
	}
	cout << ans << '\n';
#endif
	BIT bitl(n);
	BIT bitr(n);
	BIT bitls(n);
	BIT bitrs(n);
	rep(i,0,n-1){
		ll x=a[i];
		ll id=aa[i];
		bitr.add(id,1);
		bitrs.add(id,x);
	}

	mll ans=0;
	rep(i,0,n-1){
		ll x=a[i];
		ll id=aa[i];
		bitr.add(id,-1);
		bitrs.add(id,-x);

		mll p =bitl .sum(id+1,n-1);//idより大の個数
		mll ps=bitls.sum(id+1,n-1);
		mll q =bitr .sum(0,id-1);
		mll qs=bitrs.sum(0,id-1);

		ans+=p*q*x;
		ans+=ps*q;
		ans+=qs*p;

		bitl .add(id,1);
		bitls.add(id,x);
	}
	cout << ans << '\n';
}


int main(){
#if 1
	solve();
	//cin2solve();
	//generand();
#else
	ll t;  cin >> t;
	rep(i, 0, t-1){
		solve();
		//cin2solve();
	}
#endif
	return 0;
}
0