I will prove it modulo a fact written in Wikipedia which I don't know how to prove (but since, as we all know, Wikipedia is the universal arbiter of truth and is never wrong, I will equate it with complete proof in my heart).
Recall that an algebraic integer $u=u_1$ is called a Pisot–Vijayaraghavan number if $|u| > 1$ and all its conjugate $u_2, u_3, \ldots, u_n$ satisfy $|u_k| < 1$. On the Wikipedia page about these numbers, it is written that there exists such a number in any real algebraic number field, and it generates said field, so we will pick our favourite real algebraic number field (together with its embedding into $\mathbb{R}$) of degree $n = 2018$ and take said $u$. It will be a root of a polynomial with integer coefficients and leading coefficient one.
First, we will replace $u$ with $s = s_1 = u^2$. It is still a Pisot–Vijayaraghavan number (its conjugates are squares of conjugates of $u$), and it is also almost immediate that its degree is still $n$ (otherwise, if its degree is $n/2$, then both $u$ and $-u$ must be conjugate and lie in our field, but then $|-u| > 1$ -- contradiction to $u$ being a Pisot–Vijayaraghavan number). Now, $s$ and all its conjugates $s_2, s_3, \ldots, s_n$ are positive.
The powers of $s$ are also Pisot–Vijayaraghavan numbers, and there are arbitrarily high powers of $s$ which also have degree $n$ (this second fact is true for any algebraic integer). Let us pick $k$ big enough such that $s^k$ has degree $n$ and $(\max_{l = 2, \ldots , n} |s_l|)^k < \frac{1}{nm}$. Note that since all $s_l$ are between $0$ and $1$, such $k$ exists. Finally, put $r =r_1= ms^k$, we will show that it works. We begin with the proposition that
$$1 + \lfloor r^p\rfloor = r_1^p + r_2^p + \ldots + r_n^p.$$
Indeed, the right-hand side is an integer, since $r_l$ are conjugate to each other and are algebraic integers, it is strictly bigger than $r_1^p$ (here we used that $n>1$!), and also it is smaller than $r_1^p + 1$ -- this is equivalent to the fact that $r_2^p + \ldots + r_n^p < 1$, which is true since $$r_2^p + \ldots + r_n^p \le r_2 + \ldots + r_n \le \frac{m(n-1)}{nm} =\frac{n-1}{n} < 1.$$
Finally, about divisibility. We have $$r_1^p + \ldots + r_n^p = m^p(s_1^{kp}+\ldots + s_n^{kp}),$$
and the sum in the brackets is also an integer since $s_l$ are conjugate algebraic integers. So, $1 + \lfloor r^p\rfloor$ is even divisible by $m^p$, hence by $m$.