How many ways can one cover $\mathbb Q_p$ with the images of polynomials? Define a finite set of polynomials over a field $K$ to cover $K$ if the images of the polynomials, viewed as functions from $K$ to itself, have union the whole set.
Define a minimal cover to be a finite set of polynomials that cover a field, but such that no proper subset covers that field.

Can you classify all minimal covers of $\mathbb Q_p$?

A minimal cover of a number field must consist of just a single, linear polynomial. Indeed, for most $y$, for each polynomial $f$ in the set, $f(x)-y$ is an irreducible polynomial in $x$ by Hilbert irreducibility. $y$ is in the image of some $f$ so some irreducible polynomial $f(x)-y$ has a root, so is linear, so $f(x)$ is linear. A single linear polynomial covers the set so no other polynomials are needed. This is a special case of this argument.
This does not hold in $\mathbb Q_p$. This is because $\mathbb Q_p^\times/\left(\mathbb Q_p^\times\right)^n$ is finite, so if $S$ is a set of coset representatives for $\mathbb Q_p^\times/\left(\mathbb Q_p^\times\right)^n$, then $\{ s x^n | s \in S\}$ is a finite set of nonlinear polynomials that cover $f$. It is also a minimal cover.

Is this the only kind of minimal cover of $\mathbb Q_p$, up to translation and other obvious things?

The only result I have in this direction is that if you take a cover of $\mathbb Q_p$, the leading terms of all the polynomials also cover $\mathbb Q_p$. This is because every coset of $\left(\mathbb Q_p^\times\right)^n$ (where $n$ is a multiple of the degree of each polynomial) has elements which are very large in the $p$-adic norm, and when $f(x)$ is very large in the $p$-adic norm $x$ must be very large, and when $x$ is very large, the terms other than the leading term do not change what coset $f(x)$ is in, so there must be one polynomial whose leading term can reach each coset.
A vaguely related question:

What interesting fields, other than finite extensions of $\mathbb Q_p$, admit nontrivial/interesting minimal covers?

 A: In your example covering is an almost partition (the only common point is $0$). If you allow overlapping, covers can be rather complicated. For exmaple, in $\mathbb Q_5$:
$$
x^2, \ 2x^2, \ x^3, \ 5x^6, \ 2\cdot 5x^6, \ 5^5x^6, \ 2\cdot 5^5x^6.
$$
Now I will describe monomial minimal covering. We assume $p>2$.
If we have  monomial minimal covering $\{a_1x^{n_1}, \dots, a_kx^{n_k}\}$, then we should check covering only on $\mathbb Q^*_p/(\mathbb Q^*_p)^D$, where $D=lcm(n_1, \dots, n_k)$. Since $$\mathbb Q^*_p=\mathbb Z\times C_{p-1}\times \mathbb Z_p,$$ then 
$$\tag{1}
\mathbb Q^*_p/(\mathbb Q^*_p)^D=C_D\times C_{gcd(D, p-1)}\times C_{p^{v_p(D)}}.
$$
Analogously, image of $x^n$ in this group is a subgroup of the form
$$C_n\times C_{gcd(n, p-1)}\times C_{p^{v_p(n)}},$$
Where every factor is a subgroup of the corresponding factor in (1).
If we interesting in image of $ax^n$, then it is a coset of corresponding subgroup.
Now we have pure combinatorial question about covering group of cosets of special forms. If we see on first factor (which determines what occurs in the other two) then we can see classical combinatorial question: cover vertices of regular $D$-gon by smaller regular polygons. In my example, I cover 6-gon by 3-gon, 2-gon (i.e. diametr) and two 1-gons (i.e. vertices).
