If $G$ is a graph with at least one cut-vertex, then at least $2$ of the blocks of $G$ contain exactly $1$ cut-vertex.
To illustrate, I have this example:
A simpler example would be to consider two cycles with a common vertex, we can see that it is a cutting vertex and has only two blocks, since each pair of vertices is in a common cycle.