UVa 1592 Database

#include<iostream>
#include<cstdio>
#include<string>
#include<map>
#include<algorithm>
#include<vector>
#include<queue>
#include<set>
#include<cstring>
#include<stack>
using namespace std;

int n,m;

int main()
{
while(scanf("%d %d",&n,&m)!=EOF)
{
int i,j;
string temp;
getline(cin,temp);
string **arr=new string*
;
for(i=0;i<n;i++)
arr[i]=new string[m];
int id=0;
map<string,int> str2int;
map<pair<int,int>,int> pair2int;
for(i=0;i<n;i++)
{
string s;
getline(cin,s);
int index=0;
int index2;
for(j=0;j<m;j++)
{
index2=s.find(',',index);
if(index2==-1)
{
arr[i][j]=s.substr(index);
if(!str2int.count(arr[i][j]))
{
str2int[arr[i][j]]=id;
id++;
}
}
else
{
arr[i][j]=s.substr(index,index2-index);
if(!str2int.count(arr[i][j]))
{
str2int[arr[i][j]]=id;
id++;
}
}
index=index2+1;
}
}
int flag=0;
for(i=0;i<m;i++)
{
pair<int,int> temp;
for(j=i+1;j<m;j++)
{
pair2int.clear();
for(int k=0;k<n;k++)
{
temp.first=str2int[arr[k][i]];
temp.second=str2int[arr[k][j]];
if(pair2int.count(temp)!=0)
{
int row2=pair2int[temp];
cout<<"NO"<<endl;
cout<<row2+1<<" "<<k+1<<endl;
cout<<i+1<<" "<<j+1<<endl;
flag=1;
break;
}
else
pair2int[temp]=k;
}
if(flag)
break;
}
if(flag)
break;
}
if(!flag)
printf("YES\n");
}
return 0;
}