Database

U - Database

Time Limit:9000MS     Memory Limit:0KB     64bit IO Format:%lld & %llu

Submit Status Practice UVA 1592

Appoint description:

 

Description

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 ICPC	Peter	peter@neerc.ifmo.ru
How to win ACM ICPC	Michael	michael@neerc.ifmo.ru
Notes from ACM ICPC champion	Michael	michael@neerc.ifmo.ru

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 numbers n and m ( 1n10000, 1m10), the number of rows and columns in the table. The following n lines contain table rows. Each row has m 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₁ and r₂ ( 1r₁, r₂n, r₁r₂), on the third line write two integer column numbers c₁ and c₂ ( 1c₁, c₂m, c1c2), so that values in columns c₁ and c₂ are the same in rows r₁ and r₂.

Sample Input 

3 3
How to compete in ACM ICPC,Peter,peter@neerc.ifmo.ru
How to win ACM ICPC,Michael,michael@neerc.ifmo.ru
Notes from ACM ICPC champion,Michael,michael@neerc.ifmo.ru
2 3
1,Peter,peter@neerc.ifmo.ru
2,Michael,michael@neerc.ifmo.ru

Sample Output 

NO
2 3
2 3
YES

#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <string>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <sstream>
#include <cctype>
#include <utility>
using namespace std;
const int INF = 0x7fffffff;
const double EXP = 1e-8;
const int MAXR=10005;
const int MAXC=11;
typedef pair<int,int> PII;
int db[MAXR][MAXC];
map<string,int>  mp;
int id,n,m;
int ID(const string &s)
{
    if(mp.count(s)==0)
        mp[s]=++id;
    return mp[s];
}
void solve()
{
    for(int c1=0;c1<m;c1++)
        for(int c2=c1+1;c2<m;c2++)
        {
            map<PII,int>  d;
            for(int r=0;r<n;r++)
            {
                PII p=make_pair(db[r][c1],db[r][c2]);
                if(d.count(p))
                {
                    cout<<"NO"<<endl;
                    cout<<d[p]+1<<" "<<r+1<<endl;
                    cout<<c1+1<<" "<<c2+1<<endl;
                    return ;
                }
                d[p]=r;
            }
        }
    cout<<"YES"<<endl;
    return ;
}
int main()
{
    string s;
    while(getline(cin,s))
    {
        stringstream ss(s);
        if(!(ss>>n>>m))
            break;
        id=0;
        mp.clear();
        for(int r=0;r<n;r++)
        {
            getline(cin,s);
            int lastpos=-1;
            for(int c=0;c<m;c++)
            {
                size_t p=s.find(',',lastpos+1);
                if(p==string::npos)
                    p=s.length();
                db[r][c]=ID(s.substr(lastpos+1,p-lastpos-1));
                lastpos=p;
            }
        }
        solve();
    }
    return 0;
}