zoukankan      html  css  js  c++  java
  • [Hello 2020] C. New Year and Permutation (组合数学)

    [Hello 2020] C. New Year and Permutation (组合数学)

    C. New Year and Permutation

    time limit per test

    1 second

    memory limit per test

    1024 megabytes

    input

    standard input

    output

    standard output

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

    A sequence aa is a subsegment of a sequence bb if aa can be obtained from bb 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][l,r], where l,rl,r are two integers with 1≤l≤r≤n1≤l≤r≤n. This indicates the subsegment where l−1l−1 elements from the beginning and n−rn−r elements from the end are deleted from the sequence.

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

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

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

    Input

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

    Output

    Print rr (0≤r<m0≤r<m), the sum of happiness for all permutations of length nn, modulo a prime number mm.

    Examples

    input

    Copy

    1 993244853
    

    output

    Copy

    1
    

    input

    Copy

    2 993244853
    

    output

    Copy

    6
    

    input

    Copy

    3 993244853
    

    output

    Copy

    32
    

    input

    Copy

    2019 993244853
    

    output

    Copy

    923958830
    

    input

    Copy

    2020 437122297
    

    output

    Copy

    265955509
    

    Note

    For sample input n=3n=3, let's consider all permutations of length 33:

    • [1,2,3][1,2,3], all subsegments are framed segment. Happiness is 66.
    • [1,3,2][1,3,2], all subsegments except [1,2][1,2] are framed segment. Happiness is 55.
    • [2,1,3][2,1,3], all subsegments except [2,3][2,3] are framed segment. Happiness is 55.
    • [2,3,1][2,3,1], all subsegments except [2,3][2,3] are framed segment. Happiness is 55.
    • [3,1,2][3,1,2], all subsegments except [1,2][1,2] are framed segment. Happiness is 55.
    • [3,2,1][3,2,1], all subsegments are framed segment. Happiness is 66.

    Thus, the sum of happiness is 6+5+5+5+5+6=326+5+5+5+5+6=32.

    题意:

    给定一个数字n和 一个质数m,

    问n的所有全排列的good值sum和,每一个排列的good值使有多少个点对pair(i,j) 是framed subsegment

    使 (i<=j)(max{p_l, p_{l+1}, dots, p_r} - min{p_l, p_{l+1}, dots, p_r} = r - l)

    思路:

    如果([l,r]) 是framed subsegment ,那么所有([min_{i = l}^{r} p_i, max_{i = l}^{r} p_i]) 范围内的数都必须在区间([l,r]) 中。

    我们定义 区间([l,r]) 的长度 (len= r-l+1) ,那么 长度为len的framed subsegment 的范围一共有n-len+1 种。

    例如 n=3,len=2,有2种范围 : ①([1,2])([2,3])

    而长度为len的framed subsegment 又有(len!) 种排列方式

    例如: 范围是([1,2])(2!) 种排列方式,(1,2) and (2 ,1 ) 且都符合要求。

    除了 长度为len的framed subsegment 的范围 的数有 n-len 个,它们任意排列后再将framed subsegment 整体插入都对满足条件没有影响。

    所以任意排列有((n-len)!) 方式,插板法 有(n-len+1) 种方式。

    所以 长度为len的framed subsegment 的方式个数为:

    ((n-len+1)^2*fac[len]*fac[n-len]),fac[i] 为 i的阶乘

    所以我们只需要预处理0~n的所有阶乘后在([1,n])范围内枚举len 即可得到答案。

    ps:记得取模。

    代码:

    ll m;
    int n;
    ll fac[maxn];
    
    int main()
    {
        //freopen("D:\code\text\input.txt","r",stdin);
        //freopen("D:\code\text\output.txt","w",stdout);
        n = readint();
        m = readll();
        fac[0] = 1ll;
        repd(i, 1, n)
        {
            fac[i] = fac[i - 1] * i % m;
        }
        ll ans = 0ll;
        repd(i, 1, n)
        {
            ans += (1ll * (n - i + 1) % m * fac[i] % m * fac[n - i] % m * (n - i + 1) % m);
            ans %= m;
        }
        printf("%lld
    ", ans );
        return 0;
    }
    
    
    本博客为本人原创,如需转载,请必须声明博客的源地址。 本人博客地址为:www.cnblogs.com/qieqiemin/ 希望所写的文章对您有帮助。
  • 相关阅读:
    JAVAWEB使用保存cookie、删除cookie、获取cookie工具类
    JAVA比较指定的两个日期
    编写一个C程序运行时输出 Hello World!
    正确理解以下名词及其含义:1源程序,目标程序,可执行程序2程序编辑,程序编译,程序连接3程序,程序模块,程序文件4函数,主函数,被调用函数,库函数5程序调试,程序测试
    为什么需要计算机语言?高级语言有哪些特点?
    什么是程序?什么是程序设计?
    题解 卡农
    题解 GT考试
    题解 SP6779 【GSS7
    题解 Crash 的文明世界
  • 原文地址:https://www.cnblogs.com/qieqiemin/p/12248910.html
Copyright © 2011-2022 走看看