Pumping lemma not regular
assuming you have a pump length $p$ then there is a string $1^{2x}0^y$ with $p \lt x \le y$ as part part of the language

thus the partition $uvw$ with $\text{length}(uv)&lt;p$ must have $uv$ as all $1$s 

this means that your pump string $v$ contains all $1$ which if pumped can create twice as many $1$ than $0$s which is not part of the language. QED