This article investigates the targeted bipartite consensus problem of opinion dynamics in cooperative-antagonistic networks. Each agent in the network is assigned with a convergence set to represent a credibility interval, in which its opinion is trustworthy. The network topology is characterized by a signed switching digraph. The objective is to achieve the bipartite consensus targeted within these credibility intervals. A gradient term is introduced in the opinion dynamics besides the consensus term. Under the assumption that the underlying graph is uniformly jointly strongly connected and structurally balanced, it is first shown that the considered opinion dynamics reaches the targeted bipartite consensus within the intersections of the convergence sets associated with two antagonistic groups. Next, by relaxing the connectivity condition to uniform joint quasistrong connectivity, the targeted bipartite consensus result is also proven with an additional convergence set assumption. Numerical examples are provided to validate the proposed theoretical results.