Submission #948201
Source Code Expand
#include <string> #include <vector> #include<iostream> #include<cstdio> #include<cstdlib> #include<stack> #include<queue> #include<cmath> #include<algorithm> #include<functional> #include<list> #include<deque> #include<bitset> #include<set> #include<map> #include<unordered_map> #include<cstring> #include<sstream> #include<complex> #include<iomanip> #include<numeric> #include<cassert> #define int long long #define X first #define Y second #define pb push_back #define rep(X,Y) for (int (X) = 0;(X) < (Y);++(X)) #define reps(X,S,Y) for (int (X) = S;(X) < (Y);++(X)) #define rrep(X,Y) for (int (X) = (Y)-1;(X) >=0;--(X)) #define repe(X,Y) for ((X) = 0;(X) < (Y);++(X)) #define peat(X,Y) for (;(X) < (Y);++(X)) #define all(X) (X).begin(),(X).end() #define rall(X) (X).rbegin(),(X).rend() #define eb emplace_back #define UNIQUE(X) (X).erase(unique(all(X)),(X).end()) using namespace std; typedef long long ll; typedef pair<int,int> pii; typedef pair<ll,ll> pll; template<class T> using vv=vector<vector<T>>; template<class T> ostream& operator<<(ostream &os, const vector<T> &t) { os<<"{"; rep(i,t.size()) {os<<t[i]<<",";} os<<"}"<<endl; return os;} template<class S, class T> ostream& operator<<(ostream &os, const pair<S,T> &t) { return os<<"("<<t.first<<","<<t.second<<")";} template<class T> inline bool MX(T &l,const T &r){return l<r?l=r,1:0;} template<class T> inline bool MN(T &l,const T &r){return l>r?l=r,1:0;} const ll MOD=1e9+7; const int nn=512345; ll bit[nn+1]; ll sum(int i){ ++i; ll s=0; while(i>0){ s+=bit[i]; i-=i&-i; } return s; } void add(int i,ll x){ ++i; while(i<=nn){ bit[i]+=x; i+=i&-i; } } ll modpow(ll r,ll n,ll m=MOD){ ll re=1,d=r%m; if(n<0)(n%=MOD-1)+=MOD-1; for(;n;n/=2){ if(n&1)(re*=d)%=m; (d*=d)%=m; } return re; } vector<ll> fact,finv,inv; ll comb(ll n,ll r){ if(n<r||r<0)return 0; return fact[n]*finv[n-r]%MOD*finv[r]%MOD; } class Doralion{ void Modinvs(vector<ll> &re,int n){ re.resize(n+1); re[1]=1; for(int i=2;i<=n;++i)re[i]=re[MOD%i]*(MOD-MOD/i)%MOD; } void Facts(vector<ll> &re,int n){ re.resize(n+1); re[0]=1; rep(i,n)re[i+1]=re[i]*(i+1)%MOD; } void Factinvs(vector<ll> &re,const vector<ll> &inv,int n){ re.resize(n+1); re[0]=1; rep(i,n)re[i+1]=re[i]*inv[i+1]%MOD; } public: Doralion(int n){ Modinvs(inv,n); Facts(fact,n); Factinvs(finv,inv,n); } } doralion(512345); signed main(){ ios_base::sync_with_stdio(false); cout<<fixed<<setprecision(0); ll n; cin>>n; vector<ll> p(n); rep(i,n) cin>>p[i]; vector<ll> usd(n); for(ll a:p)if(a) usd[a-1]=1; vector<ll> ls(n+1),rs(n+1); rep(i,n){ if(!usd[i]) ++ls[i]; ls[i+1]+=ls[i]; } rrep(i,n){ if(!usd[i]) ++rs[i]; rs[i]+=rs[i+1]; } ll N=0; rep(i,n) if(!usd[i]) ++N; ll re=0; ll t=0; ll hoge=0; vector<int> uu; rep(i,n) if(!usd[i]){ hoge+=i; uu.pb(i);} rep(i,n){ if(p[i]){ ll tmp=ls[p[i]-1]*t%MOD*fact[N-1]%MOD; ll num=(p[i]-1-sum(p[i]-1))*fact[N]%MOD; (num+=MOD-tmp)%=MOD; (re+=fact[n-i-1]*num%MOD)%=MOD; hoge-=uu.end()-lower_bound(all(uu),p[i]-1); add(p[i]-1,1); }else{ ll cnt=0; ll tmp=N*(N-1)/2%MOD*t%MOD*(N>1?fact[N-2]:0)%MOD; (re+=(hoge%MOD*fact[N-1]%MOD+MOD-tmp)%MOD*fact[n-i-1]%MOD)%=MOD; ++t; } } (re+=fact[t])%=MOD; cout<<re<<endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | E - Encyclopedia of Permutations |
User | nuip |
Language | C++14 (GCC 5.4.1) |
Score | 1200 |
Code Size | 3521 Byte |
Status | AC |
Exec Time | 216 ms |
Memory | 35436 KB |
Judge Result
Set Name | Sample | Subtask | All | ||||||
---|---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 500 / 500 | 700 / 700 | ||||||
Status |
|
|
|
Set Name | Test Cases |
---|---|
Sample | 0_000.txt, 0_001.txt, 0_002.txt, 0_003.txt, 0_004.txt |
Subtask | 0_000.txt, 0_001.txt, 0_002.txt, 0_003.txt, 0_004.txt, 1_005.txt, 1_006.txt, 1_007.txt, 1_008.txt, 1_009.txt, 1_010.txt, 1_011.txt, 1_012.txt, 1_013.txt, 1_014.txt, 1_015.txt, 1_016.txt, 1_017.txt, 1_018.txt, 1_019.txt, 1_020.txt, 1_021.txt, 1_022.txt, 1_023.txt, 1_024.txt, 1_025.txt, 1_026.txt, 1_027.txt, 1_028.txt, 1_029.txt, 1_030.txt, 1_031.txt, 1_032.txt |
All | 0_000.txt, 0_001.txt, 0_002.txt, 0_003.txt, 0_004.txt, 1_005.txt, 1_006.txt, 1_007.txt, 1_008.txt, 1_009.txt, 1_010.txt, 1_011.txt, 1_012.txt, 1_013.txt, 1_014.txt, 1_015.txt, 1_016.txt, 1_017.txt, 1_018.txt, 1_019.txt, 1_020.txt, 1_021.txt, 1_022.txt, 1_023.txt, 1_024.txt, 1_025.txt, 1_026.txt, 1_027.txt, 1_028.txt, 1_029.txt, 1_030.txt, 1_031.txt, 1_032.txt, 2_033.txt, 2_034.txt, 2_035.txt, 2_036.txt, 2_037.txt, 2_038.txt, 2_039.txt, 2_040.txt, 2_041.txt, 2_042.txt, 2_043.txt, 2_044.txt, 2_045.txt, 2_046.txt, 2_047.txt, 2_048.txt, 2_049.txt, 2_050.txt, 2_051.txt, 2_052.txt, 2_053.txt, 2_054.txt, 2_055.txt, 2_056.txt, 2_057.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
0_000.txt | AC | 34 ms | 12288 KB |
0_001.txt | AC | 33 ms | 12288 KB |
0_002.txt | AC | 33 ms | 12288 KB |
0_003.txt | AC | 33 ms | 12288 KB |
0_004.txt | AC | 33 ms | 12288 KB |
1_005.txt | AC | 33 ms | 12288 KB |
1_006.txt | AC | 34 ms | 12288 KB |
1_007.txt | AC | 33 ms | 12288 KB |
1_008.txt | AC | 33 ms | 12416 KB |
1_009.txt | AC | 34 ms | 12416 KB |
1_010.txt | AC | 34 ms | 12416 KB |
1_011.txt | AC | 34 ms | 12416 KB |
1_012.txt | AC | 34 ms | 12416 KB |
1_013.txt | AC | 33 ms | 12416 KB |
1_014.txt | AC | 34 ms | 12416 KB |
1_015.txt | AC | 34 ms | 12416 KB |
1_016.txt | AC | 34 ms | 12416 KB |
1_017.txt | AC | 33 ms | 12288 KB |
1_018.txt | AC | 34 ms | 12416 KB |
1_019.txt | AC | 33 ms | 12416 KB |
1_020.txt | AC | 34 ms | 12416 KB |
1_021.txt | AC | 34 ms | 12416 KB |
1_022.txt | AC | 34 ms | 12416 KB |
1_023.txt | AC | 34 ms | 12416 KB |
1_024.txt | AC | 34 ms | 12416 KB |
1_025.txt | AC | 33 ms | 12288 KB |
1_026.txt | AC | 34 ms | 12416 KB |
1_027.txt | AC | 34 ms | 12416 KB |
1_028.txt | AC | 34 ms | 12416 KB |
1_029.txt | AC | 34 ms | 12416 KB |
1_030.txt | AC | 34 ms | 12416 KB |
1_031.txt | AC | 34 ms | 12416 KB |
1_032.txt | AC | 34 ms | 12416 KB |
2_033.txt | AC | 101 ms | 32112 KB |
2_034.txt | AC | 67 ms | 22260 KB |
2_035.txt | AC | 129 ms | 35436 KB |
2_036.txt | AC | 121 ms | 33516 KB |
2_037.txt | AC | 149 ms | 35052 KB |
2_038.txt | AC | 135 ms | 32236 KB |
2_039.txt | AC | 170 ms | 34540 KB |
2_040.txt | AC | 98 ms | 23536 KB |
2_041.txt | AC | 187 ms | 34156 KB |
2_042.txt | AC | 56 ms | 16504 KB |
2_043.txt | AC | 198 ms | 33648 KB |
2_044.txt | AC | 140 ms | 26352 KB |
2_045.txt | AC | 208 ms | 33264 KB |
2_046.txt | AC | 201 ms | 32368 KB |
2_047.txt | AC | 213 ms | 32884 KB |
2_048.txt | AC | 104 ms | 21368 KB |
2_049.txt | AC | 216 ms | 32376 KB |
2_050.txt | AC | 145 ms | 25592 KB |
2_051.txt | AC | 166 ms | 31872 KB |
2_052.txt | AC | 150 ms | 29952 KB |
2_053.txt | AC | 101 ms | 32112 KB |
2_054.txt | AC | 169 ms | 31872 KB |
2_055.txt | AC | 121 ms | 31872 KB |
2_056.txt | AC | 123 ms | 31872 KB |
2_057.txt | AC | 126 ms | 33904 KB |