In 1974, Erdős asked the following question: given a graph $G$ and a directed graph $\vec{H}$, how many ways are there to orient the edges of $G$ such that it does not contain $\vec{H}$ as a subgraph? We denote this value by $D(G, \vec{H})$. Further, we let $D(n, \vec{H})$ denote the maximum of $D(G, \vec{H})$ over all graphs $G$ on $n$ vertices. In 2006, Alon and Yuster gave an exact answer when $\vec{H}$ is a tournament. In 2023, Bucić, Janzer, and Sudakov gave asymptotic answers for all directed graphs $\vec{H}$, and in the same paper, they gave an exact answer when $\vec{H}$ is a directed cycle. In this paper, we give a better bound for some specific non-bipartite directed graphs. Further, we obtain exact values of $D(G, \vec{H})$ for some small non-edge-critical directed graphs $\vec{H}$. Finally, for these graphs, we classify all graphs $G$ that attain the bound $D(G, \vec{H}) = D(n, \vec{H})$.