Codeforces_CompCodes/suffix_array.cpp at main · masterishaan19/Codeforces_CompCodes · 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
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include<cmath>
#include<string>
#define pb push_back
#define ll long long
#define ull unsigned long long
#define deb(x) cerr<<#x<<" "<<x<<"\n"
#define debi cerr<<"hey sparky\n"
#define f first
#define s second
#define fast ios::sync_with_stdio(0),cin.tie(0),cout.tie(0)
#define eps (double)1e-9
#define all(x) x.begin(),x.end()
#define int long long
using namespace std;
using namespace __gnu_pbds;
typedef tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update> pdbs;

void __print(int x) {cerr << x;}
void __print(long x) {cerr << x;}
//void __print(long long x) {cerr << x;}
void __print(unsigned x) {cerr << x;}
void __print(unsigned long x) {cerr << x;}
void __print(unsigned long long x) {cerr << x;}
void __print(float x) {cerr << x;}
void __print(double x) {cerr << x;}
void __print(long double x) {cerr << x;}
void __print(char x) {cerr << '\'' << x << '\'';}
void __print(const char *x) {cerr << '\"' << x << '\"';}
void __print(const string &x) {cerr << '\"' << x << '\"';}
void __print(bool x) {cerr << (x ? "true" : "false");}

template<typename T, typename V>
void __print(const pair<T, V> &x) {cerr << '{'; __print(x.first); cerr << ','; __print(x.second); cerr << '}';}
template<typename T>
void __print(const T &x) {int f = 0; cerr << '{'; for (auto &i: x) cerr << (f++ ? "," : ""), __print(i); cerr << "}";}
void _print() {cerr << "]\n";}
template <typename T, typename... V>
void _print(T t, V... v) {__print(t); if (sizeof...(v)) cerr << ", "; _print(v...);}
#ifndef ONLINE_JUDGE
#define debug(x...) cerr << "[" << #x << "] = ["; _print(x)
#else
#define debug(x...)
#endif

// look for  all edge cases
//search for a pattern


signed main() {
	ios::sync_with_stdio(0);
	cout.tie(0);
	cin.tie(0);

	string s;
	cin >> s;
	s += '$';


	int n = s.size();

	vector<int> p(n) , c(n);


	//case -> k = 0

	vector<pair<char,int>> a(n);

	for(int i =0 ; i <n ;i++){
		a[i] = {s[i] , i};
	}

	sort(all(a));

	for(int i = 0; i < n; i++){
		p[i] = a[i].second;
	}

	c[p[0]] = 0;
	for(int i = 1; i < n; i++){
		if(a[i].first  == a[i-1].first){
			c[p[i]] = c[p[i-1]];
		}
		else
			c[p[i]] = c[p[i-1]] + 1;

	}

	int k = 0;

	while((1<<k) < n){
		// transition from k -> k+1
		vector<pair<pair<int,int>,int>> new_a(n);

		for(int i =0 ; i < n; i++){
			new_a[i] = {{c[i] , c[(i+(1<<k))%n]} ,i};
		}

		sort(all(new_a));

		for(int i = 0; i < n; i++){
			p[i] = new_a[i].second;
		}

		c[p[0]] = 0;
		for(int i = 1; i < n; i++){
			if(new_a[i].first  == new_a[i-1].first){
				c[p[i]] = c[p[i-1]];
			}
			else
				c[p[i]] = c[p[i-1]] + 1;

		}

		k++;
	}

	for(int i =0 ; i < n ; i++)
		cout<<p[i]<<" ";


	return 0;
}