zoukankan      html  css  js  c++  java
  • (转)ZOJ 3687 The Review Plan I(禁为排列)

    The Review Plan I

    Time Limit: 5 Seconds      Memory Limit: 65536 KB

    Michael takes the Discrete Mathematics course in this semester. Now it's close to the final exam, and he wants to take a complete review of this course.

    The whole book he needs to review has N chapter, because of the knowledge system of the course is kinds of discrete as its name, and due to his perfectionism, he wants to arrange exactly N days to take his review, and one chapter by each day.

    But at the same time, he has other courses to review and he also has to take time to hang out with his girlfriend or do some other things. So the free time he has in each day is different, he can not finish a big chapter in some particular busy days.

    To make his perfect review plan, he needs you to help him.

    Input

    There are multiple test cases. For each test case:

    The first line contains two integers N(1≤N≤50), M(0≤M≤25), N is the number of the days and also the number of the chapters in the book.

    Then followed by M lines. Each line contains two integers D(1≤DN) and C(1≤CN), means at the Dth day he can not finish the review of the Cth chapter.

    There is a blank line between every two cases.

    Process to the end of input.

    Output

    One line for each case. The number of the different appropriate plans module 55566677.

    Sample Input

    4 3
    1 2
    4 3
    2 1
    
    6 5
    1 1
    2 6
    3 5
    4 4
    3 4
    

    Sample Output

    11
    284
    转:http://blog.csdn.net/hlmfjkqaz/article/details/11037821
    题意:有n个位置,m个东西,第C个东西不能放在第D个位置(禁位)。
    收获:了解了:禁位排列和错位排列。http://wenku.baidu.com/link?url=H20jYGza0kMrRgxev671hFCSSR-YS0VxdSz9pu1u4cUPpCj-8C73lgnLQWZkApEvVBxuzVuk9t7ArwwvzC_dZMettS0CvBcvxv4GPybU2VS
    #include<iostream>
    #include<cstdio>
    #include<string.h>
    #include<math.h>
    using namespace std;
    typedef long long LL;
    #define MOD 55566677
    #define N 55
    LL f[N],res;
    int n,m,vis1[N],vis2[N],a[N][N],ban[N][N];
    void inint()
    {
        f[0]=1;
        for(int i=1; i<N; i++)
            f[i]=(f[i-1]*i)%MOD;
    }
    void dfs(int i,int num)  //第i个禁位,选num个禁位
    {
        if(i>m)
        {
            if(num&1) res=((res-f[n-num])%MOD+MOD)%MOD;
            else   res=(res+f[n-num])%MOD;
            return;
        }
        dfs(i+1,num);    //第i个禁位不选
        if((!vis1[a[i][0]])&&(!vis2[a[i][1]]))  //选第i个禁位
        {
            vis1[a[i][0]]=vis2[a[i][1]]=1;
            dfs(i+1,num+1);
            vis1[a[i][0]]=vis2[a[i][1]]=0;
        }
    }
    
    int main()
    {
        int i,j,d,c;
        inint();
        while(~scanf("%d%d",&n,&m))
        {
            memset(vis1,0,sizeof(vis1));
            memset(vis2,0,sizeof(vis2));
            memset(ban,0,sizeof(ban));
            for(i=1; i<=m; i++)
            {
                scanf("%d%d",&a[i][0],&a[i][1]);
                if(ban[a[i][0]][a[i][1]])
                {
                    i--;
                    m--;
                }
                else ban[a[i][0]][a[i][1]]=1;
            }
            res=0;
            dfs(1,0);
            res=(res%MOD+MOD)%MOD;
            printf("%lld
    ",res);
        }
        return 0 ;
    }
  • 相关阅读:
    IO流总览图
    自己实现的一个数组排序并去重的功能
    Java常量池详解之一道比较蛋疼的面试题
    一个简单的数组去重并排序方法
    Delphi开发经验谈
    再谈Delphi vs VC++(非常精彩)
    C#根据当前时间获取,本周,本月,本季度等时间段
    delphi CopyMemory、FillMemory、MoveMemory、ZeroMemory
    DupeString 与 StringOfChar 的区别
    SQL最大值加1
  • 原文地址:https://www.cnblogs.com/ZP-Better/p/4783948.html
Copyright © 2011-2022 走看看