(a) Yes. Here is an example:
A={3k∣k∈Z},B={3k+1∣k∈Z},C={3k+2∣k∈Z}.
(b) No. Suppose Q can be partitioned into three nonempty subsets A,B,C such that A+B,B+C,C+A are pairwise disjoint. Note that for all a∈A,b∈B,c∈C we have
a+b−c∈C,b+c−a∈A,c+a−b∈B.(1)
Indeed a+b−c∈/A since (A+B)∩(A+C)=∅, and likewise a+b−c∈/B, hence a+b−c∈C. That is, A+B⊂C+C. Similarly, we have B+C⊂A+A, C+A⊂B+B.
The reverse inclusion also holds. Let a,a′∈A,b∈B,c∈C. By (1) we get a′+c−b∈B, and since a∈A,c∈C, applying (1) again gives
a+a′−b=a+(a′+c−b)−c∈C.
A+B=C+C, B+C=A+A, C+A=B+B.
Furthermore, without loss of generality assume 0∈A. Then B={0}+B⊂A+B and C={0}+C⊂A+C. Since B+C is disjoint from A+B and A+C respectively, B+C is disjoint from B and C respectively. Hence B+C is contained in Z∖(B∪C)=A. Since B+C=A+A, we obtain A+A⊂A. On the other hand, A={0}+A⊂A+A, so we obtain A=A+A=B+C.
Therefore A+B+C=A+A+A=A, and B+B=C+A,C+C=A+B
from which we can derive B+B+B=A+B+C=A,C+C+C=A+B+C=A.
In particular, if for any r∈Q=A∪B∪C then 3r∈A.
But this conclusion is impossible. Take any b∈B (B being a nonempty subset) and let r=3b∈Q, then
b=3r∈A yields a contradiction.