On complexity of mutlidistance graph recognition in $\mathbb{R}^1$