結果
| 問題 | No.1300 Sum of Inversions |
| ユーザー |
 rniya
|
| 提出日時 | 2020-11-27 21:42:45 |
| 言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
| 結果 |
AC
|
| 実行時間 | 317 ms / 2,000 ms |
| コード長 | 7,711 bytes |
| コンパイル時間 | 2,451 ms |
| コンパイル使用メモリ | 209,068 KB |
| 最終ジャッジ日時 | 2025-01-16 06:50:19 |
|
ジャッジサーバーID （参考情報） |
judge4 / judge4 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 3 |
| other | AC * 34 |
ソースコード
#include <bits/stdc++.h>using namespace std;// const long long MOD=1000000007;const long long MOD=998244353;#define LOCAL#pragma region Macrostypedef long long ll;typedef __int128_t i128;typedef unsigned int uint;typedef unsigned long long ull;#define ALL(x) (x).begin(),(x).end()const int INF=1e9;const long long IINF=1e18;const int dx[4]={1,0,-1,0},dy[4]={0,1,0,-1};const char dir[4]={'D','R','U','L'};template<typename T>istream &operator>>(istream &is,vector<T> &v){for (T &x:v) is >> x;return is;}template<typename T>ostream &operator<<(ostream &os,const vector<T> &v){for (int i=0;i<v.size();++i){os << v[i] << (i+1==v.size()?"": " ");}return os;}template<typename T,typename U>ostream &operator<<(ostream &os,const pair<T,U> &p){os << '(' << p.first << ',' << p.second << ')';return os;}template<typename T,typename U,typename V>ostream&operator<<(ostream &os,const tuple<T,U,V> &t){os << '(' << get<0>(t) << ',' << get<1>(t) << ',' << get<2>(t) << ')';return os;}template<typename T,typename U,typename V,typename W>ostream&operator<<(ostream &os,const tuple<T,U,V,W> &t){os << '(' << get<0>(t) << ',' << get<1>(t) << ',' << get<2>(t) << ',' << get<3>(t) << ')';return os;}template<typename T,typename U>ostream &operator<<(ostream &os,const map<T,U> &m){os << '{';for (auto itr=m.begin();itr!=m.end();){os << '(' << itr->first << ',' << itr->second << ')';if (++itr!=m.end()) os << ',';}os << '}';return os;}template<typename T,typename U>ostream &operator<<(ostream &os,const unordered_map<T,U> &m){os << '{';for (auto itr=m.begin();itr!=m.end();){os << '(' << itr->first << ',' << itr->second << ')';if (++itr!=m.end()) os << ',';}os << '}';return os;}template<typename T>ostream &operator<<(ostream &os,const set<T> &s){os << '{';for (auto itr=s.begin();itr!=s.end();){os << *itr;if (++itr!=s.end()) os << ',';}os << '}';return os;}template<typename T>ostream &operator<<(ostream &os,const multiset<T> &s){os << '{';for (auto itr=s.begin();itr!=s.end();){os << *itr;if (++itr!=s.end()) os << ',';}os << '}';return os;}template<typename T>ostream &operator<<(ostream &os,const unordered_set<T> &s){os << '{';for (auto itr=s.begin();itr!=s.end();){os << *itr;if (++itr!=s.end()) os << ',';}os << '}';return os;}template<typename T>ostream &operator<<(ostream &os,const deque<T> &v){for (int i=0;i<v.size();++i){os << v[i] << (i+1==v.size()?"": " ");}return os;}void debug_out(){cerr << '\n';}template<class Head,class... Tail>void debug_out(Head&& head,Tail&&... tail){cerr << head;if (sizeof...(Tail)>0) cerr << ", ";debug_out(move(tail)...);}#ifdef LOCAL#define debug(...) cerr << " ";\cerr << #__VA_ARGS__ << " :[" << __LINE__ << ":" << __FUNCTION__ << "]" << '\n';\cerr << " ";\debug_out(__VA_ARGS__)#else#define debug(...) 42#endiftemplate<typename T> T gcd(T x,T y){return y!=0?gcd(y,x%y):x;}template<typename T> T lcm(T x,T y){return x/gcd(x,y)*y;}template<class T1,class T2> inline bool chmin(T1 &a,T2 b){if (a>b){a=b; return true;} return false;}template<class T1,class T2> inline bool chmax(T1 &a,T2 b){if (a<b){a=b; return true;} return false;}#pragma endregiontemplate<uint32_t mod> class modint{using i64=int64_t;using u32=uint32_t;using u64=uint64_t;public:u32 v;constexpr modint(const i64 x=0) noexcept :v(x<0?mod-1-(-(x+1)%mod):x%mod){}constexpr u32 &value() noexcept {return v;}constexpr const u32 &value() const noexcept {return v;}constexpr modint operator+(const modint &rhs) const noexcept {return modint(*this)+=rhs;}constexpr modint operator-(const modint &rhs) const noexcept {return modint(*this)-=rhs;}constexpr modint operator*(const modint &rhs) const noexcept {return modint(*this)*=rhs;}constexpr modint operator/(const modint &rhs) const noexcept {return modint(*this)/=rhs;}constexpr modint &operator+=(const modint &rhs) noexcept {v+=rhs.v;if (v>=mod) v-=mod;return *this;}constexpr modint &operator-=(const modint &rhs) noexcept {if (v<rhs.v) v+=mod;v-=rhs.v;return *this;}constexpr modint &operator*=(const modint &rhs) noexcept {v=(u64)v*rhs.v%mod;return *this;}constexpr modint &operator/=(const modint &rhs) noexcept {return *this*=rhs.pow(mod-2);}constexpr modint pow(u64 exp) const noexcept {modint self(*this),res(1);while (exp>0){if (exp&1) res*=self;self*=self; exp>>=1;}return res;}constexpr modint &operator++() noexcept {if (++v==mod) v=0; return *this;}constexpr modint &operator--() noexcept {if (v==0) v=mod; return --v,*this;}constexpr modint operator++(int) noexcept {modint t=*this; return ++*this,t;}constexpr modint operator--(int) noexcept {modint t=*this; return --*this,t;}constexpr modint operator-() const noexcept {return modint(mod-v);}template<class T> friend constexpr modint operator+(T x,modint y) noexcept {return modint(x)+y;}template<class T> friend constexpr modint operator-(T x,modint y) noexcept {return modint(x)-y;}template<class T> friend constexpr modint operator*(T x,modint y) noexcept {return modint(x)*y;}template<class T> friend constexpr modint operator/(T x,modint y) noexcept {return modint(x)/y;}constexpr bool operator==(const modint &rhs) const noexcept {return v==rhs.v;}constexpr bool operator!=(const modint &rhs) const noexcept {return v!=rhs.v;}constexpr bool operator!() const noexcept {return !v;}friend istream &operator>>(istream &s,modint &rhs) noexcept {i64 v; rhs=modint{(s>>v,v)}; return s;}friend ostream &operator<<(ostream &s,const modint &rhs) noexcept {return s<<rhs.v;}};using mint=modint<MOD>;template<typename T>class BinaryIndexedTree{T sum(int i){T res=T();for (;i>0;i-=(i&-i)) res+=dat[i];return res;}public:int n;vector<T> dat;BinaryIndexedTree(int n_):n(n_+1),dat(n+1,0){}void add(int i,const T &x){for (++i;i<=n;i+=(i&-i)) dat[i]+=x;}T query(int l,int r){return sum(r)-sum(l);}int lower_bound(T x) const {if (x<=0) return 0;int pos=0,k=1;while (k<n) k<<=1;for (;k>0;k>>=1){if (pos+k<=n&&dat[pos+k]<x){x-=dat[pos+k]; pos+=k;}}return pos;}int upper_bound(T x) const {return lower_bound(x+1);}T operator[](int i){return query(i,i+1);}};template<typename T> map<T,int> compress(vector<T> v){sort(v.begin(),v.end());v.erase(unique(v.begin(),v.end()),v.end());map<T,int> res;for (int i=0;i<v.size();++i) res[v[i]]=i;return res;}int main(){cin.tie(0);ios::sync_with_stdio(false);int N; cin >> N;vector<int> A(N); cin >> A;map<int,int> mp=compress(A);int n=mp.size();BinaryIndexedTree<mint> BIT0_sum(n),BIT0_cnt(n),BIT1_sum(n),BIT1_cnt(n);mint ans=0;for (int i=0;i<N;++i){int x=mp[A[i]];ans+=BIT1_sum.query(x+1,n)+BIT1_cnt.query(x+1,n)*A[i];BIT1_sum.add(x,BIT0_sum.query(x+1,n)+BIT0_cnt.query(x+1,n)*A[i]);BIT1_cnt.add(x,BIT0_cnt.query(x+1,n));BIT0_sum.add(x,A[i]);BIT0_cnt.add(x,1);}cout << ans << '\n';}