AI slop

Subtask 1

When $N=2$, the only substring of length $2$ is the entire string. Compare $S$ with $\texttt{ai}$. Both the time complexity and the additional space complexity are $O(1)$ per test case.

Subtask 2

Check each pair of adjacent characters. If any pair has $\texttt{a}$ followed by $\texttt{i}$, print AI slop. Otherwise, print Human made.

Every substring of length $2$ consists of a pair of adjacent characters. Thus, this procedure determines exactly whether $\texttt{ai}$ occurs as a substring. If $N=1$, there is no adjacent pair, so the answer is Human made.

The time complexity is $O(N)$ per test case, and storing the string uses $O(N)$ space. The check itself uses $O(1)$ additional space after the string is stored. The total time complexity is $O(T+\sum N)$.

A built-in substring search can also be used to check whether $\texttt{ai}$ occurs.

Solution written by GPT6