CodeForces - 1284C

New Year and Permutation

Recall that the permutation is an array consisting of n distinct integers from 1 to n in arbitrary order. For example, [2,3,1,5,4] is a permutation, but [1,2,2] is not a permutation (2 appears twice in the array) and [1,3,4] is also not a permutation (n=3 but there is 4 in the array).

A sequence a is a subsegment of a sequence b if a can be obtained from b by deletion of several (possibly, zero or all) elements from the beginning and several (possibly, zero or all) elements from the end. We will denote the subsegments as [l,r], where l,r are two integers with 1≤l≤r≤n. This indicates the subsegment where l−1 elements from the beginning and n−r elements from the end are deleted from the sequence.

For a permutation p1,p2,…,pn, we define a framed segment as a subsegment [l,r] where max{pl,pl+1,…,pr}−min{pl,pl+1,…,pr}=r−l. For example, for the permutation (6,7,1,8,5,3,2,4) some of its framed segments are: [1,2],[5,8],[6,7],[3,3],[8,8]. In particular, a subsegment [i,i] is always a framed segments for any i between 1 and n, inclusive.

We define the happiness of a permutation p as the number of pairs (l,r) such that 1≤l≤r≤n, and [l,r] is a framed segment. For example, the permutation [3,1,2] has happiness 5: all segments except [1,2] are framed segments.

Given integers n and m, Jongwon wants to compute the sum of happiness for all permutations of length n, modulo the prime number m. Note that there exist n! (factorial of n) different permutations of length n.

Input
The only line contains two integers n and m (1≤n≤250000, 108≤m≤109, m is prime).

Output
Print r (0≤r<m), the sum of happiness for all permutations of length n, modulo a prime number m.

Examples
inputCopy
1 993244853
outputCopy
1
inputCopy
2 993244853
outputCopy
6
inputCopy
3 993244853
outputCopy
32
inputCopy
2019 993244853
outputCopy
923958830
inputCopy
2020 437122297
outputCopy
265955509
Note
For sample input n=3, let’s consider all permutations of length 3:

[1,2,3], all subsegments are framed segment. Happiness is 6.
[1,3,2], all subsegments except [1,2] are framed segment. Happiness is 5.
[2,1,3], all subsegments except [2,3] are framed segment. Happiness is 5.
[2,3,1], all subsegments except [2,3] are framed segment. Happiness is 5.
[3,1,2], all subsegments except [1,2] are framed segment. Happiness is 5.
[3,2,1], all subsegments are framed segment. Happiness is 6.
Thus, the sum of happiness is 6+5+5+5+5+6=32.
题解：
依次计算长度为1，2，3…n，的序列，符合要求的序列必须含有连续的一段数才能保证序列内最大值减最小值等于序列长度，然后对该序列全排列，然后剩余位置全排列，每种长度序列的情况又有n-i种。
所以每种长度序列的答案为 i！*（n-i）! * （n-i)
全部序列答案求和即可。

#include<stdio.h>
#include<algorithm>
using namespace std;
typedef long long ll;
ll a[300000];
ll n,mod;
template<class T>inline void read(T &res) {
	char c;
	T flag=1;
	while((c=getchar())<'0'||c>'9')if(c=='-')flag=-1;
	res=c-'0';
	while((c=getchar())>='0'&&c<='9')res=res*10+c-'0';
	res*=flag;
}
void ycl() {
	a[0]=1;
	for(ll i=1; i<300000; ++i) {
		a[i]=a[i-1]*i%mod;
	}
}
int main() {
	read(n),read(mod);
	ycl();
	ll ans=0;
	for(int i=0; i<n; ++i) {
		ans=(ans%mod+(a[n-i]%mod*(n-i)%mod*a[i+1]%mod)%mod)%mod;
	}
	printf("%lld\n",ans);
	return 0;
}