Z-array

input/code.cpp: In function 'int main()':
input/code.cpp:37:21: warning: comparison of integer expressions of different signedness: 'int' and 'size_t' {aka 'long unsigned int'} [-Wsign-compare]
   37 |   for (int i = 0; i < n; i++) {
      |                   ~~^~~
input/code.cpp:43:23: warning: comparison of integer expressions of different signedness: 'int' and 'size_t' {aka 'long unsigned int'} [-Wsign-compare]
   43 |     while (i + arr[i] < n && s[arr[i]] == s[i + arr[i]]) {
      |            ~~~~~~~~~~~^~~
input/code.cpp:7:23: warning: comparison of integer expressions of different signedness: 'int' and 'size_t' {aka 'long unsigned int'} [-Wsign-compare]
    7 |     for (int i = 0; i < n; i++) {                                              \
      |                       ^
input/code.cpp:50:3: note: in expansion of macro 'PRINT_ARR'
   50 |   PRINT_ARR(arr, n);
      |   ^~~~~~~~~

#include <bits/stdc++.h>
using namespace std;

#define I_2D(row, col, width) ((row) * (width) + (col))
#define PRINT_ARR(arr, n)                                                      \
  do {                                                                         \
    for (int i = 0; i < n; i++) {                                              \
      cout << arr[i] << " ";                                                   \
    }                                                                          \
    cout << "\n";                                                              \
  } while (0)
#define PRINT_VEC_ARR(v, n)                                                    \
  do {                                                                         \
    for (int i = 0; i < n; i++) {                                              \
      cout << i << ": ";                                                       \
      for (auto item : v[i]) {                                                 \
        cout << item << " ";                                                   \
      }                                                                        \
      cout << endl;                                                            \
    }                                                                          \
  } while (0)

typedef long long ll;

int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  string s;
  cin >> s;

  size_t n = s.length();
  int arr[n];
  memset(arr, 0, n * sizeof(int));

  arr[0] = n;
  int x = 0, y = 0;
  for (int i = 0; i < n; i++) {
    // copy the Z-array value from the prefix
    // only copy the "known" part
    arr[i] = max(0, min(arr[i-x], y - i + 1));

    // increase y if s[arr[i]] == s[i + arr[i]]
    while (i + arr[i] < n && s[arr[i]] == s[i + arr[i]]) {
      x = i;
      y = i+arr[i];
      arr[i]++;
    }
  }

  PRINT_ARR(arr, 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