Submission #945078
Source Code Expand
#include<stdio.h>
#include<cstring>
#include<cstdlib>
#include<cmath>
#include<iostream>
#include<algorithm>
#include<vector>
#include<map>
#include<set>
#include<queue>
#include<bitset>
#include<utility>
#include<functional>
#include<iomanip>
#include<sstream>
#include<ctime>
#include<cassert>
using namespace std;
#define y0 y0z
#define y1 y1z
#define yn ynz
#define j0 j0z
#define j1 j1z
#define jn jnz
#define tm tmz
#define buli(x) (__builtin_popcountll(x))
#define bur0(x) (__builtin_ctzll(x))
#define bul2(x) (63-__builtin_clzll(x))
#define mp make_pair
#define pb push_back
#define fi first
#define se second
#define fil(a,b) memset((a),(b),sizeof(a))
#define cl(a) fil(a,0)
#define siz(x) ((int)(x).size())
#define all(x) (x).begin(),(x).end()
#define foreach(it,a) for(__typeof((a).begin()) it=(a).begin();it!=(a).end();it++)
#define rep(i,a,b) for (int i=(a),_ed=(b);i<_ed;i++)
#define per(i,a,b) for (int i=(b)-1,_ed=(a);i>=_ed;i--)
#define forg(i,gu) for (int i=gu;~i;i=e[i].next)
#define pw(x) ((ll(1))<<(x))
#define upmo(a,b) (((a)=((a)+(b))%mo)<0?(a)+=mo:(a))
#define mmo(a,b) (((a)=1ll*(a)*(b)%mo)<0?(a)+=mo:(a))
void getre(){int x=0;printf("%d\n",1/x);}
void gettle(){int res=1;while(1)res<<=1;printf("%d\n",res);}
typedef pair<int,int> pii;
typedef vector<int> vi;
typedef vector<pii> vpii;
template<typename T,typename S>inline bool upmin(T&a,const S&b){return a>b?a=b,1:0;}
template<typename T,typename S>inline bool upmax(T&a,const S&b){return a<b?a=b,1:0;}
template<typename N,typename PN>inline N flo(N a,PN b){return a>=0?a/b:-((-a-1)/b)-1;}
template<typename N,typename PN>inline N cei(N a,PN b){return a>0?(a-1)/b+1:-(-a/b);}
template<typename N>N gcd(N a,N b){return b?gcd(b,a%b):a;}
template<typename N>inline int sgn(N a){return a>0?1:(a<0?-1:0);}
#if ( ( _WIN32 || __WIN32__ ) && __cplusplus < 201103L)
#define lld "%I64d"
#else
#define lld "%lld"
#endif
inline void gn(long long&x){
int sg=1;char c;while(((c=getchar())<'0'||c>'9')&&c!='-');c=='-'?(sg=-1,x=0):(x=c-'0');
while((c=getchar())>='0'&&c<='9')x=x*10+c-'0';x*=sg;
}
inline void gn(int&x){long long t;gn(t);x=t;}
inline void gn(unsigned long long&x){long long t;gn(t);x=t;}
inline void gn(double&x){double t;scanf("%lf",&t);x=t;}
inline void gn(long double&x){double t;scanf("%lf",&t);x=t;}
inline void gs(char *s){scanf("%s",s);}
inline void gc(char &c){while((c=getchar())>126 || c<33);}
inline void pc(char c){putchar(c);}
#ifdef JCVB
#define debug(...) fprintf(stderr, __VA_ARGS__)
#else
#define debug(...)
#endif
typedef long long ll;
typedef double db;
inline ll sqr(ll a){return a*a;}
inline db sqrf(db a){return a*a;}
const int inf=0x3f3f3f3f;
const db pi=3.14159265358979323846264338327950288L;
const db eps=1e-6;
const int mo=1e9+7;
int qp(int a,ll b){int n=1;do{if(b&1)n=1ll*n*a%mo;a=1ll*a*a%mo;}while(b>>=1);return n;}
int n;
int a[555555];
int fac[555555],ifac[555555];
int unk=0;
int bit[555555];
void bitupd(int x){
for(;x<=n;x+=x&-x)bit[x]++;
}
int bitque(int x){
int ans=0;
for(;x;x-=x&-x)ans+=bit[x];
return ans;
}
int vis[555555];
int main()
{
#ifdef JCVB
//freopen("1.in","r",stdin);
//freopen("1.out","w",stdout);
int _time_jc=clock();
#endif
gn(n);
fac[0]=1;
rep(i,1,500005)fac[i]=1ll*fac[i-1]*i%mo;
ifac[500004]=qp(fac[500004],mo-2);
per(i,0,500004)ifac[i]=1ll*ifac[i+1]*(i+1)%mo;
rep(i,1,n+1){
gn(a[i]);
if(a[i]==0)unk++;
}
rep(i,1,n+1)vis[i]=1;
rep(i,1,n+1)vis[a[i]]=0;
per(i,1,n+1)vis[i]+=vis[i+1];
int ans=fac[unk];
int emp=0;
per(i,1,n+1){
int ch=fac[n-i];
if(a[i]){
int rigsm=bitque(a[i]);
bitupd(a[i]);
upmo(ans,1ll*rigsm*fac[unk]%mo*ch);
upmo(ans,1ll*(unk-vis[a[i]])*qp(unk,mo-2)%mo*emp%mo*fac[unk]%mo*ch);
}else{
upmo(ans,1ll*emp*qp(2,mo-2)%mo*fac[unk]%mo*ch);
emp++;
}
}
emp=0;
int su=0;
rep(i,1,n+1){
if(a[i]){
int dayuwo=vis[a[i]];
upmo(ans,1ll*dayuwo*qp(unk,mo-2)%mo*su%mo*fac[unk]);
}else{
emp++;
upmo(su,fac[n-i]);
}
}
printf("%d\n",ans);
#ifdef JCVB
debug("time: %d\n",int(clock()-_time_jc));
#endif
return 0;
}
Submission Info
Submission Time |
|
Task |
E - Encyclopedia of Permutations |
User |
jcvb |
Language |
C++14 (GCC 5.4.1) |
Score |
1200 |
Code Size |
4191 Byte |
Status |
AC |
Exec Time |
234 ms |
Memory |
9984 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 |
12 ms |
4224 KB |
0_001.txt |
AC |
12 ms |
4224 KB |
0_002.txt |
AC |
12 ms |
4224 KB |
0_003.txt |
AC |
12 ms |
4096 KB |
0_004.txt |
AC |
12 ms |
4224 KB |
1_005.txt |
AC |
12 ms |
4224 KB |
1_006.txt |
AC |
12 ms |
4224 KB |
1_007.txt |
AC |
12 ms |
4224 KB |
1_008.txt |
AC |
13 ms |
4224 KB |
1_009.txt |
AC |
12 ms |
4224 KB |
1_010.txt |
AC |
13 ms |
4224 KB |
1_011.txt |
AC |
12 ms |
4224 KB |
1_012.txt |
AC |
13 ms |
4224 KB |
1_013.txt |
AC |
12 ms |
4224 KB |
1_014.txt |
AC |
13 ms |
4224 KB |
1_015.txt |
AC |
12 ms |
4224 KB |
1_016.txt |
AC |
13 ms |
4224 KB |
1_017.txt |
AC |
12 ms |
4224 KB |
1_018.txt |
AC |
13 ms |
4224 KB |
1_019.txt |
AC |
12 ms |
4224 KB |
1_020.txt |
AC |
13 ms |
4224 KB |
1_021.txt |
AC |
12 ms |
4224 KB |
1_022.txt |
AC |
13 ms |
4224 KB |
1_023.txt |
AC |
13 ms |
4224 KB |
1_024.txt |
AC |
13 ms |
4224 KB |
1_025.txt |
AC |
12 ms |
4224 KB |
1_026.txt |
AC |
13 ms |
4224 KB |
1_027.txt |
AC |
12 ms |
4224 KB |
1_028.txt |
AC |
12 ms |
4224 KB |
1_029.txt |
AC |
13 ms |
4224 KB |
1_030.txt |
AC |
13 ms |
4224 KB |
1_031.txt |
AC |
13 ms |
4224 KB |
1_032.txt |
AC |
13 ms |
4224 KB |
2_033.txt |
AC |
108 ms |
8064 KB |
2_034.txt |
AC |
60 ms |
6144 KB |
2_035.txt |
AC |
127 ms |
9984 KB |
2_036.txt |
AC |
117 ms |
9600 KB |
2_037.txt |
AC |
144 ms |
9984 KB |
2_038.txt |
AC |
126 ms |
9344 KB |
2_039.txt |
AC |
159 ms |
9984 KB |
2_040.txt |
AC |
84 ms |
7040 KB |
2_041.txt |
AC |
177 ms |
9984 KB |
2_042.txt |
AC |
42 ms |
5248 KB |
2_043.txt |
AC |
186 ms |
9984 KB |
2_044.txt |
AC |
126 ms |
8064 KB |
2_045.txt |
AC |
197 ms |
9984 KB |
2_046.txt |
AC |
188 ms |
9728 KB |
2_047.txt |
AC |
208 ms |
9984 KB |
2_048.txt |
AC |
98 ms |
6784 KB |
2_049.txt |
AC |
221 ms |
9984 KB |
2_050.txt |
AC |
149 ms |
8064 KB |
2_051.txt |
AC |
233 ms |
9984 KB |
2_052.txt |
AC |
213 ms |
9472 KB |
2_053.txt |
AC |
108 ms |
8064 KB |
2_054.txt |
AC |
234 ms |
9984 KB |
2_055.txt |
AC |
225 ms |
9984 KB |
2_056.txt |
AC |
223 ms |
9984 KB |
2_057.txt |
AC |
170 ms |
9984 KB |