Orange Boy Can You Solve It Out? Ep. 48

思考题 with git

Version Control

You are given a DAG with N nodes and M direcitonal edges. Node 1 has 0 in degree. We define a node i is required for node j if i is in any path from 1 to j.

You are given Q queries, for each query you are given A and B, please output how many nodes are required for A but not for B.

版权声明:
作者:XGN
链接:https://blog.hellholestudios.top/index.php/2021/08/25/orange-boy-can-you-solve-it-out-ep-48/
来源:Hell Hole Studios Blog
文章版权归作者所有,未经允许请勿转载。

THE END
分享
二维码
< <上一篇
下一篇>>
文章目录
关闭