Uva1592 Database

The original title is ：

Ideas ： Use one IDcache To assign all strings ID, recycling pair Form a binary . Maintain left endpoint c1, Enumerate right endpoints c2, At the same time through row Scan the assigned from top to bottom id library . Query the first row That's ok pair(c1,c2) Whether it exists or not .

Code ：

#include<iostream>
#include<algorithm>
#include<string>
#include<sstream>
#include<set>// aggregate 
#include<map>// mapping 
#include<vector>// vector 
#include<utility>//pair
#define DEBUG
using namespace std;
map<string,int> IDcache;// Record ID
map<pair<int,int>,int> Binary_pair;// Record where the binary is row
int cnt=0;
int ID(string s)// Distribute ID
{
    if(IDcache.count(s))
    {
        return IDcache[s];
    }
    else
    {
        return IDcache[s]=cnt++;
    }
}
int main(void)
{
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    int n,m;
    while(cin>>n>>m)
    {
        IDcache.clear();
        Binary_pair.clear();
        vector<vector<int>> dict(n,vector<int>(m));// Deposit ID
        string s;
        cnt=0;
        cin.get();// Eliminate line breaks 
        for(int i=0;i<n;i++)
        {
            getline(cin,s);
            for(int j=0;j<s.length();j++)
            {
                if(s[j]==',')
                {
                    s[j]=' ';// Replace commas with spaces 
                }
                else if(s[j]==' ')
                {
                    s[j]=',';// Replace the space with an impossible comma 
                }
            }
            stringstream ss(s);// Character stream 
            for(int j=0;j<m;j++)
            {
                string cur;
                ss>>cur;
                dict[i][j]=ID(cur);
            }
        }
        #ifndef DEBUG// Debug statement 
        for(int i=0;i<n;i++)
        {
            for(int j=0;j<m;j++)
            {
                cout<<dict[i][j]<<" ";
            }
            cout<<endl;
        }
        #endif
        if(m>1)
        {
            for(int c1=0;c1<m-1;c1++)// Maintain left endpoint 
            {
                for(int c2=c1+1;c2<m;c2++)// Enumerate right endpoints 
                {
                    Binary_pair.clear();
                    for(int row=0;row<n;row++)// Traverse from top to bottom 
                    {
                        pair<int,int> temp(dict[row][c1],dict[row][c2]);
                        if(Binary_pair.count(temp))// Is not Peter normal form 
                        {
                            cout<<"NO"<<endl;
                            cout<<Binary_pair[temp]+1<<" "<<row+1<<endl;
                            cout<<c1+1<<" "<<c2+1<<endl;
                            goto out;// Jump out of multiple loops 
                        }
                        else
                        {
                            Binary_pair[temp]=row;
                        }
                    }
                }
            }
        }
        cout<<"YES"<<endl;
        out:;
    }
    return 0;
}