zoukankan      html  css  js  c++  java
  • Codeforces Round #167 (Div. 2) D. Dima and Two Sequences 排列组合

    题目链接:

    http://codeforces.com/problemset/problem/272/D

    D. Dima and Two Sequences

    time limit per test2 seconds
    memory limit per test256 megabytes
    #### 问题描述 > Little Dima has two sequences of points with integer coordinates: sequence (a1, 1), (a2, 2), ..., (an, n) and sequence (b1, 1), (b2, 2), ..., (bn, n). > > Now Dima wants to count the number of distinct sequences of points of length 2·n that can be assembled from these sequences, such that the x-coordinates of points in the assembled sequence will not decrease. Help him with that. Note that each element of the initial sequences should be used exactly once in the assembled sequence. > > Dima considers two assembled sequences (p1, q1), (p2, q2), ..., (p2·n, q2·n) and (x1, y1), (x2, y2), ..., (x2·n, y2·n) distinct, if there is such i (1 ≤ i ≤ 2·n), that (pi, qi) ≠ (xi, yi). > > As the answer can be rather large, print the remainder from dividing the answer by number m. #### 输入 > The first line contains integer n (1 ≤ n ≤ 105). The second line contains n integers a1, a2, ..., an (1 ≤ ai ≤ 109). The third line contains n integers b1, b2, ..., bn (1 ≤ bi ≤ 109). The numbers in the lines are separated by spaces. > > The last line contains integer m (2 ≤ m ≤ 109 + 7). #### 输出 > In the single line print the remainder after dividing the answer to the problem by number m. ####样例输入 > 1 > 1 > 2 > 7

    样例输出

    1

    题意

    给两个长度为n的序列,让你把它们合成2*n的非递减序列,问有多少种可能(两个数完全相同当且仅当他们的值相等,且在a,b中出现的位置相同。

    题解

    就考虑下相同的数中有多少对数是完全相同的,然后总的阶乘除相同的对数,由于取模m比较特别,所以2不能直接求逆,需要单独把2拉出来考虑下。

    代码

    #include<map>
    #include<set>
    #include<cmath>
    #include<queue>
    #include<stack>
    #include<ctime>
    #include<vector>
    #include<cstdio>
    #include<string>
    #include<bitset>
    #include<cstdlib>
    #include<cstring>
    #include<iostream>
    #include<algorithm>
    #include<functional>
    using namespace std;
    #define X first
    #define Y second
    #define mkp make_pair
    #define lson (o<<1)
    #define rson ((o<<1)|1)
    #define mid (l+(r-l)/2)
    #define sz() size()
    #define pb(v) push_back(v)
    #define all(o) (o).begin(),(o).end()
    #define clr(a,v) memset(a,v,sizeof(a))
    #define bug(a) cout<<#a<<" = "<<a<<endl
    #define rep(i,a,b) for(int i=a;i<(b);i++)
    #define scf scanf
    #define prf printf
    
    typedef __int64 LL;
    typedef vector<int> VI;
    typedef pair<int,int> PII;
    typedef vector<pair<int,int> > VPII;
    
    const int INF=0x3f3f3f3f;
    const LL INFL=10000000000000000LL;
    const double eps=1e-9;
    
    const double PI = acos(-1.0);
    
    //start----------------------------------------------------------------------
    
    const int maxn=2e5+20;
    
    LL fac[maxn],two[maxn];
    int num[maxn];
    int n,m;
    VPII arr;
    
    void init(){
        clr(num,0);
        fac[0]=fac[1]=1;
        for(int i=2;i<maxn;i++){
            int tmp=i;
            while(tmp%2==0){
                tmp/=2; num[i]++;
            }
            fac[i]=tmp*fac[i-1]%m;
            num[i]+=num[i-1];
        }
    
        two[0]=1;
        rep(i,1,maxn) two[i]=two[i-1]*2%m;
    }
    
    int main() {
        scf("%d",&n);
        rep(i,0,n){
            int x; scf("%d",&x);
            arr.pb(mkp(x,i+1));
        }
        rep(i,0,n){
            int x; scf("%d",&x);
            arr.pb(mkp(x,i+1));
        }
        scf("%d",&m);
        init();
    
        sort(all(arr));
        LL ans=1;
        rep(i,0,arr.sz()){
            int ed=i;
            while(ed<arr.sz()&&arr[ed].X==arr[i].X) ed++; ed--;
    
            int cnt=0;
            for(int j=i;j<ed;j++){
                if(arr[j]==arr[j+1]) cnt++;
            }
    
            ///这里有可能re
            ans=ans*fac[ed-i+1]%m*two[num[ed-i+1]-cnt]%m;
    
            i=ed;
        }
    
        prf("%I64d
    ",ans);
    
        return 0;
    }
    
    //end-----------------------------------------------------------------------
  • 相关阅读:
    6、short s1 = 1; s1 = s1 + 1;有错吗?short s1 = 1; s1 += 1;有错吗?-Java面试题答案
    5、switch语句能否作用在byte上,能否作用在long上,能否作用在String上?-Java面试题答案
    4、在JAVA中如何跳出当前的多重嵌套循环?-Java面试题答案
    3、说说&和&&的区别-Java面试题答案
    2、Java有没有goto?-Java,面试题答案
    1、一个".java"源文件中是否可以包括多个类(不是内部类)?有什么限制?-Java面试题答案
    javaScript属性
    javaScript基本知识
    javaScript额外笔记
    OOP-基础知识(c#)
  • 原文地址:https://www.cnblogs.com/fenice/p/6018100.html
Copyright © 2011-2022 走看看