For simplicity, just partition the unit interval $[0,1)$ and then repeat that partition so $x\in A$ when $x-\lfloor x \rfloor\in A$. This lets us avoid dealing with $t$.
This construction elaborates on aschepler’s comment. I use $2/3$ for simplicity, but any ratio is easily accomplished.
Let $A_1=[0,2/3)$. Let $B_1=(2/3,1]$.
If $A_n$ is a union of intervals, then for each interval cut out the middle $1/2^{n+1}$ of the interval and send it to $B_n$. Similarly, for each interval in $B_n$ cut out the middle $1/2^n$ and send it to $A_n$. Each set less what’s cut out plus what was transferred determines $A_{n+1},B_{n+1}$.
$A_n$ is initially twice as large as $B_n$ ($2/3$ is twice $1/3$). In round $n$, $A_n$ transfers $2/(3 \cdot 2^{n+1})=1/(3\cdot 2^n)$ while $1/(3\cdot 2^n)$ is transferred from $B_n$. Thus, the transfer is equivalent and so the measure of each part of the partition is preserved. Similar to the original construction, the total amount of transferred points converges to $2/3$, so an all but measure zero set of points eventually settle on a partition allowing us to construct a full partition into sets $A$ and $B$ which both have positive measure in every interval. On a sufficiently large range (or just on $[0,1)$), $A$ has $2/3$ of the total measure while $B$ has $1/3$, although this measure is not uniform within the range.