結果

問題 No.1300 Sum of Inversions
ユーザー sigma425sigma425
提出日時 2020-11-28 03:12:14
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 169 ms / 2,000 ms
コード長 5,073 bytes
コンパイル時間 2,695 ms
コンパイル使用メモリ 211,712 KB
実行使用メモリ 15,580 KB
最終ジャッジ日時 2023-10-09 23:24:42
合計ジャッジ時間 8,335 ms
ジャッジサーバーID
（参考情報） 		judge13 / judge12
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 1 ms
4,372 KB
testcase_01 AC 1 ms
4,376 KB
testcase_02 AC 1 ms
4,372 KB
testcase_03 AC 129 ms
12,824 KB
testcase_04 AC 127 ms
12,488 KB
testcase_05 AC 94 ms
10,904 KB
testcase_06 AC 138 ms
13,864 KB
testcase_07 AC 135 ms
13,272 KB
testcase_08 AC 151 ms
14,456 KB
testcase_09 AC 150 ms
14,332 KB
testcase_10 AC 75 ms
9,576 KB
testcase_11 AC 78 ms
9,752 KB
testcase_12 AC 122 ms
12,484 KB
testcase_13 AC 119 ms
12,328 KB
testcase_14 AC 169 ms
15,388 KB
testcase_15 AC 149 ms
14,548 KB
testcase_16 AC 129 ms
12,904 KB
testcase_17 AC 71 ms
9,316 KB
testcase_18 AC 88 ms
10,228 KB
testcase_19 AC 105 ms
11,436 KB
testcase_20 AC 107 ms
11,648 KB
testcase_21 AC 106 ms
11,696 KB
testcase_22 AC 95 ms
11,024 KB
testcase_23 AC 139 ms
13,976 KB
testcase_24 AC 98 ms
10,988 KB
testcase_25 AC 84 ms
9,972 KB
testcase_26 AC 81 ms
9,920 KB
testcase_27 AC 93 ms
10,716 KB
testcase_28 AC 159 ms
14,816 KB
testcase_29 AC 107 ms
11,720 KB
testcase_30 AC 156 ms
14,328 KB
testcase_31 AC 95 ms
10,968 KB
testcase_32 AC 102 ms
11,280 KB
testcase_33 AC 27 ms
12,492 KB
testcase_34 AC 42 ms
12,612 KB
testcase_35 AC 84 ms
15,404 KB
testcase_36 AC 88 ms
15,580 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using uint = unsigned int;
#define rep(i,n) for(int i=0;i<int(n);i++)
#define rep1(i,n) for(int i=1;i<=int(n);i++)
#define per(i,n) for(int i=int(n)-1;i>=0;i--)
#define per1(i,n) for(int i=int(n);i>0;i--)
#define all(c) c.begin(),c.end()
#define si(x) int(x.size())
#define pb emplace_back
#define fs first
#define sc second
template<class T> using V = vector<T>;
template<class T> using VV = vector<vector<T>>;
template<class T,class U> void chmax(T& x, U y){if(x<y) x=y;}
template<class T,class U> void chmin(T& x, U y){if(y<x) x=y;}
template<class T> void mkuni(V<T>& v){sort(all(v));v.erase(unique(all(v)),v.end());}
template<class S,class T> ostream& operator<<(ostream& o,const pair<S,T> &p){
	return o<<"("<<p.fs<<","<<p.sc<<")";
}
template<class T> ostream& operator<<(ostream& o,const vector<T> &vc){
	o<<"{";
	for(const T& v:vc) o<<v<<",";
	o<<"}";
	return o;
}
constexpr ll TEN(int n) { return (n == 0) ? 1 : 10 * TEN(n-1); }

#ifdef LOCAL
#define show(x) cerr << "LINE" << __LINE__ << " : " << #x << " = " << (x) << endl
void dmpr(ostream& os){os<<endl;}
template<class T,class... Args>
void dmpr(ostream&os,const T&t,const Args&... args){
	os<<t<<" ~ ";
	dmpr(os,args...);
}
#define shows(...) cerr << "LINE" << __LINE__ << " : ";dmpr(cerr,##__VA_ARGS__)
#define dump(x) cerr << "LINE" << __LINE__ << " : " << #x << " = {";  \
	for(auto v: x) cerr << v << ","; cerr << "}" << endl;
#else
#define show(x) void(0)
#define dump(x) void(0)
#define shows(...) void(0)
#endif

struct BIT{
	using D = ll;
	int N;
	vector<D> bit;
	BIT(int n){		//nは区間幅!!!
		N=n;
		bit.assign(n+1,0);
	}
	BIT(){}
	void init(int n){
		N=n;
		bit.assign(n+1,0);
	}
	D sum(int i){		//i個の和a[0]+..a[i-1]
		D s=0;
		while(i>0){
			s+=bit[i];
			i-=(i&-i);
		}
		return s;
	}
	D val(int i){	//return a[i]	(0-ind)
		return sum(i+1)-sum(i);
	}
	void add(int i,D x){	//a[i]+=x (0-indexed)
		i++;
		while(i<=N){
			bit[i]+=x;
			i+=(i&-i);
		}
	}
};

template<unsigned int mod_>
struct ModInt{
	using uint = unsigned int;
	using ll = long long;
	using ull = unsigned long long;

	constexpr static uint mod = mod_;

	uint v;
	ModInt():v(0){}
	ModInt(ll _v):v(normS(_v%mod+mod)){}
	explicit operator bool() const {return v!=0;}
	static uint normS(const uint &x){return (x<mod)?x:x-mod;}		// [0 , 2*mod-1] -> [0 , mod-1]
	static ModInt make(const uint &x){ModInt m; m.v=x; return m;}
	ModInt operator+(const ModInt& b) const { return make(normS(v+b.v));}
	ModInt operator-(const ModInt& b) const { return make(normS(v+mod-b.v));}
	ModInt operator-() const { return make(normS(mod-v)); }
	ModInt operator*(const ModInt& b) const { return make((ull)v*b.v%mod);}
	ModInt operator/(const ModInt& b) const { return *this*b.inv();}
	ModInt& operator+=(const ModInt& b){ return *this=*this+b;}
	ModInt& operator-=(const ModInt& b){ return *this=*this-b;}
	ModInt& operator*=(const ModInt& b){ return *this=*this*b;}
	ModInt& operator/=(const ModInt& b){ return *this=*this/b;}
	ModInt& operator++(int){ return *this=*this+1;}
	ModInt& operator--(int){ return *this=*this-1;}
	ll extgcd(ll a,ll b,ll &x,ll &y) const{
		ll p[]={a,1,0},q[]={b,0,1};
		while(*q){
			ll t=*p/ *q;
			rep(i,3) swap(p[i]-=t*q[i],q[i]);
		}
		if(p[0]<0) rep(i,3) p[i]=-p[i];
		x=p[1],y=p[2];
		return p[0];
	}
	ModInt inv() const {
		ll x,y;
		extgcd(v,mod,x,y);
		return make(normS(x+mod));
	}
	ModInt pow(ll p) const {
		if(p<0) return inv().pow(-p);
		ModInt a = 1;
		ModInt x = *this;
		while(p){
			if(p&1) a *= x;
			x *= x;
			p >>= 1;
		}
		return a;
	}
	bool operator==(const ModInt& b) const { return v==b.v;}
	bool operator!=(const ModInt& b) const { return v!=b.v;}
	friend istream& operator>>(istream &o,ModInt& x){
		ll tmp;
		o>>tmp;
		x=ModInt(tmp);
		return o;
	}
	friend ostream& operator<<(ostream &o,const ModInt& x){ return o<<x.v;}
};
using mint = ModInt<998244353>;
//using mint = ModInt<1000000007>;

V<mint> fact,ifact,invs;
mint Choose(int a,int b){
	if(b<0 || a<b) return 0;
	return fact[a] * ifact[b] * ifact[a-b];
}
void InitFact(int N){	//[0,N]
	N++;
	fact.resize(N);
	ifact.resize(N);
	invs.resize(N);
	fact[0] = 1;
	rep1(i,N-1) fact[i] = fact[i-1] * i;
	ifact[N-1] = fact[N-1].inv();
	for(int i=N-2;i>=0;i--) ifact[i] = ifact[i+1] * (i+1);
	rep1(i,N-1) invs[i] = fact[i-1] * ifact[i];
}

int main(){
	cin.tie(0);
	ios::sync_with_stdio(false);		//DON'T USE scanf/printf/puts !!
	cout << fixed << setprecision(20);

	int N; cin >> N;
	V<ll> A(N); rep(i,N) cin >> A[i];
	reverse(all(A));
	V<ll> as = A; mkuni(as);

	V<ll> L(N),LL(N),R(N),RR(N);
	{
		BIT n(si(as)),s(si(as));
		rep(i,N){
			int x = lower_bound(all(as),A[i]) - as.begin();
			L[i] = n.sum(x); LL[i] = s.sum(x);
			n.add(x,1); s.add(x,L[i]);
		}
	}
	{
		BIT n(si(as)),s(si(as));
		per(i,N){
			int x = lower_bound(all(as),A[i]) - as.begin();
			R[i] = n.sum(si(as)) - n.sum(x+1); RR[i] = s.sum(si(as)) - s.sum(x+1);
			n.add(x,1); s.add(x,R[i]);
		}
	}
	mint ans = 0;
	rep(i,N){
		ans += mint(A[i]) * (LL[i] + L[i]*R[i] + RR[i]);
	}
	cout << ans << endl;
}
0