hdu 4451 Dressing

题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=4451

题目大意:

有n件衣服,m条裤子,k双鞋子.(1<=n,m,k<=1000)

有p(0<=p<=2000000)个条件表示某衣服不能和某裤子搭配或某裤子不能和某鞋子搭配.

题目思路:

因为没有那件衣服不能和某鞋子搭配,所以,开两个数组分别表示有某裤子能和几件衣服搭配和某裤子能和几件鞋子搭配,扫一下裤子就ok了.

面子题,全场飘球专用....

代码:

#include <stdlib.h>
#include <string.h>
#include <stdio.h>
#include <ctype.h>
#include <math.h>
#include <time.h>
#include <stack>
#include <queue>
#include <map>
#include <set>
#include <vector>
#include <string>
#include <iostream>
#include <algorithm>
using namespace std;

#define ll long long
#define ls rt<<1
#define rs ls|1
#define lson l,mid,ls
#define rson mid+1,r,rs
#define middle l+r>>1
typedef pair<int,int> pii;
typedef multiset<int> mset;
typedef multiset<int>::iterator mst_it;

template <class T> T _max(T x,T y){return x>y? x:y;}
template <class T> T _min(T x,T y){return x<y? x:y;}
template <class T> void _swap(T &x,T &y){T z=x;x=y;y=z;}
template <class T> T GCD(T a,T b){for(T t;b;t=a%b,a=b,b=t);return a;}
template <class T> T LCM(T a,T b){return a/GCD(a,b)*b;}
#define clr_all(x,num) memset(x,num,sizeof(x))
#define clr(x,num,sz) memset(x,num,sizeof(x[0])*(sz+1))
#define inf 0x3F3F3F3F
#define eps (1e-9)
#define MOD 1000000007
const double pi=acos(-1.0);
const int M=1000 +3;
int ts,cas=0;

int n,m,k;
int c[M],s[M];
char s1[11],s2[11];
int n1,n2;

void run(){
    int i,j;
    scanf("%d",&i);
    clr(c,0,n+1),clr(s,0,k+1);
    while(i--){
        scanf("%s%d%s%d",s1,&n1,s2,&n2);
        if(s1[0]=='c') c[n2]++;
        else s[n1]++;
    }
    int res=0;
    for(i=1;i<=m;i++)
        res+=(n-c[i])*(k-s[i]);
    printf("%d\n",res);
}

void preSof(){
}

int main(){
    //freopen("input.txt","r",stdin);
    //freopen("output.txt","w",stdout);
    preSof();
    //run();
    while(~scanf("%d%d%d",&n,&m,&k) && (n||m||k)) run();
    //for(scanf("%d",&ts),cas=1;cas<=ts;cas++) run();
    return 0;
}