結果
問題 | No.1193 Penguin Sequence |
ユーザー | akua |
提出日時 | 2023-04-16 00:38:13 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 1,129 ms / 2,000 ms |
コード長 | 5,751 bytes |
コンパイル時間 | 5,876 ms |
コンパイル使用メモリ | 238,716 KB |
実行使用メモリ | 71,312 KB |
最終ジャッジ日時 | 2024-04-27 04:44:13 |
合計ジャッジ時間 | 37,122 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge3 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 840 ms
71,308 KB |
testcase_01 | AC | 1,109 ms
71,308 KB |
testcase_02 | AC | 1,087 ms
71,308 KB |
testcase_03 | AC | 1,076 ms
71,308 KB |
testcase_04 | AC | 1,096 ms
71,308 KB |
testcase_05 | AC | 1,100 ms
71,308 KB |
testcase_06 | AC | 1,129 ms
71,252 KB |
testcase_07 | AC | 1,107 ms
71,304 KB |
testcase_08 | AC | 1,101 ms
71,312 KB |
testcase_09 | AC | 1,093 ms
71,248 KB |
testcase_10 | AC | 1,088 ms
71,308 KB |
testcase_11 | AC | 632 ms
55,220 KB |
testcase_12 | AC | 651 ms
55,612 KB |
testcase_13 | AC | 911 ms
66,080 KB |
testcase_14 | AC | 864 ms
63,984 KB |
testcase_15 | AC | 1,031 ms
69,080 KB |
testcase_16 | AC | 583 ms
40,204 KB |
testcase_17 | AC | 142 ms
34,556 KB |
testcase_18 | AC | 201 ms
37,796 KB |
testcase_19 | AC | 1,062 ms
70,784 KB |
testcase_20 | AC | 839 ms
63,192 KB |
testcase_21 | AC | 685 ms
57,700 KB |
testcase_22 | AC | 213 ms
38,436 KB |
testcase_23 | AC | 582 ms
53,780 KB |
testcase_24 | AC | 515 ms
51,296 KB |
testcase_25 | AC | 301 ms
42,272 KB |
testcase_26 | AC | 180 ms
36,488 KB |
testcase_27 | AC | 893 ms
65,296 KB |
testcase_28 | AC | 638 ms
56,140 KB |
testcase_29 | AC | 925 ms
66,204 KB |
testcase_30 | AC | 377 ms
45,544 KB |
testcase_31 | AC | 333 ms
43,712 KB |
testcase_32 | AC | 735 ms
59,276 KB |
testcase_33 | AC | 535 ms
52,716 KB |
testcase_34 | AC | 462 ms
48,556 KB |
testcase_35 | AC | 541 ms
52,212 KB |
testcase_36 | AC | 453 ms
48,288 KB |
testcase_37 | AC | 908 ms
64,772 KB |
testcase_38 | AC | 143 ms
34,572 KB |
testcase_39 | AC | 142 ms
34,448 KB |
testcase_40 | AC | 138 ms
34,620 KB |
ソースコード
#pragma GCC target("avx2") #pragma GCC optimize("O3") #pragma GCC optimize("unroll-loops") #include <atcoder/all> #include <iostream> // cout, endl, cin #include <string> // string, to_string, stoi #include <vector> // vector #include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound #include <utility> // pair, make_pair #include <tuple> // tuple, make_tuple #include <cstdint> // int64_t, int*_t #include <cstdio> // printf #include <map> // map #include <queue> // queue, priority_queue #include <set> // set #include <stack> // stack #include <deque> // deque #include <unordered_map> // unordered_map #include <unordered_set> // unordered_set #include <bitset> // bitset #include <cctype> // isupper, islower, isdigit, toupper, tolower #include <math.h> #include <iomanip> #include <functional> using namespace std; using namespace atcoder; #define rep(i, n) for (int i = 0; i < (int)(n); i++) #define repi(i, a, b) for (int i = (int)(a); i < (int)(b); i++) typedef long long ll; typedef unsigned long long ull; const ll inf=1e18; using graph = vector<vector<int> > ; using P= pair<ll,ll>; using vi=vector<int>; using vvi=vector<vi>; using vll=vector<ll>; using vvll=vector<vll>; using vp=vector<P>; using vvp=vector<vp>; using vd=vector<double>; using vvd =vector<vd>; //string T="ABCDEFGHIJKLMNOPQRSTUVWXYZ"; //string S="abcdefghijklmnopqrstuvwxyz"; //g++ main.cpp -std=c++17 -I . //cout <<setprecision(20); //cout << fixed << setprecision(10); //cin.tie(0); ios::sync_with_stdio(false); const double PI = acos(-1); int vx[]={0,1,0,-1,-1,1,1,-1},vy[]={1,0,-1,0,1,1,-1,-1}; void putsYes(bool f){cout << (f?"Yes":"No") << endl;} void putsYES(bool f){cout << (f?"YES":"NO") << endl;} void putsFirst(bool f){cout << (f?"First":"Second") << endl;} void debug(int test){cout << "TEST" << " " << test << endl;} ll pow_pow(ll x,ll n,ll mod){ if(n==0) return 1; x%=mod; ll res=pow_pow(x*x%mod,n/2,mod); if(n&1)res=res*x%mod; return res; } ll gcd(ll x,ll y){ if(y==0)return x; return gcd(y,x%y); } ll lcm(ll x,ll y){ return ll(x/gcd(x,y))*y; } template<class T> bool chmin(T& a, T b) { if (a > b) { a = b; return true; } else return false; } template<class T> bool chmax(T& a, T b) { if (a < b) { a = b; return true; } else return false; } // https://youtu.be/L8grWxBlIZ4?t=9858 // https://youtu.be/ERZuLAxZffQ?t=4807 : optimize // https://youtu.be/8uowVvQ_-Mo?t=1329 : division ll mod =998244353; //ll mod =1e9+7; struct mint { ll x; // typedef long long ll; mint(ll x=0):x((x%mod+mod)%mod){} mint operator-() const { return mint(-x);} mint& operator+=(const mint a) { if ((x += a.x) >= mod) x -= mod; return *this; } mint& operator-=(const mint a) { if ((x += mod-a.x) >= mod) x -= mod; return *this; } mint& operator*=(const mint a) { (x *= a.x) %= mod; return *this;} mint operator+(const mint a) const { return mint(*this) += a;} mint operator-(const mint a) const { return mint(*this) -= a;} mint operator*(const mint a) const { return mint(*this) *= a;} mint pow(ll t) const { if (!t) return 1; mint a = pow(t>>1); a *= a; if (t&1) a *= *this; return a; } // for prime mod mint inv() const { return pow(mod-2);} mint& operator/=(const mint a) { return *this *= a.inv();} mint operator/(const mint a) const { return mint(*this) /= a;} }; istream& operator>>(istream& is, const mint& a) { return is >> a.x;} ostream& operator<<(ostream& os, const mint& a) { return os << a.x;} // combination mod prime // https://www.youtube.com/watch?v=8uowVvQ_-Mo&feature=youtu.be&t=1619 struct combination { vector<mint> fact, ifact; combination(int n):fact(n+1),ifact(n+1) { //assert(n < mod); fact[0] = 1; for (int i = 1; i <= n; ++i) fact[i] = fact[i-1]*i; ifact[n] = fact[n].inv(); for (int i = n; i >= 1; --i) ifact[i-1] = ifact[i]*i; } mint operator()(int n, int k) { if (k < 0 || k > n) return 0; if (n<0) return 0; return fact[n]*ifact[k]*ifact[n-k]; } mint p(int n, int k) { return fact[n]*ifact[n-k]; } } c(2000000); using vm=vector<mint> ; using vvm=vector<vm> ; struct edge{ int to; ll cost; edge(int to,ll cost) : to(to),cost(cost){} }; using ve=vector<edge>; using vve=vector<ve>; struct Compress{ vll a; map<ll,ll> d,d2; int cnt; Compress() :cnt(0) {} void add(ll x){a.push_back(x);} void init(){ set<ll>s(a.begin(),a.end()); for(auto y:s)d[y]=cnt++; for(auto&y:a)y=d[y]; for(auto u:d)d2[u.second]=u.first; } ll to(ll x){return d[x];} //変換先 ll from(ll x){return d2[x];}//逆引き int size(){return cnt;} }; //vll anss; void solve(int test){ int n; cin >> n; vi a(n);rep(i,n)cin >> a[i]; Compress comp; rep(i,n)comp.add(a[i]); comp.init(); rep(i,n)a[i]=comp.to(a[i]); int m=comp.size(); mint invn=mint(1)/n; ll num=0; ll num2=0; { map<int,int> mp; rep(i,n)mp[-a[i]]++; ll tot=0; for(auto u:mp){ num+=tot*u.second; tot+=u.second; } } { fenwick_tree<int> fw(m); rep(i,n){ num2+=fw.sum(a[i]+1,m); fw.add(a[i],1); } } // cout << num << " " << num2 << endl; mint ans=0; vm rui(n+1); vm prob(n+1); for(int i=1; i<=n; i++)prob[i]=c(n,i).inv()*c(n-1,i-1); rui[n]=prob[n]; for(int i=n-1; i>=1; i--)rui[i]=rui[i+1]+prob[i]; for(int i=1; i<=n; i++){ if(i+1<=n)ans+=rui[i+1]*invn*i*num; ans+=c(n,i).inv()*c(n-2,i-2)*num2; } for(int i=1; i<=n; i++)ans*=c(n,i); cout << ans << endl; } //g++ main.cpp -std=c++17 -I . int main(){cin.tie(0);ios::sync_with_stdio(false); int t=1;//cin >> t; rep(test,t)solve(test); // for(auto u:anss)putsYes(u); }