Code/NHAY.cpp at master · sushiljacksparrow/Code · 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
/*Sushil Kumar Singh */
#include <cassert>
#include <cctype>
#include <cfloat>
#include <cmath>
#include <cstdarg>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <climits>
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <functional>
#include <iostream>
#include <iomanip>
#include <iterator>
#include <limits>
#include <list>
#include <map>
#include <memory>
#include <new>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <valarray>
#include <vector>
#include <ext/numeric>
#include <ext/hash_map>
#include <ext/hash_set>
#include <ext/algorithm>

using namespace std;
using namespace __gnu_cxx;

#define pb push_back
#define vi vector<int>
#define vii vector<vi>
#define ii pair<int,int>
#define vs vector<string>
#define all(v) (v).begin(), (v).end()
#define For(i,x) for(int i=0;i<x;i++)


// Get all the prefix of pat and find the longest proper suffix of each of them
int arr[1000009];
string pat, text;
int m;
void failure_func()
{
	arr[0]= arr[1]=0;
	for(int i=2;i<=m;i++)
	{
		int j=arr[i-1];
		while(1)
		{
			if(pat[j]==pat[i-1])
			{
				arr[i]=j+1;
				break;
			}
			if(j==0)
			{
				arr[i]=0;
				break;
			}
			j=arr[j];
		}
	}

	//for(int i=0;i<=m;i++)
	//	cout<<i<<" "<<arr[i]<<endl;
}


int main()
{
    freopen("in.txt","r",stdin);
    freopen("out.txt","w",stdout);

	bool first = true;

	while(cin>>m>>pat>>text)
	{
		vector<int>output;
		failure_func();

		int n=text.size();
		int i=0, j=0;
		while(1)
		{
			if(j==n)
				break;
			if(text[j]==pat[i])
			{
				i++;
				j++;
				if(i==m)
				{
					output.push_back(j-i);
				//cout<<j-i<<endl;
					i=arr[i];
				}
			} else if(i>0)
				i=arr[i];
			else
				j++;
		}
		if(first)
			first=false;
		else
			cout<<endl;
		for(int i=0;i<output.size();i++)
			cout<<output[i]<<endl;
	}
    system("pause");
}