HDU-4451-Dressing (2012年金华赛区J题)
来源:互联网 发布:linux more 上一页 编辑:程序博客网 时间:2024/05/01 11:49
Dressing
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2674 Accepted Submission(s): 1179
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.
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.
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 202 2 21clothes 1 pants 12 2 22clothes 1 pants 1pants 1 shoes 10 0 0
Sample Output
865
Source
2012 Asia JinHua Regional Contest
今天上午陪队友一起做的题目之一,我之前没看这题,后来才看的;
思路:先记录好不和谐的衣服和裤子与裤子和鞋子,再枚举衣服和裤子,如果衣服和裤子可以搭配就看鞋子,然后累加可以搭配的就ok了
AC代码:
#include <cstdio>#include <cstring>#include <algorithm>#include <iostream>#include <queue>#include <stack>using namespace std;int a[1010][1010], b[1010][1010], c[1010];int main(){int N, M, K, P;char str1[10], str2[10];int t1, t2;while(scanf("%d %d %d", &N, &M, &K)==3, N || M || K){memset(a, 0, sizeof(a));memset(b, 0, sizeof(b));memset(c, 0, sizeof(c));scanf("%d", &P);while(P--) { scanf("%s %d %s %d", &str1, &t1, &str2, &t2); if(strcmp(str1,"clothes")==0) { a[t1][t2]=1; } else { b[t1][t2]=1; c[t1]++; } } int ans=0; for(int i=1;i<=N;i++) for(int j=1;j<=M;j++) if(a[i][j]==0) ans+=(K-c[j]); printf("%d\n",ans);}return 0;}
1 0
- HDU-4451-Dressing (2012年金华赛区J题)
- HDU-4442-Physical Examination (2012年金华赛区现场赛A题)
- HDU-4450-Draw Something (2012年金华赛区I题)
- hdu 4452 Running Rabbits (模拟—12年金华赛区现场赛K题)
- HDU-#4451 Dressing(枚举)
- HDU 4451 Dressing(计数)
- hdu 4473 Exam (2012ACM成都赛区现场赛J题)
- HDU 4462 Scaring the Birds (2012年杭州赛区现场赛J题)
- hdu 4451 Dressing(容斥原理)
- HDU 4451 - Dressing(容斥原理)
- hdu 4451 Dressing(容斥)
- hdu 4451 Dressing
- hdu 4451 Dressing
- hdu 4451 Dressing
- hdu 4451 Dressing
- Hdu 4451 Dressing
- hdu 4451 Dressing
- hdu 4451 Dressing
- android点击图片缩放、拖动
- C++基础(四)
- 利用ArcGIS Server REST API实现对Feature的编辑操作
- ipc 消息队列message queue
- HDU 2588 GCD && GCD问题总结
- HDU-4451-Dressing (2012年金华赛区J题)
- Visual Studio 2010 >LINK : fatal error LNK1123: failure during conversion to COFF: file in
- IE 6 7 8的样式兼容 包括对fixed的兼容
- win7中VC6.0 visual C++6.0无法打开文件和向工程中添加文件的解决办法
- python 字符串常用函数方法整合
- windows下安装nodejs注意事项
- Unique Paths
- LeetCode 135 4Sum
- 关于System.identityHashCode(obj) 与 obj.hashcode()