HDU - 4451 Dressing

Dressing

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.

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.For each case, output the answer in one line.

   题意：  n 种上衣，m种 裤子，k 种鞋子。 给定某种 衣服不能搭配某种裤子，某种 裤子不能搭配某种鞋子，找出剩下的方案数。

  思路：  先算出总方案数， 然后减去 不行的。 想了半天不知道怎么存 两种不能搭配的情况，后来看了一下Discuss,

大神说可以 抽象成点的连线，瞬间豁然开朗。以裤子为中轴，左边右边分别是 上衣和鞋子， 想要不算重复的其实就是考虑 中轴  左边和 右边剩下了多少个点，每次记录一下中轴该点的左右两边的空余点数，就是每次就 ++。

最好不要用cin,  不然可能会炸，同一个多交两遍就炸了，简直是玄学。

#pragma comment(linker, "/STACK:1024000000,1024000000")
//#include <bits/stdc++.h>
#include<string>
#include<cstdio>
#include<cstring>
#include<cmath>
#include<iostream>
#include<queue>
#include<stack>
#include<vector>
#include<set>
#include<algorithm>
#define maxn 1700
#define INF 0x3f3f3f3f
#define eps 1e-8
#define MOD 1000000007
#define ll long long
using namespace std;


int vis1[maxn],vis2[maxn];
int n,m,k,p;
int main()
{
    while(scanf("%d%d%d",&n,&m,&k)&&(n+m+k))
    {
        int x,y;
        string s1,s2;
        scanf("%d",&p);
        int ans=n*m*k;
        memset(vis1,0,sizeof vis1);
        memset(vis2,0,sizeof vis2);
        while(p--)
        {
            cin>>s1>>x>>s2>>y;
            if(s1=="clothes")
            {
                vis1[y]++;
                ans-=k-vis2[y];
            }
            else
            {
                vis2[x]++;
                ans-=n-vis1[x];
            }
        }
        printf("%d\n",ans);
    }
    return 0;
}