UVa 1592 Database(巧用map)
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.
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 ( 1≤n≤10000, 1≤m≤10), 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 r1 and r2 ( 1≤r1,r2≤n, r1≠r2), on the third line write two integer column numbers c1 and c2 ( 1≤c1, c2≤m, c1≠c2), so that values in columns c1 and c2 are the same in rows r1 and r2.
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列),即:不同的二行,对应二列字符串相同
题解
这里先用map<string,int>把字符串映射成一个值方便后面查找是否相同(如果找字符串,不断比较,TLE预定)
然后可以map<pair<int,int>,int>把r1行的两个点的值映射成r1,这样再往下循环的时候,如果r2的两个点的值在map里出现过,就OK了(用O(n)避免暴力循环O(n^2))
代码
- #include<bits/stdc++.h>
- using namespace std;
- int Map[][];
- int main()
- {
- int n,m;
- while(cin>>n>>m)
- {
- getchar();
- map<string,int> ma;
- int cnt=;
- for(int i=;i<=n;i++)
- {
- string s,ss;
- getline(cin,ss);
- int k=,Len=ss.size();
- for(int j=;j<=Len;j++)
- {
- if(j==Len||ss[j]==',')
- {
- if(ma[s]==)
- ma[s]=cnt++;
- Map[i][k++]=ma[s];
- s.clear();
- }
- else
- s+=ss[j];
- }
- }
- int F=;
- for(int j=;j<=m;j++)//c1
- {
- for(int jj=j+;jj<=m;jj++)//c2
- {
- map<pair<int,int>,int> Ma;//把r1的两个点映射成r1
- for(int i=;i<=n;i++)//r2
- {
- if(Ma[make_pair(Map[i][j],Map[i][jj])]==)//r1
- Ma[make_pair(Map[i][j],Map[i][jj])]=i;
- else
- {
- F=;
- printf("NO\n%d %d\n%d %d\n",Ma[make_pair(Map[i][j],Map[i][jj])],i,j,jj);
- break;
- }
- }
- if(F)break;
- }
- if(F)break;
- }
- if(F==)
- cout<<"YES"<<endl;
- }
- return ;
- }
UVa 1592 Database(巧用map)的更多相关文章
- UVA - 1592 Database 枚举+map
思路 直接枚举两列,然后枚举每一行用map依次记录每对字符串出现的是否出现过(字符串最好先处理成数字,这样会更快),如果出现就是"NO",否则就是"YES". ...
- UVa 1592 Database (map)
题意:给出n行m列的数据库(数据范围: n 1~10000, m 1~10), 问你能不能找出两行r1, r2,使得这两行中的c1, c2列是一样的, 即(r1,c1)==(r2,c1) && ...
- UVA 1592 DataBase
思路: 知识补充: ①make_pair和pair: /*pair是将2个数据组合成一个数据,当需要这样的需求时就可以使用pair,如stl中的map就是将key和value放在一起来保存.另一个应用 ...
- UVa - 1592 Database(STL,优化)
给一个n行m列的数据库表格,问有没有两个行 r1,r2 和 c1,c2,满足(r1,r2)的元素=(c1,c2)的元素. n≤10000,m≤10. 直接枚举4个肯定会T的.可以只枚举c1 c2,然后 ...
- uva 1592 Database (STL)
题意: 给出n行m列共n*m个字符串,问有没有在不同行r1,r2,有不同列c1,c2相同.即(r1,c1) = (r2,c1);(r1,c2) = (r2,c2); 如 2 3 123,456,789 ...
- 巧用map解决nginx的Location里if失效问题
需求: Nginx根据参数来输出不同的header 我们想用Nginx来判断一些通用的参数, 根据参数情况在输出中不同的header, 或者cookie, 那么根据正常思路, 有如下配置: locat ...
- Database UVA - 1592
对于每组数据,首先通过一个map将每个字符串由一个数字代替,相同的字符串由相同数字代替,不同的字符串由不同数字代替.那么题目就变为了询问是否存在行r1,r2以及列c1,c2使得str[r1][c1]= ...
- 【例题5-9 UVA - 1592】Database
[链接] 我是链接,点我呀:) [题意] 在这里输入题意 [题解] 枚举不同的列是哪两个列,然后枚举行. 把那一行的这两列的字符接在一起,然后用map判重. 为了防止逐个比较字符. 可以一开始先把字符 ...
- UVa 1592 数据库(c++pair)
Input Input contains several datasets. The first line of each dataset contains two integer numbersn ...
随机推荐
- 1003 Emergency (25 分)
1003 Emergency (25 分) As an emergency rescue team leader of a city, you are given a special map of y ...
- Vue引用其他组件,但组件某些部分不需要时的简单处理
项目开发时,我们会把多个地方重复使用的模块抽象成组件,提供给大家一起使用,但是使用组件的时候偶尔会遇见一些问题,比如说组件里只有某些东西自己并不需要,这个时候我们可以对组件进行简单的修改,而不影响其他 ...
- mongodb 如何区分大小写
mongodb是区分大小写的,在做mongodb数据库操作是经常使用toUpperCase()等方法将value转换为大写存到数据库中 e.g. 在做数据库模糊查询时语句如下 db.COLLECTIO ...
- seaborn可视化特征的相关性
import seaborn as sn sn.heatmap(trainX.corr(),vmax=1,square=True)
- Java 类的生命周期
类从被加载到JVM内存中开始,到卸载出内存为止,它的整个生命周期包括: 加载(Loading)-->验证(Verification)-->准备(Preparation)-->解析(R ...
- VS自动编译脚本
rem ************************************************rem * Script to compile the solutions of IdealOE ...
- CSS3 盒阴影(box-shadow)详解
CSS3 的 box-shadow 有点类似于 text-shadow,只不过不同的是 text-shadow 是对象的文本设置阴影,而 box-shadow 是给对象实现图层阴影效果.本文我们搁下I ...
- final修饰的类有什么特点
变量定义为final,一旦被初始化便不可改变,这里不可改变的意思对基本类型来说是其值不可变,而对于对象变量来说其引用不可再变. 方法定义为final,是为了防止任何继承类改变它. 类定义为final, ...
- [Python] numpy.mat
numpy.mat numpy.mat(data, dtype=None) Interpret the input as a matrix. Unlike matrix, asmatrix does ...
- zk-systemd
[Unit] Description=auto run zk server After=network.target [Service] Type=simple Environment=ZHOME=/ ...