When $x, y \not\equiv 0 \bmod p$, we have $x^3 \equiv y^3 \bmod p$ if and only if $(x/y)^3 \equiv 1 \bmod p$, so $x \equiv yz \bmod p$ where $z^3 \equiv 1 \bmod p$. Thus the cubing function on nonzero numbers mod $p$ is $k$-to-$1$ where $k$ is the number of solutions to $z^3 \equiv 1 \bmod p$. This is similar to squaring on nonzero numbers mod $p$ being $2$-to-$1$ when $p > 2$ since $x^2 \equiv y^2 \bmod p$ if and only if $x \equiv \pm y \bmod p$, where $\pm 1 \bmod p$ are the solutions to $z^2 \equiv 1 \bmod p$, and there are two such $z$ when $p$ is an odd prime.
So you need to show there are three solutions to $z^3 \equiv 1 \bmod p$ when $p \equiv 1 \bmod 3$. Since
$$
z^3 - 1 = (z-1)(z^2+z+1),
$$
the solutions to $z^3 \equiv 1 \bmod p$, rewritten as $z^3 - 1 \equiv 0 \bmod p$, are $1 \bmod p$ and the solutions to $z^2 + z + 1 \equiv 0 \bmod p$ (which doesn't have $1 \bmod p$ as a solution since $p > 3$). The quadratic formula is valid mod $p$ when $p > 2$: there are two roots to $z^2 + z + 1 \equiv 0 \bmod p$ if and only if the discriminant $1^2 - 4(1) = -3$ is a nonzero square mod $p$.
It remains to show when $p \equiv 1 \bmod 3$ that $z^2 + z + 1 \equiv 0 \bmod p$ has two roots, which would be equivalent to $-3$ is a square mod $p$. Do you know that the nonzero numbers mod $p$ have a primitive root when $p$ is prime or do you know quadratic reciprocity?