結果
問題 | No.1300 Sum of Inversions |
ユーザー | 👑 tute7627 |
提出日時 | 2020-11-27 21:38:23 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 547 ms / 2,000 ms |
コード長 | 6,315 bytes |
コンパイル時間 | 2,541 ms |
コンパイル使用メモリ | 219,632 KB |
実行使用メモリ | 21,740 KB |
最終ジャッジ日時 | 2023-10-01 05:06:12 |
合計ジャッジ時間 | 15,439 ms |
ジャッジサーバーID (参考情報) |
judge14 / judge12 |
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
4,376 KB |
testcase_01 | AC | 1 ms
4,380 KB |
testcase_02 | AC | 1 ms
4,380 KB |
testcase_03 | AC | 384 ms
17,640 KB |
testcase_04 | AC | 384 ms
17,148 KB |
testcase_05 | AC | 286 ms
14,752 KB |
testcase_06 | AC | 453 ms
19,216 KB |
testcase_07 | AC | 412 ms
18,752 KB |
testcase_08 | AC | 478 ms
20,276 KB |
testcase_09 | AC | 484 ms
20,052 KB |
testcase_10 | AC | 225 ms
12,768 KB |
testcase_11 | AC | 231 ms
12,868 KB |
testcase_12 | AC | 363 ms
17,432 KB |
testcase_13 | AC | 354 ms
16,916 KB |
testcase_14 | AC | 547 ms
21,584 KB |
testcase_15 | AC | 479 ms
20,164 KB |
testcase_16 | AC | 403 ms
17,996 KB |
testcase_17 | AC | 213 ms
12,492 KB |
testcase_18 | AC | 251 ms
13,916 KB |
testcase_19 | AC | 320 ms
15,652 KB |
testcase_20 | AC | 346 ms
16,216 KB |
testcase_21 | AC | 341 ms
16,164 KB |
testcase_22 | AC | 297 ms
14,668 KB |
testcase_23 | AC | 457 ms
19,200 KB |
testcase_24 | AC | 297 ms
15,136 KB |
testcase_25 | AC | 237 ms
13,400 KB |
testcase_26 | AC | 234 ms
13,288 KB |
testcase_27 | AC | 266 ms
14,340 KB |
testcase_28 | AC | 488 ms
20,524 KB |
testcase_29 | AC | 315 ms
15,700 KB |
testcase_30 | AC | 473 ms
19,992 KB |
testcase_31 | AC | 292 ms
14,992 KB |
testcase_32 | AC | 302 ms
15,136 KB |
testcase_33 | AC | 24 ms
6,264 KB |
testcase_34 | AC | 38 ms
6,196 KB |
testcase_35 | AC | 226 ms
21,740 KB |
testcase_36 | AC | 231 ms
21,736 KB |
ソースコード
//#define _GLIBCXX_DEBUG #include<bits/stdc++.h> using namespace std; #define endl '\n' #define lfs cout<<fixed<<setprecision(10) #define ALL(a) (a).begin(),(a).end() #define ALLR(a) (a).rbegin(),(a).rend() #define spa << " " << #define fi first #define se second #define MP make_pair #define MT make_tuple #define PB push_back #define EB emplace_back #define rep(i,n,m) for(ll i = (n); i < (ll)(m); i++) #define rrep(i,n,m) for(ll i = (ll)(m) - 1; i >= (ll)(n); i--) using ll = long long; using ld = long double; const ll MOD1 = 1e9+7; const ll MOD9 = 998244353; const ll INF = 1e18; using P = pair<ll, ll>; template<typename T1, typename T2>bool chmin(T1 &a,T2 b){if(a>b){a=b;return true;}else return false;} template<typename T1, typename T2>bool chmax(T1 &a,T2 b){if(a<b){a=b;return true;}else return false;} ll median(ll a,ll b, ll c){return a+b+c-max({a,b,c})-min({a,b,c});} void ans1(bool x){if(x) cout<<"Yes"<<endl;else cout<<"No"<<endl;} void ans2(bool x){if(x) cout<<"YES"<<endl;else cout<<"NO"<<endl;} void ans3(bool x){if(x) cout<<"Yay!"<<endl;else cout<<":("<<endl;} template<typename T1,typename T2>void ans(bool x,T1 y,T2 z){if(x)cout<<y<<endl;else cout<<z<<endl;} template<typename T>void debug(vector<vector<T>>&v,ll h,ll w){for(ll i=0;i<h;i++){cout<<v[i][0];for(ll j=1;j<w;j++)cout spa v[i][j];cout<<endl;}}; void debug(vector<string>&v,ll h,ll w){for(ll i=0;i<h;i++){for(ll j=0;j<w;j++)cout<<v[i][j];cout<<endl;}}; template<typename T>void debug(vector<T>&v,ll n){if(n!=0)cout<<v[0];for(ll i=1;i<n;i++)cout spa v[i];cout<<endl;}; template<typename T>vector<vector<T>>vec(ll x, ll y, T w){vector<vector<T>>v(x,vector<T>(y,w));return v;} ll gcd(ll x,ll y){ll r;while(y!=0&&(r=x%y)!=0){x=y;y=r;}return y==0?x:y;} vector<ll>dx={1,-1,0,0,1,1,-1,-1};vector<ll>dy={0,0,1,-1,1,-1,1,-1}; template<typename T>vector<T> make_v(size_t a,T b){return vector<T>(a,b);} template<typename... Ts>auto make_v(size_t a,Ts... ts){return vector<decltype(make_v(ts...))>(a,make_v(ts...));} template<typename T1, typename T2>ostream &operator<<(ostream &os, const pair<T1, T2>&p){return os << p.first << " " << p.second;} template<typename T>ostream &operator<<(ostream &os, const vector<T> &v){for(auto &z:v)os << z << " ";cout<<"|"; return os;} template<typename T>void rearrange(vector<ll>&ord, vector<T>&v){ auto tmp = v; for(int i=0;i<tmp.size();i++)v[i] = tmp[ord[i]]; } template<typename Head, typename... Tail>void rearrange(vector<ll>&ord,Head&& head, Tail&&... tail){ rearrange(ord, head); rearrange(ord, tail...); } //mt19937 mt(chrono::steady_clock::now().time_since_epoch().count()); int popcount(ll x){return __builtin_popcountll(x);}; int poplow(ll x){return __builtin_ctzll(x);}; int pophigh(ll x){return 63 - __builtin_clzll(x);}; template< int mod > struct ModInt { int x; ModInt() : x(0) {} ModInt(int64_t 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); } friend ModInt operator+(const ModInt& lhs, const ModInt& rhs) { return ModInt(lhs) += rhs; } friend ModInt operator-(const ModInt& lhs, const ModInt& rhs) { return ModInt(lhs) -= rhs; } friend ModInt operator*(const ModInt& lhs, const ModInt& rhs) { return ModInt(lhs) *= rhs; } friend ModInt operator/(const ModInt& lhs, const ModInt& rhs) { return ModInt(lhs) /= rhs; } 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(int64_t 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) { int64_t t; is >> t; a = ModInt< mod >(t); return (is); } static int get_mod() { return mod; } }; using modint = ModInt< MOD9 >;modint pow(ll n, ll x){return modint(n).pow(x);}modint pow(modint n, ll x){return n.pow(x);} //using modint=ld;template<typename T> template<typename T> map<T,ll> compress(vector<T> &v){ sort(ALL(v)); v.erase(unique(ALL(v)),v.end()); map<T, ll> ret; for(ll i=0;i<(ll)v.size();i++) ret[v[i]]=i; return ret; } template<typename T> struct BIT{ ll n; ll k=1; vector<T>data; BIT() = default; BIT(ll size):n(size){ data.assign(n,0); while(k*2<=n)k*=2; } void add(ll a,T w){ for(ll i=a+1;i<=n;i+=i&-i)data[i-1]+=w; } T sum(ll a){ if(a<0)return 0; T ret = 0; for(ll i=a+1;i>0;i-=i&-i)ret+=data[i-1]; return ret; } T sum(ll a,ll b){return a>b?0:sum(b)-sum(a-1);} T operator[](ll pos){ return sum(pos,pos); } ll lower_bound(ll x){ ll ret=0; for(ll i=k;i>0;i/=2){ if(ret+i<=n&&data[ret+i-1]<x){ x-=data[ret+i-1]; ret+=i; } } return ret; } void print(){ for(ll i=0;i<n;i++){ if(i!=0)cout<<" "; cout<<(*this)[i]; } cout<<endl; } }; int main(){ cin.tie(nullptr); ios_base::sync_with_stdio(false); ll res=0,buf=0; bool judge = true; ll n;cin>>n; vector<ll>a(n); rep(i,0,n)cin>>a[i]; auto va=a; auto mp=compress(va); ll sz=mp.size(); BIT<modint>l(sz),r(sz),ln(sz),rn(sz); modint ret=0; rep(i,0,n)r.add(mp[a[i]],a[i]),rn.add(mp[a[i]],1); rep(i,0,n){ ll idx=mp[a[i]]; r.add(idx,-a[i]); rn.add(idx,-1); modint lnum=ln.sum(idx+1,sz-1); modint rnum=rn.sum(idx-1); //cout<<ret spa lnum spa rnum<<endl; ret+=a[i]*lnum*rnum; ret+=r.sum(idx-1)*lnum; ret+=l.sum(idx+1,sz-1)*rnum; l.add(idx,a[i]); ln.add(idx,1); //l.print(); //r.print(); } cout<<ret<<endl; return 0; }