Z-array

input/code.cpp: In function 'int main()':
input/code.cpp:4:63: warning: format '%lld' expects argument of type 'long long int', but argument 2 has type '__gnu_cxx::__alloc_traits<std::allocator<int>, int>::value_type' {aka 'int'} [-Wformat=]
    4 | #define vout(x) for(int i=0;i<(long long)x.size();i++) printf("%lld ",x[i]);
      |                                                               ^~~~~~~
input/code.cpp:60:5: note: in expansion of macro 'vout'
   60 |     vout(z_array);
      |     ^~~~
input/code.cpp:4:67: note: format string is defined here
    4 | #define vout(x) for(int i=0;i<(long long)x.size();i++) printf("%lld ",x[i]);
      |                                                                ~~~^
      |                                                                   |
      |                                                                   long long int
      |                                                                %d

#include <bits/stdc++.h>
 
using namespace std;
#define vout(x) for(int i=0;i<(long long)x.size();i++) printf("%lld ",x[i]);
#define REP(i,a,b) for (int i = a; i <= b; i++)
 
// g++ <filename>.cpp -g -Wall -Wextra -DDEBUG -o <executable>
 
// copied from: https://codeforces.com/blog/entry/79024
// === Debug macro starts here ===
 
int recur_depth = 0;
#ifdef DEBUG
#define dbg(x) {++recur_depth; auto x_=x; --recur_depth; cerr<<string(recur_depth, '\t')<<"\e[91m"<<__func__<<":"<<__LINE__<<"\t"<<#x<<" = "<<x_<<"\e[39m"<<endl;}
#else
#define dbg(x)
#endif
template<typename Ostream, typename Cont>
typename enable_if<is_same<Ostream,ostream>::value, Ostream&>::type operator<<(Ostream& os,  const Cont& v){
	os<<"[";
	for(auto& x:v){os<<x<<", ";}
	return os<<"]";
}
template<typename Ostream, typename ...Ts>
Ostream& operator<<(Ostream& os,  const pair<Ts...>& p){
	return os<<"{"<<p.first<<", "<<p.second<<"}";
}
 
// === Debug macro ends here ===
 
vector<int> z(string s) {
 
    int n = s.size();
    vector<int> z(n);
    int l = 0;
    int r = 0;
 
    for (int i = 1; i < n; i++) 
    {
        z[i] = max(0,min(z[i-l],r-i+1));
 
        while (i+z[i] < n && s[z[i]] == s[i+z[i]]) 
        {
            l = i; 
            r = i+z[i]; 
            z[i]++;
        }
    }
    return z;
}
 
 
signed main() {
    
    string s;
    cin >> s;
 
    vector<int> z_array = z(s);
    z_array[0] = s.size();
    vout(z_array);
    cout << "\n";
 
    return 0;
}

Test 1

Verdict: ACCEPTED

Test 2

Verdict: ACCEPTED

Test 3

Verdict: ACCEPTED

Test 4

Verdict: ACCEPTED

Test 5

Verdict: ACCEPTED

Test 6

Verdict: ACCEPTED

Test 7

Verdict: ACCEPTED

Test 8

Verdict: ACCEPTED

Test 9

Verdict: ACCEPTED

Test 10

Verdict: ACCEPTED

Test 11

Verdict: ACCEPTED

Test 12

Verdict: ACCEPTED

Test 13

Verdict: ACCEPTED