Uva1592Database

Peter studies the theory of relational databases. Table in the relational database consists of values that are arranged in rows and columns.

There are different normal forms that database may adhere to. Normal forms are designed to minimize the redundancy of data in the database. For example, a database table for a library might have a row for each book and columns for book name, book author, and author's email.

If the same author wrote several books, then this representation is clearly redundant. To formally define this kind of redundancy Peter has introduced his own normal form. A table is in Peter's Normal Form (PNF) if and only if there is no pair of rows and a pair of columns such that the values in the corresponding columns are the same for both rows.

How to compete in ACM [e-mail] to win ACM [e-mail] from ACM ICPC [e-mail]

The above table is clearly not in PNF, since values for 2rd and 3rd columns repeat in 2nd and 3rd rows. However, if we introduce unique author identifier and split this table into two tables -- one containing book name and author id, and the other containing book id, author name, and author email, then both resulting tables will be in PNF.

Given a table your task is to figure out whether it is in PNF or not.

Input 

Input contains several datasets. The first line of each dataset contains two integer numbersn and m (1n10000, 1m10), the number of rows and columns in the table. The following n lines contain table rows. Each row hasm column values separated by commas. Column values consist of ASCII characters from space (ASCII code 32) to tilde (ASCII code 126) with the exception of comma (ASCII code 44). Values are not empty and have no leading and trailing spaces. Each row has at most 80 characters (including separating commas).

Output 

For each dataset, if the table is in PNF write to the output file a single word ``YES" (without quotes). If the table is not in PNF, then write three lines. On the first line write a single word ``NO" (without quotes). On the second line write two integer row numbers r₁andr₂ (1r₁,r₂n,r₁r₂), on the third line write two integer column numbers c₁ andc₂ (1c₁,c₂m,c1c2), so that values in columnsc₁ andc₂ are the same in rowsr₁ andr₂.

Sample Input 

3 3How to compete in ACM ICPC,Peter,[e-mail] to win ACM ICPC,Michael,[e-mail] from ACM ICPC champion,Michael,[e-mail]2 31,Peter,[e-mail]2,Michael,[e-mail]

Sample Output 

NO2 32 3YES

思路：

枚举列，再一行行的遍历行，用map判断是否重复。

注意：拆分字符串不能错！

代码：
#include<cstdio>#include<iostream>#include<cstring>#include<map>using namespace std;int n,m;map<string,int> mp;int Clock=0;int a[10005][15]= {0};void Make() {string y;getchar();for(int i=1; i<=n; i++) {int j=1;string b[20];while(j<=m) {char x=getchar();if(x=='\n') {j++;} else if(x==',') {j++;} else {b[j]+=x;}}for(int j=1; j<=m; j++) {if(!mp.count(b[j])) {mp[b[j]]=++Clock;}a[i][j]=mp[b[j]];}}return ;}struct node {int x,y;node() {}node(int one,int two) {x=one,y=two;}bool operator < (const node& xx) const {if(x<xx.x) return true;if(x==xx.x&&y<xx.y) return true;return false;}};void print(int x1,int x2,int x3,int x4) {printf("NO\n%d %d\n%d %d\n",x1,x2,x3,x4);}void Find() {for(int i=1; i<=m; i++) {for(int j=i+1; j<=m; j++) {map<node,int> USE;for(int k=1; k<=n; k++) {if(USE.count(node(a[k][i],a[k][j]))) {print(USE[node(a[k][i],a[k][j])],k,i,j);return ;}USE[node(a[k][i],a[k][j])]=k;}}}printf("YES\n");return ;}void init() {Clock=0;mp.clear();memset(a,0,sizeof(a));}int main() {while(scanf("%d%d",&n,&m)!=EOF) {init();Make();Find();}return 0;}