zoukankan      html  css  js  c++  java
  • hdu-4451-Dressing

    /*
    
    第4场多校联合训练解题报告——详见杭电ACM微博~
    Dressing
    
    Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
    Total Submission(s): 1574    Accepted Submission(s): 670
    
    
    Problem Description
    Wangpeng has N clothes, M pants and K shoes so theoretically he can have N×M×K different combinations of dressing.
    One day he wears his pants Nike, shoes Adiwang to go to school happily. When he opens the door, his mom asks him to come back and switch the dressing. Mom thinks that pants-shoes pair is disharmonious because Adiwang is much better than Nike. After being asked to switch again and again Wangpeng figure out all the pairs mom thinks disharmonious. They can be only clothes-pants pairs or pants-shoes pairs.
    Please calculate the number of different combinations of dressing under mom’s restriction.
     
    
    Input
    There are multiple test cases.
    For each case, the first line contains 3 integers N,M,K(1≤N,M,K≤1000) indicating the number of clothes, pants and shoes.
    Second line contains only one integer P(0≤P≤2000000) indicating the number of pairs which mom thinks disharmonious.
    Next P lines each line will be one of the two forms“clothes x pants y” or “pants y shoes z”.
    The first form indicates pair of x-th clothes and y-th pants is disharmonious(1≤x≤N,1 ≤y≤M), and second form indicates pair of y-th pants and z-th shoes is disharmonious(1≤y≤M,1≤z≤K).
    Input ends with “0 0 0”.
    It is guaranteed that all the pairs are different.
     
    
    Output
    For each case, output the answer in one line.
     
    
    Sample Input
    2 2 2
    0
    2 2 2
    1
    clothes 1 pants 1
    2 2 2
    2
    clothes 1 pants 1
    pants 1 shoes 1
    0 0 0
     
    
    Sample Output
    8
    6
    5
     
    
    Source
    2012 Asia JinHua Regional Contest
    
    
    题意:略。
    
    思路:
    简单的组合问题,注意加上重复的就是(在一个点上左边的线乘以右边的线的个数)
    */
    #include<iostream>
    #include<algorithm>
    #include<queue>
    #include<stack>
    #include<stdio.h>
    #include<stdlib.h>
    #include<math.h>
    #include<string.h>
    using namespace std;
    #define maxn 1100
    int cpn[maxn],psk[maxn];
    int main()
    {
       int sum,i,p,a,b,n,m,k,tmp;
       char s[15];
       while(scanf("%d%d%d",&n,&m,&k),n||m||k)
       {
           memset(cpn,0,sizeof(cpn));
           memset(psk,0,sizeof(psk));
           scanf("%d",&p);
           sum=n*m*k;
           tmp=0;
           for(i=0;i<p;i++)
           {
               scanf("%s%d%s%d",s,&a,s,&b);
               if(strcmp(s,"pants")==0)
               {
                   cpn[b-1]++;
                   tmp+=k;
               }
               else
               {
                   psk[a-1]++;
                   tmp+=n;
               }
           }
           for(i=0;i<m;i++)
           {
               tmp-=cpn[i]*psk[i];
           }
           printf("%d
    ",sum-tmp);
       }
        return 0;
    }
  • 相关阅读:
    『软件介绍』SQLServer2008 基本操作
    PCA的数学原理
    PCA的数学原理
    Oracle数据处理
    UVa 11995
    Unreal Engine 4 C++ 为编辑器中Actor创建自己定义图标
    codecombat之边远地区的森林1-11关及地牢38关代码分享
    初识ecside
    how tomcat works读书笔记 七 日志记录器
    HDU 1754(线段树区间最值)
  • 原文地址:https://www.cnblogs.com/heqinghui/p/3234622.html
Copyright © 2011-2022 走看看