HDU4451Dressing

来源：互联网发布：java和js的区别与联系编辑：程序博客网时间：2024/06/12 00:10

http://acm.hdu.edu.cn/showproblem.php?pid=4451

12jinhua

#include <cstdio>#include <cstring>#include <cmath>#include <map>#include <set>#include <vector>#include <iostream>#include <cstdlib>#include <algorithm>#include <string>#include <queue>#include <list>#include <stack>using namespace std;#define NN 16384#define INF 0x7ffffff#define N 1005#define eps 1e-6#define pi 3.14159265358979626//const double pi=acos(-1);const double g=9.8;int n,m,k,p1,pant[N][3];int main(){    //freopen("a.c","r",stdin);    char st1[10],st2[10];    while (1)    {        scanf("%d%d%d",&n,&m,&k);        if (n==0 && m==0 && k==0) break;        memset(pant,0,sizeof(pant));        scanf("%d",&p1);        int a,b,p=0,q=0;        for (int i=1;i<=p1;i++)        {            scanf("%s %d %s %d",st1,&a,st2,&b);            if (st1[0]=='c')            {                p++;                pant[b][1]++;            }            else if (st2[0]=='s')            {                q++;                pant[a][2]++;            }        }        int ans=n*m*k,tp=0;        for (int i=1;i<=m;i++) tp+=pant[i][1]*pant[i][2];        ans=ans-p*k-q*n+tp;        printf("%d\n",ans);    }    return 0;}