Label the placement positions consecutively with the numbers $1, 2, ..., 10$.
Since the $1$-labeled tiles have to be placed one apart from each other, we can write their positions as $a$ and $a+2$ for some $1 \le a \le 8$.
Similarly, you can write the positions of the $2$-labeled tiles as $b$ and $b+3$ for some $1 \le b \le 7$.
Keeping up with the pattern, the $3$-labeled tiles are at $c$ and $c+4$, the $4$-labeled tiles are at $d$ and $d+5$, and the $5$-labeled tiles are at $e$ and $e+6$.
Now suppose you could successfully place all the pairs of tiles. This means that each of the placement positions $\{1, 2, ..., 10\}$ is covered by exactly one of the values $\{a, a+2, b, b+3, c, c+4, d, d+5, e, e+6\}$.
So that means that the sum of the values $\{1, 2, ..., 10\}$ is the same as the sum of the values $\{a, a+2, b, b+3, c, c+4, d, d+5, e, e+6\}$:
$$
\begin{align}
\sum \{1, 2, ..., 10\} &= \sum \{a, a+2, b, b+3, c, c+4, d, d+5, e, e+6\} \\
55 &= 2a + 2b + 2c + 2d + 2e + 20 \\
&= 2(a+b+c+d+e) + 20
\end{align}
$$
which implies that
$$
2(a+b+c+d+e) = 35
$$
Since $a$, $b$, $c$, $d$, and $e$ are integers, that's not possible. So such a placement can't happen.