I tried to search sth, but no result found. I tried to search sth else, the same result, but I knew there are relevant blogs in CF. Here is an example:
Sorry for my bad English :)
can you help me with this problem?:
We have DAG with n vertices and m edges. We have q queries, each query has two integers v[i] and u[i], determine for each query that if there is a path starting at v[i] and finishing at u[i].
n, m, q <= 1e5
thanks, and sorry for my bad English. (: