spoj-solutions/ARDA1.cpp at master · RohitJV/spoj-solutions · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
#include <iostream>
#include <stdio.h>
#include <string.h>
#include <vector>
#include <queue>
#include <algorithm>
#include <set>
#include <map>
using namespace std;

#define pb push_back
#define mp make_pair

int n1,n2,m1,m2,cnt=1;
vector < pair<int,int> > v;
vector <int> pattern;
vector <int> text[2005];

void failure_func(int F[])
{
     int i,j;
     F[0]=0;
     j=0;
     i=1;

     while(i<n1)
     {
               if(pattern[i]==pattern[j])
               {
                    F[i]=j+1;
                    i++;
                    j++;
               }
               else if(j>0)
                    j=F[j-1];
               else
               {
                    F[i]=0;
                    i++;
               }
     }
}

void KMP()
{
    int F[n1];
    failure_func(F);
    int i,j;

    for(int k=0;k<m2-n2+1;k++)
    {
      i=0,j=0;
      while(i<m1)
      {
              if(text[i][k]==pattern[j])
              {
                     if(j==n1-1)
                     {
                              //cout<<i-n2+2<<","<<k+1<<"\n";
                              v.pb(mp(i-n1+2,k+1));
                              j=F[j];
                              i++;
                     }
                     else
                     {
                         i++;
                         j++;
                     }
              }
              else if(j>0)
                   j=F[j-1];
              else
                   i++;
      }
    }
}

int main()
{
    string p[400],q[2005],temp;
    //vector <int> pattern;
    //vector <int> text[2005];
    map <string,int> m;
    scanf("%d%d",&n1,&n2);
    for(int i=0;i<n1;i++)
    {
      cin>>p[i];
      if(m.find(p[i])==m.end())
      {
          m[p[i]]=cnt;
          pattern.pb(cnt++);
      }
      else
          pattern.pb(m[p[i]]);
    }
    scanf("%d%d",&m1,&m2);
    for(int i=0;i<m1;i++)
      cin>>q[i];
    /*for(int i=0;i<n1;i++)
      cout<<pattern[i]<" ";
    cout<<"\n\n";*/
    for(int i=0;i<m1;i++)
    {
      for(int j=0;j<m2-n2+1;j++)
      {
        string temp=q[i].substr(j,n2);
        if(m.find(temp)!=m.end())
          text[i].pb(m[temp]);
        else
          text[i].pb(0);
      }
    }
    /*
    for(int i=0;i<m1;i++)
    {
      for(int j=0;j<m2-n2+1;j++)
        cout<<text[i][j]<<" ";
      cout<<"\n";
    }
    cout<<"\n\n";
    */
    KMP();
    if(v.size()==0)
        cout<<"NO MATCH FOUND...";
    else
    {
        sort(v.begin(),v.end());
        for(int i=0;i<v.size();i++)
            cout<<"("<<v[i].first<<","<<v[i].second<<")\n";
    }
}