UVa_1592 - Database_uva1592、-优快云博客

本文链接：https://blog.youkuaiyun.com/wowowoc/article/details/40554525

本文介绍了如何通过读取数据库表格并使用特定算法判断表格是否符合Peter提出的规范形式（PNF），即每对不同行的同一列不应有相同的值。通过实例演示了表格规范化的过程，并提供了实现此功能的代码示例。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

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.

$\textstyle \parbox{.5\textwidth}{\begin{center}\begin{tabular}{\vert l\vert l......\hlineNotes from ACM ICPC champion & 2 \\\hline\end{tabular}\end{center}}$ $\textstyle \parbox{.49\textwidth}{\begin{center}\begin{tabular}{\vert l\vert ......ine2 & Michael & michael@neerc.ifmo.ru \\\hline\end{tabular}\end{center}}$

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 (1 $\le$ n $\le$ 10000, 1 $\le$ m $\le$ 10), 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₂ (1 $\le$ r₁,r₂ $\le$ n,r₁ $\ne$ r₂), on the third line write two integer column numbers c₁ andc₂ (1 $\le$ c₁,c₂ $\le$ m,c1 $\ne$ c2), so that values in columnsc₁ andc₂ are the same in rowsr₁ andr₂.

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

题意：

给一个数据库，查找是否存在（r1,c1)=（r2,c1) && (r1,c2)=(r2,c2)，即：不同的二行，对应二列字符串相同

解题：

1. 首先读入字符串，将每个字符串分配一个编号，这样在遍历数据库查找时会迅速很多，不用比较字符串比如对于

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

编号为

0 1 2

3 4 5

6 4 5

2. 因为要找到两对相同的列，四重遍历可以找到，但是太慢了，考虑将c1,c2两列的内容一起存到map中，所以map的key为（x,y）【x,y分别代表对应字符串的编号】，map的值为对应的行r1，遍历行就是r2;所以三重遍历即可完成。

注意：

1. 注意要找到的二列，不一定相邻，可以相隔；

2. 对于map<node,int> data; data.clear()的位置要放对，每次遍历完2列，就要清空一次（因为要找到对应两行两列（r1,c1)=（r2,c1) && (r1,c2)=(r2,c2) ）

代码如下：

#include<iostream>
#include<cstdio>
#include<map>
#include<string>
#include<vector>
using namespace std;

const int ROW = 10000 + 10;
const int COL = 10 + 5;
int n,m;
map<string, int> IDcache;
vector<string> Strcache;
vector<int> Text[ROW]; //保存处理后的文本，每个字符串都替换成一个编号
struct node
{
    int x,y;
    node(int x, int y):x(x),y(y) { }
    bool operator < (const node& r) const { return x<r.x || x==r.x&&y<r.y; }
};
map<node,int> data;

int ID_alloc(string str)
{
    if(IDcache.count(str)) return IDcache[str];
    Strcache.push_back(str);
    return IDcache[str] = Strcache.size()-1;
}

void read()
{
    string str;
    char ch = getchar();
    for(int i=0;i<n;i++)
    {
        for(;;)
        {
            ch = getchar();
            if(ch=='\n'||ch=='\r') {
                if(!str.empty()) Text[i].push_back(ID_alloc(str));
                str.clear();  break;
            }
            if(ch!=',') str += ch;
            else { Text[i].push_back(ID_alloc(str)); str.clear();}
         }
    }
}

void solve()
{
    int x,y,c1,c2;
    for(c1=0;c1<m;c1++)
    {
        for(c2=c1+1;c2<m;c2++)
        {
            data.clear();
            for(int r=0;r<n;r++)
            {
                x = Text[r][c1]; y = Text[r][c2];
                node p(x,y);
                if(!data.count(p)) data[p] = r;
                else{
                    cout<<"NO"<<endl;
                    cout<<data[p]+1<<" "<<r+1<<endl<<c1+1<<" "<<c2+1<<endl;
                    return;
                }
            }
        }
    }
    cout<<"YES"<<endl;
}

int main()
{
    //freopen("1592.txt","r",stdin);
    while(cin>>n>>m)
    {
        read();
        solve();
        for(int i=0;i<n;i++) Text[i].clear();
        IDcache.clear(); Strcache.clear();
        //data.clear();
    }
    return 0;
}